A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Self Organized Terminode Routing
Cluster Computing
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Wireless Communications & Mobile Computing
RandomWalk Routing for Wireless Sensor Networks
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Non-Euclidian geographic routing in wireless networks
Ad Hoc Networks
EEGR: Energy-Efficient Geographic Routing inWireless Sensor Networks
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Efficient geographic routing over lossy links in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
Maintaining low power consumption is critical in wireless ad hoc and sensor networks. With packet transmissions and retransmissions consuming much of the energy resources in wireless networks, it becomes important to minimize the number of transmissions associated with the end-to-end delivery of packets. Power-aware routing algorithms must balance the advantages and disadvantages of selecting to forward packets over shorter high-quality links against selecting longer and less reliable links. This paper proposes a new power-aware geographic routing technique that combines geographic greedy routing with probabilistic random walks to recover from local minima (i.e., cases when the forwarding node is not aware of any neighboring node providing "greedy" progress towards the destination). Building upon previous power-aware protocols without recovery mechanisms, our protocol uses simple distance metrics that combine information about the individual reception rates between node pairs and the relative forward progress candidate nodes provide towards the target destination. The combined metrics are used to make greedy choices (when at least one node provides progress) and probabilistic choices (when the packet recovers from a local minimum). Using simulations we show that power-aware routing significantly reduces the energy consumption in the network, and our probabilistic recovery mechanism can significantly increase the delivery rates with only a small decrease in energy efficiency.