Minimum Cost Broadcast Routing with Forbidden Set for Ad-Hoc Networks

In many wireless applications, it is necessary for one device in an ad-hoc network to send data to all the other devices. In this paper, broadcast routing algorithms that aim to minimize the cost of the routing path are proposed. A new cost model is formulated by taking into account the remaining battery energy and battery discharge profile at each node. A minimum cost broadcast routing scheme based on spanning tree algorithm is presented. A second routing protocol is obtained by incorporating the notion of forbidden set. The difference between these and other approaches is highlighted by showing the broadcast trees constructed by each method. Performance is then investigated using several meaningful metrics. The results indicate that the proposed schemes can produce more robust broadcast routes.