Please use this identifier to cite or link to this item:

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 台灣網際網路研討會] 會議論文

Files in This Item:

File Description SizeFormat
449.pdf298KbAdobe PDF221View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing