English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51717873      Online Users : 587
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


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


    Title: Optimal and Heuristic Algorithms for the Power-Based QoS Multiple Routing Problem for Mobile Ad Hoc Networks
    Authors: Sheu, Pi-Rong
    Chien, Chia-Hung
    Liao, Wei-Sheng
    Li, Yu-Ting
    Chen, Zhi-Cheng
    Keywords: 隨意網路;多重路徑繞送;電力考量;路徑繞送;服務品質
    Ad Hoc Network;Multiple Routing;Power-Aware;Routing;Quality of Service
    Date: 2005
    Issue Date: 2017-10-23 14:22:06 (UTC+8)
    Abstract: 在本篇論文中，我們將要探討如何為隨意網路之多個來源節點找尋多條路徑來將它們的資料封包繞送到它們各自的目的節點並且保證在整個資料封包的繞送過程中都不會發生電力不足的情況。這個問題已經被証明是一個NP-complete問題。在本篇論文中，根據網路流量的原理和線性規劃的技巧，我們將提出一個整數線性規劃公式來求解這個問題的最佳解。此外，基於Dijkstra’s演算法的技巧，我們也將提出擁有較低時間複雜度的啟發式演算法來求解這個問題的次佳解。電腦模擬結果顯示我們的啟發式演算法所求得的次佳解是相當接近最佳解的。
    In this paper, we will consider the problem of searching for multiple paths between multiple pairs of sources and destinations satisfying the power requirement in a mobile ad hoc network. The problem has been proved to be an NP-complete problem. In this paper, according to the principle of network flow and linear programming techniques, we will propose an integer linear programming formula to generate the optimal solution for this problem. Furthermore, based on the Dijkstra’s algorithm, efficient heuristic algorithms with low time complexities are developed. Computer simulations verify that the suboptimal solutions generated by our heuristic algorithms are very close to the optimal ones.
    Relation: TANET 2005 台灣網際網路研討會論文集
    行動簡易模式無線網路與無線監測網路
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    450.pdf245KbAdobe PDF2169View/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