Open AccessSelf‐healing and energy‐efficient restoration in machine‐to‐machine networks
Author(s) -
Zeng Yali,
Chen Zhide,
Yang Xu
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0533
Subject(s) - computer science , network topology , energy consumption , node (physics) , scheme (mathematics) , distributed computing , focus (optics) , path (computing) , shortest path problem , energy (signal processing) , computer network , theoretical computer science , engineering , mathematics , mathematical analysis , graph , statistics , physics , structural engineering , optics , electrical engineering
Machine‐to‐machine (M2M) networks often serve mission‐critical applications in our daily life. Maintaining nodes connectivity is crucial for M2M networks to accomplish their tasks effectively. The fault of a critical node may break the network into several blocks, and thus hinders the operation. Rapid recovery is highly required in such a case. In this study, the authors focus on designing an effective algorithm for restoring damaged network topologies by moving available nodes. Unlike contemporary algorithms that only consider network connectivity or coverage, the proposed algorithm not only takes into account network connectivity, coverage and energy consumption, but also concerns about the shortest path between any pair of nodes. Simulation results demonstrate that the proposed algorithm outperforms the existing scheme in terms of network lifetime.