• Title/Summary/Keyword: Sender

Search Result 466, Processing Time 0.021 seconds

An adaptive keystream resynchronization algorithm by using address field of LAPB (LAPB의 주소 영역을 이용한 적응 난수열 재동기 알고리즘)

  • 윤장홍;이주형;황찬식;양상운
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2181-2190
    • /
    • 1997
  • The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

  • PDF

The Android-based Bluetooth Device Application Design and Implementation (안드로이드 기반의 블루투스 디바이스 응용 설계 및 구현)

  • Cho, Hyo-Sung;Lee, Hyuk-Joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.1
    • /
    • pp.72-85
    • /
    • 2012
  • Today, although most bluetooth hands-free devices within a vehicle provide telephone service functions such as voice communication, caller id display and SMS message display and so on, they do not provide a function that displays Internet-based text data. We need to develop a scheme that displays the internet-based text data including existing hands-free function because the request for using the Internet service is increasing within a vehicle recently. The proposed bluetooth device application includes advanced function such as SNS message arrival notification, the message display function and we chose Android as the implementation mobile platform giving consideration to the fact that most SNS applications operate on Android and the platform is easily embedded into small embedded device. Smartphone or tablet PC connected with the proposed bluetooth device is an Android-based device and we designed a form of Android app for the function implementation of the devices. When the audio-text gateway app receives SNS text data, it extracts title and sender information from the message header information in a form of text data and sends them via ACL (Asynchronous Connection-Oriented) link to the bluetooth device showing the data on the screen. Android-based bluetooth devices are not possible to play voice through speaker because the bluetooth hands-free or headset profile ported within Android platform normally only includes audio gateway's function. The proposed bluetooth device application, therefore, applies the streaming scheme that sends data via ACL link instead of the way that sending them via SCO (Synchronous Connection-Oriented) link.

Design and Performance Evaluation of Resequencing Algorithm for TCP Performance Enhancement in FHMIPV6 Handover (FHMIPv6 핸드오버에서 TCP 성능 향상을 위한 재정렬 알고리즘 설계 및 성능 분석)

  • Hwang An-Kyu;Lee Jae-Yong;Kim Byung-Chul;Lee Jae-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.118-125
    • /
    • 2006
  • Mobile nodes in FHMIPv6 has both advantages of HMIPv6 protocol which reduces signaling delay time and resource consumption during a handover and fast handover algorithm which reduces packet loss. Fast handover algorithm can reduce packet loss by 'tunneling' method ; that transmits a packet from old access router to new access router in case of handover. However, the fast handover algorithm can cause a reordering problem in a receiver between packets tunneled from the previous access router and packets transmitted directly to the new access router, which could degrade the TCP performance due to congestion control. In this paper, we propose two algorithms to solve the reordering problem in fast handover. The first one uses a holding timer for tunneling, the other adds a new algorithm to routers that adopt snoop protocol. We compare the performance of the proposed reseuquencing algorithms with that of the existing FHMIPv6 protocol by simulation. The simulation results show that the proposed algorithms solve the reordering problems and enhance TCP performance by preventing TCP sender entering congestion control.

New Framework for Convergent Services between Telecommunication and Broadcasting: Public Goods and Interactivity (방송.통신 융합서비스의 적정 규제 방안: 서비스의 공공재적 속성과 양방향적 특성을 중심으로)

  • Lee, Sang-Woo;Kwak, Dong-Kyun
    • Korean journal of communication and information
    • /
    • v.27
    • /
    • pp.213-245
    • /
    • 2004
  • As we know, broadcasting implies a unilateral transmission by one sender to several recipients of information generally produced by third parties. Contrary to that, telecommunications implies an exchange between participants. Participants exchange information they produce during an interaction. However, in the age of convergence between telecommunication and broadcasting, it becomes difficult to determine exactly the boundary between services classified under telecommunications and those classified under broadcasting services. This means that new regulatory regime should be introduced to meet the convergence between telecommunication and broadcasting. In this article, we try to overcome the existing framework for understanding and regulating convergent services. In order to develop more powerful and useful framework for dealing with new convergent services, we focus on the original characteristic of "cast services," which could give us very significant basis for further discussion. "Cast services," such as traditional broadcasting services, have the characteristics of both public goods (non-exclusivity and non-rivalry in consumption) and non-interactivity. Depending on the existence of these three characteristics, we are able to apply different regulatory regime to those convergent services.

  • PDF

Video Quality Metric Using One-Dimensional Histograms of Motion Vectors (움직임 벡터의 1차원 히스토그램을 이용한 비디오 화질 평가 척도)

  • Han, Ho-Sung;Kim, Dong-O;Park, Bae-Hong;Sim, Dong-Gyu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.21-28
    • /
    • 2008
  • This paper proposes a novel reduced-reference assessment method for video quality assessment, in which one-dimensional (1-D) histograms of motion vectors (MVs) are used as features of videos. The proposed method is more efficient than the conventional methods in view of computation time, because the proposed quality metric decodes MVs directly from video stream in the parsing process instead of reconstructing the distorted video at the receiver. Moreover, in view of data size, the propose method is efficient because a sender transmits 1-D histograms of MVs accumulated over whole input video sequences. Here, we use 1-D histograms of MVs accumulated over the whole video sequences, which is different from the conventional methods that assessed each image independently. For testing the similarity between histograms, we use histogram intersection and histogram difference methods. We compare the proposed method with the conventional methods for 52 video clips, which are coded under varying bit rate, image size, and frame rate. Experimental results show that the proposed method is more efficient than the conventional methods and that the proposed method is more similar to the mean opinion score (MOS) than conventional algorithms.

Cost Effective Remote Subscription scheme for Ubiquitous Convergence IP-based Network (유비쿼터스 컨버젼스 IP 기반 대용량 네트워크에서 비용 절감형 리모트-서브스크립션 기법)

  • Shin, Soo-Young;Yoon, Young-Muk;Park, Soo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.95-104
    • /
    • 2007
  • Mobile multimedia services such as TV-call or video streaming are gradually becoming popular in the 3rd or more generation mobile network (IMT-2000). Multimedia traffic is expected to continue increasing into the coming years, and IP technology is considered to be the efficient way of transporting such huge volumes of multimedia traffic. IP-based IMT network platform represents an evolution from IMT-2000. The structure of IP-based IMT network as ubiquitous platform is three-layered model : Middleware including Network Control PlatForm (NCPF) and Service Support PlatForm (SSPF), IP-BackBone (IP-BB), access network including sensor network. Mobility Management (MM) architecture in NCPF is proposed for IP-based IMT network in order to manage routing information and location information separately. The generous existing method of multicast control in IP-based IMT network is Remote Subscription. But Remote Subscription has problem that should be reconstructed whole multicast tree when sender in multicast tree moves to another area. To solve this problem, we propose the way to put Multicast-manager in NCPF.

2-Subset Difference Broadcast Encryption System Based on Secret Sharing Method (비밀분산 기반의 2-Subset Difference 브로드캐스트 암호시스템)

  • Lee, Jae Hwan;Park, Jong Hwan
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.580-597
    • /
    • 2015
  • Broadcast encryption system is a cryptographic primitive that enables a sender to broadcast a message to a set of receivers in a secure channel. Out of previous proposed broadcast encryption systems, the most effective is the one that uses the Subset Difference(SD) method in a binary tree structure. The SD method has been realized by two underlying approaches: Pseudo-Random Generator(PRG) and Secret Sharing(SS). 2-SD method is the generalized version of the SD method by which two subsets of revoked receivers can be dealt with by one subset (in an SD-based broadcast encryption system). The primary advantage of the 2-SD method is to further reduce the size of transmission overhead, compared to the SD method. Until now, however, there is no known broadcast encryption system that is based on such a 2-SD technique using either PRG or SS basis. In this paper, we suggest a new 2-SD broadcast encryption system using the SS-based technique that was suggested by Jae Hwan Lee et al. in 2014[9]. The new system can reduce the size of ciphertext by 25% of the one in the previous SS-based broadcast encryption system. Also, on a theoretical note, ours is the first 2-SD broadcast encryption system that is provably secure.

