无线传感器网络局部瓶颈节点的分布式检测算法  

Distributed Detection Algorithm for Local-Bottleneck Nodes of Wireless Sensor Network

作　　者：李磊[1] 李凤荣[1] 黄河清[1] 

机构地区：[1]中国科学院上海微系统与信息技术研究所,上海200050

出　　处：《西南交通大学学报》2011年第3期475-480,共6页Journal of Southwest Jiaotong University

基　　金：国家科技重大专项项目(2009ZX03006-003);上海市科委创新计划资助项目(10511502500)

摘　　要：为减轻网络的负担,提出了"局部瓶颈节点"的概念及其分布式检测算法.该类节点具有与瓶颈节点类似的影响,但检测算法更简单可行.特别地,对于布设在带状区域的网络,证明了当布设区域宽度不超过槡3/2倍节点通信半径时,即可根据一跳邻居信息判断一个节点是否是瓶颈节点.结果表明,邻居节点数平均为10时,采用提出的分布式算法,被测节点成为局部瓶颈节点的概率仅为准瓶颈节点的1/4,从而提高了判断的准确性,降低了网络维护成本.To reduce network burden,the concept of ＂local-bottleneck node＂ was proposed,and a distributed detection algorithm for local-bottleneck nodes was given.Local-bottleneck nodes have a similar effect on network performance with bottleneck nodes,but their detection is more practicable.Especially,to a network deployed in a belt-type area,it is proved that as long as the width of the area does not exceed 3/2 times of communication radius,one-hop topology information is enough to judge whether a node is a bottleneck node.The experimental result shows that with the distributed detection algorithm,the probability for an arbitrary node to become a local-bottleneck node is only 1/4 of that for a quasi-bottleneck node when the average number of neighbor nodes is 10,which improves the detecting accuracy and reduces the cost of network maintenance.

关 键 词：无线传感网 带状网 瓶颈节点 

分 类 号：TN92[电子电信—通信与信息系统]