Salleh, S. and Razak, S.A. and Abdullah, A.H and Hosseini, M. and Chizari, H. (2010) EF-MPR, a new energy efficient multi-point relay selection algorithm for MANET. Journal of Supercomputing, 59 (2). pp. 744-761. ISSN 0920-8542
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s11227-010-0470-7
MultiPoint Relay (MPR) selection algorithm is a fooding technique for propagating a broadcast message inside an ad-hoc network which reduces the number of unnecessary broadcast messages in order to save more energy in the network, minimize the number of packet collisions, and speed up the propagation time. In this paper, we demonstrate that MPR selection is an application of Set Covering Problem (SCP). A few optimization methods are developed in this work to ?nd the optimum solution including Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), and a new greedy algorithm. Extensive simulations are set up to evaluate the developed methods. The new algorithm is named Energy eF?cient MPR or EF-MPR in short. The simulation results show that EF-MPR can reduce the number of MPR nodes up to 19%. Moreover, EF-MPR algorithm reduces the power-consumption of network up to 12% and speed up the propagation time by 9%.
|Uncontrolled Keywords:||genetic algorithms, mobile ad hoc network, multipoint relay, optimization, simulated annealing, tabu search|
|Deposited By:||Liza Porijo|
|Deposited On:||28 Jun 2012 01:44|
|Last Modified:||18 Aug 2014 03:42|
Repository Staff Only: item control page