作者: Hassan Chizari , Majid Hosseini , Shaharuddin Salleh , Shukor Abd Razak , Abdul Hanan Abdullah
DOI: 10.1007/S11227-010-0470-7
关键词:
摘要: MultiPoint Relay (MPR) selection algorithm is a flooding technique for propagating broadcast message inside an ad-hoc network which reduces the number of unnecessary messages in order to save more energy network, minimize packet collisions, and speed up propagation time. In this paper, we demonstrate that MPR application Set Covering Problem (SCP). A few optimization methods are developed work find optimum solution including Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), new greedy algorithm. Extensive simulations set evaluate methods. The named Energy eFficient or EF-MPR short. simulation results show can reduce nodes 19%. Moreover, power-consumption 12% time by 9%.