Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

被引:25
作者
Kwon, Sungoh [1 ]
Shroff, Ness B. [2 ,3 ]
机构
[1] Samsung Elect Co, Suwon 443742, Gyeonggi Do, South Korea
[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
[3] Ohio State Univ, Dept Comp Sci & Engn, Columbus, OH 43210 USA
基金
美国国家科学基金会;
关键词
Analysis; geometric probability; multi-hop wireless network; routing; simulations;
D O I
10.1109/TNET.2008.2002222
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows that the nodal load at each node is a function of the node's Voronoi cell, the node's location in the network, and the traffic pattern specified by the source and destination randomness and straight line routing. In the asymptotic regime, we show that each node's probability that the node serves a packet arriving to the network approaches the products of half the length of the Voronoi cell perimeter and the load density function that a packet goes through the node's location. The density function depends on the traffic pattern generated by straight line routing, and determines where the hot spot is created in the network. Hence, contrary to conventional wisdom, straight line routing can balance the load over the network, depending on the traffic patterns.
引用
收藏
页码:857 / 869
页数:13
相关论文
共 40 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]   Wireless mesh networks: a survey [J].
Akyildiz, IF ;
Wang, XD ;
Wang, WL .
COMPUTER NETWORKS, 2005, 47 (04) :445-487
[3]  
[Anonymous], 1995, Stochastic Geometry and its Applications
[4]  
[Anonymous], Probability, Random Variables and Stochastic Processes
[5]  
Bandyopadhyay S, 2003, IEEE INFOCOM SER, P1713
[6]  
BLOUGH DM, 2002, P ACM MOBICOM 02 SEP, V1, P183
[7]  
Boyd S., 2004, CONVEX OPTIMIZATION, DOI DOI 10.1017/CBO9780511804441
[8]  
Chang J., 2000, Proceedings. IEEE, V1, P22, DOI DOI 10.1109/INFCOM.2000.832170
[9]  
Chong E., 2001, INTRO OPTIMIZATION
[10]   DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS [J].
DOBKIN, DP ;
FRIEDMAN, SJ ;
SUPOWIT, KJ .
DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (04) :399-407