An Efficient Information Retrieval and Routing using AODV on TDMA in WSNs

Abstract

In Wireless Sensor Networks (WSNs), Time Division Multiple Access (TDMA) based slot scheduling is one of the essential research problems during the fast data collection process. In order to enhance the lifetime of the network, TDMA slot allocation is considered as significant methodology. In this research, for minimizing the consumption of energy during the process of information retrieval,  effectively discovering the appropriate routes and maintenance of routing process, we introduced K-Means-TDMA-AODV methodology where the formation of clusters and selection of cluster head is managed by the K-Means clustering algorithm. The Ad hoc On-Demand Distance Vector (AODV) is simplified by utilizing the neighbour information strategy in a TDMA protocol.For the time critical data, the TDMA methodology failed to minimize the time delay, however, the TDMA helps to maximize the network lifetime through adjusting the schedule of the TDMA slot. Thus, the proposed K-Means-TDMA-AODV provides the better performance in terms of number of data packets received by the base station, lifetime of the network, maintain the number of alive nodes and consumption of energy. The performance of the proposed K-Means-TDMA-AODV methodology is compared with the standard existing information retrieval routing protocol Ex-APTEEN. The results from this research showed that, theK-Means-TDMA-AODV methodology outperformed existing methods in terms of lifetime of the network and energy consumption.