TY - GEN
T1 - An upper bound on multi-hop transmission capacity with dynamic routing selection
AU - Chen, Yuxin
AU - Andrews, Jeffrey G.
PY - 2010
Y1 - 2010
N2 - This paper develops an upper bound on the end-to-end transmission capacity of multi-hop wireless networks, in which all nodes are randomly distributed. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form bound on the outage probability is derived in terms of the number of potential paths. This in turn gives an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows us to immediately observe how the number of hops and other network traits affect spatial throughput. Our analysis indicates that predetermined routing approach (such as nearest-neighbor) cannot achieve optimal throughput: more hops are not necessarily helpful in interference-limited networks compared with single-hop direct transmission.
AB - This paper develops an upper bound on the end-to-end transmission capacity of multi-hop wireless networks, in which all nodes are randomly distributed. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form bound on the outage probability is derived in terms of the number of potential paths. This in turn gives an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows us to immediately observe how the number of hops and other network traits affect spatial throughput. Our analysis indicates that predetermined routing approach (such as nearest-neighbor) cannot achieve optimal throughput: more hops are not necessarily helpful in interference-limited networks compared with single-hop direct transmission.
UR - http://www.scopus.com/inward/record.url?scp=77955693966&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955693966&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2010.5513248
DO - 10.1109/ISIT.2010.5513248
M3 - Conference contribution
AN - SCOPUS:77955693966
SN - 9781424469604
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1718
EP - 1722
BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010
Y2 - 13 June 2010 through 18 June 2010
ER -