### Abstract

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.

Original language | English |
---|---|

Title of host publication | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings |

Pages | 510-514 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2010 Aug 23 |

Event | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 2010 Jun 13 → 2010 Jun 18 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8103 |

### Other

Other | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
---|---|

Country | United States |

City | Austin, TX |

Period | 10/6/13 → 10/6/18 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

### Cite this

*2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings*(pp. 510-514). [5513480] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513480

}

*2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings.*, 5513480, IEEE International Symposium on Information Theory - Proceedings, pp. 510-514, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 10/6/13. https://doi.org/10.1109/ISIT.2010.5513480

**Multi-hop routing is order-optimal in underwater extended networks.** / Shin, Won Yong; Lucani, Daniel E.; Médard, Muriel; Stojanovic, Milica; Tarokh, Vahid.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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/8/23

Y1 - 2010/8/23

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

ER -