期刊文献+

一种能量延时优化的无线传感器网络信息分发策略

Information Dissemination Strategy for Energy and Delay Optimization in Wireless Sensor Networks
下载PDF
导出
摘要 研究无线传感网络中的信息分发问题,结合复杂动态网络信息传播模型理论,提出一种能量和延时优化的信息分发策略(energy and delay opti mizedinformation dissemination strategy,EDOIDS)。该算法无需节点定位信息和网络拓扑信息,立足信息传播逐步向外扩展的动力学特性,利用接收节点的接收端信号功率强度指示(RSSI)估计接收节点与发送节点的相对距离,建立节点转发优先级,确定MAC层转发时延。该算法在最大化覆盖新区域的同时能够有效降低碰撞,缩短整个系统的传播时延,同时,通过MAC层的监听机制以及复杂网络谣言传播理论,控制节点的转发权,抑制冗余,降低能耗。 This paper addressed the information dissemination issue over wireless sensor networks.Based on the information propagation model of complex dynamic networks,an energy and delay optimized information dissemination strate-gy(EDOIDS)was proposed for wireless sensor networks,which didn't need the location information and topology information.By using the dynamics characteristic that the process of propagation grows outside with time from the source of information,and the received signals strength indication(RSSI),the algorithm evaluates the relative distances between senders and receivers,and decides forwarding priorities of nodes and time delay of MAC.The algorithm ensures the maximum coverage of new area,avoids effectively the collision of nodes and optimizes the delay of the whole network.Meanwhile,a joint of the listening mechanism of MAC with rumor spreading idea is used for controlling the forwarding priorities of nodes,restraining the redundant flooding packets and minimizing the energy consumption.
出处 《计算机科学》 CSCD 北大核心 2010年第10期123-126,155,共5页 Computer Science
基金 国家教育部新世纪优秀人才支持计划(NCET-06-0510) 国家自然科学基金项目(60874091) 江苏省‘六大人才高峰’高层次人才项目(SJ209006) 南京邮电大学引进人才项目(NY209021)资助
关键词 无线传感器网络 复杂动态网络 信息分发 洪泛算法 Wireless sensor networks Complex dynamic networks Information dissemination Flooding algorithm
  • 相关文献

参考文献17

  • 1YiY,GerlaM,KwonTJ. Efficient flooding in adhoc networks: A comparative performance study [C]// IEEE International Conference on Communications (/CC'03 ). Ottawa, Canada, 2003:1059-1063.
  • 2Akkaya K, Younis M. A survey on routing protocols for wireless sensor networks [J]. Ad Hoc Networks, 2005,3 (3) : 325-349.
  • 3Ni S Y, Tseng Y C, Chen Y S, et al. The broadcast storm problem in a mobile ad hoe network[C] // Proceedings of the 5th annual ACM/IEEE International Conference on Mobile Computing and Networking. 1999:151-162.
  • 4Powell O, Leone P,Rolim J. Energy optimal data propagation in wireless sensor networks [J]. Journal of Parallel and Distributed Computing, 2007,67 (3) :302-317.
  • 5Sabbineni H, Chakrabarty K. Location-aided flooding: An energy-efficient data dissemination protocol for wireless sensor networks [J]. IEEE Transactions on Computers, 2005,54(1) : 36-46.
  • 6李方敏,刘新华,旷海兰.无线传感器网络中一种高能效低延时的泛洪算法研究[J].通信学报,2007,28(8):46-53. 被引量:15
  • 7Ogier R, Templin F, Lewis M. RFC 3684. Topology dissemination based on reverse-path forwarding(tbrpf) [S]. IETF,2004.
  • 8Younis M, Youssef M, Arisha K. Energy-aware routing in cluster-based sensor networks[C]// Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems ( MASCOTS' 02 ) Fort Worth,Texas USA,2002:129-136.
  • 9Ghiassi-Farrokhfal Y, Pakravan M R. Cross-layer flooding for sensor networks without location information [C]// IEEE International Conference on Mobile Adhoc and Sensor Systems Conference. Washington, DC. USA, 2005 : 110-114.
  • 10Wang X,Yin J, Zhang Q, et al. A cross-layer approach for efficient flooding in wireless sensor networks [C] // 2005 IEEE Wireless Communications and Networking Conference. New Or leans, LA USA, 2005 : 1812-1817.

二级参考文献34

  • 1崔莉,鞠海玲,苗勇,李天璞,刘巍,赵泽.无线传感器网络研究进展[J].计算机研究与发展,2005,42(1):163-174. 被引量:730
  • 2Demers A, Greene D, Houser C, Irish W, Larson J. Epidemic algorithms for replicated database maintenance. In ACM Symp. Principles of Distributed Computing, Vancouver, Canada, Aug. 1987, pp.1- 12.
  • 3Kempe D, Kleinberg J, Demers A. Spatial gossip and resource location protocols. In Proc. ACM Symp. Theory of Computing, Heraklion, Crete, Greece, Jul. 2001, pp.163-172.
  • 4Kempe D, Kleinberg J, Demers A. Spatial gossip and resource location protocols. Journal of the ACM, Nov. 2004, 51(6): 934-967.
  • 5Deb S, Mdard M, Chout C. Algebraic gossip: A network coding approach to optimal multiple rumor mongering. IEEE Trans. Information Theory, Jun. 2006, 52(6): 2486- 2507.
  • 6Karp R, Schindelhauer C, Shenker S, Vocking B. Randomized rumor spreading. In Proc. Foundations of Computer Science, Redondo Beach, CA, Nov. 2000, pp.565-574.
  • 7Boyd S, Ghosh A, Prabhakar B, Shah D. Gossip algorithms: Design, analysis and applications. In Proc. IEEE INFOCOM, Miami, USA, 2005, pp.1653- 1664.
  • 8Dimakis AG, Sarwate AD, Wainwright MJ. Geographic gossip: Efficient aggregation for sensor networks. In Proc. Information Processing on Sensor Networks, Nashville, Tennessee, USA, 2006, pp.69- 76.
  • 9Kempe D, Dobra A, Gehrke J. Gossip-based computation of aggregate information. In Proc. the 44th Annu. IEEE Symp. Foundations of Computer Science, Cambridge, MA, USA, 2003, pp.482-491.
  • 10Fernandess C, Malkhi D. On collaborative content distribution using multi-message gossip. In Proc. Parallel and Distributed Processing Syrup., Greece, Apr. 2006, p.9.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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