政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/113973
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51717655      Online Users : 589
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/113973


    Title: An Efficient Genetic Algorithm for the Power-Balanced Anycast Routing Problem in Static Ad Hoc Networks
    Authors: Sheu, Pi-Rong
    Li, Yu-Ting
    Keywords: 隨意網路;Anycast路徑繞送;NP完全性;基因演算法;電力考量;電力平衡
    Ad Hoc Network;Anycast Routing;NP-Completeness;Genetic Algorithm;Power-Aware;Power-Balanced
    Date: 2005
    Issue Date: 2017-10-23 14:21:47 (UTC+8)
    Abstract: 在本論文中我們將考慮如何設計一個anycast路徑繞送演算法來有效地安排anycast之傳送需求以使得每一個節點的電力消耗能盡可能地平均。在本論文中，我們將證明如此之電力平衡anycast路徑繞送問題為一個NP-complete的問題並為此問題設計一個以基因演算法為主之啟發式演算法。電腦模擬結果顯示我們的電力平衡anycast路徑繞送之基因演算法所產生的網路生命週期將較長於以最短路徑為主之anycast路徑繞送演算法以及其它傳統之電力平衡anycast路徑繞送演算法。
    In this paper, we will consider the problem of designing an anycast routing algorithm to efficiently arrange anycast transmission requirements such that the power consumption of each node is as even as possible. In this paper, we will prove the problem to be an NP-complete problem and use the principle of genetic algorithms to design a novel heuristic algorithm for the difficult problem. Computer simulations verify that the power consumptions of networks generated by our genetic power-balanced anycast routing algorithm are more balanced than those generated by shortest-path-based anycast routing algorithms and other traditional power-balanced anycast routing algorithms.
    Relation: TANET 2005 台灣網際網路研討會論文集
    行動簡易模式無線網路與無線監測網路
    Data Type: conference
    Appears in Collections:[TANet Conference] Conference Papers

    Files in This Item:

    File Description SizeFormat
    449.pdf298KbAdobe PDF2241View/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