On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks

Details On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks

2005-03-21

arxiv.org/abs/cs/0503047v1

Computer Science

Information Theory

Submitted to the IEEE Transactions on Information Theory, March 2005

Scientific paper

We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof technique based on which we are able to obtain a tight characterization of the solution to the linear program associated with the multiflow problem, to within constants independent of network size. We also use this proof method to analyze network capacity for a variety of transmitter/receiver architectures, for which we obtain some conclusive results. These results contain as a special case (and strengthen) those of Gupta and Kumar for random networks, for which a new derivation is provided using only elementary counting and discrete probability tools.

Affiliated with

Also associated with

No associations

Rating

On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some 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 Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160032