Abstract
In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone (VB) in wireless sensor/ad hoc networks can help achieve efficient broadcasting. A well-known and well-researched approach for constructing virtual backbone is solving the Connected Dominating Set (CDS) problem. Furthermore, minimizing the size of the CDS is a significant research issue. We propose a new parallel scatter search algorithm with elite and featured cores for constructing a wireless sensor/ad hoc network virtual backbones based on finding minimum connected dominating sets of wireless nodes. Also, we addressed the problem of VB node/nodes failure by either deploying a previously computed VBs provided by the main pSSEF algorithm that does not contain the failed node/nodes, or by using our proposed FT-pSSEF algorithm repairing the broken VBs. Finally, as nodes in a VB incur extra load of communication and computation, this leads to faster power consumption compared to other nodes in the network. Consequently, we propose the virtual backbone scheduling algorithm SC-pSSEF which aims to find multiple VBs using the VBs provided by the pSSEF algorithm and switch between them periodically to prolong the network life time.
Highlights
Wireless sensor networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities
To recover from failures that may occur in the wireless networks, we propose a new virtual backbone fault-tolerant algorithm based on scatter search called the FT-pSSEF method
Minimum approximate domination number (Min) which is the number of nodes in the best connected dominating solution found in all independent runs
Summary
Wireless sensor networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. We investigate the problem of identifying the VBs of WSNs using graph domination and scatter search in parallel environment. Method is proposed for solving the minimum connected dominating set problem in wireless networks. To recover from (tolerate) failures that may occur in the wireless networks, we propose a new virtual backbone fault-tolerant algorithm based on scatter search called the FT-pSSEF method. It picks the one that does not contain the failed node/nodes, else the FT-pSSEF method starts to look for a new set of VBs that excludes failed node/nodes Another version of the algorithm is designed to increase the network life time by VB scheduling called the SC-pSSEF method.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
