Sciweavers

2705 search results - page 333 / 541
» Splitting the sensor node
Sort
View
EURONGI
2006
Springer
15 years 8 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer
138
Voted
MOBIDE
2010
ACM
15 years 4 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
140
Voted
JCST
2008
144views more  JCST 2008»
15 years 4 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
JCM
2006
144views more  JCM 2006»
15 years 4 months ago
Using Micro-Genetic Algorithms to Improve Localization in Wireless Sensor Networks
Wireless sensor networks are widely adopted in many location-sensitive applications including disaster management, environmental monitoring, military applications where the precise...
Vincent Tam, King-Yip Cheng, King-Shan Lui
INFOCOM
2010
IEEE
15 years 3 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran