摘要
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.
基金
This study is supported by National Natural Science Foundation of China(60372107)
Chongqing Key Laboratory 0pen Project Foundation.
