Sciweavers

184 search results - page 4 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
104
Voted
CISS
2008
IEEE
15 years 6 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
100
Voted
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 6 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
94
Voted
DAM
1999
119views more  DAM 1999»
14 years 11 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
DCOSS
2010
Springer
14 years 12 months ago
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
Joffroy Beauquier, Janna Burman
98
Voted
TCS
2008
14 years 11 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...