192 search results - page 21 / 39 » On the Minimum k-Connectivity Repair in Wireless Sensor Netw... |
MOBICOM
2005
ACM
14 years 9 days ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
ISPA
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. In this paper, we investigate the fault tolerance of connectivity probability for CDMA-based wireless sensor networks with variations of nodes deployment. The variations ...
SSS
2009
Springer
14 years 1 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
ADHOCNOW
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
HICSS
2008
IEEE
13 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...