文献类型：期刊文献

中文题名：Distributed Connectivity Restoration Strategy for Movable Sensor Networks

英文题名：Distributed Connectivity Restoration Strategy for Movable Sensor Networks

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

第一作者：Ma Guizhen;马桂真

通讯作者：Ma, GZ[1]

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

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

通讯机构：[1]corresponding author), Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100088, Peoples R China.

年份：2014

卷号：11

期号：A01

起止页码：156-163

中文期刊名：中国通信：英文版

外文期刊名：CHINA COMMUNICATIONS

收录：CSTPCD;;Scopus(收录号：2-s2.0-84922577636);WOS:【SCI-EXPANDED(收录号:WOS:000347133100022)】；CSCD:【CSCD2013_2014】；

基金：This work was partly supported by Funds for Creative Research Groups of China (61121061), NSFC (61272515, 61372108), Ph.D Programs Foundation of Ministry of Education of China (No. 20110005110011), Fundamental Research Funds for the Central Universities (No. 2014RC1102), and Beijing Higher Education Young Elite Teacher Project (YETP0474).

语种：英文

中文关键词：移动传感器网络;恢复策略;分布式;连接;节点故障;无线传感器网络;传感器节点;应用程序

外文关键词：movable sensor networks; connectivity recovery; critical node

摘要：Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.