The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per

network) is minimized, without exceeding the available budget for the upgrade. In the multiple-pair version of BUP, a set Q of source-destination pairs is given, and the problem is to choose for upgrade those edges that lead to the smallest sum of shortest path distances across all pairs in Q, subject

This paper investigates the problem of optimally determin-ing source-destination connectivity in random graphs. We consider the classic Erdos-Renyi (ER) random graph with n nodes, where an edge independently exists between any two nodes with probability p. The problem examined

, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our

We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable

mechanism computes lowest-cost routes for all source-destination pairs and payments for transit nodes on all of the routes (rather than computing routes and payments for only one source-destination pair at a time, as is done in [15,11]); (3) we show how to compute our mechanism with a distributed algorithm

Abstract—An interference-aware relay selection scheme is proposed for two-hop relay networks with multiple source– destination (S–D) pairs, each of which is assisted by a relay selected from the candidates. We address the interference from relays to their nonintended destinations

Abstract—This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. For the Gaussian channel the proposed sum-rate outer bound outperforms known bounds for certain channel parameters. Index Terms—Interference channel; Outer bound; Sum-capacity.

...network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per source-destination pair is... Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or throughput scaling per source-destination

networks and does not require the presence of base stations to manage transmission power (i.e. it is decentralized). The advantage of implementing a power controlled protocol in an ad-hoc network is that source-destination pairs can be more tightly packed into the network allowing a greater number