• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.7-20
• /
• 2011

Recently, Proxy Mobile IPv6(PMIPv6) networks have been studied as the mobility management protocol to effectively use limited wireless resources. And the multicasting, which is core technology of the Internet broadcast system such as mobile IPTV, has been discussed mainly based on PMIPv6 network. However, multicasting based on PMIPv6 network causes disconnection of services because it does not solve problems of packet loss during binding and group joining procedure. Hence, we propose a seamless multicast scheme which prevents packet loss in PMIPv6 networks. The proposed scheme achieves lower latency than the existing scheme because it combines binding and group joining procedure, a1so it does not cause about packet losses due to performing buffering. We proved the performance using the simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1533-1546
• /
• 2013

Wireless multicast is considered as an effective transmission mode for the future mobile social contact services supported by Long Time Evolution (LTE). Though wireless multicast has an excellent resource efficiency, its performance suffers deterioration from the channel condition and wireless resource availability. Cognitive Radio (CR) and Device to Device (D2D) are two solutions to provide potential resource. However, resource allocation for cognitive wireless multicast based on D2D is still a great challenge for LTE social networks. In this paper, a joint sub-carriers and power allocation model based on D2D for general cognitive radio multicast (CR-D2D-MC) is proposed for Orthogonal Frequency-Division Multiplexing (OFDM) LTE systems. By opportunistically accessing the licensed spectrum, the maximized capacity for multiple cognitive multicast groups is achieved with the condition of the general scenario of imperfect spectrum sensing, the constrains of interference to primary users (PUs) and an upper-bound power of secondary users (SUs) acting as multicast source nodes. Furthermore, the fairness for multicast groups or unicast terminals is guaranteed by setting a lower-bound number of the subcarriers allocated to cognitive multicast groups. Lagrange duality algorithm is adopted to obtain the optimal solution to the proposed CR-D2D-MC model. The simulation results show that the proposed algorithm improves the performance of cognitive multicast groups and achieves a good balance between capacity and fairness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.91-107
• /
• 2014

Device-to-device (D2D) communication is an excellent technology to improve the system capacity by sharing the spectrum resources of cellular networks. Multicast service is considered as an effective transmission mode for the future mobile social contact services. Therefore, multicast based on D2D technology can exactly improve the spectrum resource efficiency. How to apply D2D technology to support multicast service is a new issue. In this paper, a resource allocation scheme based on cognitive radio (CR) for D2D underlay multicast communication (CR-DUM) is proposed to improve system performance. In the cognitive cellular system, the D2D users as secondary users employing multicast service form a group and reuse the cellular resources to accomplish a multicast transmission. The proposed scheme includes two steps. First, a channel allocation rule aiming to reduce the interference from cellular networks to receivers in D2D multicast group is proposed. Next, to maximize the total system throughput under the condition of interference and noise impairment, we formulate an optimal transmission power allocation jointly for the cellular and D2D multicast communications. Based on the channel allocation, optimal power solution is in a closed form and achieved by searching from a finite set and the interference between cellular and D2D multicast communication is coordinated. The simulation results show that the proposed method can not only ensure the quality of services (QoS), but also improve the system throughput.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.573-586
• /
• 2008

The improved performance and miniaturization of computer and the improvement of wireless communication technology have enabled the emergence of many high quality services. Among them multicast services are receiving much attention and their usage is increasing due to the increase of Internet multimedia services such as video conference, multimedia stream, internet TV, etc. Security plays an important role in mobile multicast services. In this paper, we proposed a secure multicast protocol for a hierarchical micro-mobility environment. The proposed secure multicast protocol provides security services such as authentication, access control, confidentiality and integrity using mechanisms including symmetric/asymmetric key crypto-algorithms and capabilities. To provide forward/backward secrecy and scalability, we used sub-group keys based on the hierarchical micro-mobility environment. With this security services, it is possible to guard against all kinds of security attacks performed by illegal mobile nodes. Attacks executed by internal nodes can be thwarted except those attacks which delete packet or cause network resources to be wasted. We used simulator to measure the performance of proposed protocol. As a result, the simulation showed that effect of these security mechanisms on the multicast protocol was not too high.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.445-447
• /
• 1999

