BREAC: broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model

Authors:
Li-Sheng Chen;Hwang-Cheng Wang
Affiliations:
Department of Electronic Engineering, National Ilan University, Taiwan;Department of Electronic Engineering, National Ilan University, Taiwan
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
An analytical high-level battery model for use in energy management of portable electronic systems

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Minimizing broadcast latency in ad hoc wireless networks

ACM-SE 45 Proceedings of the 45th annual southeast regional conference

Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.