On scalable and efficient distributed failure detectors
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Cluster-Based Failure Detection Service for Large-Scale Ad Hoc Wireless Network Applications
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Context-Aware, Policy-Based Framework for the Management of MANETs
POLICY '06 Proceedings of the Seventh IEEE International Workshop on Policies for Distributed Systems and Networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Decentralized Local Failure Detection in Dynamic Distributed Systems
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
A Failure Detection Service for Large-Scale Dependable Wireless Ad-Hoc and Sensor Networks
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
A scalable PBNM framework for MANET management
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Hi-index | 0.00 |
Node failures may be frequent in MANETs, but there can be many different causes for those failures. Nodes may lose power, crash, or simply move out of range of other nodes in the network. Identifying the root cause is complicated by a lack of fixed monitoring and analysis infrastructure. Past research has focused on monitoring using either ping, heartbeat, or gossip-based approaches, which can incur significant network wide overhead. This paper proposes a novel k-hop cluster based data dissemination scheme that can piggyback on routing messages for more efficient detection of failures including node disconnection. In this scheme, nodes forward their neighbour-hood observations to a per-cluster failure detector based on the observed spanning tree. Simulations show that detecting disconnected nodes using a cross-layer implementation of the data dissemination scheme is more efficient while an application layer implementation is faster. This effect is more pronounced in sparse networks.