Name
Abstract | ||
|---|---|---|
MultiPoint Relay (MPR) selection algorithm is a flooding 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 find 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 eFficient 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%. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11227-010-0470-7 | The Journal of Supercomputing |
Keywords | Field | DocType |
Genetic algorithms,Mobile ad hoc network,Multipoint relay,Optimization,Simulated annealing,Tabu search | Simulated annealing,Set cover problem,Mathematical optimization,Computer science,Selection algorithm,Network packet,Greedy algorithm,Multipoint relay,Tabu search,Genetic algorithm,Distributed computing | Journal |
Volume | Issue | ISSN |
59 | 2 | 0920-8542 |
Citations | PageRank | References |
1 | 0.36 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hassan Chizari | 1 | 52 | 6.20 |
| Majid Hosseini | 2 | 12 | 1.13 |
| Shaharuddin Salleh | 3 | 158 | 16.65 |
| Shukor Abd Razak | 4 | 112 | 13.67 |
| Abdul Hanan Bin Abdullah | 5 | 566 | 48.77 |