Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic

Details Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic

2007-03-03

arxiv.org/abs/cs/0703014v1

Computer Science

Networking and Internet Architecture

Scientific paper

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to unity as the number of nodes goes to infinity. We study \emph{(i)} asymmetric networks, where the numbers of sources and destinations of traffic are unequal, \emph{(ii)} multicast networks, in which each created packet has multiple destinations, \emph{(iii)} cluster networks, that consist of clients and a limited number of cluster heads, and each client wants to communicate with any of the cluster heads, and \emph{(iv)} hybrid networks, in which the nodes are supported by a limited infrastructure. Our findings quantify the fundamental capabilities of these wireless networks to handle traffic bottlenecks, and point to correct design principles that achieve the capacity without resorting to overly complicated protocols.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic 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 Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719917