Flattening the gap between source-destination paths in energy efficient greedy georouting in wireless sensor networks

Authors:
Essia H. Elhafsi;David Simplot-Ryl
Affiliations:
Univ. Lille 1, CNRS, INRIA, France;Univ. Lille 1, CNRS, INRIA, France
Venue:
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Year:
2007

Citing 9
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Location Systems for Ubiquitous Computing

Computer
Power-Aware Localized Routing in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Hybrid Greedy/Face Routing for Ad-Hoc Sensor Network

DSD '04 Proceedings of the Digital System Design, EUROMICRO Systems
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Energy efficient mobile routing in actuator and sensor networks with connectivity preservation

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we are interested in simple routing protocols, for wireless sensor networks. One of the major challenging issue in sensor networks is that nodes rely on batteries with limited capacity. Therefore, to extend the life of the sensors and the reliability of the network, an efficient routing algorithm can reduce/optimize energy consumption by reducing routing overhead while maintaining a high delivery rate. Moreover, a good routing method should compute a routing path that is as close as possible to the shortest path. We propose ORouting, a localized energy efficient greedy routing scheme. To minimize the gap between the shortest path and the computed path, ORouting computes its routing path by locally selecting the next hop node based on its orthogonal distance to the direction of the source/destination pair. Moreover, in its routing decision, ORouting is biased towards its neighbors in the forward direction towards the destination. We compare ORouting to several routing protocols. We show, through simulation, that our protocol improves significantly energy consumption and achieves a high percentage of successful routings.