Publication Type:

Journal Article

Source:

Research Journal of Applied Sciences, Engineering and Technology, Volume 4, Number 8, p.973-977 (2012)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84862113827&partnerID=40&md5=4e258eaba5268b7a223c63977d607d0d

Keywords:

Ad hoc networks, Algorithms, Cluster leader, Clustering, Destination nodes, Form clusters, Minimum distance, Nearest neighbors, Neighbors, Optimal paths, Optimization

Abstract:

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.

Notes:

cited By (since 1996)0

Cite this Research Publication

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.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
9th
RANK(INDIA):
NIRF 2017
150+
INTERNATIONAL
PARTNERS