Ad Hoc网络中基于能量耗费和阻塞成本路由算法研究
|
摘要
Ad hoc无线网络是一种无需基础架构,利用节点就可以相互传送数据的网络,其节点的电量是有限制的,需要设计一种能延长节点电量的路由算法来解决这个问题。将传统的路由协议(如:AODV、DSR)加入能量耗费与阻塞成本作为选择路由的依据,利用相关参数构建能量耗费成本模型,并设计出的新的路由算法,最后经过仿真实验验证算法的优越性。
Ad hoc wireless network is a kind of network which can transmit data to each other without infrastructure. The power of its nodes is limited. It is necessary to design a routing algorithm which can prolong the power of nodes to solve this problem. The traditional routing protocols( such as AODV and DSR) are added to the energy consumption and congestion cost as the basis for routing. The energy consumption cost model is constructed by the related parameters,and a new routing algorithm is designed. Finally,the superiority of the algorithm is verified by simulation experiments.
Ad hoc wireless network is a kind of network which can transmit data to each other without infrastructure. The power of its nodes is limited. It is necessary to design a routing algorithm which can prolong the power of nodes to solve this problem. The traditional routing protocols( such as AODV and DSR) are added to the energy consumption and congestion cost as the basis for routing. The energy consumption cost model is constructed by the related parameters,and a new routing algorithm is designed. Finally,the superiority of the algorithm is verified by simulation experiments.
引文
[1]梁芳,武京治,任成鑫.基于NS2仿真的AODV和DSR路由协议性能的比较与分析[J].传感器世界,2014,20(01):33-36.
[2]徐晓俊.基于能量优化的移动Ad Hoc网络路由协议研究[D].北京邮电大学,2018.
[3]霍景河,高昂,张国辉. MANET中两种反应式路由协议效能评估[J].信息通信,2016(05):225-226.
[4] C. K. Toh,“Maximum battery life routing to support ubiquitous mobile computing in wireless ad-hoc networks,”IEEE Communications Magazine,vol. 39,no. 6,pp. 138-147,2001.
[5] S. Doshi,S. Bhandare,and T. X. Brown,“An on-demand minimum energy routing protocol for a wireless ad hoc network,”ACM SIGMOBILE Mobile Computing and Communications Review,vol. 6,no. 3,pp. 50-66,2002.
[5] R. Dube,C. D. Rais,K. Y. Wang,and S. K. Tripathi,“Signal stability-based adaptive routing(SSA)for ad-hoc mobile networks,” IEEE Personal Communications, pp. 36-45,Feb.,1997.
[6] Eiman Alotaibi,Biswanath Mukherjee. A survey on routing algorithms for wireless Ad-Hoc and mesh networks[J]. Computer Networks,2011,56(2).
[7]王树西,李安渝. Dijkstra算法中的多邻接点与多条最短路径问题[J].计算机科学,2014,41(06):217-224.
[2]徐晓俊.基于能量优化的移动Ad Hoc网络路由协议研究[D].北京邮电大学,2018.
[3]霍景河,高昂,张国辉. MANET中两种反应式路由协议效能评估[J].信息通信,2016(05):225-226.
[4] C. K. Toh,“Maximum battery life routing to support ubiquitous mobile computing in wireless ad-hoc networks,”IEEE Communications Magazine,vol. 39,no. 6,pp. 138-147,2001.
[5] S. Doshi,S. Bhandare,and T. X. Brown,“An on-demand minimum energy routing protocol for a wireless ad hoc network,”ACM SIGMOBILE Mobile Computing and Communications Review,vol. 6,no. 3,pp. 50-66,2002.
[5] R. Dube,C. D. Rais,K. Y. Wang,and S. K. Tripathi,“Signal stability-based adaptive routing(SSA)for ad-hoc mobile networks,” IEEE Personal Communications, pp. 36-45,Feb.,1997.
[6] Eiman Alotaibi,Biswanath Mukherjee. A survey on routing algorithms for wireless Ad-Hoc and mesh networks[J]. Computer Networks,2011,56(2).
[7]王树西,李安渝. Dijkstra算法中的多邻接点与多条最短路径问题[J].计算机科学,2014,41(06):217-224.