Multi-hop routing is order-optimal in underwater extended networks
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 we...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73996 https://orcid.org/0000-0003-4059-407X |
_version_ | 1826209401964331008 |
---|---|
author | Shin, Won-Yong Lucani, Daniel Enrique Medard, Muriel Stojanovic, Milica Tarokh, Vahid |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Shin, Won-Yong Lucani, Daniel Enrique Medard, Muriel Stojanovic, Milica Tarokh, Vahid |
author_sort | Shin, Won-Yong |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T14:21:57Z |
format | Article |
id | mit-1721.1/73996 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T14:21:57Z |
publishDate | 2012 |
publisher | Institute of Electrical and Electronics Engineers (IEEE) |
record_format | dspace |
spelling | mit-1721.1/739962022-10-01T20:50:13Z Multi-hop routing is order-optimal in underwater extended networks Shin, Won-Yong Lucani, Daniel Enrique Medard, Muriel Stojanovic, Milica Tarokh, Vahid Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Research Laboratory of Electronics Lucani, Daniel Enrique Medard, Muriel 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. National Science Foundation (U.S.) (Grant 0520075) National Science Foundation (U.S.) (Grant 0831728) National Science Foundation (U.S.) (Grant CNS-0627021) United States. Office of Naval Research. Multidisciplinary University Research Initiative (Grant N00014-07-1-0738) Space and Naval Warfare Systems Center San Diego (U.S.) (Contract N66001-06-C2020) National Science Foundation (U.S.) (Grant 0831728) United States. Office of Naval Research. Multidisciplinary University Research Initiative (Grant N00014-09-1-0700) 2012-10-15T20:19:24Z 2012-10-15T20:19:24Z 2010-07 2010-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-7891-0 978-1-4244-7890-3 http://hdl.handle.net/1721.1/73996 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 https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/ISIT.2010.5513480 Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT), 2010 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. application/pdf Institute of Electrical and Electronics Engineers (IEEE) IEEE |
spellingShingle | Shin, Won-Yong Lucani, Daniel Enrique Medard, Muriel Stojanovic, Milica Tarokh, Vahid Multi-hop routing is order-optimal in underwater extended networks |
title | Multi-hop routing is order-optimal in underwater extended networks |
title_full | Multi-hop routing is order-optimal in underwater extended networks |
title_fullStr | Multi-hop routing is order-optimal in underwater extended networks |
title_full_unstemmed | Multi-hop routing is order-optimal in underwater extended networks |
title_short | Multi-hop routing is order-optimal in underwater extended networks |
title_sort | multi hop routing is order optimal in underwater extended networks |
url | http://hdl.handle.net/1721.1/73996 https://orcid.org/0000-0003-4059-407X |
work_keys_str_mv | AT shinwonyong multihoproutingisorderoptimalinunderwaterextendednetworks AT lucanidanielenrique multihoproutingisorderoptimalinunderwaterextendednetworks AT medardmuriel multihoproutingisorderoptimalinunderwaterextendednetworks AT stojanovicmilica multihoproutingisorderoptimalinunderwaterextendednetworks AT tarokhvahid multihoproutingisorderoptimalinunderwaterextendednetworks |