政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111989
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113303/144284 (79%)
Visitors : 50835061      Online Users : 990
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
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/111989


    Title: Cross Network Topology Design for Contingency Cellular Network
    Authors: 連耀南
    Lien, Yao-Nan
    Huang, Kuan-Chieh
    Huang, Jyh-Shyan
    Contributors: 資訊科學系
    Keywords: Ad Hoc Network;Deployment Scheduling;Disaster Management;Emergency Communication;Mobile Communication
    Date: 2014
    Issue Date: 2017-08-16 17:04:55 (UTC+8)
    Abstract: When stricken by a large-scale disaster, the efficiency of disaster response operation is very critical to lifesaving. However, communication systems, such as cellular networks, usually crashed due to various causes making coordination among disorganized disaster responders extremely difficult. Unfortunately, rapid deployment of many existing emergency communication systems relies on a good transportation system, which is usually not available in a catastrophic natural disaster. We proposed a Contingency Cellular Network (CCN) for emergency communication by connecting disconnected base stations together with wireless links and constructing a multi-hop cellular network. CCN can support existing mobile phone users with reduced capability. Such a system can support a large number of disaster responders in the early hours of a catastrophic natural disaster, thus save many lives. This paper addresses the design of forwarding topology using multiple operator`s base stations aiming to maximize the efficiency of disaster response. We take the degree of emergency and population of each stricken area as the priority measure as well as the available resources as the constraint to determine the topology. The CCN Cross Network Topology Design problem is modeled as a K-Maximum Spanning Tree Problem. The problem is proven NP Hard. We also designed a few efficient heuristic algorithms to solve the problem when it is needed in urgent. © 2014 IEEE.
    Relation: 2014 IEEE Canada International Humanitarian Technology Conference, IHTC 2014
    2014 IEEE Canada International Humanitarian Technology Conference, IHTC 2014; Montreal; Canada; 1 June 2014 到 4 June 2014; 類別編號CFP1406Y-ART; 代碼 113212
    Data Type: conference
    DOI link: http://dx.doi.org/10.1109/IHTC.2014.7147552
    DOI: 10.1109/IHTC.2014.7147552
    Appears in Collections:[Department of Computer Science ] Proceedings

    Files in This Item:

    File Description SizeFormat
    07147552.pdf773KbAdobe PDF2345View/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