Hierarchical agglomerative clustering based routing algorithm for overall efficiency of wireless sensor network

Wireless sensor networks, also called as wireless sensor and actuator networks, consist of individual sensors distributed in space according to a particular criteria and are designed to monitor physical or environmental conditions, such as temperature, sound, pressure and many more. These sensors collectively pass their data through the network to a main location, mostly a base station. A critical regard with respect to applications of wireless sensor networks is its network lifetime. Battery-powered sensors are deployable provided they can communicate the gathered data to a central node or a processing node. Sensing and communication processes consume energy; therefore sophisticated power management and scheduling can successfully extend the operational time. Sensors that are more distant from base station deplete greater energy. Hence the cluster head is deployed for processing and sending the information while other energy nodes can be used to achieve sensing in the proximity of the target. Transmitting data from the cluster head to the base station requires more energy than the transmission from sensor node to the cluster head, particularly if the base station is located away from cluster head. This causes the cluster head to deplete their energy much faster. In this paper propose a method to address these factors. With the help of Centrality based CH election and the Gateway nodes, the simulation results prove the efficiency of this method.