结合距离与队列积压的无线mesh网络拥塞感知路由协议

Wireless mesh network congestion-aware routing protocol combining distance and queue backlog

针对无线mesh网络中路由的拥塞问题,提出了一种结合距离与队列积压信息的拥塞感知路由(DBCAR)协议。结合链路质量源路由(LQSR)协议中的距离度量和E-Backpressure协议中的队列积压度量构建一种新的链路质量度量;每个节点通过探测数据包来计算链路质量,并通过控制数据包和其邻居节点进行交互,以此来更新链路质量;最后,节点根据链路质量来选择下一跳节点,从而构建从源节点到目的节点之间的最佳路径。在MAC层中为控制数据包分配最高的优先级,同时保证控制数据包的安全性。仿真实验表明,在不同的链路负载下,该协议在网络传输时延和网络吞吐量方面都具有优越的性能,具有可行性和有效性。

For the congestion problem of routing in wireless mesh networks,this paper proposed a congestion-aware routing(DB-CAR)protocol combining the distance and queue backlog information.Firstly,it constructed a new link quality metric based on the distance metric in the link quality source routing(LQSR)protocol and the queue backlog in the E-Backpressure protocol.Then,each node computed the link quality by detecting packet,and updated the link quality by interacting the control packet with its neighbor nodes.Finally,the node selected the next hop node based on the link quality to construct the best path from the source node to the destination node.In addition,it assigned the highest priority for the control packet in the MAC layer,while ensuring the control packet security.The simulation results show that the protocol has the advantages of network transmission delay and network throughput under different link load,and it is feasible and effective.