A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
スポンサーリンク
概要
- 論文の詳細を見る
Wireless LANs, which consist of access points and wireless stations, have widely spread in recent years. Routing in wireless LANs suffers the problem that each wireless station selects an access point and a wired path to its destination station. It is desired to design an adaptive routing protocol for wireless LANs since throughputs of communications are dynamically affected by selections of other wireless stations and external environmental changes. In this paper, we propose a routing protocol for wireless LANs based on attractor selection. Attractor selection is a biologically inspired approach, and it has high adaptability to dynamic environmental changes. By applying attractor selection, each wireless station can adaptively select its access point and wired path with high throughput against environmental changes. In addition, we design the protocol with a new technique: combination of multiple attractor selections. The technique is useful because it enables us to divide a problem into several simpler problems. To the best of our knowledge, our protocol is the first one designed around a combination of multiple attractor selections. We show the effectiveness and adaptability of our protocol by simulations.
- (社)電子情報通信学会の論文
- 2009-10-01
著者
-
Izumi Taisuke
Nagoya Inst. Technol. Nagoya‐shi Jpn
-
Izumi Tomoko
Nagoya Inst. Technol. Nagoya‐shi Jpn
-
NISHIKAWA Gen
Graduate School of Information Science and Technology, Osaka University
-
IZUMI Tomoko
College of Information Science and Engineering, Ritsumeikan University
-
OOSHITA Fukuhito
Graduate School of Information Science and Technology, Osaka University
-
KAKUGAWA Hirotsugu
Graduate School of Information Science and Technology, Osaka University
-
MASUZAWA Toshimitsu
Graduate School of Information Science and Technology, Osaka University
-
Masuzawa Toshimitsu
Graduate School Of Engineering Science Osaka University
-
Nishikawa Gen
Graduate School Of Information Science And Technology Osaka University
-
Masuzawa Toshimitsu
Osaka Univ. Toyonaka‐shi Jpn
-
Ooshita Fukuhito
Graduate School Of Information Science And Technology Osaka University
-
Kakugawa Hirotsugu
Graduate School Of Information Science And Technology Osaka University
関連論文
- A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
- A Biologically Inspired Self-Adaptation of Replica Density Control
- A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
- An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
- Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
- A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
- Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
- Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
- Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
- Self-Stabilization in Dynamic Networks
- Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
- Self-Stabilizing Agent Traversal on Tree Networks(Distributed Cooperation and Agents)
- A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination(Discrete Mathematics and Its Applications)
- Complexity of minimum certificate dispersal problem with tree structure (コンピュテーション)
- Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
- A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance