By Topic

RRBS: Reliable broadcasting over unreliable wireless links in resilient 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
$31 $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)
Fu-Wen Chen ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Jung-Chun Kao

This paper addresses the minimum transmission broadcast problem in resilient ad-hoc networks and presents efficient solutions, including centralized heuristic algorithms and a distributed algorithm. In disaster-resilient networks, wireless links are unreliable due to harsh environments. Distinct from related work in the literature which typically assumes wireless links are reliable, we address the issue of broadcasting over both reliable wireless links and unreliable wireless links. Our main contributions are as follows: First, we develop heuristic algorithms for both reliable- and unreliable-link model. Second, we propose a distributed algorithm based on 1-hop neighbor information. Using simulation, we confirm that the proposed heuristic algorithms can reduces the number of transmissions significantly and the proposed distributed algorithm performs comparably well to the centralized heuristic algorithms in terms of both delivery ratio and the number of transmissions.

Published in:

Wireless Personal Multimedia Communications (WPMC), 2012 15th International Symposium on

Date of Conference:

24-27 Sept. 2012