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 i...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.展开更多
A novel weighted cooperative routing algorithm （WCRA） is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy （MRE） of the relays and the maximal received SNR （MRS）...A novel weighted cooperative routing algorithm （WCRA） is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy （MRE） of the relays and the maximal received SNR （MRS） of the nodes. Moreover, a cooperative routing protocol was implemented on the basis of WCRA. Then simulation is done on network simulation （NS-2） platform to compare the performances of MRS, MRE and WCRA with that of noncooperative destination-sequenced destination-sequenced distance-vector （DSDV） protocol. The simulative results show that WCRA obtains a performance tradeoff between MRE and MRS in terms of delivery ratio and network lifetime, which can effectively improve the network lifetime at an acceptable loss of delivery ratio.展开更多
基金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.
文摘A novel weighted cooperative routing algorithm （WCRA） is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy （MRE） of the relays and the maximal received SNR （MRS） of the nodes. Moreover, a cooperative routing protocol was implemented on the basis of WCRA. Then simulation is done on network simulation （NS-2） platform to compare the performances of MRS, MRE and WCRA with that of noncooperative destination-sequenced destination-sequenced distance-vector （DSDV） protocol. The simulative results show that WCRA obtains a performance tradeoff between MRE and MRS in terms of delivery ratio and network lifetime, which can effectively improve the network lifetime at an acceptable loss of delivery ratio.
