![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
A Novel Cluster Arrangement Energy Efficient Routing Protocol for Wireless Sensor Networks
Background: Wireless sensor networks are application-based networks designed by large number of sensor nodes. Utilizing the energy in efficient way is the one of the main design issue in Wireless Sensor Network (WSN). Limited battery capacity of sensor nodes makes energy efficiency a major and challenging problem in wireless sensor networks. Methods: In order to improve Network lifetime, Energy efficiency and Load balance in Wireless Sensor Network, a Cluster Arrangement Energy Efficient Routing Protocol CAERP is proposed. It mainly includes efficient way of node clustering and distributed multi-hop routing. In the clustering part of CAERP we introduce an un-even clustering mechanism. Cluster head which are closer to the Base Station (BS) have smaller cluster size than those farther from BS, so in here they can preserve some energy in the time of inter-cluster data communication. Our protocol consists of cluster head selection algorithm, a cluster formation scheme and a routing algorithm for the data transmission between cluster heads and the base station. Findings: Each sensor node should effectively handle its energy in order to keep the WSN at its operation state. In each time duration Q-leach is consume more energy than the CAERP. CAERP eliminate the initial dead node problem. During the initial stage the message overhead between the Q-Leach and CAERP have somewhat similar, but after the uneven clustering formation the CAERP message overhead is reduced comparing with the Q-LEACH. In CAERP protocol it mainly focuses for utilizing the energy in efficient way. This improvement is accomplished because the nodes remain alive due to the efficient way of cluster arrangement. CAERP has mainly five cluster Head so each cycle the Cluster Head varying based on the CAERP CH selection algorithm. Due to efficient CH selection algorithm the CAERP have high network life time compared to Q-LEACH. The simulation result shows that CAERP significantly increasing the network lifetime and minimizes energy consumption of nodes compared with Q-leach protocol. Conclusion: The performance of the proposed protocol is compared with that of Q-LEACH using different parameters with the help network simulators. Our protocol CAERP has significantly improved in average energy consumption, survival rate and the extended the network life cycle which means the energy efficiency of the CAERP network is improved.
Keywords
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 295
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0