Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Better Practical Algorithm for Distributed Graph Coloring
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Secure code distribution in dynamically programmable wireless sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Achieving Real-Time Target Tracking UsingWireless Sensor Networks
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A stream-oriented power management protocol for low duty cycle sensor network applications
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Gradient clock synchronization in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
ICMLC '10 Proceedings of the 2010 Second International Conference on Machine Learning and Computing
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
MANNA: a management architecture for wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.00 |
We consider providing presence service for duty-cycled wireless sensor networks through a multihop approach. The presence service is to ensure automatic network monitoring by which each node would know whether the sink node is reachable or not. Towards providing such presence service, we tackle three problems: 1) efficient neighbor discovery due to not-always-awake nature of duty-cycling and the mobile environment, 2) light presence message passing from the sink node to all reachable nodes given broadcasting is expensive and difficult in an embedded duty-cycling network, and 3) automatic network monitoring if there is node failure and network partition. In our protocol, in order to save power consumption, an online node which is reachable from the sink node only book-keeps the broadcast schedule of its parent in a breadth-first-search spanning tree in order to trace the online status all along. The offline node which is not reachable from the sink node stays awake periodically based on quorum-based wakeup scheduling, and probes the beacons which may come from online nodes. The presence protocol can automatically detect link failure or network partition, and it can also automatically recover online status for each sensor node if there is a path to the sink node, which is significant for applications that are sensitive to end-to-end latency constraints. The presence protocol proposed is implemented through a layered approach so that it is independent from any specific MAC and routing protocols. We make extensive simulations in order to validate the energy efficiency and reliability of our design.