Computer Science – Information Theory
Scientific paper
2010-06-08
Computer Science
Information Theory
6 pages, in Proceedings of ISIT 2010
Scientific paper
We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.
Chiasserini Carla-Fabiana
Garetto Michele
Leonardi Emilio
Nordio Alessandro
No associations
LandOfFree
Information-theoretic Capacity of Clustered Random 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 Information-theoretic Capacity of Clustered Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-theoretic Capacity of Clustered Random Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30557