• Title/Summary/Keyword: Overlay Ad hoc Multicast

Search Result 16, Processing Time 0.028 seconds

Overlay Multicast in Wireless Ad Hoc Networks (무선 ad-hoc 망에서의 Overlay Multicast 지원 방안)

  • 김혜원
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.345-348
    • /
    • 2003
  • Overlay multicast is proposed as an alternative approach for providing muticast services. A logical infrastructure is built to form an overlay network on top of the physical layer. In this paper, we propose an efficient overlay multicast in wireless ad hoc networks. The overlay multicast tree adapts to the changes in underlying networks. The multicast tree adjusted according to the local member information.

  • PDF

Performance Evaluation and Analysis of Implicit Cluster-based Ad hoc Multicast Mechanism (암시적 클러스터기반 애드 혹 멀티캐스트 기법 성능 평가 및 분석)

  • Choi, Young-Hwan;Park, Soo-Chang;Lee, Eui-Sin;Yu, Fucai;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.457-461
    • /
    • 2008
  • Previous studies on overlay ad hoc multi-casting are mainly divided into two categories: hierarchical structure-based multicast schemes and non-hierarchical structure-based multicast schemes. They do not reflect their real-time location information for routing updates. This can be a cause of low performance on energy consumption, throughput, and latency. For improving the problems, we propose an implicit cluster based overlay ad hoc multicast scheme with analysis of related work, and then we evaluate performance through computer simulation.

A Performance Analysis of Region-based Overlay Multicast Routing Protocol for Ad Hoc Networks (Ad Hoc 네트워크를 위한 지역기반 오버레이 멀티캐스트 라우팅 프로토콜의 성능 분석)

  • Kim Kap-Dong;Park Jun-Hee;Lee Kwang-Il;Kim Hag-Young;Kim Sang-Ha
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.1037-1040
    • /
    • 2006
  • This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

  • PDF

Overlay Multicast using Geographic Information in MANET (MANET에서의 지리 정보를 이용한 오버레이 멀티캐스트)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.4
    • /
    • pp.359-364
    • /
    • 2007
  • Current researches on the overlay multicast mechanism in the mobile ad hoc network (MANET) maintain the network topology information of the dynamically changing MANET, which may cause severe overhead. In this paper, we propose a new overlay multicast mechanism, the region-based overlay multicast in MANET(ROME), using the geometric locations of group members. In ROME, the physical topology is divided into small regions and the scope of location updates of group members is limited to a single region. ROME provides scalability by using the coordinate of the center point of a destination region as the destination of a data packet instead of the list of member addresses of that region. Our simulation results show that ROME gives better performance in terms of the packet overhead than other schemes.

A Study on Hierarchical Overlay Multicast Architecture in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크를 위한 계층적 오버레이 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Park, Jun-Hee;Lee, Kwang-Il;Kim, Hag-Young;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.627-634
    • /
    • 2006
  • Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

A Scalable Multicasting with Group Mobility Support in Mobile Ad Hoc Networks

  • Kim, Kap-Dong;Lee, Kwang-Il;Park, Jun-Hee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.1-7
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.

Adaptive Overlay Trees for Tradeoffs between Delay and Energy Consumption in Multicast on Static Ad Hoc Networks (정적 애드혹 네트워크 멀티캐스트에서 지연 시간과 에너지 소비의 트레이드오프를 위한 적응 오버레이 트리)

  • Moh, Sang-Man
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.791-800
    • /
    • 2009
  • Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

A Simple CBT-Based Overlay Multicast Protocol for Ad-Hoc Networks (Ad-Hoc 네트워크에서의 간단한 CBT 기반의 Overlay 멀티캐스트 프로토콜)

  • Yang, Ki-Seon;Lee, Won-Jun
    • Annual Conference of KIPS
    • /
    • 2003.05b
    • /
    • pp.1393-1396
    • /
    • 2003
  • 멀티캐스트 그룹의 멤버들만으로 트리를 구성하는 Overlay 멀티캐스트 프로토콜인 AMRoute은 이동이 빈번한 Ad hoc 네트워크 환경에서 중간 라우터의 이동에 대한 트리의 견고함으로 높은 데이터 전송을 제공하는 장점이 있으나, 네트워크의 변동으로 인하여 중복되는 전송 경로가 발생하여 대역폭이 낭비되는 효율성 문제를 가지고 있다. 본 논문에서는 기존의 AMRoute 제어 메시지에 각 멤버의 메쉬 링크 상태 정보가 추가된 제어 메시지를 통하여 멤버간에 장치 상태를 교환함으로써 AMRoute에서의 중복되는 전송 경로를 제거하여 대역폭의 낭비를 줄이는 방안을 제안한다. 본 논문에서 제안한 방안은 기존의 제어 메시지를 활용함으로써 적은 오버헤드로 새로운 메쉬 링크를 발견하여 기존의 AMRoute의 중복되는 전송 경로로 인한 대역폭의 낭비를 줄여 멀티캐스트의 성능을 향상시키는 효과를 기대할 수 있다.

  • PDF

A Study on Logical Cooperative Entity-Based Multicast Architecture Supporting Heterogeneous Group Mobility in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크에서 이질적 그룹 이동성을 지원하는 논리적 협업 개체 기반의 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.171-178
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.