Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks

A. Ferro, G. Pigola, A. Pulvirenti, Dennis Shasha

Research output: Contribution to journalArticle

Abstract

Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tree data structure [5]. This very effective structure was originally designed for finite sets of points in an arbitrary metric space to support efficient range searching. It requires only a linear number of pair-wise distance calculations among nodes. Mobile Base Stations occupy an approximate centroid of the clusters and are moved according to a fast practical bipartite matching algorithm which tries to minimize both total and maximum distance. We show that the best known computational geometry algorithms [1] become infeasible for our application when a high number of mobile base stations is required. On the other hand our proposed 8% average error solution requires O(k log k) running time instead of the approximatively O(k2) exact algorithm [1]. Communication among nodes is realized by a Clusterhead Gateway Switching Routing (CGSR) protocol [15] where the mobile base stations are organized in a suitable network. Other efficient clustering algorithms [11, 17] may be used instead of the Antipole Tree. However the nice hierarchical structure of the Antipole Tree makes it applicable to other types of mobile wireless (Ad-Hoc) and wired networks but this will be subject of future work.

Original languageEnglish (US)
Pages (from-to)223-236
Number of pages14
JournalInternational Journal of Foundations of Computer Science
Volume14
Issue number2
DOIs
StatePublished - 2003

Fingerprint

Base stations
Wireless networks
Computational geometry
Gateways (computer networks)
Routing protocols
Clustering algorithms
Data structures
Communication

Keywords

  • Antipole Clustering
  • closest match
  • mobile base stations
  • Wireless Network

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks. / Ferro, A.; Pigola, G.; Pulvirenti, A.; Shasha, Dennis.

In: International Journal of Foundations of Computer Science, Vol. 14, No. 2, 2003, p. 223-236.

Research output: Contribution to journalArticle

@article{f23631fdb24e48259b007e32f9369689,
title = "Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks",
abstract = "Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tree data structure [5]. This very effective structure was originally designed for finite sets of points in an arbitrary metric space to support efficient range searching. It requires only a linear number of pair-wise distance calculations among nodes. Mobile Base Stations occupy an approximate centroid of the clusters and are moved according to a fast practical bipartite matching algorithm which tries to minimize both total and maximum distance. We show that the best known computational geometry algorithms [1] become infeasible for our application when a high number of mobile base stations is required. On the other hand our proposed 8{\%} average error solution requires O(k log k) running time instead of the approximatively O(k2) exact algorithm [1]. Communication among nodes is realized by a Clusterhead Gateway Switching Routing (CGSR) protocol [15] where the mobile base stations are organized in a suitable network. Other efficient clustering algorithms [11, 17] may be used instead of the Antipole Tree. However the nice hierarchical structure of the Antipole Tree makes it applicable to other types of mobile wireless (Ad-Hoc) and wired networks but this will be subject of future work.",
keywords = "Antipole Clustering, closest match, mobile base stations, Wireless Network",
author = "A. Ferro and G. Pigola and A. Pulvirenti and Dennis Shasha",
year = "2003",
doi = "10.1142/S0129054103001698",
language = "English (US)",
volume = "14",
pages = "223--236",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

TY - JOUR

T1 - Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks

AU - Ferro, A.

AU - Pigola, G.

AU - Pulvirenti, A.

AU - Shasha, Dennis

PY - 2003

Y1 - 2003

N2 - Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tree data structure [5]. This very effective structure was originally designed for finite sets of points in an arbitrary metric space to support efficient range searching. It requires only a linear number of pair-wise distance calculations among nodes. Mobile Base Stations occupy an approximate centroid of the clusters and are moved according to a fast practical bipartite matching algorithm which tries to minimize both total and maximum distance. We show that the best known computational geometry algorithms [1] become infeasible for our application when a high number of mobile base stations is required. On the other hand our proposed 8% average error solution requires O(k log k) running time instead of the approximatively O(k2) exact algorithm [1]. Communication among nodes is realized by a Clusterhead Gateway Switching Routing (CGSR) protocol [15] where the mobile base stations are organized in a suitable network. Other efficient clustering algorithms [11, 17] may be used instead of the Antipole Tree. However the nice hierarchical structure of the Antipole Tree makes it applicable to other types of mobile wireless (Ad-Hoc) and wired networks but this will be subject of future work.

AB - Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tree data structure [5]. This very effective structure was originally designed for finite sets of points in an arbitrary metric space to support efficient range searching. It requires only a linear number of pair-wise distance calculations among nodes. Mobile Base Stations occupy an approximate centroid of the clusters and are moved according to a fast practical bipartite matching algorithm which tries to minimize both total and maximum distance. We show that the best known computational geometry algorithms [1] become infeasible for our application when a high number of mobile base stations is required. On the other hand our proposed 8% average error solution requires O(k log k) running time instead of the approximatively O(k2) exact algorithm [1]. Communication among nodes is realized by a Clusterhead Gateway Switching Routing (CGSR) protocol [15] where the mobile base stations are organized in a suitable network. Other efficient clustering algorithms [11, 17] may be used instead of the Antipole Tree. However the nice hierarchical structure of the Antipole Tree makes it applicable to other types of mobile wireless (Ad-Hoc) and wired networks but this will be subject of future work.

KW - Antipole Clustering

KW - closest match

KW - mobile base stations

KW - Wireless Network

UR - http://www.scopus.com/inward/record.url?scp=33847166046&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847166046&partnerID=8YFLogxK

U2 - 10.1142/S0129054103001698

DO - 10.1142/S0129054103001698

M3 - Article

VL - 14

SP - 223

EP - 236

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 2

ER -