• 제목/요약/키워드: Multicast Communications

검색결과 247건 처리시간 0.02초

On the Diversity-Multiplexing Tradeoff of Cooperative Multicast System with Wireless Network Coding

  • Li, Jun;Chen, Wen
    • Journal of Communications and Networks
    • /
    • 제12권1호
    • /
    • pp.11-18
    • /
    • 2010
  • Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.

이동성과 보안성 있는 멀티케스트 통신을 위한 군용 그룹 키 관리 (Military Group Key Management for Mobile and Secure Multicast Communications)

  • 정윤찬
    • 한국통신학회논문지
    • /
    • 제35권6B호
    • /
    • pp.977-983
    • /
    • 2010
  • 군용 네트워크에서는 이동성과 보안성을 지원하기 위하여 네트워크의 물리적 구성 형태와 상관없이 IPSec ESP 터널들이 Full mesh 형태로 IPSec 장치들을 연결하고 있으며 이 장치들 간에는 멀티케스트 통신이 필요하다. IPSec 장치들은 변화하는 IPSec 터널들을 지원하기 위하여 멀티케스트 그룹키를 동적으로 갱신시킬 수 있어야 한다. 또 특정한 그룹을 형성하는 전술 단말 측면에서도 그룹 구성원 간에 보안성 있는 멀티케스트 통신을 제공해 주어야 한다. 이러한 단말 그룹 구성원의 이동성을 지원하기 위해서는 멀티케스트 그룹 키가 동적으로 갱신되어야만 한다. 본 논문에서는 기존의 Diffie-Hellman (DH) 키 교환 방식 기술과 키 Tree 기술을 활용하여 동적인 상황변화에 따라 보안성 있게 그룹 키를 관리할 수 있도록 하는 방법을 제시한다. 제시하는 동적인 Tree 기반 키관리의 장점은 변화가 심한 그룹 구성원이 서로 상대방으로부터 주기적으로 상황 정보를 받도록 하여 변화하는 상황에 맞추어 효과적으로 그룹 키를 갱신할 수 있다는 점이다.

확장 멀티캐스트를 이용한 다중레벨 전자상거래 보안에 관한 연구 (A Study on the Multilevel Electronic Commerce Security using Scalable Multicast)

  • 서장원
    • 한국전자거래학회지
    • /
    • 제7권1호
    • /
    • pp.66-74
    • /
    • 2002
  • Through the increment of requirement for EC(Electronic Commerce) oriented communication services, security multicast communications is becoming more important. However, multicast to EC environment is much different from unicast concept most network security protocols. On the network security, using mandatory access control of multilevel architecture which assigns a specific meaning to each subject, so we accomplish access control. In this way, access control security based on the information security level is proposed. A security protocol based on the architecture proposed in this paper would be utilized in security multicast communications, group key management service and leveled security service through multilevel EC security policy, Also we discuss and propose the security level scaleability and key management method on the network.

  • PDF

HMIPv6 네트워크에서 단말기 이동성을 고려한 멀티캐스트 방안 (A Multicast Scheme considering the Terminal Mobility in HMIPv6 Networks)

  • 하정미;박상준;김병기
    • 한국시뮬레이션학회논문지
    • /
    • 제14권4호
    • /
    • pp.107-116
    • /
    • 2005
  • The multi user communications that is called as the multicast service should be applied into the evolving mobile networks. In this paper, we propose a fast multicast management scheme for mobile terminals in HMIPv6 (Hierarchical Mobile IPv6) based mobile networks. In HMIPv6 based mobile networks, we consider the mobile terminal mobility that the multicast management scheme during mobile handover is used for the multicast routing changing. The changing impact to the multicast routing Is determined from handovers in intra AR, and in inter AR or MAP. In this paper, we propose multicast supporting schemes that the tunneling scheme is used in intra AR handover, and the previous subscription scheme is used in inter AR handover for considering the changing impact of the multicast routing.

  • PDF

