Sciweavers

123 search results - page 18 / 25
» Expected k-coverage in wireless sensor networks
Sort
View
MOBIHOC
2005
ACM
15 years 9 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
APSEC
2004
IEEE
15 years 1 months ago
Dynamic Enclose Cell Routing in Mobile Sensor Networks
Many routing protocols for wireless sensor network have been proposed, with the purpose of achieving efficient routing. However, when the mobility increases rapidly and the networ...
Yuan Yang, Dong-hyun Lee, Myong-Soon Park, Hoh Pet...
ICDCS
2006
IEEE
15 years 3 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
COMPSYSTECH
2009
14 years 7 months ago
Architectural models for realization of web-based personal health systems
: Recent advances in Information and Communication Technologies (ICT) and more specifically in wireless networks and mobile computing have driven new directions in the development ...
Mitko Shopov, Grisha Spasov, Galidia Petrova
TSP
2008
147views more  TSP 2008»
14 years 9 months ago
Decentralized Activation in Dense Sensor Networks via Global Games
Decentralized activation in wireless sensor networks is investigated for energy-efficient monitoring using the theory of global games. Given a large number of sensors which can ope...
V. Krishnamurthy