The nominal capacity of wireless mesh networks

被引:289
作者
Jun, JG [1 ]
Sichitiu, ML [1 ]
机构
[1] N Carolina State Univ, Dept Elect & Comp Engn, Raleigh, NC 27695 USA
关键词
D O I
10.1109/MWC.2003.1241089
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless mesh networks are an alternative access. In WMNs, similar to ad hoc-networks, each user node operates not only as a host but also as a router; user packets are forwarded to and from an Internet-connected gateway in multihop fashion. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investment. Despite the recent startup surge in WMNs, much research remains to be done before WMNs realize their full potential. This article tackles the problem of determining the exact capacity of a WMN. The key concept we introduce to enable this calculation is the bottleneck collision domain, defined as the geographical area of the network that bounds from above the amount of data that can be transmitted in the network. We show that for WMNs the throughput of each node decreases as O(1/n), where n is the total number of nodes in the network. In contrast with most existing work on ad hoc network capacity, we do not limit our study to the asymptotic case. In particular, for a given topology and the set of active nodes, we provide exact upper bounds on the throughput of any node. The calculation can be used to provision theoretical results are validated by detailed simulations.
引用
收藏
页码:8 / 14
页数:7
相关论文
共 14 条
[1]  
[Anonymous], 1999, IEEE Standard 802.11a-1999
[2]  
Bharghavan V., 1994, Computer Communication Review, V24, P212, DOI 10.1145/190809.190334
[3]  
CALI F, 1998, INFOCOM 98, V1
[4]  
Fullmer C. L., 1995, Computer Communication Review, V25, P262, DOI 10.1145/217391.217458
[5]  
Garcia-Luna-Aceves J. J., 1997, P IEEE MILCOM 97 MON
[6]  
GASTPAR M, 2002, P IEEE INFOCOMM
[7]  
GROSSGLAUSER M, 2001, P IEEE INFOCOM APR
[8]  
GUPTA P, 2000, IEEE T INFO THEO MAR, V46
[9]  
HAENGGI M, 2002, IEEE WIR CIRC SYS WK
[10]  
Jun J, 2003, SECOND IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, P249, DOI 10.1109/NCA.2003.1201163