Multicast 패킷의 QoS 스위칭을 위한 스케쥴링 방법 (A Scheduling Method for QoS Switching of Multicast Packet)

  • 이형섭;김환우
    • 한국통신학회논문지
    • /
    • 제26권11C호
    • /
    • pp.123-132
    • /
    • 2001
  • 서비스의 다양화와 함께 multicast 패킷의 비율이 증가하고 이를 전달하는 네트워크 시스템에서는 multicast 패킷의 스위칭 효율로 인하여 스위칭 효율이 감소하게 되어 시스템의 처리율 및 패킷의 서비스가 지연된다. 본 논문에서는 multicast 패킷의 스위칭 효율을 높여 패킷의 서비스 지연을 줄이기 위한 스위치 시스템 구조 및 패킷 버퍼링 구조, iSLIP을 이용한 새로운 패킷 스케쥴링(Scheduling)방법을 제안하였다. 제안된 스위치 시스템의 구조 및 스케쥴링 방법은 패킷의 스위칭 지연 관점에서 지금까지 제안된 multicast 패킷의 스위칭 바업들과 비교 시뮬레이션을 통하여 제안된 알고리즘의 성능을 검증하였다.

  • PDF

A Scalable Explicit Multicast Protocol for MANETs

  • Gossain Hrishikesh;Anand Kumar;Cordeiro Carlos;Agrawal Dharma P.
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.294-306
    • /
    • 2005
  • Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.

이동통신환경에서의 소규모 그룹통신을 위한 XMIP 프로토콜의 구현 (An Implementation of Explicit Multicast with Mobile IP for Small Group Communications in Mobile Networks)

  • 박인수;박용진
    • 정보처리학회논문지C
    • /
    • 제12C권2호
    • /
    • pp.267-280
    • /
    • 2005
  • 본 논문에서는 다세션 소규모 멀티캐스트 통신을 위해 제안된 Explicit Multicast 전송방식과 IETF Mobile W를 효과적으로 결합한 XMIP 프로토콜을 구현하고 검증한다. Xcast 패킷 헤더 내에 목적지 주소들을 소스 노드가 명시하여 Xcast 네트워크로 전송하면 각 Xcast 라우터는 멀티캐스트 트리의 지원없이도 유니캐스트 라우팅 정보만을 기초로 목적지를 향해 경로설정과 전송을 수행한다. XMIP 프로토콜은 이러한 Explicit Multicast 프로토콜의 특징을 상속받아 상태유지의 필요없이 유니캐스트 라우팅 테이블을 기반으로 하므로 전송방식이 명확하고 단순하다. 본 연구에서는 Xcast 네트워크와 IETF Mobile IP의 연동을 함께 고려해서 Mobile IP의 이동 에이젼트인 HA/FA를 수정 보완하여 HA+/FA+로 각각 확장한다. HA+로 전송된 Xcast 패킷은 Mobile IP 바인딩 테이블을 참조하여 각 FA+로 향하는 X-in-X 터널 인터페이스를 통해 전송된다. 이 메커니즘으로 IETF Mobile IP 멀티캐스트 트래픽 집중 문제를 효과적으로 해결할 수 있다. 마지막으로 무선랜기반 실험망을 구축하고, Xcast 응용으로서 다중 사용자를 위한 인스턴트 메신져를 개발하고 실험하므로써 최종 개발한 XMIP/Xcast 프로토콜의 실효성을 검증한다.

QoSCM: QoS-aware Coded Multicast Approach for Wireless Networks

  • Mohajer, Amin;Barari, Morteza;Zarrabi, Houman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5191-5211
    • /
    • 2016
  • It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

Interference Aware Channel Assignment Algorithm for D2D Multicast Underlying Cellular Networks

  • Zhao, Liqun;Ren, Lingmei;Li, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권8호
    • /
    • pp.2648-2665
    • /
    • 2022
  • Device-to-device (D2D) multicast has become a promising technology to provide specific services within a small geographical region with a high data rate, low delay and low energy consumption. However, D2D multicast communications are allowed to reuse the same channels with cellular uplinks and result in mutual interference in a cell. In this paper, an intelligent channel assignment algorithm is designed in D2D underlaid cellular networks with the target of maximizing network throughput. We first model the channel assignment problem to be a throughput maximizing problem which is NP-hard. To solve the problem in a feasible way, a novel channel assignment algorithm is proposed. The key idea is to find the appropriate cellular communications and D2D multicast groups to share a channel without causing critical interference, i.e., finding a channel for a D2D multicast group which generates the least interference to network based on current channel assignment status. In order to show the efficacy and effectiveness of our proposed algorithm, a novel search algorithm is proposed to find the near-optimal solution as the baseline for comparisons. Simulation results show that the proposed algorithm improves the network throughput.

A Novel Certificate Revocation List Distribution for Vehicle Communications in Mobile Communication Networks

  • Dan, Du Anh;Kim, Hyun-Gon
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권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.