|
Abstract
|
Article Information:
Clustering in Ad Hoc Networks using Nearest Neighbor
V. Anand, N. Sairam and M. Thiyagarajan
Corresponding Author: V. Anand
Submitted: November 25, 2011
Accepted: December 27, 2011
Published: April 15, 2012 |
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.
Key words: Clustering, cluster leader, neighbors, optimal path, , ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
V. Anand, N. Sairam and M. Thiyagarajan, . Clustering in Ad Hoc Networks using Nearest Neighbor. Research Journal of Applied Sciences, Engineering and Technology, (08): 973-977.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
