hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2005.03.02

A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network

Ziping Liu
Bidyut Gupta

Puni tekst: engleski, pdf (314 KB) str. 177-194 preuzimanja: 487* citiraj
APA 6th Edition
Liu, Z. i Gupta, B. (2005). A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network. Journal of computing and information technology, 13 (3), 177-194. https://doi.org/10.2498/cit.2005.03.02
MLA 8th Edition
Liu, Ziping i Bidyut Gupta. "A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network." Journal of computing and information technology, vol. 13, br. 3, 2005, str. 177-194. https://doi.org/10.2498/cit.2005.03.02. Citirano 25.02.2021.
Chicago 17th Edition
Liu, Ziping i Bidyut Gupta. "A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network." Journal of computing and information technology 13, br. 3 (2005): 177-194. https://doi.org/10.2498/cit.2005.03.02
Harvard
Liu, Z., i Gupta, B. (2005). 'A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network', Journal of computing and information technology, 13(3), str. 177-194. https://doi.org/10.2498/cit.2005.03.02
Vancouver
Liu Z, Gupta B. A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network. Journal of computing and information technology [Internet]. 2005 [pristupljeno 25.02.2021.];13(3):177-194. https://doi.org/10.2498/cit.2005.03.02
IEEE
Z. Liu i B. Gupta, "A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network", Journal of computing and information technology, vol.13, br. 3, str. 177-194, 2005. [Online]. https://doi.org/10.2498/cit.2005.03.02

Sažetak
Mobile ad hoc network is a wireless mobile network that does not have any base station or other central control infrastructure. Design of efficient multicast routing protocols in such network is challenging, especially when the mobile hosts move faster. Shared tree routing protocol is a widely used multicast routing protocol in ad hoc network. However, there are problems in end-to-end delay and network throughput for this protocol. In this paper, we propose a protocol to improve the inherent problem of large end-to-end delay in shared tree method as a modification to the existing multicast Ad hoc On-demand Distance Vector (MAODV) routing for low mobility network. The protocol uses n-hop local ring search to establish new forwarding path and limit flooding region. We then propose an extension to our proposed protocol, which uses periodic route discovery message to improve the network throughput for high mobility network. Simulation results demonstrate the improvement with average end-to-end delay in low mobility case as well as high packet delivery ratio in high mobility case

Hrčak ID: 44686

URI
https://hrcak.srce.hr/44686

Posjeta: 677 *