Sciweavers

48 search results - page 5 / 10
» A Simple Approximation to Minimum-Delay Routing
Sort
View
ICALP
2005
Springer
14 years 4 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
PIMRC
2008
IEEE
14 years 5 months ago
A joint routing-MAC model for cellular-relaying networks
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
Bogdan Timus, Pablo Soldati
ADHOC
2005
116views more  ADHOC 2005»
13 years 10 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 8 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 11 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler