• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.944-956
• /
• 2013

Drivers need lots of information when they drive on the highway, however it is necessary and important to be provided information which is appropriate formation. In order to offer the suitable information, adequate size, quantity, and frequency of provided information are required for the drivers. To evaluate propriety of the expressed message of VMS that provides real-time traffic conditions, first of all, the amount of message about legibility distance and viewing should be estimated. In this research, drivers' characteristics of VMS message design were also reviewed to enhance the efficiency of VMS. And legibility distance, the amount of viewing information, and ratio of viewing information were analyzed on the currently operating VMS. The results of this study proposed that the appropriate size, quantity, and frequency were concluded by the legibility and memory of message on the real driving conditions. Consequently, these design methods of VMS could be expected to improve the transmitting capability of highway information to drivers.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.372-379
• /
• 2012

This paper presents a group based propagation method for multi-hop transmission, in order to deliver an emergency message to the reasonable size of vehicle troop. A group head is selected in considering of the position information of vehicles and radio transmission range. With benefits of the group based transmission, it is possible to minimize the unnecessary transmissions and the possibility of message collisions. We evaluate the performance of the proposed scheme compared with conventional schemes. Simulation results show that the message propagation performance is so stable regardless of vehicle's congestion degree.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1064-1070
• /
• 2010

Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1003-1019
• /
• 2019

Threshold ring signature scheme enables any t entities from N ring members to spontaneously generate a publicly verifiable t-out-of-N signature anonymously. The verifier is convinced that the signature is indeed generated by at least t users from the claimed group, but he cannot tell them apart. Threshold ring signatures are significant for ad-hoc groups such as mobile ad-hoc networks. Based on the lattice-based ring signature proposed by Melchor et al. at AFRICRYPT'13, this work presents a lattice-based threshold ring signature scheme, employing the technique of message block sharing proposed by Choi and Kim. Besides, in order to avoid the system parameter setup problems, we proposed a message processing technique called "pad-then-permute", to pre-process the message before blocking the message, thus making the threshold ring signature scheme more flexible. Our threshold ring signature scheme has several advantages: inherits the quantum immunity from the lattice structure; has considerably short signature and almost no signature size increase with the threshold value; provable to be correct, efficient, indistinguishable source hiding, and unforgeable.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1536-1546
• /
• 2008

RSVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing (WFQ) algorithm to secure required qualities of traffic flows. A RSVP-capable router based on the LOFQ (Latency optimized fair queuing) algorithm had been proposed to improve the performance of the WFQ-based RSVP-router, but it required not only the RESV message to be expanded but also its performance could be evaluated only through simulation. This paper proposed a LOFQ based RSVP-capable router using the conventional RESV message and developed an algorithm to analyze the performance of the LOFQ based RSVP-capable routers. The performance evaluation using the developed algorithm showed that in terms of performance improvement the proposed router is inferior to the one using the expanded RESV message under a small packet size, but on the range of a large packet size both routers provide the same improvement.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.11-21
• /
• 2014

In this paper, concerning the various advertising and policy advertising of the election with respect to whether to deliver a message to a large number of people, we design and implement an automative system what enables sending the text messages directly from the server to the client and also fast feedback is enabled by utilizing a number of operational programs to connect to the server. Therefore, we design and implement the automative communication system which enables delivering message to each user mobile terminal from a plurality of relay mobile terminals by utilizing the mobile instant messenger, not to deliver a message from the server to the mobile instant messenger user directly. In result of comparative analysis on the number of times of data transmission, this automative communication system utilizing mobile instant messenger shows the result that it enables transmitting five times per minute as it can copy and paste in the automation system regardless of the size of the data loading, otherwise in case of transmitting manually it show the result that the number of times of data transmission is reduced if the size of the data is larger.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.143-150
• /
• 2006

The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

• Korean Journal of Audiology
• /
• v.24 no.1
• /
• pp.1-9
• /
• 2020

Auditory scene analysis is defined as a listener's ability to segregate a meaningful message from meaningless background noise in a listening environment. To gain better understanding of auditory perception in terms of message integration and segregation ability among concurrent signals, we aimed to systematically review the size of auditory scenes among individuals. A total of seven electronic databases were searched from 2000 to the present with related key terms. Using our inclusion criteria, 4,507 articles were classified according to four sequential steps-identification, screening, eligibility, included. Following study selection, the quality of four included articles was evaluated using the CAMARADES checklist. In general, studies concluded that the size of auditory scene increased as the number of sound sources increased; however, when the number of sources was five or higher, the listener's auditory scene analysis reached its maximum capability. Unfortunately, the score of study quality was not determined to be very high, and the number of articles used to calculate mean effect size and statistical significance was insufficient to draw significant conclusions. We suggest that study design and materials that consider realistic listening environments should be used in further studies to deep understand the nature of auditory scene analysis within various groups.

• Journal of Audiology & Otology
• /
• v.24 no.1
• /
• pp.1-9
• /
• 2020

Auditory scene analysis is defined as a listener's ability to segregate a meaningful message from meaningless background noise in a listening environment. To gain better understanding of auditory perception in terms of message integration and segregation ability among concurrent signals, we aimed to systematically review the size of auditory scenes among individuals. A total of seven electronic databases were searched from 2000 to the present with related key terms. Using our inclusion criteria, 4,507 articles were classified according to four sequential steps-identification, screening, eligibility, included. Following study selection, the quality of four included articles was evaluated using the CAMARADES checklist. In general, studies concluded that the size of auditory scene increased as the number of sound sources increased; however, when the number of sources was five or higher, the listener's auditory scene analysis reached its maximum capability. Unfortunately, the score of study quality was not determined to be very high, and the number of articles used to calculate mean effect size and statistical significance was insufficient to draw significant conclusions. We suggest that study design and materials that consider realistic listening environments should be used in further studies to deep understand the nature of auditory scene analysis within various groups.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.340-347
• /
• 2007

Vehicle safety service can be effectively achieved with inter-vehicle communication technologies, in which moving vehicles transmit a safety related urgency information such as traffic accidents, sudden stops, obstacle appearance etc. They usually utilize a broadcast of message propagation method because the communicating vehicles are not known each other. The pure broadcasting scheme does not satisfy the requirements of vehicle safety communication service due to the transmission delay with frequent message collisions. To resolve this problem, this paper presents a group based propagation method for the multi-hop transmission, in order to deliver an urgency message to the reasonable size of vehicle troop. A group header is elected in considering of the position information of vehicles and radio transmission range. And a vehicle equivalent group is formed with the header. With benefits of the group based transmission, it is possible to minimize the unnecessary transmission and the possibility of message collisions. Simulation results show that the message propagation performance is so stable regardless of vehicle's congestion degree.