CARE: Coverage-aware connectivity restoration algorithm for mobile actor/robot networks

Haider, N. and Imran, M. and Saad, N.M. (2013) CARE: Coverage-aware connectivity restoration algorithm for mobile actor/robot networks. In: UNSPECIFIED.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

Maintaining coverage-aware connectivity is extremely crucial for successful operation of mobile actor/robot networks as mobile nodes have to collaborate on the data received from sensors and perform coordinated action. However, failure of a critical node (i.e., cut vertex) may introduce a coverage hole besides partitioning the network into disjoint segments, and thus disrupts the operation. Most of the published schemes are reactive, require additional placement of nodes and only concentrate on restoring connectivity. Mission-critical time-sensitive applications crave an instantaneous self-healing recovery with minimum overhead. This paper presents a localized and hybrid coverage-aware connectivity restoration (CARE) algorithm which opts to rejuvenate lost connected coverage while minimizing recovery overhead. The design philosophy of CARE is based on 'caretaker' theory. CARE proactively segregates critical/non-critical nodes, designates appropriate caretaker to each critical node in order to minimize recovery delay and avoid overreacting against non-critical node failure. CARE prefers to nominate a highly connected non-critical neighbor with highest overlapped coverage to minimize the repercussions and scope of recovery. The pre-designated guardian detects the failure and instigates a recovery that may involve controlled and coordinated multi-node relocation. Simulation results confirm the effectiveness and efficiency of CARE compared to contemporary schemes found in the literature. © 2013 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: cited By 6; Conference of 2013 19th Asia-Pacific Conference on Communications, APCC 2013 ; Conference Date: 29 August 2013 Through 31 August 2013; Conference Code:105681
Uncontrolled Keywords: Algorithms; Fault tolerance; Recovery; Restoration, Connectivity restorations; Coordinated actions; Design philosophy; Disjoint segments; Effectiveness and efficiencies; Recovery overhead; Self-healing recoveries; Time sensitive applications, Computer system recovery
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 09 Nov 2023 15:52
Last Modified: 09 Nov 2023 15:52
URI: https://khub.utp.edu.my/scholars/id/eprint/3821

Actions (login required)

View Item
View Item