Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CORR
2008
Springer

favoriteEmaildiscussreport

73views Education» more CORR 2008»

On Information-Theoretic Scaling Laws for Wireless Networks

13 years 4 months ago

On Information-Theoretic Scaling Laws for Wireless Networks

Download www.ece.uwaterloo.ca

With the analysis of the hierarchical scheme, the potential influence of the pre-constant in deriving scaling laws is exposed. It is found that a modified hierarchical scheme can achieve a throughput arbitrarily times higher than the original one, although it is still diminishingly small compared to the linear scaling. The study demonstrates the essential importance of the throughput formula itself, rather than the scaling laws consequently derived.

Liang-Liang Xie

Real-time Traffic

CORR 2008 | Education | Hierarchical Scheme | Modified Hierarchical Scheme | Potential Influence |

claim paper

Related Content

» Information Theoretic Operating Regimes of Large Wireless Networks

» On the scaling laws of dense wireless sensor networks

» Product Multicommodity Flow in Wireless Networks

» Scaling Laws on Multicast Capacity of Large Scale Wireless Networks

» Fundamental scaling laws for energyefficient storage and querying in wireless sensor netwo...

» Toward simple criteria to establish capacity scaling laws for wireless networks

» Throughput Scaling Laws for Wireless Networks with Fading Channels

» Throughput Scaling of Wireless Networks With Random Connections

» Ad Hoc networks with topologytransparent scheduling schemes Scaling laws and capacitydelay...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Liang-Liang Xie

Comments (0)