A lifetime-concerned probabilistic routing scheme in wireless cooperative sensor network

Node cooperation is a promising feature in wireless sensor network, since the application of cooperative communication (CC) can vastly improve the energy efficiency of the network. In this paper, we investigate the Leach based clustering scheme, where the neighboring nodes dynamically form clusters to cooperatively transmit the gathered information to the sink. We model the wireless sensor network as an edge-weighted graph, in which the edge between two clusters is weighted by the energy cost. The famous Dijkstra algorithm is utilized to seek for the shortest path to the sink. Then the famous D-algorithm is modified to prolong the lifetime of the network. Numerical results confirm that the energy efficient routing can effectively enhance the performance of WSNs.