Results 1  10
of
493
Mobility increases the capacity of adhoc wireless networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the persession throughpu ..."
Abstract

Cited by 1220 (5 self)
 Add to MetaCart
The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the per
Best Upgrade Plans for Single and Multiple SourceDestination Pairs
"... In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be redu ..."
Abstract
 Add to MetaCart
network) is minimized, without exceeding the available budget for the upgrade. In the multiplepair version of BUP, a set Q of sourcedestination 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
Optimal determination of sourcedestination connectivity in random graphs
"... This paper investigates the problem of optimally determining sourcedestination connectivity in random graphs. We consider the classic ErdosRenyi (ER) random graph with n nodes, where an edge independently exists between any two nodes with probability p. The problem examined is that of determining ..."
Abstract
 Add to MetaCart
This paper investigates the problem of optimally determining sourcedestination connectivity in random graphs. We consider the classic ErdosRenyi (ER) random graph with n nodes, where an edge independently exists between any two nodes with probability p. The problem examined
Design of Logical Topologies for WavelengthRouted Optical Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1996
"... This paper studies the problem of designing a logical topology over a wavelengthrouted alloptical network physical topology. The physical topology consists of the nodes and fiber links in the network. On an alloptical network physical topology, we can set up lightpaths between pairs of nodes, w ..."
Abstract

Cited by 204 (4 self)
 Add to MetaCart
, 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 sourcedestination pairs), our
Capacity Regions for Wireless Ad Hoc Networks
 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
, 2003
"... 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 sourcedestination pairs in the network under various transmission strategies, such as variablerate transmissi ..."
Abstract

Cited by 283 (16 self)
 Add to MetaCart
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 sourcedestination pairs in the network under various transmission strategies, such as variable
A BGPbased Mechanism for LowestCost Routing
, 2002
"... The routing of traffic between... this paper, we address the problem of interdomain routing from a mechanismdesign point of view. The application of mechanismdesign principles to the study of routing is the subject of earlier work by Nisan and Ronen [15] and Hershberger and Suri [11]. In this pape ..."
Abstract

Cited by 268 (16 self)
 Add to MetaCart
mechanism computes lowestcost routes for all sourcedestination pairs and payments for transit nodes on all of the routes (rather than computing routes and payments for only one sourcedestination pair at a time, as is done in [15,11]); (3) we show how to compute our mechanism with a distributed algorithm
InterferenceAware Relay Selection Scheme for TwoHop Relay Networks With Multiple Source–Destination Pairs
"... Abstract—An interferenceaware relay selection scheme is proposed for twohop 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, and the interferen ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract—An interferenceaware relay selection scheme is proposed for twohop 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
A New SumRate Outer Bound for Interference Channels with Three SourceDestination Pairs
"... Abstract—This paper derives a novel sumrate 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 twouser channel. For the Gaussian channel the proposed sumrate out ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—This paper derives a novel sumrate 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 twouser channel. For the Gaussian channel the proposed sumrate outer bound outperforms known bounds for certain channel parameters. Index Terms—Interference channel; Outer bound; Sumcapacity.
ThroughputDelay Tradeoff in Wireless Networks
 IEEE TRANS. ON INFORM. TH
, 2006
"... ...network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per sourcedestination pair is... Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or throughput scaling per sourcede ..."
Abstract

Cited by 242 (12 self)
 Add to MetaCart
...network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per sourcedestination pair is... Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or throughput scaling per sourcedestination
A power controlled multiple access protocol for wireless packet networks
, 2001
"... Abstract — Multiple accessbased collision avoidance MAC protocols have typically used fixed transmission power, and have not considered power control mechanisms based on the distance of the transmitter and receiver in order to improve spatial channel reuse. This work proposes PCMA, a power controll ..."
Abstract

Cited by 242 (2 self)
 Add to MetaCart
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 adhoc network is that sourcedestination pairs can be more tightly packed into the network allowing a greater number
Results 1  10
of
493