Bandwidth-Satisfied Multicast Trees in MANETs

Authors:
Chia-Cheng Hu;Eric Hsiao-Kuang Wu;Gen-Huey Chen
Affiliations:
-;-;-
Venue:
IEEE Transactions on Mobile Computing
Year:
2008

Citing 0
Cited 6

An energy-efficient, distributed wireless multicast protocol based on concurrent CTS and N2 connectivity

Wireless Networks
Delay-sensitive routing in multi-rate MANETs

Journal of Parallel and Distributed Computing
Efficient cross-layer protocol for bandwidth-satisfied multicast in multi-rate MANETs

Wireless Networks
Review: Review of multicast routing mechanisms in mobile ad hoc networks

Journal of Network and Computer Applications
Bandwidth-satisfied routing in multi-rate MANETs by cross-layer approach

Wireless Communications & Mobile Computing
QoS routing in wireless sensor networks—a survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, named 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. Without considering the bandwidth consumption of two-hop neighbors is the reason why 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. Further, it also aims to minimize the number of forwarders so as to reduce bandwidth and power consumption. Simulation results show that the proposed algorithm can improve the network throughput.