Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ICWN
2004

favoriteEmaildiscussreport

164views Wireless Networks» more ICWN 2004»

A Distributed Clustering Framework in Mobile Ad Hoc Networks

14 years 7 days ago

A Distributed Clustering Framework in Mobile Ad Hoc Networks

Download www.mohrahit.in

Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amount of computational and information overhead while maintaining a stable cluster formation. The algorithm is a distributed version of the Basic Leader-Follower Algorithm used in pattern recognition. Our algorithm does not require maintaining a cluster head. The parameters of the algorithm give us `good' control over the cluster properties.

Mohit Garg, R. K. Shyamasundar

Real-time Traffic

Algorithm | Basic Leader-Follower Algorithm | ICWN 2004 | ICWN 2007 | Stable Cluster Formation |

claim paper

Related Content

» GPSfree Positioning in Mobile Ad Hoc Networks

» A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in ...

» MobilityBased Clustering in VANETs Using Affinity Propagation

» Distributed Clustering for Ad Hoc Networks

» A Distributed Sizebounded Multihop Clustering for Mobile Ad Hoc Networks

» MaximumObjectiveTrust Clustering Solution and Analysis in Mobile Ad Hoc Networks

» Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks

» A Failure Adapted LoadBalanced Distributed Routing for Wireless Ad Hoc Sensor Networks

» A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	ICWN
Authors	Mohit Garg, R. K. Shyamasundar

Comments (0)