A WDS clustering algorithm for wireless mesh networks

Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.

Original languageEnglish
Pages (from-to)800-810
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE93-D
Issue number4
DOIs
Publication statusPublished - 2010

Fingerprint

Wireless mesh networks (WMN)
Clustering algorithms
Radio interference
Heuristic algorithms
Cost functions
Scalability
Computational complexity
Throughput
Internet
Communication

Keywords

  • Gateway selection
  • Heuristic algorithm
  • NP-complete
  • Variable depth search
  • WDS clustering
  • Wireless mesh network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

A WDS clustering algorithm for wireless mesh networks. / Tajima, Shigeto; Funabiki, Nobuo; Higashino, Teruo.

In: IEICE Transactions on Information and Systems, Vol. E93-D, No. 4, 2010, p. 800-810.

Research output: Contribution to journalArticle

Tajima, Shigeto ; Funabiki, Nobuo ; Higashino, Teruo. / A WDS clustering algorithm for wireless mesh networks. In: IEICE Transactions on Information and Systems. 2010 ; Vol. E93-D, No. 4. pp. 800-810.
@article{5b2cf6156803471994a5c0e86f8cabc4,
title = "A WDS clustering algorithm for wireless mesh networks",
abstract = "Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.",
keywords = "Gateway selection, Heuristic algorithm, NP-complete, Variable depth search, WDS clustering, Wireless mesh network",
author = "Shigeto Tajima and Nobuo Funabiki and Teruo Higashino",
year = "2010",
doi = "10.1587/transinf.E93.D.800",
language = "English",
volume = "E93-D",
pages = "800--810",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

TY - JOUR

T1 - A WDS clustering algorithm for wireless mesh networks

AU - Tajima, Shigeto

AU - Funabiki, Nobuo

AU - Higashino, Teruo

PY - 2010

Y1 - 2010

N2 - Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.

AB - Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.

KW - Gateway selection

KW - Heuristic algorithm

KW - NP-complete

KW - Variable depth search

KW - WDS clustering

KW - Wireless mesh network

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

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

U2 - 10.1587/transinf.E93.D.800

DO - 10.1587/transinf.E93.D.800

M3 - Article

AN - SCOPUS:77952325059

VL - E93-D

SP - 800

EP - 810

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 4

ER -