Sciweavers

123 search results - page 5 / 25
» Expected k-coverage in wireless sensor networks
Sort
View
MASS
2010
162views Communications» more  MASS 2010»
14 years 7 months ago
A metric for routing in delay-sensitive wireless sensor networks
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...
Zhen Jiang, Jie Wu, Risa Ito
86
Voted
ICC
2007
IEEE
245views Communications» more  ICC 2007»
15 years 3 months ago
A Node Recovery Scheme for Data Dissemination in Wireless Sensor Networks
—In wireless sensor networks, sensor nodes are expected to gather specific information about the environment and send it to the user. The data dissemination usually involves many...
Faycal Bouhafs, Madjid Merabti, Hala M. Mokhtar
WIOPT
2006
IEEE
15 years 3 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
MSN
2005
Springer
179views Sensor Networks» more  MSN 2005»
15 years 3 months ago
Coverage Analysis for Wireless Sensor Networks
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
Ming Liu, Jiannong Cao, Wei Lou, Lijun Chen 0006, ...
VTC
2006
IEEE
223views Communications» more  VTC 2006»
15 years 3 months ago
A Range-Free Localization Algorithm for Wireless Sensor Networks
Distributed localization in wireless sensor networks has attracted significant interest in recent years. In this paper, we propose two improvements towards the DV-Hop algorithm: th...
Qiqian Huang, S. Selvakennedy