Weighted cooperative routing algorithm through opportunistic relaying
Chao Chen · Systems engineering and electronics · 2009
Cooperative routing technology can improve the performance of the network by forwarding data among relays.A decentralized weighted cooperative routing algorithm(DWCRA) through opportunistic relaying is proposed with the weighted metric consisting of remaining energy of the relays and the channel state information between nodes,then the cooperative routing model and strategy are established.The simulation is performed on NS-2 to compare the performance of optimal channel state(OCS),maximal remaining energy(MRE) and WCRA with that of non-cooperative DSDV protocol.The results indicate that DWCRA obtains a quality of service(QoS) tradeoff between MRE and OCS in terms of the delivery ratio and network lifetime.Furthermore,different performance needs can be satisfied by dynamically coordinating the weighted factors.