Expected path length for angle and distance-based localized routing

Authors:
Israat Tanzeena Haque;Ioanis Nikolaidis;Pawel Gburzynski
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Year:
2009

Citing 2
Cited 0

Probability distribution of multi-hop-distance in one-dimensional sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give analytical solutions for the expected path length in ad-hoc wireless networks employing distance-based or angle-based based greedy routing schemes. Such schemes underlay many practical routing protocols for ad-hoc wireless networks in which nodes are aware of their geographical locations and can use that information to simplify (localize) the routing rules. As the two paradigms, i.e., minimizing the distance towards the destination, and minimizing the angular deviation from the straight path towards the destination, lie at the heart of practically all location-based routing protocols, our solutions can be viewed as generic and applicable to a variety of realistic schemes.