The research of cooperative routing algorithm in mobile Ad hoc networks  

作　　者：CHEN Chao ZHENG Bao-yu ZHAO Xian-jing 

机构地区：[1]Institute of Signal and Information Processing, Nanjing University of Posts and Telecommunications, Nanjing 210003, China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2006年第3期5-10,共6页中国邮电高校学报（英文版）

基　　金：This study is supported by National Natural Science Foundation of China(60372107);Chongqing Key Laboratory 0pen Project Foundation.

摘　　要：Cooperative routing technology can efficiently improve the performance of the network by initiatively selecting cooperative nodes to forward the data. In this article, cooperative routing algorithms are proposed and implemented based on three different criteria： optimal channel state, maximal remaining energy, and the shortest path. The simulation based on network simulation （NS） compares the performance of the proposed algorithms with non-cooperative destination-sequenced distancevector （DSDV） protocol. The results reveal that cooperative algorithms outperform DSDV routing protocol with distinctive gains at the cost of sacrificing acceptable normalized network load.Cooperative routing technology can efficiently improve the performance of the network by initiatively selecting cooperative nodes to forward the data. In this article, cooperative routing algorithms are proposed and implemented based on three different criteria： optimal channel state, maximal remaining energy, and the shortest path. The simulation based on network simulation （NS） compares the performance of the proposed algorithms with non-cooperative destination-sequenced distancevector （DSDV） protocol. The results reveal that cooperative algorithms outperform DSDV routing protocol with distinctive gains at the cost of sacrificing acceptable normalized network load.

关 键 词：cooperative routing crosslayer DSDV routing protocol Ad hoc networks 

分 类 号：TN915[电子电信—通信与信息系统]