TY - GEN
T1 - Multi-hop routing is order-optimal in underwater extended networks
AU - Shin, Won Yong
AU - Lucani, Daniel E.
AU - Médard, Muriel
AU - Stojanovic, Milica
AU - Tarokh, Vahid
PY - 2010
Y1 - 2010
N2 - Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes. A narrowband model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a highly power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal as the attenuation parameter scales exponentially with √n (or faster). Finally, these scaling results are extended to a random network realization.
AB - Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes. A narrowband model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a highly power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal as the attenuation parameter scales exponentially with √n (or faster). Finally, these scaling results are extended to a random network realization.
UR - http://www.scopus.com/inward/record.url?scp=77955681158&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955681158&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2010.5513480
DO - 10.1109/ISIT.2010.5513480
M3 - Conference contribution
AN - SCOPUS:77955681158
SN - 9781424469604
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 510
EP - 514
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 -