节点(物理)
计算机科学
过程(计算)
表(数据库)
无线传感器网络
不相交集
谈判
计算机网络
星团(航天器)
分布式计算
无线
数据挖掘
电信
工程类
数学
结构工程
组合数学
法学
政治学
操作系统
作者
Sachin Shriwastav,Debasish Ghose
标识
DOI:10.1016/j.adhoc.2018.04.008
摘要
This paper addresses the problem of restoration of connectivity in wireless sensor networks after multiple simultaneous node failures. Such failures of multiple nodes may split the network into several clusters. These clusters are unaware of their own size, surviving nodes and links as well as size and location of other survivor clusters. A distributed and autonomous approach of reconnecting disjoint clusters in a short time is proposed, in which each survivor cluster undergoes a self-discovery process where it compiles information of connected survivors and then sends a negotiator to participate in a round table negotiation and decision-making process. All such negotiators exchange information and decide upon reconnection paths between clusters through known dead node locations and then assign nodes to be deployed on those paths, using available nodes. The negotiators then return to their respective clusters, convey the decision and the reconnection process is carried out. Analytical results of the self-discovery process have been obtained and simulation results on a large network are presented to illustrate the process. It is shown through a detailed comparison with existing methods that the proposed approach achieves reconnection in significantly lower time and compares favorably with respect to other performance metrics as well.
科研通智能强力驱动
Strongly Powered by AbleSci AI