On average and maximum load of greedy routing in wireless ad hoc networks

Authors:
Mohsen Eftekhari Hesari;Lata Narayanan;Jaroslav Opatrny
Affiliations:
CSE Department, Concordia University, Montreal, Quebec, Canada;CSE Department, Concordia University, Montreal, Quebec, Canada;CSE Department, Concordia University, Montreal, Quebec, Canada
Venue:
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Year:
2010

Citing 10
Cited 0

The forwarding index of communication networks

IEEE Transactions on Information Theory
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Oblivious routing on geometric networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Balancing traffic load in wireless networks with curveball routing

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds on hop distance in greedy routing approach in wireless ad hoc networks

International Journal of Wireless and Mobile Computing
Balancing traffic load using one-turn rectilinear routing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Position-based routing in ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

One common model that has been used to analyze routing algorithms in ad hoc networks considers networks that are so dense that a node exists close enough to any point in the network. Continuous techniques were used to calculate the average and maximum loads of the routing algorithms. In this paper we explain some limitations of such techniques in predicting the load of routing algorithms in discrete network models such as unit disk graphs even at high node densities. We present a new approach to find estimates of the average and maximum load induced by greedy routing in discrete network models. Our model takes into consideration parameters such as the transmission radius and the average degree of nodes, and is suitable for networks that are not necessarily very dense. Our model is validated by simulation results that closely match the theoretical predictions.