Abstract
This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of n randomly located wireless nodes. The infrastructure uses multiantenna base stations (BSs), in which the number of BSs and the number of antennas at each BS can scale at arbitrary rates relative to n. Under the model, capacity scaling laws are analyzed for both dense and extended networks. Two BS-based routing schemes are first introduced in this study: an infrastructure-supported single-hop (ISH) routing protocol with multiple-access uplink and broadcast downlink and an infrastructure- supported multihop (IMH) routing protocol. Then, their achievable throughput scalings are analyzed. These schemes are compared against two conventional schemes without BSs: the multihop (MH) transmission and hierarchical cooperation (HC) schemes. It is shown that a linear throughput scaling is achieved in dense networks, as in the case without help of BSs. In contrast, the proposed BS-based routing schemes can, under realistic network conditions, improve the throughput scaling significantly in extended networks. The gain comes from the following advantages of these BS-based protocols. First, more nodes can transmit simultaneously in the proposed scheme than in the MH scheme if the number of BSs and the number of antennas are large enough. Second, by improving the long-distance signal-to-noise ratio (SNR), the received signal power can be larger than that of the HC, enabling a better throughput scaling under extended networks. Furthermore, by deriving the corresponding information-theoretic cut-set upper bounds, it is shown under extended networks that a combination of four schemes IMH, ISH, MH, and HC is order-optimal in all operating regimes.
Original language | English |
---|---|
Article number | 5961816 |
Pages (from-to) | 5088-5102 |
Number of pages | 15 |
Journal | IEEE Transactions on Information Theory |
Volume | 57 |
Issue number | 8 |
DOIs | |
Publication status | Published - 2011 Aug |
Bibliographical note
Funding Information:Manuscript received November 05, 2008; revised April 02, 2010; accepted March 18, 2011. Date of current version July 29, 2011. This work was supported in part by the Brain Korea 21 Project, The School of Information Technology, KAIST, in 2008; in part by the National Science Foundation (NSF) under awards 1017436 and 1053933; in part by ARO MURI grant number W911NF-07-1-0376; and in part by the IT R&D program of MKE/KEIT [KI001835]. The material in this paper was presented at the IEEE Communication Theory Workshop, St. Croix, U.S. Virgin Islands, May 2008, and at the IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences