• Title/Summary/Keyword: Broadcast Message

Search Result 232, Processing Time 0.026 seconds

Requirement Analysis of Korean Public Alert Service using News Data (뉴스 데이터를 활용한 재난문자 요구사항 분석)

  • Lee, Hyunji;Byun, Yoonkwan;Chang, Sekchin;Choi, Seong Jong
    • Journal of Broadcast Engineering
    • /
    • v.25 no.6
    • /
    • pp.994-1003
    • /
    • 2020
  • In this paper, we investigated the current issues on the KPAS(Korean Public Alert Service) by News analysis. News articles, from May 15, 2005 to April 30, 2020, were collected with the key word of 'KPAS' through the News Big-Data System provided by the Korea Press Foundation. The results of the content analysis are as follows. First, the issues on alert presentation were categorized by alarm sound, message content, alert level, transmission frequency, delay, reception range, time of alert, and language. Issues on inability to receive KPAS messages were categorized into authority, mobile, sending standard, mobile communication infra, etc. For the last two to three years, news on the inability issues had decreased, while news on the presentation issues had increased. This tells us that the public demand for improvement in the KPAS lies in the presentation issues. The demand for societal resolutions to the presentation issues especially on message content, transmission frequency, and reception range has soared.

Reference Interpolation Protocol for Reducing the Synchronization Messages in Wireless Sensor Network (무선 센서 네트워크에서 동기화 메시지 감소를 위한 참조 보간 프로토콜)

  • Park, Chong-Myung;Lim, Dong-Sun;Lee, Joa-hyoung;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.446-457
    • /
    • 2007
  • In wireless sensor network, to provide the proper responses quickly for diverse events, wireless sensor nodes have to cooperate with each other. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In the wireless sensor network, the message packets including time information are used for the time synchronization. However, the transmission of many message packets will exhaust the battery of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive transmission of message packets has an negative impact upon their lifetime. In this paper, the Reference Interpolation Protocol (RIP) is proposed to reduce the number of message packets for the time synchronization. The proposed method performs the time interpolation between the reference packet's time and the global time of the base station. The proposed method completes the synchronization operation with only 2 message packets when compared to the previous Reference Broadcast Synchronization (RBS) technique. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages and showed the 12.7 times less power consumption than the RBS method. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

A Reliable Broadcast Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰적 브로드캐스팅 기법)

  • Choi, Won-Suk;Cho, Sung-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.165-173
    • /
    • 2008
  • In this paper, we propose a new reliable broadcast protocol referred to as timer-based reliable broadcast (TRB) for wireless sensor networks (WSNs). The proposed TRB scheme exploits (1) bitmap based explicit ACK to effectively reduce the unnecessary error control messages and (2) randomized timer for ACK transmission to substantially reduce the possibility of contentions. Although it has been argued that 100% reliability is not necessary in WSNs, there should be messages (such as mission-critical message, task assignment, software updates, etc.) that need to be reliably delivered to the entire sensor field. We propose to use the TRB algorithm for such cases. Performance evaluation shows that the TRB scheme achieves 100 % reliability significantly better than other schemes with expense of slightly increased energy consumption.

Design and Evaluation of an Early Intelligent Alert Broadcasting Algorithm for VANETs (차량 네트워크를 위한 조기 지능형 경보 방송 알고리즘의 설계 및 평가)

  • Lee, Young-Ha;Kim, Sung-Tae;Kim, Guk-Boh
    • Journal of Internet Computing and Services
    • /
    • v.13 no.4
    • /
    • pp.95-102
    • /
    • 2012
  • The development of applications for vehicular ad hoc networks (VANETs) has very specific and clear goals such as providing intellectual safe transport systems. An emergency warning technic for public safety is one of the applications which requires an intelligent broadcast mechanism to transmit warning messages quickly and efficiently against the time restriction. The broadcast storm problem causing several packet collisions and extra delay has to be considered to design a broadcast protocol for VANETs, when multiple nodes attempt transmission simultaneously at the access control layer. In this paper, we propose an early intelligent alert broadcasting (EI-CAST) algorithm to resolve effectively the broadcast storm problem and meet time-critical requirement. The proposed algorithm uses not only the early alert technic on the basis of time to collision (TTC) but also the intelligent broadcasting technic on the basis of fuzzy logic, and the performance of the proposed algorithm was compared and evaluated through simulation with the existing broadcasting algorithms. It was demonstrated that the proposed algorithm shows a vehicle can receive the alert message before a collision and have no packet collision when the distance of alert region is less than 4 km.

Modeling and Simulation of LEACH Protocol to Analyze DEVS Kernel-models in Sensor Networks

  • Nam, Su Man;Kim, Hwa Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.97-103
    • /
    • 2020
  • Wireless sensor networks collect and analyze sensing data in a variety of environments without human intervention. The sensor network changes its lifetime depending on routing protocols initially installed. In addition, it is difficult to modify the routing path during operating the network because sensors must consume a lot of energy resource. It is important to measure the network performance through simulation before building the sensor network into the real field. This paper proposes a WSN model for a low-energy adaptive clustering hierarchy protocol using DEVS kernel models. The proposed model is implemented with the sub models (i.e. broadcast model and controlled model) of the kernel model. Experimental results indicate that the broadcast model based WSN model showed lower CPU resource usage and higher message delivery than the broadcast model.

Broadcast Encryption System Using Secret Sharing and Subset Difference Methods (비밀분산 기법과 Subset Difference 기법을 이용한 브로드캐스트 암호시스템)

  • Lee, Jae Hwan;Park, Jong Hwan
    • Journal of Broadcast Engineering
    • /
    • v.20 no.1
    • /
    • pp.92-109
    • /
    • 2015
  • Broadcast encryption is a cryptographic primitive that allows a sender to securely broadcast a message to a set of receivers. The most influential broadcast encryption system was proposed in 2001 by Naor, Naor, Lotspiech, based on a pseudo-random generator and the Subset Difference (SD) method. In this paper, we suggest a new broadcast encryption system that is based on secret sharing and SD methods. On an efficiency aspect, our system achieves O(r) transmission cost, O($log^2n$) storage cost, and O(1) computational cost for the number n of users and the number r of revoked users. Compared to O(log n) computational cost in the previous SD method, our system has the advantage that it needs only constant-sized computational cost for decryption, regardless of the number n or r. On a security aspect, our system can achieve tighter security reduction than the previous SD method and the gap of security loss is about O(n log n). Moreover, our result shows that it is possible to give the effect of the SD method while using an information-theoretically secure key distribution technique as in the Complete Subtree method.

A improved back-off algorithm using the gaussian model in the vehicular networks (차량 간 통신에서 가우시안 모델을 적용한 개선된 백오프 알고리즘)

  • Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.10 no.6
    • /
    • pp.225-230
    • /
    • 2012
  • When a car accident happened, the accident vehicle should broadcast a safe message to its neighbors in multi-hop. However, the pure flooding is difficult to protect a chain-reaction collision because of the frequent collision and the communication delay. To solve this problem, we proposes a back-off algorithm applied to the estimation of the neighbor node count using the t-distribution. And we proposes a MAC protocol preventing the communication delay by separating the neighbor's count collection channel and data channel. As a result, we show the frame reception success rate of our protocol improved more 10% than the previous protocol.

Automatic Distress Notification System Working with an External VHF Device in Small Ship (비상재난 발생 시 외부 VHF 장비와 연동하는 소형선박용 재난자동속보장치)

  • Jeong, Heon
    • Fire Science and Engineering
    • /
    • v.27 no.1
    • /
    • pp.14-19
    • /
    • 2013
  • In this paper, I have developed an automatic distress notification system (ADNS) working with an external VHF device in small ship. The proposed system is as part of a small ship disaster analysis system which can detect and quickly respond to the small ship disaster. The automatic notification system receives the location information signal from the disaster analysis system, and the signal will be converted into voice signal to broadcast of the accident position through external VHF device. It will be sending a distress message as form of voice information through VHF device until sinking under the water. Through this research, I expect we'll be make a quick response and prevent a terrible loss of human life.

Access Control of Pay TV Program in Digital Satellite Broadcasting System (디지털 위성방송 시스템에서 유료 TV방송 프로그램 접근제어)

  • Park, Jeong-Hyun;Lee, Sang-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.3123-3132
    • /
    • 1997
  • In this paper, we describe access control system for protection of pay TV program in digital DBS(Direct Broadcast satellite) system. We also propose a possible access control system and operation scenario for scrambling and descrambling which are important in access control system. Transport stream structure and option, entitlement checking message and entitlement management message for access control on digital broadcasting system are described in this paper. Especially, the authentication based on Flat-Shamir and Gulllou-Quisquater schemes required for verification of proper subscriber as access control is oriented to smart card number and subscriber ID(Identity). It has less restriction than scheme oriented to descrambler number.

  • PDF

Secure and Efficient Identity-based Batch Verification Signature Scheme for ADS-B System

  • Zhou, Jing-xian;Yan, Jian-hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6243-6259
    • /
    • 2019
  • As a foundation of next-generation air transportation systems, automatic dependent surveillance-broadcast (ADS-B) helps pilots and air traffic controllers create a safer and more efficient national airspace system. Owing to the open communication environment, it is easy to insert fake aircraft into the system via spoofing or the insertion of false messages. Efforts have thus been made in academic research and practice in the aviation industry to ensure the security of transmission of messages of the ADS-B system. An identity-based batch verification (IBV) scheme was recently proposed to enhance the security and efficiency of the ADS-B system, but current IBV schemes are often too resource intensive because of the application of complex hash-to-point operations or bilinear pairing operations. In this paper, we propose a lightweight IBV signature scheme for the ADS-B system that is robust against adaptive chosen message attacks in the random oracle model, and ensures the security of batch message verification and against the replaying attack. The proposed IBV scheme needs only a small and constant number of point multiplication and point addition computations instead of hash-to-point or pairing operations. Detailed performance analyses were conducted to show that the proposed IBV scheme has clear advantages over prevalent schemes in terms of computational cost and transmission overhead.