By Topic

An optimum branching-based efficient distributed broadcast scheme for wireless ad hoc networks

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

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

In Ad hoc networks, links between nodes may be asymmetric for many reasons. In general, a graph with asymmetric link costs provides a more realistic network modeling perspective. In an earlier work, we proposed a broadcast routing scheme based on Edmonds algorithm for ad hoc networks with asymmetric link costs. The method involved setting up link state, finding minimum in-edge, detecting cycles, re-weighting and breaking cycles. In this paper, the distributed implementation of the method is examined. In centralized routing algorithms, link state and other relevant information are kept in the routing table of each node. In order to obtain such information, global information exchanges are required which incur high overhead and waste of energy resources. In contrast, the distributed implementation of the Edmonds-based broadcast routing only calls for local information exchanges. The distributed algorithm is compared against distributed BIP and MCDS using different performance metrics.

Published in:

Internet, 2009. AH-ICI 2009. First Asian Himalayas International Conference on

Date of Conference:

3-5 Nov. 2009