16-05-2014, 01:02 PM
Algorithms For Clustering In Ad Hoc Networks
Algorithms For Clustering .ppt (Size: 208 KB / Downloads: 31)
What Is An Ad Hoc Network?
Wireless computer network
No central control
Computers talking to each other
Suitable for
Conference rooms
Classrooms
Battlefields
Wearable computing
What Is Clustering In Ad-hoc Networks?
Partitioning wireless device nodes into groups
Each group has clusterhead
Oversee channel allocation
Message routing within cluster
Message routing between clusters
Ordinary nodes within the clusterhead's transmission range
What Are Goals Of Clustering?
At least 1 neighboring clusterhead
Allows fast communications between nodes
Nodes connected to “best" clusterhead
Clusterheads well scattered throughout the network
How Are Clusterheads Chosen?
Approximating Minimum Size Weakly-Connected Dominating Sets For Clustering Mobil Ad Hoc Networks
Criterion: domination in graphs
Distributed Clustering For Ad Hoc Networks
Criterion: generic weight
Algorithms Presented
Presented 5 algorithms
Analyzed 2 algorithms
Their most important algorithm covered here
Algorithm V Distributed Asynchronous Approach
Desired Graph Properties
Goal is to find a small weakly-connected dominating set in order to abstract the network structure as much as possible
Smaller values are preferred
Improvement number of pieces that would be merged into a single cluster if that piece were clusterhead