无线传感器网络中的鲁棒性分段组播路由算法  

A Robust Segmented Multicast Routing Algorithm in Wireless Sensor Network

作　　者：陈熙[1] 洪佩琳[1] 卢昊[1] 

机构地区：[1]中国科学技术大学电子工程与信息科学系信息网络实验室,合肥230027

出　　处：《小型微型计算机系统》2015年第3期478-482,共5页Journal of Chinese Computer Systems

基　　金：国家重大专项(2011ZX005-006)资助;广东省教育部产学研结合项目(2011B090400250)资助;互联网基础技术开放实验室(DNSLAB)开放课题(k201211048)资助

摘　　要：在无线传感器网络(Wireless Sensor Network,WSN)组播路由算法的各类研究中,无状态组播可扩展性差,而分级及分支组播又存在单点失效问题.为权衡可扩展性及鲁棒性,提出一种鲁棒性分段组播路由算法(Robust Segmented Multicast Routing Algorithm,RSMR),将组播树分割成多个组播子树,并将这些组播子树的拓扑信息分布式地存储在一部分分支节点上,从而在控制分组头长度的同时减少了整个组播结构单点失效的概率.另外,还提出一种组播树存储节点的更新算法,在原存储节点剩余能量过小时,从附近选取一个新的存储节点,从而进一步提升整个组播结构的鲁棒性.仿真结果表明,RSMR能获得可扩展性及鲁棒性综合性能的提升,且在密集部署的大规模WSN中提升尤为显著.Among various studies on multicast routing algorithms in wireless sensor networks （ WSN）, stateless multicast works with poor scalability, while hierarchical and branch multicast has a problem that aggregation nodes may easily become invalid. This paper proposes a robust segmented multicast routing algorithm （RSMR） ,which divides a multicast tree into multiple multicast subtrees, and separately stores the topology information of those subtrees in a part of branch nodes, so that the length of packet header can be con- trolled while the failure probabilities of aggregation nodes in multicast structure can be reduced. In addition, the paper proposes an al- gorithm to update storage nodes, which selects new storage nodes near original ones when the latters find their residual energy too low, thus further enhancing the robustness of the entire multicast structure. Simulation results show that, RSMR can obtain an improvement in terms of scalability and robustness ,and the improvement is particularly significant in large-scale densely deployed WSNs.

关 键 词：WSN 组播 分段 鲁棒 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]