Broadcasting strategy based on greedy and ant colony algorithm in mobile ad hoc networks

The broadcast is an important operation to transmit information and establish routing in mobile ad hoc networks (MANET). In order to solve the problem of link redundancy and broadcast storm in the broadcast process, a broadcast strategy based on the greedy ant colony algorithm (GACA) is proposed. Firstly, the objective function is established by combining the total transfer distance, the link quantities and the link qualities. Then, the GACA is used to achieve the minimum value of the objective function and plan the optimal path of information broadcast. Finally, the forwarding nodes relay the message according to the path requirement. Simulation results show that this strategy can reasonably utilize network resources, reduce information redundancy and avoid broadcast storms. © 2020, Editorial Office of Systems Engineering and Electronics. All right reserved.