Sciweavers

114 search results - page 6 / 23
» Network coverage using low duty-cycled sensors: random
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
INFOCOM
2007
IEEE
14 years 1 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
GLOBECOM
2006
IEEE
14 years 1 months ago
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
Yuh-Ren Tsai
ADHOC
2010
292views more  ADHOC 2010»
13 years 7 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
ICESS
2007
Springer
14 years 1 months ago
Sleep Nodes Scheduling in Cluster-Based Heterogeneous Sensor Networks Using AHP
Abstract. Wireless sensor networks (WSNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...