期刊文献+

一种基于信息熵的WSN节点拥塞避免机制

WSN Node-level Congestion Avoidance Mechanism Based on Entropy Theory
下载PDF
导出
摘要 无线传感器网络(WSN)中多对一通信产生的网络拥塞是一个亟待解决的问题。针对WSN节点生命期有限的情况,引入了节点相对信息熵的概念,提出基于节点相对信息熵的拥塞避免机制:节点首先计算其联合信息熵为上游节点分配数据窗;然后上游节点根据收到的数据窗的大小来决定向下游节点发送数据包的大小。仿真分析表明,该算法有效地避免了网络数据包的丢失,减少了网络传输延迟,且具有良好的能量有效性。 Network congestion produced by many to one communication is a crusial problem in WSN. In allusion to the limited lifetime for WSN nodes, the relative information entropy of the node is introduced, and a node-level congestion avoidance mechanism is proposed. The relative information entropy of nodes is calculated to distribute data window for upstream nodes, and then the upstream nodes send the data packets according to the size of the received data window. The simulation analyses show that the proposed algorithm can effectively avoid the loss of network data packets, reduce the delay of network transmission and also has the excellent energy effectiveness.
作者 褚红玉 陈光
出处 《现代电子技术》 2011年第10期108-111,共4页 Modern Electronics Technique
关键词 无线传感器网络 节点相对信息熵 拥塞避免 数据窗 wireless sensor network node relative information entropy congestion avoidance data window
  • 相关文献

参考文献8

  • 1TILAK S, ABU-GHAZALEH N B, HEINZELMAN W. Infrastructure tradeoff for sensor networks [C]// Proceedings of the 1st ACM Workshop on Wireless Sensor Networks and Application. New York: ACM, 2002: 49-57.
  • 2WANG C G, SOHRABY K, I.I B. A survey of transport protocols for wireless sensor networks [J]. IEEE Networks, 2006, 20 (3): 34-40.
  • 3WAN C Y, EISENMAN S B, CAMPBELL A T. CODA: congestion detection and voidance in sensor networks [C]// Proceedings of 2003 ACM SenSys. Los Angeles, California, USA: ACM, 2003:266-279.
  • 4SANKAASUBRAMANIANM Y, AKAN O, AKYILDIZ I F. Event tosink reliable transport in wireless sensor networks [J]. IEEE/ACM Trans. on Networking, 2005, 13 (5) : 1003-1016.
  • 5HULL B, JAMIESON K, BALAKRISHNAN H. Mitigating congestion in wireless sensor networks [C]// Proc. of ACM SenSys. New York: ACM, 2004, 1:134-147.
  • 6孙国栋,廖明宏,邱硕.无线传感器网络中一种避免节点拥塞的算法[J].计算机研究与发展,2009,46(6):934-939. 被引量:6
  • 7傅祖芸.信息论:基础理论与应用[M].北京:电子工业出版社,2010.
  • 8PATTEM S, KRISHNAMACHARI B, GOVINDAN R. The impact of spatial correlation on routing with compression in wireless sensor networks [C]// Proc. of the 3rd International Syrup. on Information Processing in Sensor Networks. Berkeley, California: ACM, 2004: 28-35.

二级参考文献16

  • 1Akyildiz IF, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks: A survey [J]. Computer Networks, 2002, 38(4) : 393-422.
  • 2Tilak S, Abu-Ghazaleh NB, Heinzetman W. Infrastructure tradeoff for sensor networks[C] //Proe of the 1st ACM Workshop on Wireless Sensor Networks and Application. New York: ACM, 2002:49-57.
  • 3Wang C G, Sohraby K, Li B. A survey of transport protocols for wireless sensor networks [J]. IEEE Networks, 2006, 20(3) : 34-40.
  • 4Sankaasubramanianm Y, Akan O, Akyildiz IF. Event-to-sink reliable transport in wireless sensor networks [J]. IEEE/ACM Trans on Networking, 2005, 13(5) : 1003-1016.
  • 5Wan CY, Eisenman S, Campbell A. CODA: Congestion detection and avoidance in sensor networks [C] //Proc of ACM SenSys. New York: ACM, 2003:266-278.
  • 6Hull B, Jamieson K, Balakrishnan H. Mitigating congestion in wireless sensor networks [C]//Proe of ACM SenSys. New York: ACM, 2004:134-147.
  • 7Ee CT, Bajcsy R. Congestion control and fairness for many to one routing in sensor networks [C]//Proc of ACM SenSy. New York: ACM, 2004.. 148-161.
  • 8Yi Y, Shakkottai S. Hop-by-hop congestion control over a wireless multihop network [J]. IEEE/ACM Trans on Networking, 2007, 15(1): 133-144.
  • 9Wang C G, Li B, Sohraby K, et al. Upstream congestion control in wireless sensor networks through cross layer optimization [J]. IEEE Journal on Selected Areas in Communications, 2007, 25(4): 786-795.
  • 10Zawodniok M, Jaqannathan S. Predictive congestion control protocol for wireless sensor networks [J]. IEEE Trans on Wireless Communications, 2007, 6(11):3955-3963.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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