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

Congestion Control Algorithm Based on Virtual Cluster Head

作　　者：刘永帅[1] 王新生[1] 胡玉兰[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《计算机工程》2012年第9期93-96,共4页Computer Engineering

基　　金：国家"973"计划基金资助项目"信息系统协同性随机模型与可生存性复杂分析"(2005CB321902)

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

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]