Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks: Research Articles

Authors:
Ivan Stojmenovic;Susanta Datta
Affiliations:
Computer Science, SITE, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada;Computer Science, SITE, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada
Venue:
Wireless Communications & Mobile Computing
Year:
2004

Citing 0
Cited 8

The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Power-aware single- and multipath geographic routing in sensor networks

Ad Hoc Networks
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks

International Journal of Autonomous and Adaptive Communications Systems
Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks

Ad Hoc Networks
Power-aware recovery for geographic routing

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Efficient node distribution techniques in mobile ad hoc networks using game theory

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Using a dynamic backbone for efficient data delivery in solar-powered WSNs

Journal of Network and Computer Applications
Energy-balanced cooperative routing in multihop wireless networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a localized routing algorithm, each node currently holding a message makes forwarding decision solely based on the position information about itself, its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. This paper proposes localized routing algorithms, aimed at minimizing total power for routing a message or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and/or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. Another improvement is to restrict the routing to nodes in a dominating set. These improvements require two-hop knowledge at each node. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with the corresponding shortest weighted path algorithms and localized algorithms that use fixed transmission power at each node. Significant energy savings are obtained, and feasibility of applying power and cost-aware localized schemes is demonstrated. Copyright © 2004 John Wiley & Sons, Ltd.