Sciweavers

147 search results - page 18 / 30
» Dependable k-coverage algorithms for sensor networks
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
DCOSS
2007
Springer
14 years 1 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
DCOSS
2007
Springer
14 years 1 months ago
Dwarf: Delay-aWAre Robust Forwarding for Energy-Constrained Wireless Sensor Networks
With the field of wireless sensor networks rapidly maturing, the focus shifts from “easy” deployments, like remote monitoring, to more difficult domains where applications imp...
Mario Strasser, Andreas Meier, Koen Langendoen, Ph...
ALGOSENSORS
2009
Springer
14 years 1 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
PEWASUN
2007
ACM
13 years 8 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi