Computer Science – Information Theory
Scientific paper
2010-05-05
Computer Science
Information Theory
16 pages, 4 figures, Submitted to IEEE Transactions on Information Theory
Scientific paper
Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. 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. Interestingly, it is seen that unlike the case of wireless radio networks, our upper bound is intrinsically related to the attenuation parameter but not the spreading factor. 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 $\sqrt{n}$ (or faster). Finally, these scaling results are extended to a random network realization.
Lucani Daniel E.
Medard Muriel
Shin Won-Yong
Stojanovic Milica
Tarokh Vahid
No associations
LandOfFree
On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-25408