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

被引：0

作者：

Hesari, Mohsen Eftekhari ^{[1
]}

Narayanan, Lata ^{[1
]}

Opatrny, Jaroslav ^{[1
]}

机构：

[1] Concordia Univ, CSE Dept, Montreal, PQ, Canada

来源：

WONS 2010: SEVENTH INTERNATIONAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES | 2010年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：113 / 120

页数：8

共 18 条

[11] Karp B., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P243, DOI 10.1145/345910.345953
[12] KLEIN L, 1978, P IEEE NAT TEL C
[13] Kranakis E., 1999, P 11 CAN C COMP GEOM, V11, P51
[14] PARK V, 1997, ANN JOINT C IEEE COM
[15] PHAM P, P INFOCOM 2003 22 AN, P251
[16] Popa L, 2007, MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P170
[17] Stojmenovic I., 2002, IEEE COMMUNICATIONS
[18] TAKAGI H, 1984, IEEE T COMMUNICATION

← 1 2 →