Sciweavers

120 search results - page 12 / 24
» Entropy-based sensor selection for localization
Sort
View
GLOBECOM
2006
IEEE
15 years 3 months ago
Integrated Data Delivery and Interest Dissemination Techniques for Wireless Sensor Networks
— The paper presents IRIS, an Integrated Routing and Interest dissemination System for wireless sensor networks. The proposed protocols are designed to work under very low duty c...
Michele Mastrogiovanni, Chiara Petrioli, Michele R...
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
15 years 10 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala
INFOCOM
2007
IEEE
15 years 4 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
JPDC
2006
187views more  JPDC 2006»
14 years 9 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
IAT
2009
IEEE
15 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...