Energy Efficient Homogeneous Routing in Clustered Wireless Sensor Networks among Obstacles

Abstract

An essential problem of studies in Wi-Fi sensor networks (WSNs) is to dynamically organize the sensors into a Wi-Fi network and direction the sensory facts from sensors to a sink. Clustering in WSNs is an effective technique for prolonging the network lifetime. In most of the traditional routing in clustered WSNs assumes that there is no impediment in a ?eld of interest. Although it isn't always a practical assumption, it removes the consequences of barriers in routing the sensory statistics. In this paper, we ?rst suggest a clustering approach in WSNs named strength-efficient homogeneous clustering that periodically selects the cluster heads consistent with a hybrid of their residual strength and a secondary parameter, inclusive of the utility of the sensor to its buddies. In this manner, the selected cluster heads have same variety of pals and residual strength. We then present a course optimization method in clustered WSNs amongst limitations the usage of Dijkstra's shortest path algorithm. We display that our work reduces the common hop count number, packet put off, and strength-consumption of WSNs.