文献类型：期刊文献

英文题名：Obstacle Aware Connectivity Restoration for Disjoint Wireless Sensor Networks Using a Mix of Stationary and Mobile Nodes

作者：Ma, Guizhen[1,2];Yang, Yang[1];Qiu, Xuesong[1];Gao, Zhipeng[1]

第一作者：Ma, Guizhen;马桂真

通讯作者：Ma, GZ[1];Ma, GZ[2]

机构：[1]Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China;[2]Beijing Union Univ, Tourism Coll, Beijing 100106, Peoples R China

第一机构：Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China

通讯机构：[1]corresponding author), Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China;[2]corresponding author), Beijing Union Univ, Tourism Coll, Beijing 100106, Peoples R China.|[1141732]北京联合大学旅游学院;[11417]北京联合大学;

年份：2016

卷号：2016

外文期刊名：INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS

收录：;EI(收录号：20162402481979);Scopus(收录号：2-s2.0-84973163623);WOS:【SCI-EXPANDED(收录号:WOS:000376931000001)】；

基金：This work was partly supported by NSFC (61401033, 61372108, and 61272515) and Beijing Higher Education Young Elite Teacher Project (YETP0474).

语种：英文

外文关键词：Restoration

摘要：In many applications, wireless sensor networks (WSNs) are deployed in inhospitable environments and therefore the nodes are at increased risk of failure. Large scale damage may partition a network into disjoint segments, which has very negative effect on the application. Mobile nodes have been exploited to act as mobile data collectors (MDCs) among segments to restore the connectivity of WSNs in the previous works. However, almost all of the works assumed that mobile nodes travel via a direct path, which may not be the case in real-world applications. In order to improve the applicability of the recovery strategy, obstacles should be taken into account. In this paper, we present an obstacle aware connectivity restoration strategy (OACRS) to fit these requirements. Our algorithm is designed for the scenarios that the number of available relays is less than the number of relays required to construct stable links and more than the number of segments. At first we construct and optimize the obstacle-avoiding minimum spanning tree of the segments and then determine the relays which keep static and the ones which act as MDCs. Finally we optimize the tour path of MDCs. The effectiveness of the proposed algorithm is validated through simulation experiments.