Sciweavers

92 search results - page 6 / 19
» Restricted Shortest Path Routing with Concave Costs
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
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
13 years 11 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...
ISCC
2009
IEEE
201views Communications» more  ISCC 2009»
14 years 2 months ago
Self-Selecting Reliable Path Routing in diverse Wireless Sensor Network environments
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...
Thomas A. Babbitt, Christopher Morrell, Boleslaw K...
INFOCOM
2011
IEEE
12 years 11 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
JAIR
2002
106views more  JAIR 2002»
13 years 7 months ago
Collective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
David Wolpert, Kagan Tumer