期刊文献+

DDRLD:支持局部扩散的定向扩散算法

DDRLD:directed diffusion routing supporting local detection for WSN
下载PDF
导出
摘要 在定向扩散协议中,中间节点以泛洪的机制向网络中的所有邻居节点转发接收到的兴趣报文,导致网络能源的浪费。为此,提出一种支持局部扩散的定向扩散算法DDRLD。它通过设置梯度扩散深度阈值,缩小了兴趣报文扩散的范围,降低了网络中传输的数据量;通过设置节点剩余能量门限值,增加了每个节点被选取为转发节点的概率,延长了节点的平均工作时间,改善了网络负载平衡。仿真结果表明DDRLD大大缩短了数据报文端到端的平均延迟,降低了网络功耗,增加了网络生存时间。 In the directed diffusion routing protocol, the intermediate nodes retransmit their received interest message to all of the neighbor nodes by flooding, which can bring about great power consumption to the network. This paper proposed a wireless sensor network data aggregation algorithm called directed diffusion routing supporting local detection(DDRLD). Firstly intro- duced the background of the research, then provided the analysis of DD, and pointed out the disadvantages of DD and to avoid the disadvantages, proposed DDRLD, in which by setting the maximum gradient diffusion depth and the minimum node remai- ning energy, the times for each node to retransmit interest message at the propagation stage were optimized. It focused on the simulation and the results analysis. The simulation results indicate that DDRLD greatly cuts down the average end-to-end delay of data message, reduces network power consumption and prolongs the network lifetime.
机构地区 西北工业大学
出处 《计算机应用研究》 CSCD 北大核心 2008年第5期1330-1332,共3页 Application Research of Computers
基金 国家自然科学基金资助项目(60273009) 教育部博士点基金资助项目(20050699037)
关键词 无线传感器网络 数据融合 定向扩散 扩散深度 剩余能量 wireless sensor network(WSN) data aggregation directed diffusion(DD) diffusion depth remaining energy
  • 相关文献

参考文献1

二级参考文献5

  • 1Intanagonwiwat C, Govindan R, Estrin D. Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Boston, 2000
  • 2Shakkottai Sanjay. Asymptotics of Search Strategies over a Sensor Network. IEEE Transactions on Automatic Control, 2005, 50(5):594-60
  • 3Rabbat M, Nowak R. Quantized Incremental Algorithms for Distributed Optimization. IEEE Journal on Selected Areas in Communications, 2005, 23(4) : 798-808
  • 4Levy E, Louchard G, Petit J. A Distributed Algorithm to Find Hamiltonian Cycles in G(n;p) Random Graphs. Workshop Combinatorial and Algorithmic Aspects of Networking, Banff, AB, Canada, 2004
  • 5Ye W, Heidemann J, Estrin D. An Energy-Efficient MAC Protocol for Wireless Sensor Networks. Proceedings of the IEEE Infocom, 2002, 1567-1576

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部