The Capacity of Wireless Networks in Nonergodic Random Fading

Nebat, Y.; Cruz, R.L.; Bhardwaj, Sumit

doi:10.1109/tit.2009.2019343

Cited by 14 publications

(13 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We thus assume a narrow-band time-varying channel, whose gain changes to a new independent value for every symbol. Note that this random phase model is based on a far-field assumption [10,11,28], 8 which is valid if the wavelength is sufficiently smaller than the minimum node separation. Based on the above channel characteristics, operating regimes of the network are identified according to the following physical parameters: the absorption a( f ) and the noise PSD N ( f ) which are exploited here by choosing the frequency f based on the number of nodes, n. In other words, if the relationship between f and n is specified, then a( f ) and N ( f ) can be given by a certain scaling function of n from (3) and (5), respectively.…”

Section: System and Channel Modelsmentioning

confidence: 99%

“…They showed that the total throughput scales as Θ √ n/ log n when a multi-hop (MH) routing strategy is used for n source-destination (S-D) pairs randomly distributed in a unit area. 1 MH schemes are then further developed and analyzed in [3][4][5][6][7][8][9], while their throughput per S-D pair scales far slower than Θ (1). Recent results [10,11] have shown that an almost linear throughput in the radio network, i.e.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Effects of Frequency Scaling Over Capacity Scaling in Underwater Networks—Part I: Extended Network Model

ShinWon-Yong¹,

LucaniDaniel²,

MédardMuriel³

et al. 2012

Wireless Pers Commun

View full text Add to dashboard Cite

In this two-part paper, information-theoretic capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a square, in which both bandwidth and received signal power can be limited significantly. Parts I and II deal with an extended network of unit node density and a dense network of unit area, respectively. In both cases, a narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n, which is shown to be crucial for achieving the order optimality in multi-hop (MH) mechanisms. We first characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. Upper and lower bounds on the capacity scaling are then derived. In Part I, we show that the upper bound on capacity for extended networks is inversely proportional to the attenuation parameter, thus resulting in a highly power-limited network. Interestingly, it is shown that the upper bound is intrinsically related to the attenuation parameter but not the spreading factor. propose an achievable communication scheme based on the nearest-neighbor MH transmission, which is suitable due to the low propagation speed of acoustic channel, and show that it is order-optimal for all operating regimes of extended networks. Finally, these scaling results are extended to the case of random node deployments providing fundamental limits to more complex scenarios of extended underwater networks.

show abstract

Section: System and Channel Modelsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Effects of Frequency Scaling Over Capacity Scaling in Underwater Networks—Part I: Extended Network Model

ShinWon-Yong¹,

LucaniDaniel²,

MédardMuriel³

et al. 2012

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…This throughput scaling is achieved using a multihop communication scheme. Multihop schemes were then further developed and analyzed in the literature [2][3][4]. A recent result has shown that we can actually achieve a linear scaling of the total throughput in the network by using a hierarchical cooperation strategy [5] and infrastructure nodes [6].…”

Section: Introductionmentioning

confidence: 99%

“…The effect of fading on the scaling laws was studied in [2,3,7], where it was shown that achievable scaling laws do not fundamentally change if all nodes are assumed to have their own traffic demands, i.e., if heavily loaded network environments are assumed [2,3,7] or the effect of fading is averaged out [2,7]. However, in the literature, there are some results on the usefulness of fading, where one can exploit an opportunistic gain, e.g., opportunistic scheduling [8], opportunistic beam-forming [9], and random beamforming [10] in broadcast channels.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Parallel Opportunistic Multihop Routing

Shin¹

2014

Journal of information and communication convergence engineerin

View full text Add to dashboard Cite

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

show abstract

“…This throughput scaling is achieved using a multi-hop (MH) communication scheme. This was improved to Θ( √ n) by using percolation theory [2], [3]. MH schemes are further developed and analyzed in [4], [5].…”

Section: Introductionmentioning

confidence: 99%

Hierarchical Cooperation in Ultra-Wide Band <i>Ad Hoc</i> Networks

Shin

Ishibashi

2013

IEICE Trans. Commun.

View full text Add to dashboard Cite

Won-Yong SHIN †a) , Nonmember and Koji ISHIBASHI † †b) , Member SUMMARY We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3. key words: hierarchical cooperation (HC), multi-hop, path-loss exponent, power-limited, throughput scaling, ultra-wide band (UWB)

show abstract

The Capacity of Wireless Networks in Nonergodic Random Fading

Cited by 14 publications

References 19 publications

On the Effects of Frequency Scaling Over Capacity Scaling in Underwater Networks—Part I: Extended Network Model

On the Effects of Frequency Scaling Over Capacity Scaling in Underwater Networks—Part I: Extended Network Model

Performance Evaluation of Parallel Opportunistic Multihop Routing

Hierarchical Cooperation in Ultra-Wide Band <i>Ad Hoc</i> Networks

Contact Info

Product

Resources

About