An energy-efficient routing with sensor nodes cooperation in wireless sensor network

An energy-efficient cooperative geographic routing (ECGR) is proposed for wireless sensor networks(WSN). The proposed algorithm is composed of two aspects: at physical layer, WSN uses cyclic redundancy check to find out the nodes that can correctly decode the packet. A competitive selection algorithm is then used to select a header node from these nodes and a new cluster is formed through information exchange with the header node. Then, the cluster transmits the packet cooperatively and finally realizes multi-node diversity gain. At the network layer, ECGR uses the geographic routing to make the packet always rout toward the destination and to avoid diverging routes. Compared with other works, the ECGR increases the transmit distance of each hop, reduces the overall network energy consumption and balances the energy consumption among the sensor nodes, and hence the life of the network is extended. Simulation results in 400 simulation rounds and comparisons with geographic routing algorithm with 0.03 node density show that the alive rate of nodes in ECGR improves about 70%.