摘要:
针对无线传感器网络数据汇集应用中, 由于数据流量大, 相邻路径之间容易发生串扰、信道竞争和冲突, 造成拥塞问题, 提出了基于拥塞控制的无线传感器网络数据汇集树生成算法(Data gather tree algorithm based on congestion control, DGT-CC). DGT-CC算法通过层次发现、邻居发现、启发式搜索和流量均衡策略构造一棵最短路径最小拥塞权值树. 理论分析证明DGT-CC算法收敛, 并能够构造一棵最短路径最小拥塞权值树, 仿真实验表明DGT-CC算法在丢包率、网络吞吐量和时延方面都较普通的最短路径树具有更好的性能.
Abstract:
In data gathering application of wireless sensor networks, owing to the heavy traffic, the channel contention and interference between adjacent paths, the congestion would easily happen. The data gather tree algorithm based on congestion control (DGT-CC) is proposed, which generates a shortest path and minimum congestion weight tree through level found, neighbors discovery, heuristic search, and traffic balanced strategy. Theoretical analysis proves the DGT-CC to be convergent, and the routing tree to be a shortest path and minimum congestion weight tree. Simulation results show that the DGT-CC algorithm is superior to the ordinary shortest path tree in terms of success rate of data transfer, network throughput, and delay.
下载:
