Distributed graph clustering for application in wireless networks

Authors:
Chia-Hao Yu;Shaomeng Qin;Mikko Alava;Olav Tirkkonen
Affiliations:
Department of Communications and Networking, Aalto University, Finland;Department of Applied Physics, Aalto University, Finland;Department of Applied Physics, Aalto University, Finland;Department of Communications and Networking, Aalto University and Nokia Research Center, Helsinki, Finland
Venue:
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Year:
2011

Citing 9
Cited 0

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Principles of Mobile Communication

Principles of Mobile Communication
On Clustering Using Random Walks

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Natural communities in large linked networks

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Stochastic local clustering for massive graphs

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A survey of clustering schemes for mobile ad hoc networks

IEEE Communications Surveys & Tutorials
Computational Intelligence in Wireless Sensor Networks: A Survey

IEEE Communications Surveys & Tutorials
Network coordination for spectrally efficient communications in cellular systems

IEEE Wireless Communications
Survey: Graph clustering

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider distributed clustering of weighted graphs. Each node in the graph is represented by an agent, with agents independent of each other. The target is to maximize the sum weight of intra-cluster edges with cluster size constrained by an upper limit. To avoid getting stuck in not-too-good local optima, we approach this problem by allowing bad decision-making with a small probability that is dependent on the depth of local optima. We evaluate performance in a setting inspired by self-organizing coordination area formation for coordinated transmission in wireless networks. The results show that our distributed clustering algorithm cab perform better than a distributed greedy local search.