Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks

被引:182
作者
Abbasi, Ameer Ahmed [1 ]
Younis, Mohamed [2 ]
Akkaya, Kemal [3 ]
机构
[1] King Fahd Univ Petr & Minerals, Dept Comp Engn, Dhahran 31261, Saudi Arabia
[2] Univ Maryland Baltimore Cty, Dept Comp Sci & Elect Engn, Baltimore, MD 21250 USA
[3] So Illinois Univ, Dept Comp Sci, Carbondale, IL 62901 USA
基金
美国国家科学基金会;
关键词
Connectivity restoration; controlled node mobility; fault tolerance; wireless sensor and actor networks;
D O I
10.1109/TPDS.2008.246
中图分类号
TP301 [理论、方法];
学科分类号
080201 [机械制造及其自动化];
摘要
Recent years have witnessed a growing interest in applications of wireless sensor and actor networks (WSANs). In these applications, a set of mobile actor nodes are deployed in addition to sensors in order to collect sensors' data and perform specific tasks in response to detected events/objects. In most scenarios, actors have to respond collectively, which requires interactor coordination. Therefore, maintaining a connected interactor network is critical to the effectiveness of WSANs. However, WSANs often operate unattended in harsh environments where actors can easily fail or get damaged. An actor failure may lead to partitioning the interactor network and thus hinder the fulfillment of the application requirements. In this paper, we present DARA, a Distributed Actor Recovery Algorithm, which opts to efficiently restore the connectivity of the interactor network that has been affected by the failure of an actor. Two variants of the algorithm are developed to address 1- and 2-connectivity requirements. The idea is to identify the least set of actors that should be repositioned in order to reestablish a particular level of connectivity. DARA strives to localize the scope of the recovery process and minimize the movement overhead imposed on the involved actors. The effectiveness of DARA is validated through simulation experiments.
引用
收藏
页码:1366 / 1379
页数:14
相关论文
共 22 条
[1]
Sink repositioning for enhanced performance in wireless sensor networks [J].
Akkaya, K ;
Younis, M ;
Bangad, M .
COMPUTER NETWORKS, 2005, 49 (04) :512-534
[2]
AKKAYA K, 2007, P 26 IEEE INT PERF C
[3]
AKKAYA K, 2008, P IEEE WIR COMM NETW
[4]
Akkaya K, 2006, P IEEE 64 VEH TECHN
[5]
Akyildiz I. F., 2004, Ad Hoc Networks, V2, P351, DOI DOI 10.1016/J.ADH0C.2004.04.003
[6]
[Anonymous], 2005, P 1 IEEE WORKSH INF
[7]
Movement control algorithms for realization of fault-toleront ad hoc robot networks [J].
Basu, P ;
Redi, J .
IEEE NETWORK, 2004, 18 (04) :36-44
[8]
Das S., 2007, P 1 IFIP INT C WIR S
[9]
Network boundary recognition via graph-theory [J].
Destino, Giuseppe ;
de Abreu, Giuseppe Thadeu Freitas .
WPNC'08: 5TH WORKSHOP ON POSITIONING, NAVIGATION AND COMMUNICATION 2008, WORKSHOP PROCEEDINGS, 2008, 5 :271-275
[10]
Diestel R., 2001, GRAPH THEORY