DocumentCode
2889472
Title
Fair and Flexible Budget-Based Clustering
Author
Ben Abdesslem, Fehmi ; Ziviani, Artur ; De Amorim, Marcelo Dias ; Todorova, Petia
Author_Institution
UPMC Univ. Paris 06, Paris, France
fYear
2009
fDate
14-18 June 2009
Firstpage
1
Lastpage
5
Abstract
An efficient way to bound the size of clusters in large-scale self-organizing wireless networks is to rely on a budget-based strategy. The side effect of conventional budget- based clustering approaches is that they generate a potentially large number of small, even single-node, clusters. The consequence is that while clusters are bounded, their average size may be far from the expected value (the budget), which negatively impacts the performance of the communication systems running on top of it. In contrast, we propose Fair and Flexible Budget- Based Clustering (FFBC) to form size-controlled clusters in large-scale self-organizing networks. For a given target cluster size, our approach outperforms previous budget-based algorithms by creating clusters of average size closer to the requested value and avoiding isolated nodes.
Keywords
pattern clustering; radio networks; fair and flexible budget-based clustering; large-scale self-organizing wireless networks; size-controlled clusters; target cluster size; Clustering algorithms; Communications Society; IP networks; Large-scale systems; Network topology; Partitioning algorithms; Scalability; Self-organizing networks; Size control; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2009. ICC '09. IEEE International Conference on
Conference_Location
Dresden
ISSN
1938-1883
Print_ISBN
978-1-4244-3435-0
Electronic_ISBN
1938-1883
Type
conf
DOI
10.1109/ICC.2009.5199023
Filename
5199023
Link To Document