Computer Science – Information Theory
Scientific paper
2008-09-07
Computer Science
Information Theory
Scientific paper
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.
No associations
LandOfFree
On Information-Theoretic Scaling Laws for Wireless Networks 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 Information-Theoretic Scaling Laws for Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Information-Theoretic Scaling Laws for Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-322137