Sciweavers

370 search results - page 2 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
IJWIN
2006
209views more  IJWIN 2006»
13 years 6 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
SECON
2008
IEEE
14 years 22 days ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 7 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
WCE
2007
13 years 7 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
DCOSS
2005
Springer
13 years 12 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das