BibTeX:

@article{IJIRSTV3I2075,
     title={Energy Efficient Routing in Clustered Wireless Sensor Network Among Obstacles},
     author={B. Amarnath and Sachinkumar Veerashetty},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={3},
     number={2},
     pages={127--129},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV3I2075.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

The routing which is present in clustered WSNs assumes that there is no barrier in a field of interest (FoI). Although it isn’t a practical statement it eliminates s the effects of obstacles in routing the sensory data. The intend of clustering technique in WSNs named energy-efficient consistent clustering that periodically selects the cluster heads according to their residual energy and secondary parameter as utility of the sensor to its neighbors. Then selected cluster heads have equal number of neighbors and residual energy. The present of route optimization technique in clustered WSNs among obstacles using Dijkstra’s shortest path algorithm. This criterion reduces average hop count, packet delay and energy-consumption of Wireless Sensor Networks.

Wireless Sensor Network (WSN), Field of Interest (FOI), Cluster Head