scispace - formally typeset
Journal ArticleDOI

Avoid 'void' in geographic routing for data aggregation in sensor networks

TLDR
A new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes and replaces the right-hand rule by distance upgrading is proposed, which is fully distributed and responds to topology changes instantly with localised operations.
Abstract
Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. New techniques must be developed for sensor networks due to their lack of infrastructure support and the constraints on computation capability, memory space, communication bandwidth and above all, energy supply. To prolong the life time of a battery-powered sensor network, an energy efficient routing algorithm for data collection is essential. We propose a new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes. The algorithm eliminates the voids that cause non-optimal routing paths in geographic routing. It replaces the right-hand rule by distance upgrading. It is fully distributed and responds to topology changes instantly with localised operations. We formally prove the correctness of the algorithm and evaluate its performance by simulations.

read more

Citations
More filters
Journal Article

Habitat monitoring: Application driver for wireless communications technology

TL;DR: This work proposes a tiered system architecture in which data collected at numerous, inexpensive sensor nodes is filtered by local processing on its way through to larger, more capable and more expensive nodes.
Journal ArticleDOI

A survey of void handling techniques for geographic routing in wireless networks

TL;DR: An overview of the void problem is presented and the currently available void-handling techniques (as of July 2006) for geographic routing are surveyed, each designed with a different approach.
Proceedings ArticleDOI

Hyperbolic Embedding and Routing for Dynamic Graphs

TL;DR: A simple but robust generalization of greedy distance routing called Gravity-Pressure (GP) routing is proposed, which always succeeds in finding a route to the destination provided that a path exists, even if a significant fraction of links or nodes is removed subsequent to the embedding.
Journal ArticleDOI

Void-Handling Techniques for Routing Protocols in Underwater Sensor Networks: Survey and Challenges

TL;DR: The state of the art of void-handling techniques proposed by underwater geographic greedy routing protocols, along with the recent advances, are reviewed and a qualitative comparison of these techniques is presented.
Proceedings ArticleDOI

Localized algorithm for aggregate fairness in wireless sensor networks

TL;DR: This paper proposes a new aggregate fairness model and a localized algorithm (called AFA) that implements the model and performs extensive simulations, demonstrating that the proposed algorithm can effectively improve end-to-end fairness.
References
More filters
Journal ArticleDOI

A survey on sensor networks

TL;DR: The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections.
Proceedings ArticleDOI

GPSR: greedy perimeter stateless routing for wireless networks

TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Journal Article

An Energy-Efficient MAC Protocol for Wireless Sensor Networks

TL;DR: S-MAC as discussed by the authors is a medium access control protocol designed for wireless sensor networks, which uses three novel techniques to reduce energy consumption and support self-configuration, including virtual clusters to auto-sync on sleep schedules.
Proceedings ArticleDOI

An energy-efficient MAC protocol for wireless sensor networks

TL;DR: S-MAC uses three novel techniques to reduce energy consumption and support self-configuration, and applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network.
Proceedings ArticleDOI

Routing with guaranteed delivery in ad hoc wireless networks

TL;DR: The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.