581 search results - page 49 / 117 » Approximation algorithms for constructing wavelength routing... |
129
click to vote
IWDC
2005
Springer
15 years 7 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
127
click to vote
QOSIP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
145
click to vote
IPSN
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
143
click to vote
APCHI
2008
IEEE
15 years 8 months ago
2008
IEEE
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...