• Title/Summary/Keyword: Multicast Key

Search Result 127, Processing Time 0.025 seconds

Efficient Multicast Key Management for Stateless Receivers (스테이트리스 리시버를 위한 효율적인 멀티캐스트 키관리)

  • Ki, Ju-Hee;Kim, Hyun-Jueong;Lee, Dong-Hoon;Park, Chang-Seop
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.841-844
    • /
    • 2002
  • 이 논문에서는 동적이고 규모가 큰 그룹에 대해서 한명의 그룹 관리자가 존재하면서, 특별히 새로운 그룹키가 갱신될 때마다 새로운 정보를 받기 힘든 구성원, 즉 스테이트리스 리시버(stateless receiver)에게 적합한 방법을 제안한다. 이 방법은 구성원에게 각각 한 개씩 주어지는 개인키를 전송하는 메시지를 제외한 다른 모든 메시지들에는 암호화 과정이 요구되지 않는다. 즉, 갱신된 그룹키를 공유하기 위해 필요한 계산은 단지 O($log_2$n) 번의 해쉬함수 계산과 배타적 논리합(XOR)을 수행하는 것이며, 그룹키를 갱신하기 위해 필요한 정보는 암호화될 필요없는 멀티캐스트 메시지와 그룹에 추가될 때 그룹 관리자로부터 받은 초기값이다. 또한 제안하는 방법은 새롭게 추가된 사람이 이전의 그룹키에 대한 어떠한 정보도 알 수 없으며(후방보호 : Backward Secrecy), 삭제되는 사람 역시 이후의 새로운 그룹키에 대한 정보를 알 수 없다(전방보호 : Forward Secrecy). 또한 제안된 방법에 게시판이 이용된다면, 각 그룹의 구성원은 어떠한 멀티캐스트 메시지없이 단지 자신의 초기 개인키만으로 필요한 모든 노드키들을 계산할 수 있다.

  • PDF

An Energy Efficient Clustering Algorithm in Mobile Adhoc Network Using Ticket Id Based Clustering Manager

  • Venkatasubramanian, S.;Suhasini, A.;Vennila, C.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.341-349
    • /
    • 2021
  • Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

A Study on PON-based Mobile Backhaul Using Network Coding (네트워크 코딩을 이용한 PON기반 무선백홀 연구)

  • Jung, Bokrae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.275-280
    • /
    • 2013
  • With rapidly growing mobile wireless services, the existing copper-based mobile backhaul technologies suffer from reaching the capacity limits. PON technologies is drawing attention as a key solution to replace the existing mobile backhaul technologies due to not only providing innovative network capacity but also cost-effective maintenance caused by the bandwidth gain from optical fibers. With a PON-based mobile backhaul, broadband wireless multimedia services such as a video conference and IPTV can be seamlessly provided. In this paper, we first introduce overview of the PON-based mobile backhaul technology. For a example of practical integration, three types of EPON-WiMAX integrated architectures are proposed and comparatively analyzed in term of costs and network performance. Then, applicable plan and anticipated effects are presented when applying network coding on the PON-based mobile backhaul to improve the performance of delivering multicast traffic.

Interchange Algorithm for VoD System (VOD 시스템에서의 Interchange Agent 운영 알고리즘)

  • Kang, Seok-Hoon;Park, Su-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1847-1854
    • /
    • 2005
  • This paper proposes a approach to configure efficient video-on-demand system by introducing Multicast and Cache Video-on-Demand (MCVoD) system. As a key element or the MCVoD system, interchange agent provides this system with multicasting and switching functions. With the multicasting, the MCVoD system is able to reduce the load on the network as well as VoD servers by transmitting only one video request instead of sending multiple requests on a same video stream. The switching enables clients to receive the lust stream of requested video streams instantly without waiting time and also allows avoiding undesirable duplication of video streams in the system. With various experiment results through simulation about waiting tine and cache hit ratio, we show that the MCVoD system employing the interchange agent provides better performance than current uni-proxy based system.

A Secure Subscription-Push Service Scheme Based on Blockchain and Edge Computing for IoT

  • Deng, Yinjuan;Wang, Shangping;Zhang, Qian;Zhang, Duo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.445-466
    • /
    • 2022
  • As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

A Mobility Management Scheme based on the Mobility Pattern of Mobile Networks (이동 네트워크의 이동 패턴에 기반을 둔 이동성 관리 기법)

  • Yang, Sun-Ok;Kim, Sung-Suk
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.345-354
    • /
    • 2008
  • Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

An Efficient Feedback Collection for Multimedia Multicast (멀티미디어 멀티캐스트를 위한 효율적인 피드백 정보 수집)

  • Kung, Sang-Hwan;Kang, Min-Gyu;Koo, Yeon-Seol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.3
    • /
    • pp.751-762
    • /
    • 1998
  • The purpose of this study is to enhance the quality of multimedia service under the heterogeneous end-terminals and network environment by monitoring the data receiving status of the group members regularly when the sender multicasts real-time multimedia data to a group. Especially, it focuses to reduce the total number of status information responded to the sender from the receivers. Accordingly. it upgrades the sender's performance by suppressing the number of status information packets generated by the receivers. The key idea of this study starts from how we profile the activity of all the members in a group. We assume that the receiver status in the worst status, so called primary receiver, represents the status of the whole group. This means that the whole group is assumed as being degraded in performance if the primary receiver is degraded, and that the whole group is assumed as being upgraded if the primary one is upgraded. In this algorithm, the primary receiver announces its status information to the whole group prior to other receivers, ana every receiver listening to the primary and other receivers' status compares its own status with them. Accordingly, any receiver may give up the status notification in case its status is not worse than others, resulting in the reduction of unnecessary responses to the sender.

  • PDF