Ulaş C. Kozat
ABSTRACT
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by purely using the remaining ad hoc nodes as their relays. In addition, ad hoc nodes can also utilize the existing infrastructure fully or partially by reaching any access point (or gateway) of the infrastructure network in a single or multi-hop fashion. Using the same tools as in [1], we show that the per source node capacity of T(W/log(N)) can be achieved in a random network scenario with the following assumptions: (i) The number of ad hoc nodes per access point is bounded above, (ii) each wireless node, including the access points, is able to transmit at W bits/sec using a fixed transmission range, and (iii) N ad hoc nodes, excluding the access points, constitute a connected topology graph. This is a significant improvement over the capacity of random ad hoc networks with no infrastructure support which is found as T(W/vN log(N)) in [1]. Although better capacity figures may be obtained by complex network coding or exploiting mobility in the network, infrastructure approach provides a simpler mechanism that has more practical aspects. We also show that even when less stringent requirements are imposed on topology connectivity, a per source node capacity figure that is arbitrarily close to T(1) cannot be obtained. Nevertheless, under these weak conditions, we can further improve per node throughput significantly.
- P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388--404, March 2000. Google Scholar
Digital Library
- Joseph P. Macker, Vincent D. Park, and M. Scott Corson, "Mobile and Wireless Internet Services: Putting the Pieces Together," IEEE Communications Magazine, vol. 39, no. 6, pp. 148--155, June 2001. Google ScholarDigital Library
- Ying-Dar Lin and Yu-Ching Hsu, "Multihop Cellular: A New Architecture for Wireless Communications," in IEEE INFOCOM 2000, March 2000, pp. 1273--1282.Google Scholar
- John W. Noerenberg II, "Bridging Wireless Protocols," IEEE Communications Magazine, vol. 39, no. 11, pp. 90--97, Nov. 2001. Google ScholarDigital Library
- George Neonakis Aggélou and Rahim Tafazolli, "On the Relaying Capability of Next-Generation GSM Cellular Networks," IEEE Personal Communications, pp. 40--47, Feb. 2001.Google ScholarCross Ref
- A.N. Zadeh, B. Jabbari, R. Pickholtz, B. Vojcic, "Self-organizing packet radio ad hoc networks with overlay (SOPRANO)," IEEE Communications Magazine, vol. 40, pp. 149--157, June 2002. Google ScholarDigital Library
- M. Gastpar and M. Vetterli, "On the capacity of wireless networks: The relay case," in Proceedings of the IEEE Infocom, 2002.Google Scholar
- Benyuan Liu, Zhen Liu, and Don Towsley, "On the capacity of hybrid wireless networks," in Proceedings of the IEEE Infocom, 2003.Google Scholar
- Jiang Xie and Ian F. Akyildiz, "A Distributed Dynamic Regional Location Management Scheme for Mobile IP," in Proceedings of IEEE Infocom, June 2002.Google Scholar
- M. Grossglauser and D. Tse, "Mobility increases the capacity of ad-hoc wireless networks," in Proceedings of the IEEE Infocom, 2001.Google Scholar
- P. Gupta and P.R. Kumar, "Towards an information theory of large networks: An achievable rate region," in IEEE Int. Symp. Info. Theory, Washington DC, June 2001.Google ScholarCross Ref
- Enrique J. Duarte-Melo and Mingyan Liu, "Data-Gathering Wireless Sensor Networks: Organization and Capacity," Uni. of Michigan, Ann Arbor, Tech. Rep., 2002.Google Scholar
- P. Gupta and P.R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Application: A Volume in Honor of W.H. Fleming, March 1998.Google Scholar
- Thomas M. Cover and Joy A. Thomas, Elements of Information Theory. Wiley-Interscience, 1991. Google ScholarDigital Library
- Athanasios Papoulis, Probability, Random Variables, and Stochastic Processes. McGraw-Hill Inc., 1991.Google Scholar
- Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms. MIT Press, 1990. Google ScholarDigital Library
- P.T. Olivier Dousse and M. Hasler, "Connectivity in ad-hoc and hybrid networks," in Proceedings of the IEEE Infocom, 2002.Google Scholar
- Vladimir Vapnik, Estimation of Dependences Based on Empirical Data. Springer-Verlag, 1982. Google ScholarDigital Library
- J. Li, C. Blake, D.S.J. DeCouto, H.I. Lee, and R. Morris, "Capacity of ad hoc wireless networks," in Proceedings of Mobicom, 2001. Google ScholarDigital Library
Index Terms
- Throughput capacity of random ad hoc networks with infrastructure support
Recommendations
Throughput scalability of wireless hybrid networks over a random geometric graph
Special issue: Selected papers from ACM MobiCom 2003In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by ...
Capacity of ad hoc wireless networks with infrastructure support
We determine the asymptotic scaling for the per user throughput in a large hybrid ad hoc network, i.e., a network with both ad hoc nodes, which communicate with each other via shared wireless links of capacity W bits/s, and infrastructure nodes which in ...
Infrastructure-based routing in wireless mobile ad hoc networks
In this paper, we propose a new protocol for wireless mobile ad hoc communications, which establishes a dynamic wireless mobile infrastructure to mimic and maintain the operation of the fixed infrastructure in cellular networks, namely, the Virtual Base ...
Comments