A WDS Clustering Algorithm for Wireless Mesh Networks
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2010-04-01
著者
-
Higashino Teruo
Graduate School Of Information Science And Technology Osaka University
-
Higashino Teruo
Department Of Informatics And Mathematical Science Osaka University
-
Higashino Teruo
The Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka
-
Funabiki N
Graduate School Of Natural Science And Technology Okayama University
-
Funabiki Nobuo
Graduate School Of Natural Science And Technology Okayama University
-
Tajima Shigeto
Graduate School Of Engineering Science Osaka University
関連論文
- A Contact-based Hybrid Routing Protocol for Mobile Ad Hoc Networks
- Extensions of the Access Point Allocation Algorithm for Wireless Mesh Networks
- A WDS Clustering Algorithm for Wireless Mesh Networks
- An Access Point Allocation Algorithm for Indoor Environments in Wireless Mesh Networks
- An Optical-Drop Wavelength Assignment Algorithm for Efficient Wavelength Reuse under Heterogeneous Traffic in WDM Ring Networks(Discrete Mathematics and Its Applications)
- A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks(Network)
- P2PMM_router : A Two-Stage Heuristic Algorithm to Peer-to-Peer Multicast Routing Problems in Multihome Networks(Discrete Mathematics and Its Applications)
- A Quasi-Solution State Evolution Algorithm for Channel Assignment Problems in Cellular Networks(Special Section on Discrete Mathematics and Its Applications)
- A Proposal of Test Sequence Generation Method for Communication Protocols Using SAT Algorithm
- Double Depth First Search Based Parametric Analysis for Parametric Time-Interval Automata(Concurrent/Hybrid Systems : Theory and Applications)
- Time-Action Alternating Model for Timed Processes and Its Symbolic Verification of Bisimulation
- A Proposal of Optimal Path Selection Algorithm for Static and Mobile Multicast Routing Problems
- A Proposal of Improved Lip Contour Extraction Method Using Deformable Template Matching and Its Application to Dental Treatment
- Deriving Concurrent Synchronous EFSMs from Protocol Specifications in LOTOS (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
- A Method to Convert Concurrent EFSMs with Multi-Rendezvous into Synchronous Sequential Circuit(Special Section on Concurrent Systems Technology)
- Execution Time Analysis for Binary Code Executed on a Pipelined Processor Using Parametric Model Checking
- Performance evaluation of vital-sign collection mechanism using wireless sensor device (モバイルマルチメディア通信)
- Relaxation of Coefficient Sensitiveness to Performance for Neural Networks Using Neuron Filter through Total Coloring Problems
- A Proposal of Neuron Filter: A Constraint Resolution Scheme of Neural Networks for Combinatorial Optimization Problems
- A Digital Neural Network for Multilayer Channel Routing with Crosstalk Minimization
- A Massive Digital Neural Network for Total Coloring Problems
- A Gradual Neural Network Approach for Time Slot Assignment in TDM Multicast Switching Systems
- Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems (Special Section on Discrete Mathematics and Its Applications)
- A Minimal-State Processing Search Algorithm for Graph Coloring Problems
- An Efficient Overlay Multicast Protocol for Heterogeneous Users(Selected Papers from ICMU 2005(Second International Conference on Mobile Computing and Ubiquitous Networking))
- BS-3-17 LOAD BALANCING STAGE FOR AN ACCESS-POINT AGGREGATION ALGORITHM IN WIRELESS LOCAL AREA NETWORKS(BS-3. Management and Control Technologies for Innovative Networks)
- BS-5-29 An Idea of Linux Implementation of Fixed Backoff-time Switching Method for Wireless Mesh Networks(BS-5. Network and Service Design, Control and Management)
- Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
- Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
- A Fixed Backoff-Time Switching Method for CSMA/CA Protocol in Wireless Mesh Networks
- An Efficient Overlay Multicast Protocol for Heterogeneous Users
- An Access-Point Aggregation Approach for Energy-Saving Wireless Local Area Networks
- BS-1-2 AN IMPROVED HOST ASSOCIATION OPTIMIZATION STAGE IN ACCESS-POINT AGGREGATION ALGORITHM FOR WIRELESS LOCAL AREA NETWORKS
- BS-1-26 A Design for OpenFlow lmplementation of Fixed Backoff-time Switching Method in Wireless Mesh Networks