In this paper we propose overlay multicast (Mcast) routing architecture that uses basic trees and their neighboring mobile nodes (NMN) in mobile wireless network. The basic trees are generated according to hop-counts from mobile nodes (MN) toward base node. NMNs are 1-hop away from a MN and exist in other basic trees. NMNs identify only whether they have Mcast group MNs in mapping table, and never broadcast MNs' Mcast request. But MNs on an identical basic tree must broadcast Mcast request to parent or child MNs when they don't have Mcast group in mapping table. MNs don't have Mcast routing table but have only mapping table to convert logical address into physical IP address. The proposed Mcast routing architecture has effectiveness to solve shortcomings in mobile wireless network and sensor networks since it can decrease effectively flooding traffic restricted to MNs on a basic tree. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kim, B., & Kim, I. (2005). Overlay multicast routing architecture in mobile wireless network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 354–359). Springer Verlag. https://doi.org/10.1007/11557654_43
Mendeley helps you to discover research relevant for your work.