无线传感器网络自适应拥塞控制的路由算法分析  

Analysis on Routing Algorithms of Adaptive Congestion Control of Wireless Sensor Networks

作　　者：李路伟[1] 杨洪勇[1] 

机构地区：[1]鲁东大学信息与电气工程学院,烟台264025

出　　处：《上海理工大学学报》2013年第3期215-220,共6页Journal of University of Shanghai For Science and Technology

基　　金：国家自然科学基金资助项目(61273152);山东自然科学基金资助项目(ZR2011M017)

摘　　要：无线传感器网络中节点的覆盖范围有限,因而采用多跳路由传输方式.无线自组网中的多跳路由是由普通节点协作完成的,选择不同的转发节点,会对网络的信息传输产生不同的影响.对不同路由(洪泛路由、最短路径等)算法下的网络自适应拥塞控制进行了分析,研究了不同路由算法下的网络性能和拥塞控制效果.根据节点跳数与缓存占用的关系,提出一种基于节点跳数和缓存占用的性能函数的改进最短路径算法,算法选取使性能函数值最小的节点作为转发节点.最后,通过实验比较了最短路径算法与改进路由算法的网络性能,发现改进路由算法相比最短路径算法,具有较好的网络性能和服务质量.Since the coverage of wireless sensor network nodes is limited, the transmission of multi-hop routing is adopted. The multi-hop routing of wireless ad hoc networks is realized by common nodes cooperation and selecting different forwarding nodes will have a different effect upon the information transmission. By analyzing the network adaptive congestion control with different routing algorithms such as the flooding routing and the shortest path algorithm, the performances of network and congestion control with different kinds of routing algorithms were studied.According to the relationship between hop count and cache occupied, a kind of improved shortest path algorithm based on the performance function of node hop count and cache occupied was proposed, where the node with minimum value of function was selected as the forwarding node. Experiment examples were used to compare the network performances of the shortest path algorithm and the modified routing algorithm. It is shown that the modified one has better network performance and service quality than the shortest path algorithm.

关 键 词：无线传感器网络 自适应 拥塞控制 路由算法 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]