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 [9], we show that the per source node capacity of Θ(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 \(\Theta(W/\sqrt{N \log(N)})\) in [9]. 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 Θ(1) cannot be obtained. Nevertheless, under these weak conditions, we can further improve per node throughput significantly. We also provide a limited extension on our results when the number of ad hoc nodes per access point is not bounded.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.N. Aggé lou and R. Tafazolli, On the relaying capability of next-generation GSM cellular networks, IEEE Personal Communications (Feb. 2001) pp. 40–47.
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, MA, 1990).
T.M. Cover and J.A. Thomas, Elements of Information Theory (Wiley-Interscience, New York, 1991).
O. Dousse and M. Hasler, Connectivity in ad-hoc and hybrid networks, in: Proceedings of the IEEE Infocom (June 2002).
E.J. Duarte-Melo and M. Liu, Data-gathering wireless sensor networks: Organization and capacity, Computer Networks (COMNET), Special Issue on Wireless Sensor Networks 43(4) (2003) 519–537.
M. Gastpar and M. Vetterli, On the capacity of wireless networks: The relay case, in: Proceedings of the IEEE Infocom (June 2002).
M. Grossglauser and D. Tse, Mobility increases the capacity of ad-hoc wireless networks, in: Proceedings of the IEEE Infocom (April 2001).
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 (Birkhä user, Boston, 1999).
P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46(2) (2000) 388–404.
P. Gupta and P.R. Kumar, Towards an information theory of large networks: An achievable rate region, in: IEEE Int. Symp. Info. Theory (June 2001).
J. Li, C. Blake, D.S.J. DeCouto, H.I. Lee and R. Morris, Capacity of ad hoc wireless networks, in: Proceedings of Mobicom (July 2001) pp. 61–69.
Y. Lin and Y. Hsu, Multihop cellular: A new architecture for wireless communications, in: Proceedings of IEEE INFOCOM 2000 (March 2000) pp. 1273–1282.
B. Liu, Z. Liu and D. Towsley, On the capacity of hybrid wireless networks, in: Proceedings of the IEEE Infocom (March 2003).
J.P. Macker, V.D. Park and M.S. Corson, Mobile and wireless internet services: putting the pieces together, IEEE Communications Magazine 39(6) (2001) 148–155.
J.W. Noerenberg, Bridging wireless protocols, IEEE Communications Magazine 39(11) (2001) 90–97.
A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd ed. (McGraw-Hill Inc., New York, 1991).
M.D. Penrose, A strong law for the longest edge of the minimal spanning tree, The Annals of Probability 27(1) (1999) 246–160.
V. Vapnik, Estimation of Dependences Based on Empirical Data (Springer-Verlag, 1982).
J. Xie and I.F. Akyildiz, A distributed dynamic regional location management scheme for mobile IP, in: Proceedings of IEEE Infocom (June 2002).
A.N. Zadeh, B. Jabbari, R. Pickholtz and B. Vojcic, Self-organizing packet radio ad hoc networks with overlay (SOPRANO), IEEE Communications Magazine 40 (2002) 149–157.
Author information
Authors and Affiliations
Additional information
Ulaş C. Kozat was born in 1975, in Adana, Turkey. He received his B.Sc. degree in Electrical and Electronics Engineering from Bilkent University, Ankara, Turkey and his M.Sc. in Electrical Engineering from The George Washington University, Washington D.C. in 1997 and 1999 respectively. He has received his Ph.D. degree in May 2004 from the Department of Electrical and Computer Engineering at University of Maryland, College Park. He has conducted research under the Institute for Systems Research (ISR) and Center for Hybrid and Satellite Networks (CSHCN) at the same university. He worked at HRL Laboratories and Telcordia Technologies Applied Research as a research intern. His current research interests primarily focus on wireless and hybrid networks that span multiple communication layers and networking technologies. Mathematical modelling, resource discovery and allocation, vertical integration of wireless systems and communication layers, performance analysis, architecture and protocol development are the main emphasis of his work. E-mail: kozat@isr.umd.edu
Leandros Tassiulas (S′89, M′91) was born in 1965, in Katerini, Greece. He obtained the Diploma in Electrical Engineering from the Aristotelian University of Thessaloniki, Thessaloniki, Greece in 1987, and the M.S. and Ph.D. degrees in Electrical Engineering from the University of Maryland, College Park in 1989 and 1991 respectively.
He is Professor in the Dept. of Computer and Telecommunications Engineering, University of Thessaly, Greece and Research Professor in the Dept. of Electrical and Computer Eng and the Institute for Systems Research, University of Maryland College Park since 2001. He has held positions as Assistant Professor at Polytechnic University New York (1991–95), Assistant and Associate Professor University of Maryland College Park (1995–2001) and Professor University of Ioannina Greece (1999–2001).
His research interests are in the field of computer and communication networks with emphasis on fundamental mathematical models, architectures and protocols of wireless systems, sensor networks, high-speed internet and satellite communications.
Dr. Tassiulas received a National Science Foundation (NSF) Research Initiation Award in 1992, an NSF CAREER Award in 1995 an Office of Naval Research, Young Investigator Award in 1997 and a Bodosaki Foundation award in 1999 and the INFOCOM′94 best paper award. E-mail: leandros@isr.umd.edu
Rights and permissions
About this article
Cite this article
Kozat, U.C., Tassiulas, L. Throughput Scalability of Wireless Hybrid Networks over a Random Geometric Graph. Wireless Netw 11, 435–449 (2005). https://doi.org/10.1007/s11276-005-1767-y
Issue Date:
DOI: https://doi.org/10.1007/s11276-005-1767-y