Sciweavers

279 search results - page 17 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
WCE
2007
13 years 8 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
INFOCOM
2002
IEEE
14 years 13 days ago
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies.
—Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low per-node cost ...
Alberto Cerpa, Deborah Estrin
TMC
2010
139views more  TMC 2010»
13 years 5 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
JSAC
2008
98views more  JSAC 2008»
13 years 7 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
INFOCOM
2012
IEEE
11 years 10 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...