RAMRP Protocol for Reliable Multicasting in Wireless Ad-hoc Nerwork Environments 


Vol. 27,  No. 5, pp. 484-494, May  2002


PDF
  Abstract

In wireless ad-hoc network environments, packet retransmissions and route reconstructions caused by link failures can be more frequent than in the wired network environments. Therefore, when the multicasting is performed in wireless ad-hoc network environments, new multicasting schemes that are designed with the consideration of these problems should be used. In other words, for multicasting in wireless ad-hoc networks, development of the multicasting technologies reducing transmission delays and packet losses that occur due to the changes of links in a multicast tree are required. In this paper, we propose a RAMRP (Reliable Ad-hoc Multicast Routing Protocol) protocol that supports an efficient multicasting in wireless ad-hoc networks. RAMRP protocol uses a link soundness based route construction method, an agent based ACK strategy, and a buffering technology. It also provides a reliable multicasting scheme suitable for wireless ad-hoc networks by reducing route reconstructions and packet retransmissions.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Y. Park and Y. I. Eom, "RAMRP Protocol for Reliable Multicasting in Wireless Ad-hoc Nerwork Environments," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 484-494, 2002. DOI: .

[ACM Style]

Sang Yun Park and Young Ik Eom. 2002. RAMRP Protocol for Reliable Multicasting in Wireless Ad-hoc Nerwork Environments. The Journal of Korean Institute of Communications and Information Sciences, 27, 5, (2002), 484-494. DOI: .

[KICS Style]

Sang Yun Park and Young Ik Eom, "RAMRP Protocol for Reliable Multicasting in Wireless Ad-hoc Nerwork Environments," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 484-494, 5. 2002.