Title :
What is the traffic hauling capacity of wireless networks?
Author :
Gupta, Piyush ; Kumar, P.R.
Author_Institution :
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
fDate :
6/21/1905 12:00:00 AM
Abstract :
We consider multi-hop radio networks, also known as packet radio networks, or ad hoc networks. Consider n nodes located in a disk of area A m2., with each node capable of transmitting at W bits/sec over a common channel. If the nodes are randomly located and each node´s destination is randomly chosen, then each node can obtain a throughput of Θ(w/√n log n) bit/sec for its destination, under optimal operation. In the best case when the node locations, OD-pair assignments, and traffic patterns can be optimally chosen, then the entire network can transport Θ(W√An) bit-meters/sec. In this case, we say that the network transports 1 bit-meter when 1 bit has been transported over a distance of 1 meter
Keywords :
channel capacity; packet radio networks; telecommunication traffic; multiple hop radio networks; node destination; node location; packet radio networks; telecommunication traffic; traffic hauling capacity; wireless networks; Ad hoc networks; Contracts; Packet radio networks; Power system modeling; Protocols; Radio network; Spread spectrum communication; Telecommunication traffic; Throughput; Wireless networks;
Conference_Titel :
Decision and Control, 1999. Proceedings of the 38th IEEE Conference on
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-7803-5250-5
DOI :
10.1109/CDC.1999.827904
