An Autonomous Connectivity Restoration Algorithm Based On Finite State Machine For Wireless Sensor-Actor Networks

Keywords

Connected dominating set; Network connectivity restoration algorithm; Relocation; Wireless sensor-actor networks

Abstract

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms.

Publication Date

1-8-2018

Publication Title

Sensors (Switzerland)

Volume

18

Issue

1

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.3390/s18010153

Socpus ID

85042789402 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85042789402

This document is currently not available here.

Share

COinS