eprintid: 3821
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/38/21
datestamp: 2023-11-09 15:52:05
lastmod: 2023-11-09 15:52:05
status_changed: 2023-11-09 15:47:41
type: conference_item
metadata_visibility: show
creators_name: Haider, N.
creators_name: Imran, M.
creators_name: Saad, N.M.
title: CARE: Coverage-aware connectivity restoration algorithm for mobile actor/robot networks
ispublished: pub
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
note: 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
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.
date: 2013
publisher: IEEE Computer Society
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84902349680&doi=10.1109%2fAPCC.2013.6765985&partnerID=40&md5=8c66a29c3fdddf4672070bf7a2c48e6a
id_number: 10.1109/APCC.2013.6765985
full_text_status: none
publication: 2013 19th Asia-Pacific Conference on Communications, APCC 2013
place_of_pub: Denpasar
pagerange: 439-444
refereed: TRUE
isbn: 9781467360500
citation:   Haider, N. and Imran, M. and Saad, N.M.  (2013) CARE: Coverage-aware connectivity restoration algorithm for mobile actor/robot networks.  In: UNSPECIFIED.