Abstract
A Wireless Sensor Network (WSN) is connected if a communication path exists among each pair of sensor nodes (motes). Maintaining reliable connectivity in WSNs is a complicated task, since any failure in the nodes can cause the data transmission paths to break. In a k-connected WSN, the connectivity survives after failure in any k-1 nodes; hence, preserving the k-connectivity ensures that the WSN can permit k-1 node failures without wasting the connectivity. Higher k values will increase the reliability of a WSN against node failures. We propose a simple and efficient algorithm (PINC) to accomplish movement-based k-connectivity restoration that divides the nodes into the critical, which are the nodes whose failure reduces k, and non-critical groups. The PINC algorithm pickups and moves the non-critical nodes when a critical node stops working. This algorithm moves a non-critical node with minimum movement cost to the position of the failed mote. The measurements obtained from the testbed of real IRIS motes and Kobuki robots, along with extensive simulations, revealed that the PINC restores the k-connectivity by generating optimum movements faster than its competitors.
Highlights
Wireless Sensor Networks (WSNs) are incorporate sensing devices that gather data from the environment, process the collected data and deliver them to interested parties.WSNs are broadly utilized in many areas, including agriculture, industrial manufacturing and automation, disaster control, military, health care, and structural monitoring [1,2,3,4].Generally, WSNs have no strong and confident communication infrastructure and all nodes work as an endpoint for data collection and as an intermediate carrier on a communication path to transmit the packets between other nodes
We study the movement-based connectivity restoration problem, in which mobile nodes move to necessary positions to restore the connectivity status of a WSN
The following theorem proves that the propose a simple and efficient algorithm (PINC) can restore the k-connectivity if at least one non-critical node exists in the network
Summary
Wireless Sensor Networks (WSNs) are incorporate sensing devices (motes) that gather data from the environment, process the collected data and deliver them to interested parties. In an arbitrary connected network, if a sensor node stops running for any reason (device crash, battery draining, etc.), the transmission routes between other existing motes can be eliminated. In WSNs, we have one or more special sink nodes that gather the collected data and instructions between the motes and the interested parties. We study the movement-based connectivity restoration problem, in which mobile nodes move to necessary positions to restore the connectivity status of a WSN. We propose a pickup non-critical node based k-connectivity restoration algorithm (PINC) that identifies the critical nodes and generates minimum-cost movements for k-connectivity restoration when a critical node stops working.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
