Information-theoretic limits of dense underwater networks
Name
Medard_Information-theoretic.pdf
Size
195.03 KB
Format
Adobe PDF
Checksum (MD5)
acb01fe4d7653137760a3777d54c8041
Author(s)
Shin, Won-Yong
Lucani, Daniel Enrique
Medard, Muriel
Stojanovic, Milica
Tarokh, Vahid
Date Issued
November 2011
Journal
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Shin, Won-Yong et al. “Information-theoretic Limits of Dense Underwater Networks.” Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2011. 1835–1839.
Version
Author's final manuscript
Abstract
Information-theoretic throughput scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a unit square, in which both bandwidth and received signal power can be severely limited. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. We first characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. In the dense network having unit area, a cut-set upper bound on the capacity scaling is then derived. We show that there exists either a bandwidth or a power limitation, or both, according to the path-loss attenuation regimes, thus yielding the upper bound that has three fundamentally different operating regimes. In the dense network, we also describe an achievable scheme based on the simple nearest-neighbor multi-hop transmission. The operating regimes that guarantee the order optimality are identified, where frequency scaling is instrumental towards achieving the order optimality in the regimes.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ACSSC.2011.6190340
