Sciweavers

61 search results - page 6 / 13
» Approximation Algorithms for Survivable Optical Networks
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 28 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
INFOCOM
2003
IEEE
14 years 24 days ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
SECON
2010
IEEE
13 years 5 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
CATS
2007
13 years 9 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
TON
2010
197views more  TON 2010»
13 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...