ID 56159
フルテキストURL
著者
Tajima, Shigeto Graduate School of Engineering Science, Osaka University
Funabiki, Nobuo Graduate School of Natural Science and Technology, Okayama University 科研費研究者番号
Higashino, Teruo Graduate School of Information Science and Technology, Osaka University
抄録
Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.
キーワード
wireless local-area network
WLAN
holding access-point
partially overlapping channel
assignment algorithm
combinatorial optimisation problem
発行日
2018-04-10
出版物タイトル
International Journal of Space-Based and Situated Computing
8巻
1号
出版者
INDERSCIENCE ENTERPRISES
開始ページ
50
終了ページ
58
ISSN
2044-4893
資料タイプ
学術雑誌論文
言語
English
OAI-PMH Set
岡山大学
論文のバージョン
author
DOI
Web of Sience KeyUT
関連URL
isVersionOf https://doi.org/10.1504/IJSSC.2018.091196
過去1年のアクセス数
アクセス数 : ?
ダウンロード数 : ?

今月のアクセス数
アクセス数 : ?
ダウンロード数 : ?