TY - GEN
T1 - Solving minimum power broadcast problem in wireless ad-hoc networks using Genetic Algorithm
AU - Wu, Xiang
AU - Wang, Xinheng
AU - Liu, Rui
PY - 2008
Y1 - 2008
N2 - A novel permutation encoded Genetic Algorithm (GA) is proposed for solving the minimum power broadcast (MPB) problem in wireless ad-hoc networks. The problem has been proven to be non-deterministic polynomial (NP) complete, and diverse heuristic algorithms were reported solve this problem recently. In this study, the MPB problem has been mathematically formulated to a constrained optimisation problem using a graph representation, and GA-based approach is developed to cooperate with deterministic greedy-like algorithm to obtain the MPB tree. The powerful search capability of GA is a key factor improving the system performance in terms of the total consumption power. A variety of simulations were conducted to examine the performance of the proposed GA approach, and the results indicate that the proposed GA approach significantly outperforms the greedy-based Broadcast Incremental Power (BIP) algorithm and exhibits competitive search strength compared with other recently proposed optimisation methods.
AB - A novel permutation encoded Genetic Algorithm (GA) is proposed for solving the minimum power broadcast (MPB) problem in wireless ad-hoc networks. The problem has been proven to be non-deterministic polynomial (NP) complete, and diverse heuristic algorithms were reported solve this problem recently. In this study, the MPB problem has been mathematically formulated to a constrained optimisation problem using a graph representation, and GA-based approach is developed to cooperate with deterministic greedy-like algorithm to obtain the MPB tree. The powerful search capability of GA is a key factor improving the system performance in terms of the total consumption power. A variety of simulations were conducted to examine the performance of the proposed GA approach, and the results indicate that the proposed GA approach significantly outperforms the greedy-based Broadcast Incremental Power (BIP) algorithm and exhibits competitive search strength compared with other recently proposed optimisation methods.
UR - http://www.scopus.com/inward/record.url?scp=49649114329&partnerID=8YFLogxK
U2 - 10.1109/CNSR.2008.91
DO - 10.1109/CNSR.2008.91
M3 - Conference Proceeding
AN - SCOPUS:49649114329
SN - 9780769531359
T3 - Proceedings of the 6th Annual Communication Networks and Services Research Conference, CNSR 2008
SP - 203
EP - 207
BT - Proceedings of the 6th Annual Communication Networks and Services Research Coference, CNSR 2008
T2 - 6th Annual Communication Networks and Services Research Conference, CNSR 2008
Y2 - 5 May 2008 through 8 May 2008
ER -