Overlay multicast routing architecture in mobile wireless network

Authors:
Backhyun Kim;Iksoo Kim
Affiliations:
Department of Information and Telecommunication Engineering, University of Incheon, Incheon, Korea;Department of Information and Telecommunication Engineering, University of Incheon, Incheon, Korea
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 2
Cited 0

Scenario-based performance analysis of routing protocols for mobile ad-hoc networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.