By Topic

BREAC: Broadcast Routing Based on Edmonds Algorithm for Ad Hoc Networks with Asymmetric Cost Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li-Sheng Chen ; Dept. of Electron. Eng., Nat. Ilan Univ., Ilan, Taiwan ; Hwang-Cheng Wang

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.

Published in:

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

24-26 Sept. 2009