English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51719062      Online Users : 652
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/75829


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75829


    Title: Resource delivery path dependent deployment scheduling for contingency cellular network
    Authors: Lien, Yao-Nan;Kao, Tsai I.;Huang, Jyh-Shyan
    連耀南;高采衣;黃智賢
    Contributors: 資科系
    Keywords: Ad hoc networks;Algorithms;Communication;Disaster prevention;Disasters;Emergency services;Human resource management;Problem solving;Radio broadcasting;Ubiquitous computing;Disaster management;Disaster response;Emergency communication;Mobile communications;Natural disasters;Precedence constraints;Scheduling problem;Transportation capacity;Scheduling
    Date: 2014-04
    Issue Date: 2015-06-16 15:25:07 (UTC+8)
    Abstract: When a catastrophic natural disaster occurs, the efficiency of disaster response is crucial to life saving. However, mobile communication systems usually crashed due to various causes, making the coordination among a large number of disorganized disaster response workers extremely difficult. We propose a Contingency Cellular Network (CCN) by connecting disconnected base stations together with wireless links and portable power generators. Since the transportation capacity may be very limited, scheduling of CCN deployment order according to the demand of disaster response becomes an important issue. Two models aiming to maximize disaster response efficiency are proposed in this research. Emergency levels of disaster areas, time decreasing profit functions, traveling time of delivery path, and antecessor precedence constraint are taken into consideration in the CCNDS-AC model. The second model, CCNDS-UC is the same but with antecessor precedence constraint relaxed. Both problems are proven NP complete. Two heuristic but efficient algorithms are designed to solve the problems. Both algorithms can outperform our previous algorithm by a significant margin in our simulation experiments. This shows that the traveling time is a significant factor in designing an effective CCN deployment scheduling problem. © 2014 IEEE.
    Relation: 2014 IEEE International Conference on Pervasive Computing and Communication Workshops, PERCOM WORKSHOPS 2014, 2014, 論文編號 6815223, Pages 308-313, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops, PERCOM WORKSHOPS 2014; Budapest; Hungary; 24 March 2014 到 28 March 2014; 類別編號CFP14344-ART; 代碼 105241
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/PerComW.2014.6815223
    DOI: 10.1109/PerComW.2014.6815223
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML2930View/Open


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


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback