GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks

@article{Ye2005GRAdientBA,
  title={GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks},
  author={Fan Ye and Gary Zhong and Songwu Lu and Lixia Zhang},
  journal={Wireless Networks},
  year={2005},
  volume={11},
  pages={285-298}
}
Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of mechanisms and protocols which is designed specifically for robust data delivery in face of unreliable nodes and fallible wireless links. Similar to previous work [12,13], GRAB builds and… Expand
SGF: A state-free gradient-based forwarding protocol for wireless sensor networks
TLDR
Simulation results show that SGF achieves significant energy savings and outperforms several existing data forwarding protocols in terms of packet delivery ratio and end-to-end delay. Expand
Chapter 1 DISSEMINATION PROTOCOLS FOR LARGE SENSOR NETWORKS
Dissemination protocols in a large sensor network typicall y take a data-centric paradigm in which the communication primitives are organiz ed around the sensing data instead of the network nodes. AExpand
U-GRAB: A utility-based gradient broadcasting algorithm for wireless sensor networks
TLDR
This paper introduces a new gradient broadcasting routing algorithm for wireless sensor networks, U-GRAB, where the broadcasting decision is taken according to a utility-based policy, and shows that this new forwarding strategy greatly improves the robustness/energy/delay trade-off of GRAB. Expand
Dwarf: Delay-aWAre Robust Forwarding for Energy-Constrained Wireless Sensor Networks
TLDR
D Dwarf is presented, an energy-efficient, robust and dependable forwarding algorithm that tolerates large fractions of link and node failures, yet is energy efficient enough to allow for an operational lifetime of several years. Expand
Interference and Congestion Aware Gradient Broadcasting Routing for Wireless Sensor Networks
TLDR
This paper proposes a novel broadcasting solution that accounts for the interference impact and the congestion level of the channel, in order to improve robustness, energy consumption and delay performance, compared to a benchmark routing protocol, the GRAB algorithm. Expand
Decentralized Peer-to-Peer Data Dissemination in Wireless Sensor Networks
Next generation Wireless Sensor Networks will operate as self-regulated ad hoc networks of tiny devices that sense, actuate and communicate in a collaborative, autonomous and decentralised manner.Expand
Reliable Cost-based Data-centric Routing Protocol forWireless Sensor Networks
  • Jian Wu, P. Havinga
  • Computer Science
  • Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)
  • 2006
TLDR
This paper focuses on the dynamic aspects of wireless sensor networks and presents a new reliable cost-based data-centric routing algorithm for such dynamic WSNs, designed to route message intelligently to reduce the effect of event mobility. Expand
A multipath routing algorithm for mobile Wireless Sensor Networks
TLDR
A new routing algorithm for WSN's, named the Data Centric Braided Multipath (DCBM) algorithm, designed to achieve and maintain route resiliency through multiple interleaving routing paths, capable to cope with node mobility. Expand
Decentralised Peer-to-Peer data dissemination in Wireless Sensor Networks
TLDR
This paper presents a communications architecture for scalable selective data dissemination in wireless sensor networks which is comprised of a decentralised data distribution layer that is tightly coupled to a reliable gradient-based routing protocol. Expand
A New Directional Flooding Protocol for Wireless Sensor Networks
TLDR
The proposed directional flooding can lead flooded packets to flow in the ”right direction” towards their destinations, hence eliminating unnecessary packet forwarding and reducing the total energy consumption. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
A scalable solution to minimum cost forwarding in large sensor networks
TLDR
This work presents a novel backoff-based cost field setup algorithm that finds the optimal costs of all nodes to the sink with one single message overhead at each node in a large sensor network. Expand
A two-tier data dissemination model for large-scale wireless sensor networks
TLDR
This paper describes TTDD, a Two-Tier Data Dissemination approach that provides scalable and efficient data delivery to multiple mobile sinks and evaluates TTDD performance through both analysis and extensive simulation experiments. Expand
ReInForM: reliable information forwarding using multiple paths in sensor networks
TLDR
This paper describes a protocol called RelnForM to deliver packets at desired reliability at a proportionate communication cost, and shows that for uniform unit disk graphs, the number of edge-disjoint paths between nodes is equal to the average node degree with very high probability. Expand
Directed diffusion: a scalable and robust communication paradigm for sensor networks
TLDR
This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation. Expand
Energy aware routing for low energy ad hoc sensor networks
  • R. Shah, J. Rabaey
  • Computer Science
  • 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609)
  • 2002
TLDR
This paper takes the view that always using lowest energy paths may not be optimal from the point of view of network lifetime and long-term connectivity and proposes a new scheme called energy aware routing that uses sub-optimal paths occasionally to provide substantial gains. Expand
Gradient Routing in Ad Hoc Networks
TLDR
Gradient Routing (GRAd), a novel approach to routing and control in wireless ad hoc networks, which attains scalability through a multi-hop architecture and maintains good connectivity in the face of frequently changing network topologies. Expand
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
TLDR
It is found that braided multipaths are a viable alternative for energy-efficient recovery from isolated and patterned failures in sensor network data dissemination schemes. Expand
Distributed quality-of-service routing in ad hoc networks
TLDR
This paper proposes a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment and can tolerate a high degree of information imprecision. Expand
Ad-hoc on-demand distance vector routing
  • C. Perkins, E. Belding-Royer
  • Computer Science
  • Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks. Expand
Dynamic Source Routing in Ad Hoc Wireless Networks
TLDR
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Expand
...
1
2
3
...