Multi-hop routing is order-optimal in underwater extended networks
Name
Medard_Multi-hop routing.pdf
Size
209.23 KB
Format
Adobe PDF
Checksum (MD5)
071535bce6fb142eb1f36f831a214bf1
Author(s)
Shin, Won-Yong
Lucani, Daniel Enrique
Medard, Muriel
Stojanovic, Milica
Tarokh, Vahid
Date Issued
July 2010
Journal
Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Shin, Won-Yong et al. “Multi-hop Routing Is Order-optimal in Underwater Extended Networks.” IEEE International Symposium on Information Theory Proceedings (ISIT), 2010. 510–514. © Copyright 2010 IEEE
Version
Final published version
Abstract
Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes. A narrow-band 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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2010.5513480
