By Topic

Bandwidth-Satisfied Multicast Trees in MANETs

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

3 Author(s)
Chia-Cheng Hu ; Dept. of Inf. Manage., Naval Acad., Kaohsiung ; Wu, E.H.-K. ; Gen-Huey Chen

Previous quality-of-service (QoS) routing/multicasting protocols in mobile ad hoc networks determined bandwidth-satisfied routes for QoS applications. However, they suffer from two bandwidth-violation problems, namely, the hidden route problem (HRP) and the hidden multicast route problem (HMRP). HRP may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Similarly, HMRP may arise when multiple flows are permitted concurrently. Not considering the bandwidth consumption of two-hop neighbors is the reason that the two problems are introduced. In this paper, a novel algorithm that can avoid the two problems is proposed to construct bandwidth-satisfied multicast trees for QoS applications. Furthermore, it also aims at minimizing the number of forwarders so as to reduce bandwidth and power consumption. Simulation results show that the proposed algorithm can improve the network throughput.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:7 ,  Issue: 6 )