TY - GEN
T1 - Ad hoc networking with rate-limited infrastructure
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
AU - Jeong, Cheol
AU - Shin, Won Yong
PY - 2014
Y1 - 2014
N2 - Capacity scaling of a large hybrid network with unit node density, consisting of wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links between the BSs and the RCP are rate-limited. We first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed in the network based on using one of pure multihop, hierarchical cooperation, and two infrastructure-supported routing protocols, and moreover, information-theoretic operating regimes are identified. In addition, to verify the order optimality of our achievability result, a generalized cut-set upper bound under the network model is derived by cutting not only the wireless connections but also the wired connections.
AB - Capacity scaling of a large hybrid network with unit node density, consisting of wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links between the BSs and the RCP are rate-limited. We first derive the minimum backhaul link rate required to achieve the same capacity scaling law as in the infinite-capacity backhaul link case. Assuming an arbitrary rate scaling of each backhaul link, a generalized achievable throughput scaling law is then analyzed in the network based on using one of pure multihop, hierarchical cooperation, and two infrastructure-supported routing protocols, and moreover, information-theoretic operating regimes are identified. In addition, to verify the order optimality of our achievability result, a generalized cut-set upper bound under the network model is derived by cutting not only the wireless connections but also the wired connections.
UR - http://www.scopus.com/inward/record.url?scp=84906534722&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906534722&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6874795
DO - 10.1109/ISIT.2014.6874795
M3 - Conference contribution
AN - SCOPUS:84906534722
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 61
EP - 65
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 29 June 2014 through 4 July 2014
ER -