Computer Science – Information Theory
Scientific paper
2006-11-15
Computer Science
Information Theory
56 pages, 16 figures, submitted to IEEE Transactions on Information Theory
Scientific paper
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r^{-alpha}, as well as a random phase. We identify the scaling laws of the information theoretic capacity of the network. In the case of dense networks, where the area is fixed and the density of nodes increasing, we show that the total capacity of the network scales linearly with n. This improves on the best known achievability result of n^{2/3} of Aeron and Saligrama, 2006. In the case of extended networks, where the density of nodes is fixed and the area increasing linearly with n, we show that this capacity scales as n^{2-alpha/2} for 2
Leveque Olivier
Ozgur Ayfer
Tse David
No associations
LandOfFree
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc 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 Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-54885