Enhanced Knn Query Processing Algorithm Using Autonomous Clustering in Mobile Ad Hoc Network

Location-based service is a typical application for mobile ad hoc networks. In an LBS, it is common for a node to issue k nearest neighbor (knn) queries, which search the information on the k nearest neighbors (knns) from the specified location (querypoint). In these methods, the query-issuing node first forwards a kNN query using geo-routing to the nearest node from the point specified by the query (query point). Then, the nearest node from the query point forwards the query to other nodes close to the query point, and each node receiving the query replies with the information on itself. In this process, there are two different approaches: the Explosion (EXP) method and the Spiral (SPI) method. In the EXPmethod, the nearest node from the query point floods the query to nodes within a specific circular region, and each node receiving the query replies with information on itself. In the SPI method, the nearest node from the query point forwards the query to other nodes in a spiral manner, and the node that collects a satisfactory kNN result transmits the result to the query-issuing node. In this project, we propose enhanced KNN query processing method for reducing traffic and maintaining high energy efficiency in mobile ad hoc networks. Enhance the current KNN query algorithm by using Autonomous clustering and Hierarchal Routing Algorithm. The cluster consists of one cluster head (CH), one or more gateways (GW), and cluster members. When a node in a cluster queries with a node in its neighboring cluster, packets are forwarded through only the GWs. Cluster head works to manage the cluster. Gateway works to get the information of a neighboring cluster. The entire network is divided into multiple clusters. The cluster size is managed by the number of nodes in the cluster (Upper bound and Lower bound).