Skip to Main Content
Broadcast is a common communication paradigm in wireless ad hoc networks. This is fulfilled by constructing a spanning tree for the underlying graph model based on link costs. We have investigated various ways in defining link cost function. The study shows that asymmetric link costs provide better modeling of the network. Under such circumstances, simple minimum spanning tree algorithms which deal with undirected graphs yield only sub-optimal broadcast paths. This has motivated us to propose broadcast routing based on Edmonds algorithm in this paper. The resulting broadcast routing scheme is called BREAC. The major steps of the algorithm are described and the implementation is examined. Differences between BREAC and existing methods are highlighted by depicting the broadcast trees generated by the individual methods. Performance of the methods is further compared using several metrics. The results indicate that BREAC prevails over the others in terms of path energy and lifetime.