An Efficient Routing Protocol in Heterogeneous Wireless Sensor Network Considering Obstacle

In addition to coverage it is important for a sensor network to maintain connectivity. Connectivity can be defined as the ability of the sensor nodes to reach the data sink. If there is no available route from a sensor node to the data sink then the data collected by that node cannot be processed. Each node has a communication range which defines the area in which another node can be located in order to receive data. In this research, we extend an energy-efficient clustering algorithm with obstacle consideration in wireless sensor networks to achieve the required features of prolonged network lifetime and coverage-preservation. Obstacle is the major issue in wireless sensing networks as it hinders the communication. This is to be achieved by figuring clusters from the randomly scattered sensor nodes in the sensing field and sensibly selecting the cluster-heads, representing respective clusters, temporary cluster head and their cluster-members while ensuring the coverage. The simulation results show the better optimization results, improved network coverage and prolong network lifetime as compared to ECSSCOM without obstacles.