이동호스트를 지원하는 이동네트웍에서의 멀티캐스팅 문제는 빈번한 그룹 멤버쉽의 변화와 함께 그룹 멤버의 위치 변화를 가져와 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 프로토콜을 적용하는 것은 적합하지 못하다. 이런 점에서 특히 Mobile IP를 기본 유니캐스팅 방법으로 사용하는 환경에서 이동호스트를 위한 몇가지 멀티캐스팅 방식이 제시되었으나, 비최적 경로의 데이터 전송, 비효율적인 데이터 중복 전송 또는 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 내포하고 있다. 따라서 본 논문에서는 이런 문제점을 좀 더 보완하면서 Mobile IP를 사용하는 이동호스트에게 IP 멀티캐스트를 제공하는 효과적인 프로토콜을 제안한다. 호스트의 이동성을 적극 반영하여 유동적으로 멀티캐스트 포워더(Multicast Forwarder)를 선정함으로서 데이터 전송 경로의 단축, 중복되는 데이터 전송의 감소와 같은 효과를 얻을 수 있고 그 결과를 시뮬레이션을 통하여 확인해 본다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.364-366
• /
• 2002

무선 환경에서 모바일 호스트는 네트웍 사이를 이동할 때에 핸드오프를 수행해야 한다. 본 논문에서는 이동 컴퓨팅 환경의 IP 멀티캐스트 전송 기법에서 핸드오프 중에 발생하는 패킷 손실을 줄이기 위한 버퍼링 기법을 제안하였다. 기존에 제시된 방법들은 모바일 노드의 핸드오프 동안 전송되어지는 패킷들을 이동 전에 서비스 해주는 FA가 버퍼링 하여핸드 오프 후에 전달해주거나, 핸드 오프 동안 이동 전ㆍ후의 FA 모두에게 멀티캐스트 하도록 하고 있다. 본 논문에서는 기존의 방법과는 달리 모바일 호스트가 네트웍들의 오버랩영역으로 이동하게 되면 버퍼링 수행 여부를 결정하고, 판단 결과에 따라 직접 버퍼링을 수행함으로써 핸드 오프 시 발생 할 수 있는 패킷 손실을 줄이도록 하고 있다. 이는 버퍼링 된 패킷의 포워딩 시간을 최소로 할 뿐 아니라 불필요한 버퍼링을 방지 할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.262-264
• /
• 2001

컴퓨터 네트웍 시스템에서 부각되고 있는 두 가지 중요한 추세는 아마도 ‘멀티미디어’와 ‘이동 컴퓨팅’일 것이다. 멀티캐스트는 멀티미디어 데이터가 차지하는 많은 네트웍 트래픽을 수신 컴퓨터들에게 효율적으로 분배함으로써 네트웍 트래픽을 줄일 수 있다. 그러나 이동 호스트를 지원하는 이동 네트웍에서의 멀티캐스팅은 빈번한 그룹 멤버쉽의 변화와 함께 그룹 멤버의 위치변화로 인해서 기존의 고정 호스트를 기본으로 설계된 멀티캐스트 프로토콜을 적용하는 것은 적합하지 못한다. 이런 점에서 Mobile IP를 기본 유니캐스팅 환경에서 채택하여 이동 호스트에게 멀티캐스트를 지원하기 위한 몇 가지 방법이 제시되었으나, 비최적 경로로의 데이터 전송, 비효율적인 데이터 중복 전송, 또는 빈번한 멀티캐스트 트리의 재구성으로 인한 오버헤드 등의 문제점을 내포하고 있다. 제안된 프로토콜에서는 이동 호스트에게 멀티캐스트 서비스를 제공하는 FMA(Foreign Multicast Agent)를 유동적으로 선정하고 이동 호스트가 가지는 타임아웃 값을 이용하여 이동성으로 인해 발생하는 문제점들을 완화시킴으로써, Mobile IP를 이용하는 이동 호스트에게 IP멀티캐스팅을 효과적으로 제공한다.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.109-116
• /
• 2017

Short-lived pseudonym certificates as vehicle identities could satisfy both security and privacy requirements. However, to remove revoked certificates especially in vehicle communications, pseudonym certificate revocation list (CRL) should be distributed resource-efficiently from a practical deployment point of view and in a timely manner. In this paper, we propose a novel CRL distribution scheme capable of CRL multicast to only activated vehicles registered to the CRL multicast group using the group communication system enabler, namely, the GCSE which is being standardized. The scheme is resource efficient by using CRL distribution paths instead of paging processes to find out multicast vehicle(s) within a certain region. The analyzed results show that the proposed scheme outperforms in terms of paging cost, packets transmission cost, and the processing cost at the respective entities compared to the existing four schemes in the literature.