计算机工程 ›› 2012, Vol. 38 ›› Issue (9): 93-96.doi: 10.3969/j.issn.1000-3428.2012.09.028

• 网络与通信 • 上一篇    下一篇

一种基于虚拟簇头的拥塞控制算法

刘永帅,王新生,胡玉兰   

  1. (燕山大学信息科学与工程学院,河北 秦皇岛 066004)
  • 收稿日期:2011-07-28 出版日期:2012-05-05 发布日期:2012-05-05
  • 作者简介:刘永帅(1985-),男,硕士研究生,主研方向:无线传感器网络拥塞控制;王新生,教授;胡玉兰,硕士研究生
  • 基金项目:
    国家“973”计划基金资助项目“信息系统协同性随机模型与可生存性复杂分析”(2005CB321902)

Congestion Control Algorithm Based on Virtual Cluster Head

LIU Yong-shuai, WANG Xin-sheng, HU Yu-lan   

  1. (School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)
  • Received:2011-07-28 Online:2012-05-05 Published:2012-05-05

摘要: 在大规模、高密度的无线传感器网络中,使用多跳分簇的层次结构有利于管理整个网络,且节省传感器节点的能量,但容易发生网络拥塞。针对该问题,提出一种基于虚拟簇头节点的拥塞控制算法,在簇内建立最短路径树,在簇间构造多元路径。实验结果表明,该算法能在保证网络吞吐量的同时,缩短数据的传输时延。

关键词: 无线传感器网络, 分簇, 网络拥塞, 拥塞控制, 最短路径树, 多元路径

Abstract: In the multi-hop and clustering hierarchical structure, which is often used in Wireless Sensor Network(WSN) of large-scale and high-density, cluster head node is the only way which the communication must be passed between inner-cluster and extra-cluster, it is also the node that congestion is most easily to happen. In order to solve the network congestion problem, this paper presents a Congestion Control algorithm Based on Virtual Cluster head(CCBVC) to release network congestion, including the establishment of Shortest Path Tree(SPT) in inner-cluster and construction of multiplexing path in extra-cluster. Simulation results show that the algorithm not only can ensure network throughput effectively, but also can shorten data transmission delay relatively.

Key words: Wireless Sensor Network(WSN), clustering, network congestion, congestion control, Shortest Path Tree(SPT), multiplexing path

中图分类号: