broadcast routing based on new link cost model for ad-hoc networks
For many wireless applications such as group conference and digital audio/video broadcast, it is necessary to send data to all devices that form an ad-hoc network. In this paper, minimum cost broadcast routing (MCBR) and minimum cost broadcast routing with forbidden set (MCBRF) are proposed. We first formulate a new cost model for the underlying graph by considering the distance between nodes, the remaining battery energy, and battery discharge pattern at each node. A minimum cost broadcast routing (MCBR) based on minimum cost graph spanning is described. Then forbidden set is introduced into MCBR to obtain MCBRF. The performance of the algorithms is investigated through simulations and contrasted against several other routing methods. A set of performance metrics are defined. The results on a variety of topologies of different sizes indicate that the spanning tree constructed by MCBRF algorithm has more leaf nodes than BIP and MMLE. Although the broadcast trees constructed by MWIS and MCDS have more leaf nodes, they suffer serious drawbacks in terms of energy consumption. Also, MCBR and MCBRF generate spanning trees that select nodes with higher remaining battery capacity as relay nodes. Thus more robust broadcast routes are established.
broadcast routing cost model ad-hoc network forbidden set bottleneck lifetime minimum cost spanning tree