DocumentCode :
3193189
Title :
A WDS Clustering Algorithm for Wireless Mesh Networks
Author :
Tajima, Shigeto ; Higashino, Teruo ; Funabiki, Nobuo ; Nakanishi, Toru
Author_Institution :
Osaka Univ, Osaka
fYear :
2007
fDate :
2-4 July 2007
Firstpage :
1
Lastpage :
5
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.
Keywords :
communication complexity; radio access networks; telecommunication network planning; telecommunication network routing; NP-completeness; WDS clustering algorithm; access points; bin packing problem; broadcasting control packets; multihop wireless connections; wireless access network; wireless distribution system; wireless mesh networks; Broadcasting; Clustering algorithms; Heuristic algorithms; IP networks; Internet; Protocols; Space technology; Spread spectrum communication; Wireless mesh networks; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless and Optical Communications Networks, 2007. WOCN '07. IFIP International Conference on
Conference_Location :
Singapore
Print_ISBN :
1-4244-1005-3
Electronic_ISBN :
1-4244-1005-3
Type :
conf
DOI :
10.1109/WOCN.2007.4284191
Filename :
4284191
Link To Document :
بازگشت