Sciweavers

20 search results - page 1 / 4
» Lattice sensor networks: capacity limits, optimal routing an...
Sort
View
IPSN
2004
Springer
13 years 10 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
INFOCOM
2011
IEEE
12 years 8 months ago
A robust optimization approach to backup network design with random failures
—This paper presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffi...
Matthew Johnston, Hyang-Won Lee, Eytan Modiano
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
13 years 9 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
13 years 9 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
ADHOC
2007
126views more  ADHOC 2007»
13 years 4 months ago
Energy-aware routing in sensor networks: A large system approach
In many sensor networking environments, the sensor nodes have limited battery capacity and processing power. Hence, it is imperative to develop solutions that are energy-efficient...
Longbi Lin, Ness B. Shroff, R. Srikant