The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam makalah ini kami menghuraikan algoritma penghalaan berbilang hantaran, yang dibina di atas ejen multicast mudah alih bagi rangkaian ad-hoc. Ejen multicast mudah alih (MMA) membentuk tulang belakang maya rangkaian ad-hoc dan mereka menyediakan penemuan pokok multicast, penyelenggaraan pokok multicast dan penghantaran datagram. Mula-mula, kami membina struktur hierarki kelompok-tulang belakang untuk rangkaian ad-hoc. Kedua, kami mencadangkan algoritma penghalaan multicast, yang diilhamkan oleh protokol penghalaan Ad-hoc On-Demand Distance Vector (AODV). Keputusan menunjukkan bahawa algoritma multicast MMA boleh memudahkan penemuan pokok multicast, mengurangkan overhed kawalan rangkaian, dan meningkatkan jumlah pemprosesan rangkaian, berbanding dengan operasi multicast AODV am. Kami juga mengatasi kekurangan penghalaan multicast CBRP, yang memberi banyak beban kepada ketua kluster.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Xin WANG, Fei LI, Susumu ISHIHARA, Tadanori MIZUNO, "A Multicast Routing Algorithm Based on Mobile Multicast Agents in Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2087-2094, August 2001, doi: .
Abstract: In this paper we describe a multicast routing algorithm, which builds upon mobile multicast agents of an ad-hoc network. Mobile multicast agents (MMAs) form a virtual backbone of an ad-hoc network and they provide multicast tree discovery, multicast tree maintenance and datagram delivery. First, we construct a cluster-spine hierarchy structure for an ad-hoc network. Second, we propose a multicast routing algorithm, which is inspired by Ad-hoc On-Demand Distance Vector (AODV) routing protocol. The results show that the MMA multicast algorithm can simplify the multicast tree discovery, reduce control overhead of the network, and increase the total network throughput, in comparison with general AODV multicast operation. We also overcome the deficiency of CBRP multicast routing, which places much burden on cluster heads.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2087/_p
Salinan
@ARTICLE{e84-b_8_2087,
author={Xin WANG, Fei LI, Susumu ISHIHARA, Tadanori MIZUNO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Multicast Routing Algorithm Based on Mobile Multicast Agents in Ad-Hoc Networks},
year={2001},
volume={E84-B},
number={8},
pages={2087-2094},
abstract={In this paper we describe a multicast routing algorithm, which builds upon mobile multicast agents of an ad-hoc network. Mobile multicast agents (MMAs) form a virtual backbone of an ad-hoc network and they provide multicast tree discovery, multicast tree maintenance and datagram delivery. First, we construct a cluster-spine hierarchy structure for an ad-hoc network. Second, we propose a multicast routing algorithm, which is inspired by Ad-hoc On-Demand Distance Vector (AODV) routing protocol. The results show that the MMA multicast algorithm can simplify the multicast tree discovery, reduce control overhead of the network, and increase the total network throughput, in comparison with general AODV multicast operation. We also overcome the deficiency of CBRP multicast routing, which places much burden on cluster heads.},
keywords={},
doi={},
ISSN={},
month={August},}
Salinan
TY - JOUR
TI - A Multicast Routing Algorithm Based on Mobile Multicast Agents in Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2087
EP - 2094
AU - Xin WANG
AU - Fei LI
AU - Susumu ISHIHARA
AU - Tadanori MIZUNO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2001
AB - In this paper we describe a multicast routing algorithm, which builds upon mobile multicast agents of an ad-hoc network. Mobile multicast agents (MMAs) form a virtual backbone of an ad-hoc network and they provide multicast tree discovery, multicast tree maintenance and datagram delivery. First, we construct a cluster-spine hierarchy structure for an ad-hoc network. Second, we propose a multicast routing algorithm, which is inspired by Ad-hoc On-Demand Distance Vector (AODV) routing protocol. The results show that the MMA multicast algorithm can simplify the multicast tree discovery, reduce control overhead of the network, and increase the total network throughput, in comparison with general AODV multicast operation. We also overcome the deficiency of CBRP multicast routing, which places much burden on cluster heads.
ER -