Sciweavers

179 search results - page 16 / 36
» On Solving Coverage Problems in a Wireless Sensor Network Us...
Sort
View

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...
AINA
2007
IEEE
14 years 2 months ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle
PERCOM
2007
ACM
14 years 7 months ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
Rui Huang, Gergely V. Záruba
MOBIHOC
2001
ACM
14 years 7 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
WSNA
2003
ACM
14 years 1 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li