| Analysis of a simple multihop underwater acoustic network |
| Full text |
Pdf
(488 KB)
|
Source
|
International Conference on Mobile Computing and Networking
archive
Proceedings of the third ACM international workshop on Underwater Networks
table of contents
San Francisco, California, USA
SESSION: Algorithms and analysis
table of contents
Pages 3-10
Year of Publication: 2008
ISBN:978-1-60558-185-9
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 10, Downloads (12 Months): 119, Citation Count: 0
|
|
|
ABSTRACT
A multihop underwater acoustic network, which consists of a series of equal-distance hops connected by relay transceivers in a tandem, is considered. Messages are originated as coded packets from a source node at one end, relayed (decoded and re-encoded) sequentially hop by hop, and finally received by a destination node at the other end of the network. Several key characteristics of underwater acoustic channels, namely, frequency-dependent signal attenuation and noise, inter-hop interference, half-duplex constraint, and large propagation delay, are taken into account in the analysis. A simple transmission protocol with spatial reuse is considered, and the transmission schedule is designed to satisfy the half-duplex constraint on relay transceivers in the presence of large propagation delay. To efficiently cope with frequency-dependent channel characteristic and inter-hop interference, the power spectral density function of signaling is analytically optimized in a way analogous to water-filling. Furthermore, the problem of determining the minimum number of hops to support a prespecified rate and reliability with and without a maximum coded packet length constraint is examined. Finally, numerical results are presented to illustrate the analysis.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
C. A. Desoer, Communication Through Channels in Cascade, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1953.
|
| |
3
|
R. A. Silverman, "On Binary Channels and Their Cascades," IRE Trans. Inform. Theory, Dec. 1955, pp. 19--27.
|
| |
4
|
E. C. Posner and A. L. Rubin, "The Capacity of Digital Links in Tandem," IEEE Trans. Inform. Theory, May 1984, pp. 464--470.
|
| |
5
|
A. B. Kiely and J. T. Coffey, "On the Capacity of a Cascade of Channels," IEEE Trans. Inform. Theory, Jul. 1993, pp. 1310--1321.
|
| |
6
|
U. Niesen, C. Fragouli, and D. Tuninetti, "Scaling Laws for Line Networks: From Zero-Error to Min-Cut Capacity," in Proc. IEEE International Symposium on Information Theory (ISIT), Seattle, Jul. 2006.
|
| |
7
|
W. Zhang and U. Mitra, "Multihopping Strategies: An Error-Exponent Comparison," in Proc. IEEE International Symposium on Information Theory (ISIT), Nice, France, Jun. 2007.
|
| |
8
|
T. M. Cover and A. A. El Gamal, "Capacity Theorems for the Relay Channel," IEEE Trans. Inform. Theory, Vol. 25, No. 5, pp. 572--584, Sep. 1979.
|
| |
9
|
Marcin Sikora , J. Nicholas Laneman , Martin Haenggi , Daniel J. Costello, Jr. , Thomas E. Fuja, Bandwidth- and power-efficient routing in linear wireless networks, IEEE/ACM Transactions on Networking (TON), v.14 n.SI, p.2624-2633, June 2006
[doi> 10.1109/TIT.2006.874520]
|
| |
10
|
M. Stojanovic, "Capacity of a Relay Acoustic Channel," in Proc. the MTS/IEEE Oceans 2007, Oct. 2007, Vancouver, BC, Canada.
|
 |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
|