EF-MPR,a new energy eFficient multi-point relay selection algorithm for MANET |
| |
Authors: | Hassan Chizari Majid Hosseini Shaharuddin Salleh Shukor Abd Razak Abdul Hanan Abdullah |
| |
Affiliation: | (1) Intel Asia Pacific, Research and Development Ltd., 2nd floor, Block 4, 555 Dong Chuan Road, Shanghai, Zizhu Science Park, 200241, PRC |
| |
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%. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|