Computer Science – Discrete Mathematics
Scientific paper
2011-04-29
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 3, No. 2, April 2011, 253-270
Computer Science
Discrete Mathematics
Scientific paper
10.5121/ijwmn.2011.3220
In this paper, a new multi-hop weighted clustering procedure is proposed for homogeneous Mobile Ad hoc networks. The algorithm generates double star embedded non-overlapping cluster structures, where each cluster is managed by a leader node and a substitute for the leader node (in case of failure of leader node). The weight of a node is a linear combination of six different graph theoretic parameters which deal with the communication capability of a node both in terms of quality and quantity, the relative closeness relationship between network nodes and the maximum and average distance traversed by a node for effective communication. This paper deals with the design and analysis of the algorithm and some of the graph theoretic/structural properties of the clusters obtained are also discussed.
Janakiraman T. N.
Thilak Senthil A.
No associations
LandOfFree
A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18239