2018
DOI: 10.3390/s18010153
|View full text |Cite
|
Sign up to set email alerts
|

An Autonomous Connectivity Restoration Algorithm Based on Finite State Machine for 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 becom… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(17 citation statements)
references
References 31 publications
0
17
0
Order By: Relevance
“…The first subcategory methods restore connectivity by moving surviving node to the location of the damaged cut-vertex node. The connectivity restoration methods proposed in [10]- [13] have similar idea, which can be summarized as finding out the cut-vertex nodes in the network first, then if the cut-vertex node is detected to be unavailable, restoring connectivity by cascaded movement of the related nodes. However, the cascaded movement causes lots of communication overhead because every moving node broadcasts a message to its neighbor before relocation.…”
Section: ) Repositioning Surviving Nodesmentioning
confidence: 99%
“…The first subcategory methods restore connectivity by moving surviving node to the location of the damaged cut-vertex node. The connectivity restoration methods proposed in [10]- [13] have similar idea, which can be summarized as finding out the cut-vertex nodes in the network first, then if the cut-vertex node is detected to be unavailable, restoring connectivity by cascaded movement of the related nodes. However, the cascaded movement causes lots of communication overhead because every moving node broadcasts a message to its neighbor before relocation.…”
Section: ) Repositioning Surviving Nodesmentioning
confidence: 99%
“…They include the innovative multicast repair (M-REP) mechanism [ 36 ] and its enhanced version EM-REP [ 38 ]. The M-REP FRR mechanism uses the multicast [ 39 , 40 , 41 ] routing protocol—protocol independent multicast—dense mode (PIM DM) to flood traffic around failed element and create alternative FRR path. Enhanced version EM-REP adds support for the repair of multiple failures and link-state routing protocol such as OSPF or IS-IS.…”
Section: Related Workmentioning
confidence: 99%
“…One of the researches in scattered failures is the distributed autonomous connectivity restoration method based on finite state machine (DCRMF) that employs a regional restoration [24]. Finite state machine identifies whether a node is a critical or noncritical.…”
Section: Related Workmentioning
confidence: 99%