In this study, we propose an algorithm to route the data from a source to destination through a path with minimum distance in an ad hoc network. To achieve this, sets of nodes based on their neighborhood are grouped to form clusters. The algorithm forms clusters and the cluster leaders are chosen based on the minimum distance. The source and destination nodes choose their cluster leader and commute through their cluster leaders. The proposed work is attempted on different set of nodes and attained the optimal path. © Maxwell Scientific Organization, 2012.
cited By (since 1996)0
Va Anand, Sairam, Na, and Thiyagarajan, Mb, “Clustering in ad hoc networks using nearest neighbor”, Research Journal of Applied Sciences, Engineering and Technology, vol. 4, pp. 973-977, 2012.