Abstract
We study the capacity of static wireless networks, both ad hoc and hybrid, under the Protocol and Physical Models of communication, proposed in [1]. For ad hoc networks with <i>n</i> nodes, we show that under the Physical Model, where signal power is assumed to attenuate as 1/r<sup>α</sup>, α > 2, the transport capacity scales as Θ(√<i>n</i>) bit-meters/sec. The same bound holds even when the nodes are allowed to approach arbitrarily close to each other and even under a more generalized notion of the Physical Model wherein the data rate is Shannon's logarithmic function of the SINR at the receiver. This result is sharp since it closes the gap that existed between the previous best known upper bound of O(<i>n</i><sup>α-1/α</sup>) and lower bound of Ω(√n).
We also show that any spatio-temporal scheduling of transmissions and their ranges that is feasible under the Protocol Model can also be realized under the Physical Model by an appropriate choice of power levels for appropriate thresholds. This allows the generalization of various lower bound constructions from the Protocol Model to the Physical Model. In particular, this provides a better lower bound on the best case transport capacity than in [1].
For hybrid networks, we consider an overlay of μ<i>n</i> randomly placed wired base stations. It has previously been shown in [6] that if all nodes adopt a common power level, then each node can be provided a throughput of at most Θ(1/log <i>n</i>) to randomly chosen destinations. Here we show that by allowing nodes to perform power control and properly choosing ν(1/log <i>n</i>), it is further possible to provide a throughput of Θ(1) to any fraction <i>f</i>, 0 < <i>f</i> < 1, of nodes. This result holds under both the Protocol and Physical models of communication. On the one hand, it shows that that the aggregate throughput capacity, measured as the sum of individual throughputs, can scale linearly in the number of nodes. On the other hand, the result underscores the importance of choosing minimum power levels for communication and suggests that simply communicating with the closest node or base station could yield good capacity even for multihop hybrid wireless networks.
- P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. IT-46, March 2000.Google Scholar
- A. Agarwal and P. R. Kumar, "Improved capacity bounds for wireless networks," Wireless Communications and Mobile Computing, vol. 4, issue 3, pp. 251--261, May 2004. Google ScholarDigital Library
- L. Xie and P. R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Transactions on Information Theory, vol. 50, no. 5, pp. 748--767, May 2004. Google ScholarDigital Library
- M. Franceschetti, O. Dousse, D. Tse, P. Thiran, "Closing the gap in the capacity of random wireless networks," preprint.Google Scholar
- B. Liu, Z. Liu, and D. Towsley, "On the capacity of hybrid wireless networks," in Proceedings of IEEE Infocom, 2003.Google Scholar
- U. C. Kozat and L. Tassiulas, "Throughput capacity of random ad hoc networks with infrastructure support," in Proceedings of Mobicom, 2003. Google ScholarDigital Library
- P. Gupta, "Design and performance analysis of wireless networks," Ph.D. dissertation, University of Illinois at Urbana-Champaign, 2000.Google Scholar
- T. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991. Google ScholarDigital Library
- A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations Concepts and Applications of Voronoi Diagrams. John Wiley, 1992. Google ScholarDigital Library
- Piyush Gupta and P. R. Kumar, "Internets in the sky: The capacity of three dimensional wireless networks," Communications in Information and Systems, vol. 1, issue 1, pp. 33--49, Jan. 2001.Google ScholarCross Ref
- Piyush Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks", pp. 547--566, in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Edited by W. M. McEneany, G. Yin, and Q. Zhang. Birkhauser, Boston, 1998. ISBN 0-8176-4078-9.Google Scholar
Index Terms
- Capacity bounds for ad hoc and hybrid wireless networks
Recommendations
On the Throughput Capacity of Hybrid Wireless Networks Using an L-Maximum-Hop Routing Strategy
AbstractThe capacity of ad hoc network is constrained by the multi-hop relay traffic. We investigate a hybrid wireless network with base stations distributed in an ad hoc network in order to localize the ad hoc traffic. We propose to organize the ad hoc ...
Infrastructure support for ad hoc networks: when and where?
Currently, there are several attempts to connect ad hoc wireless networks with legacy infrastructured wireless networks. This paper is the initial work about how we can efficiently use an ad hoc wireless network with infrastructure from the view of ad ...
Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks
Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing ...
Comments