Analysis and Solution of the Broadcasting Problem in a Multi-Hop Wireless Network

This paper investigates the problem of Area and Probability-Based Broadcasting with Simple Flooding broadcasting strategy in aMulti-hop wireless network consisting 100 fixed nodes in a 1000×1000 square meters area. The problem is to design a distributedbroadcasting algorithm such that each node in the network receives the broadcasting packet with probability not less than 85%. Theobjectives are minimizing the number of retransmissions and maximizing the transmission probability. Analysis of the search spacelandscape of this problem shows that the local optimums are close to each other and the landscape is rugged. The problem falls intothe ‘massif central’ category with a few deep valleys, while the best solutions are localized near the optimal solution. As a result,the best metaheuristic algorithms for solving this kind of problems are single solution-based metaheuristics. In this paper, a Recordto Record Travel (RRT) algorithm, which is a variant of the Simulated Annealing method, has been developed for solving theBroadcasting Problem in a Multi-Hop Wireless Network, and the computational results are reported.