摘要
在抢险救灾等应急情况下,传感器网络的节点能量更为有限。为减少无用转发的能量消耗,利用无线信道的广播特性,根据广播子树删除思想,提出一种基于最短路由树、具有最少转发节点的组播路由树生成算法。对该算法进了证明和详细分析,并针对实际需要,给出使用范围更广泛的分布式实现方法。仿真分析说明,算法的分布式实现方法可减少ODMRP的转发节点数,大大降低数据发送次数,接收成员节点较多时尤为明显。最少转发节点的组播路由树的网络总开销最小,是延长网络生存时间的有效方法。
In disaster rescue and emergency situations, node energy in sensor network is especially limited. In order to reduce unnecessary forwarding consumption, this paper presents a MANET multicast routing tree algorithm with least forwarding nodes, which is based on shortest routing tree and sub-tree deletion. The algorithm is proved and analyzed in detail. Its practical distributed version is also presented. The simulation comparison shows that this distributed algorithm reduces the forwarding transmission in improved ODMRP, especially there are much more receivers in MANET. Minimum forwarding routing tree has the minimum network overhead. It is an effective way to extend the network lifetime.
作者
印敏
沈晔
蒋磊
冯径
Yin Min Shen Ye Jiang Lei Feng Jing(College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101, China)
出处
《电子测量与仪器学报》
CSCD
北大核心
2017年第1期76-82,共7页
Journal of Electronic Measurement and Instrumentation
基金
国家自然科学基金(61371119)
"快速响应卫星动态组网与数据传输控制技术研究"项目
江苏省自然科学基金(BK20130070)
"应对多种节点行为状态的ad hoc网络信任模型研究"项目资助
关键词
传感器网络
组播路由树
最少转发
节省能量
应急
sensor network
muhieast routing tree
minimum forwarding
energy limited
emergency
