Abstract
This paper addresses the minimum transmission broadcast problem in resilient ad-hoc networks and presents efficient solutions, including centralized heuristic algorithms and a distributed algorithm. In disaster-resilient networks, wireless links are unreliable due to harsh environments. Distinct from related work in the literature which typically assumes wireless links are reliable, we address the issue of broadcasting over both reliable wireless links and unreliable wireless links. Our main contributions are as follows: First, we develop heuristic algorithms for both reliable-and unreliable-link model. Second, we propose a distributed algorithm based on 1-hop neighbor information. Using simulation, we confirm that the proposed heuristic algorithms can reduces the number of transmissions significantly and the proposed distributed algorithm performs comparably well to the centralized heuristic algorithms in terms of both delivery ratio and the number of transmissions. © 2012 NiCT.