A WDS clustering algorithm for wireless mesh networks

Shigeto Tajima, Teruo Higashino, Nobuo Funabiki, Toru Nakanishi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The wireless mesh network has been studied as an expandable wireless access network to the Internet. This paper focuses on the network composed of only access points (APs) that has multihop wireless connections with each other through Wireless Distribution System (WDS). Because the number of APs in a single WDS cluster is limited due to transmission loads of broadcasting control packets, the proper partition of APs for multiple WDS clusters is essential for its scale-up. In this paper, we formulate this WDS clustering problem, and prove the NP-completeness of its decision version through reduction from the bin packing problem. Then, we present its two-stage heuristic algorithm where we verify the effectiveness of our approach through extensive simulations.

Original languageEnglish
Title of host publication4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007
DOIs
Publication statusPublished - 2007
Event4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007 - Singapore, Singapore
Duration: Jul 2 2007Jul 4 2007

Other

Other4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007
CountrySingapore
CitySingapore
Period7/2/077/4/07

Fingerprint

Wireless mesh networks (WMN)
distribution system
Clustering algorithms
broadcasting
heuristics
Bins
Heuristic algorithms
Broadcasting
Internet
simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Tajima, S., Higashino, T., Funabiki, N., & Nakanishi, T. (2007). A WDS clustering algorithm for wireless mesh networks. In 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007 [4284191] https://doi.org/10.1109/WOCN.2007.4284191

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

4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007. 2007. 4284191.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tajima, S, Higashino, T, Funabiki, N & Nakanishi, T 2007, A WDS clustering algorithm for wireless mesh networks. in 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007., 4284191, 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007, Singapore, Singapore, 7/2/07. https://doi.org/10.1109/WOCN.2007.4284191
Tajima S, Higashino T, Funabiki N, Nakanishi T. A WDS clustering algorithm for wireless mesh networks. In 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007. 2007. 4284191 https://doi.org/10.1109/WOCN.2007.4284191
Tajima, Shigeto ; Higashino, Teruo ; Funabiki, Nobuo ; Nakanishi, Toru. / A WDS clustering algorithm for wireless mesh networks. 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007. 2007.
@inproceedings{a82c612bae2445a3b0825e3fd01c339c,
title = "A WDS clustering algorithm for wireless mesh networks",
abstract = "The wireless mesh network has been studied as an expandable wireless access network to the Internet. This paper focuses on the network composed of only access points (APs) that has multihop wireless connections with each other through Wireless Distribution System (WDS). Because the number of APs in a single WDS cluster is limited due to transmission loads of broadcasting control packets, the proper partition of APs for multiple WDS clusters is essential for its scale-up. In this paper, we formulate this WDS clustering problem, and prove the NP-completeness of its decision version through reduction from the bin packing problem. Then, we present its two-stage heuristic algorithm where we verify the effectiveness of our approach through extensive simulations.",
author = "Shigeto Tajima and Teruo Higashino and Nobuo Funabiki and Toru Nakanishi",
year = "2007",
doi = "10.1109/WOCN.2007.4284191",
language = "English",
isbn = "1424410045",
booktitle = "4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007",

}

TY - GEN

T1 - A WDS clustering algorithm for wireless mesh networks

AU - Tajima, Shigeto

AU - Higashino, Teruo

AU - Funabiki, Nobuo

AU - Nakanishi, Toru

PY - 2007

Y1 - 2007

N2 - The wireless mesh network has been studied as an expandable wireless access network to the Internet. This paper focuses on the network composed of only access points (APs) that has multihop wireless connections with each other through Wireless Distribution System (WDS). Because the number of APs in a single WDS cluster is limited due to transmission loads of broadcasting control packets, the proper partition of APs for multiple WDS clusters is essential for its scale-up. In this paper, we formulate this WDS clustering problem, and prove the NP-completeness of its decision version through reduction from the bin packing problem. Then, we present its two-stage heuristic algorithm where we verify the effectiveness of our approach through extensive simulations.

AB - The wireless mesh network has been studied as an expandable wireless access network to the Internet. This paper focuses on the network composed of only access points (APs) that has multihop wireless connections with each other through Wireless Distribution System (WDS). Because the number of APs in a single WDS cluster is limited due to transmission loads of broadcasting control packets, the proper partition of APs for multiple WDS clusters is essential for its scale-up. In this paper, we formulate this WDS clustering problem, and prove the NP-completeness of its decision version through reduction from the bin packing problem. Then, we present its two-stage heuristic algorithm where we verify the effectiveness of our approach through extensive simulations.

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

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

U2 - 10.1109/WOCN.2007.4284191

DO - 10.1109/WOCN.2007.4284191

M3 - Conference contribution

SN - 1424410045

SN - 9781424410040

BT - 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007

ER -