English  |  正體中文  |  简体中文  |  Items with full text/Total items : 88284/117783 (75%)
Visitors : 23395668      Online Users : 131
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/111698
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/111698


    Title: An integrated optimization model for wireless access point deployment construction, and enhancement
    Authors: 林湘霖
    Wang, C.-S.
    Lin, Shiang-Lin
    Contributors: 資管系
    Keywords: Artificial intelligence;Budget control;Genetic algorithms;Interference suppression;Linear programming;Multiobjective optimization;Optimization;Signal interference;Software engineering;Tabu search;Wireless telecommunication systems;Access points;Dynamic throughputs;Integrated optimization models;Networking infrastructure;Tabu search algorithms;Wireless access points;Wireless communications;Wireless lans;C (programming language)
    Date: 2015-08
    Issue Date: 2017-08-09 17:28:39 (UTC+8)
    Abstract: Appropriate wireless LAN design is essential for ensuring a good quality of telecommunication service. Optimal access point deployment (APD) presents a typical NP-complex problem that resolves wireless networking infrastructure with the involvement of multiple objectives (MO-APD). MO-APD can be divided into the APD construction (APD-C) problem and the APD enhancement (APD-E) problem. For APD-E problem resolving, the present APD must be taken into consideration for subsequent extensions. This paper proposes a goal-programming-driven model (GM) integrated with a genetic algorithm and an embedded mask mechanism to optimally resolve both the MO-APD-C and MO-APD-E problems in the same model. The GM formulates the target deployment subject to four constraints: budget, coverage rate, capacity requirement and signal interference. In addition, to replicate real wireless communication, the GM addresses the dynamic capacity requirement of the user. Two experiments are designed to validate the feasibility of the GM and compare the experiment results with the Tabu search algorithm. The experimental results of experiment 1 demonstrate that GM can increase 5% networking capacity and decrease 10% interference rate by using less APs and therefore lowering cost. The experimental results of experiment 2 further validate the usefulness of the proposed method to resolve both the APD-C and APD-E problems steadily. © 2015 IEEE.
    Relation: 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/SNPD.2015.7176223
    DOI: 10.1109/SNPD.2015.7176223
    Appears in Collections:[資訊管理學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML156View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback