• Title/Summary/Keyword: Multicast Mobility

Search Result 107, Processing Time 0.025 seconds

The QoS guaranteed seamless mobile multicast handover mechanism using probing based CAC and PMIPv6 (Probing 기반 수락제어와 PMIPv6를 이용한 품질보장 Seamless 모바일 멀티캐스트 핸드오버 메커니즘)

  • Kang, Hyun-Myoung;Choi, Hoan-Suk;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7B
    • /
    • pp.1018-1033
    • /
    • 2010
  • Recently, as the use of mobile terminal is generalized, the needs of high-speed Internet mobile service is increased. Also users want to receive the multimedia contents what they want through the various terminals in anywhere, anytime via wired and wireless integrated environment. Therefore, various mechanisms that support the mobility are proposed. However, these mechanisms are difficult to support seamless mobility and QoS awareness on the mobile multicast environment. In this paper, we propose a QoS aware handover mechanism that is able to provide the high-quality and real-time services such as mobile IPTV in an integrated environment for these requests of users. Proposed mechanism manages the multicast admission control and multicast handover using the 2-layer multicast information management at the wired and wireless integrated network that extended the service guaranteed methods through the probing based admission control of the wired network to the wireless network based on PMIPv6. We present a performance evaluation results and features analyzed by the simulations using the ㎱-2.

Sink-Initiated Geographic Multicasting Protocol for Mobile Sinks in Wireless Sensor Networks (무선 센서 망에서 이동 싱크를 위한 위치기반 멀티캐스팅 프로토콜)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.377-385
    • /
    • 2010
  • In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

A Cluster-Based Multicast Routing for Mobile Ad-hoc Networks (모바일 Ad-hoc 네트워크를 위한 클러스터 기반 멀티캐스트 라우팅)

  • An, Beong-Ku;Kim, Do-Hyeun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.9 s.339
    • /
    • pp.29-40
    • /
    • 2005
  • In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

Preconfigured Multicast Delivery Tree in Mobile IP (Mobile IP에서 기설정된 전달 트리를 이용한 멀티캐스팅 방안)

  • C.B. Chun;C.H. Kang;Lee, J.H.;Kwon, K.H.;Kim, B.S.;Hong, J.P.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.76-78
    • /
    • 2002
  • Multicasting over mobile IP network becomes more important with the increasing needs of supporting multimedia services in mobile network. The IETF has suggested two approaches which are remote subscription and bidirectional tunneling for supporting mobility management in multicasting over mobile IP. But these protocols have problems - the frequent reconstruction of multicast delivery tree, packet less during handoff, convergence problem, and so on. In this paper, we propose to use preconfiguration of multicast delivery tree when mobile host enters the foreign network. It will decrease the frequency of multicast delivery tree reconstruction, and reduce the packet loss during handoff, Also the multicast delivery tree maintained by Keep Alive messages makes the signaling overload of networks diminished.

  • PDF

A Study on an efficient handover scheme for real-time multicast services in PMIPv6 network (Proxy Mobile IPv6 기반 실시간 멀티캐스트 서비스를 위한 효율적인 핸드오버 방안에 대한 연구)

  • Kim, Jung-Hoon;Ryoo, In-Tae;Na, Won-Shik
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.4
    • /
    • pp.537-544
    • /
    • 2010
  • The PMIPv6 is a network controlled mobility management protocol in which mobile nodes never participate in IP mobility protocol signaling. One issue in using PMIPv6 for multicast service is that a new component should be added as the mobility management functions are located not on the device but on the network. Currently, standardization activities for providing muticast services with PMIPv6 have been actively in progress. This paper addresses some issues about the on-going standardization works for providing efficient real-time multicast services with PMIPv6, and proposes a scheme for minimizing hand over delays and packet losses by using a new neighbor cell reporting method. The proposed scheme has been verified to outperform the existing scheme in hand over delay and packet loss perfonnrmces by using computer simulations.

Hierarchical Mesh-based Multicast Routing Protocol for Ad-Hoc Networks (에드 혹 네트워크를 위한 계층적인 메쉬 기반 멀티캐스트 라우팅 프로토콜)

  • Kim, Ye-Kyung;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.586-601
    • /
    • 2001
  • We propose a mesh based multicast routing protocol referred to as HMMRP for ad-hoc networks. In HMMRP, a limited number of sources are selected as core sources, and the rest of the sources of a multicast group are connected to one of those core sources. The sources and the receivers of a multicast group are also connected through per source trees. In HMMRP, the data delivery mesh of a multicast group are composed of the nodes on these paths, and are reconfigured at regular intervals. Furthermore, each mesh member that lies on the paths between the sources and the core sources as well as be-tween the core sources and the receivers keeps checking if there is a symptom of mesh separation around itself. When a mesh member finds such symptom, it tries to patch itself to the mesh with a local flooding. As a result, the part of the data delivery mesh on those paths are kept connected with a lot higher probability than the rest of the data delivery mesh. That is, for a certain source receiver pair, it is very likely that at least there exists a data delivery path that route from the source to a core source and then to the receiver. Therefore, HMMRP may provide very high data delivery ratio without frequent entire data delivery mesh reconfiguration even when the nodal mobility is high. Simulation results show that HMMRP shows relatively little performance degradation with respect to mobility. Furthermore, the performance degradation with respect to mobility is even smaller when the size of the multicast group becomes larger.

  • PDF

An Efficient Multicast Scheme for Hierarchical Mobile IPv6 (계층적 Mobile IPv6를 위한 효율적 멀티캐스트 방안)

  • Kim, Byung-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.597-602
    • /
    • 2005
  • This paper proposes an efficient multicast scheme for the hierarchical mobile IPv6(HMIPv6). If a mobility anchor point(MAP) in a new domain does not support multicasting, an entering group member cannot join the multicast group through the new MAP The group member thus keeps receiving multicast packets from its home agent(HA) using Mobile IPv6 (MIPv6). This increases the propagation delay of binding update (BU) messages. However, our scheme enables an entering group member to keep receiving packets from the old multicast MAP. It can also reduce tunneling costs, total delivery costs and handover latency. We simulated the performance of our scheme by comparing it with the seamless multicast handover in a hierarchical mobile Pv6 (M-HMIPv6) using the delivery cost and handover latency factors.

Performance Comparison of Mobile Ad Hoc Multicast Routing Protocols (모바일 애드 혹 멀티캐스트 라우팅 프로토콜 성능분석)

  • Lee, Joo-Han;Cho, Jin-Woong;Lee, Jang-Yeon;Lee, Hyeon-Seok;Park, Sung-Kwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.173-179
    • /
    • 2008
  • An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.

  • PDF

An Efficient Multicast-based Binding Update Scheme for Network Mobility

  • Kim, Moon-Seong;Radha, Hayder;Lee, Jin-Young;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.1
    • /
    • pp.23-35
    • /
    • 2008
  • Mobile IP (MIP) is the solution supporting the mobility of Mobile Nodes (MNs), however, it is known to lack the support for NEtwork MObility (NEMO). NEMO manages situations when an entire network, composed of one or more subnets, dynamically changes its point of attachment to the Internet. NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this weakness, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents, especially when a large number of Mobile Routers (MRs) and MNs exist in the environment such as train, bus, ship, or aircraft. In this paper, a solution to reduce the cost of delivering the BU messages is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to 32.9% over IPDbased, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.