TY - GEN
T1 - Improved power-delay trade-off in wireless ad hoc networks using opportunistic routing
AU - Shin, Won Yong
AU - Chung, Sae Young
AU - Lee, Yong H.
PY - 2007
Y1 - 2007
N2 - We study the benefits of opportunistic routing in wireless networks by examining how the power and delay scale as the number of source-destination (S-D) pairs increases, where S-D pairs are randomly located over the network. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined. The results indicate that the opportunistic routing can exhibit better power-delay trade-off than the conventional routing while providing up to a logarithmic boost in the scaling law. The gain comes from the fact that the system with opportunistic routing can tolerate more interference due to increased received signal power from utilizing the multi-user diversity gain. Furthermore, we derive an upper bound on the total throughput using the cut-set theorem. It is shown that the achievable rates of the conventional and opportunistic routing schemes become close to the upper bound when the number of S-D pairs is large enough.
AB - We study the benefits of opportunistic routing in wireless networks by examining how the power and delay scale as the number of source-destination (S-D) pairs increases, where S-D pairs are randomly located over the network. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined. The results indicate that the opportunistic routing can exhibit better power-delay trade-off than the conventional routing while providing up to a logarithmic boost in the scaling law. The gain comes from the fact that the system with opportunistic routing can tolerate more interference due to increased received signal power from utilizing the multi-user diversity gain. Furthermore, we derive an upper bound on the total throughput using the cut-set theorem. It is shown that the achievable rates of the conventional and opportunistic routing schemes become close to the upper bound when the number of S-D pairs is large enough.
UR - http://www.scopus.com/inward/record.url?scp=51649093310&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51649093310&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2007.4557329
DO - 10.1109/ISIT.2007.4557329
M3 - Conference contribution
AN - SCOPUS:51649093310
SN - 1424414296
SN - 9781424414291
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 841
EP - 845
BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Y2 - 24 June 2007 through 29 June 2007
ER -