Sciweavers

2190 search results - page 38 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
COMSWARE
2007
IEEE
14 years 2 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...
ALGOSENSORS
2006
Springer
13 years 11 months ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen
TMC
2008
112views more  TMC 2008»
13 years 7 months ago
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
Sensor deployment is a critical issue because it affects the cost and detection capability of a wireless sensor network. In this work, we consider two related deployment problems: ...
You-Chiun Wang, Chun-Chi Hu, Yu-Chee Tseng
DCOSS
2008
Springer
13 years 9 months ago
Techniques for Improving Opportunistic Sensor Networking Performance
Abstract. A number of recently proposed mobile sensor network architectures rely on uncontrolled, or weakly-controlled mobility to achieve sensing coverage over time at low cost, a...
Shane B. Eisenman, Nicholas D. Lane, Andrew T. Cam...

Presentation
945views
12 years 1 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...