An Efficient Broadcast Encryption System with Delegation of Decryption (복호화 위임을 제공하는 효율적인 브로드캐스트 암호시스템)

  • Han, Su Min;Park, Seung Hwan;Park, Jong Hwan;Lee, Dong Hoon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.5
    • /
    • pp.758-770
    • /
    • 2013
  • In a Broadcast Encryption System, a sender sends an encrypted message to a large set of receivers at once over an insecure channel and it enables only users in a target set to decrypt the message with their private keys. In 2005, Boneh et al. proposed a fully collusion-resistant public key broadcast encryption in which the ciphertext and the privatekey sizes are constant. In general, pairing-based broadcast encryption system is efficient in bandwidth and storing aspects than non-pairing based broadcast encryption system, however, it requires many computational costs that resource-constrained devices is not suit to be applied. In this paper, we propose a Broadcast Encryption scheme(called BEWD) that user can decrypt a ciphertext more efficiently. The scheme is based on Boneh et al.scheme. More precisely, it reduces receiver's computational costs by delegating pairing computation to a proxy server which computation is required to receiver in Boneh et al.scheme. Furthermore, the scheme enables a user to check if the proxy server compute correctly. We show that our scheme is secure against selective IND-RCCA adversaries under l-BDHE assumption.

Letters by Medical Missionaries to Korea: Exploring Digital Humanities Approaches (북미지역에 소장된 내한 의료선교사 편지 기록의 현황과 디지털 인문학적 활용 가능성)

  • Hur, Kyungjin;Kim Han, Mikyung;Lee, Hye Eun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.29 no.1
    • /
    • pp.233-252
    • /
    • 2018
  • The first Protestant medical missionary, Horace Allen, came to Korea in 1884 and built the first western-style hospital, Jaejungwon. John Heron, Oliver Avison and other foreign medical doctors soon followed. They established hospitals and medical schools, and, by treating patients and educating native doctors, they disseminated and developed modern medicine in Korea. At the same time, they wrote letters and reports to their sponsoring agencies, as well as family and friends, thereby leaving a vast body of literature that is scattered all over the world. Since the end of the 19th century, the records left by foreign medical missionaries have been valuable resources for the study of Korean history. While all types of records, such as diaries, memoirs, reports and travel logs, are available, these tend to be exaggerated or unverifiable because they are unilateral records. In contrast, letters can be verified because they are bilateral records between the recipient and the sender, and cannot be modified or altered according to changes in circumstances. Despite the academic value of these materials, however, there have been insufficient efforts to discover or identify these primary data sources, or to systematically organize them for scholars. This paper identified 49 archival collections from 29 institutions in North America. After analyzing their academic value, the paper will explore digital humanities options in utilizing the letters for future scholarship.

An adaptive resynchronization technique for stream cipher system in HDLC protocol (HDLC 프로토콜에서 운용되는 동기식 스트림 암호 통신에 적합한 적응 난수열 재동기 기법)

  • 윤장홍;황찬식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1916-1932
    • /
    • 1997
  • The synchronous stream cipher which require absoulte clock synchronization has the problem of synchronization loss by cycle slip. Synchronization loss makes the state which sender and receiver can't communicate with each other and it may break the receiving system. To lessen the risk, we usually use a continuous resynchronization method which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get resynchronization effectively by continuous resynchroniation, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using HDLC protocol. It is able to solve the problem of the continuous resynchronization. The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of HDLC. It measures the receiving rate of theaddress field in the decision duration. Because it make resynchronization only when the receiving rate is greateer than the threshold value, it is able to solve the problems of continuous resynchronization method. When the proposed adaptive algorithm is applied to the synchronous stream cipher system in packet netork, it has addvance the result in R_e and D_e.

  • PDF