• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.034 seconds

A Hybrid Authentication Scheme for Wireless MSAP Mesh Networks in the Next-Generation TMCS (차세대 전술이동통신체계 무선 MSAP 메쉬망을 위한 혼합형 인증기법)

  • Bae, Byoung-Gu;Yoon, Sun-Joong;Ko, Young-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1011-1019
    • /
    • 2012
  • This paper presents a novel hybrid authentication scheme in the next-generation Tactical Mobile Communication Systems(TMCS) with wireless MSAP mesh networks. The existing centralized and distributed authentication methods for security between MSAPs may have their pros and cons. The centralized authentication method induces overhead from frequent MSAP association which leads to long authentication delay. On the other hand, the distributed authentication method requires initial sharing of the authentication information. Therefore, a more efficient authentication scheme is needed to protect the network from malicious MSAPs and also maximize efficiency of the network security. The proposed scheme provides a hybrid method of efficiently managing the authentication keys in the wireless MSAP mesh network to reduce the induced authentication message exchange overhead. Also, as the authentication method between MSAP and TMFT is different, a method of utilizing the ACR for handling the EAP packets is proposed. In overall, the proposed scheme provides efficient mutual authentication between MSAPs especially for tactical environments and is analyzed through performance evaluation to prove its superiority.

The Coexistence Solution using Transmission Schedule and User's Position Information in Cognitive Radio Networks (전송 스케줄 및 사용자 위치 정보를 이용한 무선 인지 네트워크의 동일 주파수 대역 공존 방안)

  • Lee, Kyu-Ho;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.189-203
    • /
    • 2012
  • In cognitive radio networks, a secondary user opportunistically accesses an empty channel based on periodic sensing results for avoiding possible interference to the primary users. However, local sensing does not guarantee the full protection of the primary users because hidden primary receivers may exist within the interference range of the secondary transmitter. To protect primary systems and simultaneously to maximize utilization of the secondary users, we need to derive carefully designed coexistence solutions for various network scenarios. In this paper, we propose coexistence conditions without any harmful interference in accordance with the uplink/downlink schedule and user position. We have classified the coexistence conditions into four different scenario cases depending on the provided information to the secondary network basestations. Computer simulation results demonstrated that the proposed method can be applied to the real cognitive radio system to improve the communication probability of CR devices.

A Simplified 3D-Location Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 저복잡도 3차원 무선측위 기법)

  • Hoang, Quan T.;Kim, Kwang-Yul;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.573-580
    • /
    • 2011
  • WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and improving localization performance is a crucial and essential issue for sensor network applications. In this paper, we propose a low-complexity localization mechanism for WSNs that operates in 3D (Three-Dimensional) space. The basic idea is to use aerial vehicles or flying objects that are deliberately equipped with the anchor nodes. These anchor nodes periodically broadcast beacon signals containing their current locations, and the unknown nodes receive these signals as soon as they enter the communication range of the anchors. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

Group Emotion Prediction System based on Modular Bayesian Networks (모듈형 베이지안 네트워크 기반 대중 감성 예측 시스템)

  • Choi, SeulGi;Cho, Sung-Bae
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1149-1155
    • /
    • 2017
  • Recently, with the development of communication technology, it has become possible to collect various sensor data that indicate the environmental stimuli within a space. In this paper, we propose a group emotion prediction system using a modular Bayesian network that was designed considering the psychological impact of environmental stimuli. A Bayesian network can compensate for the uncertain and incomplete characteristics of the sensor data by the probabilistic consideration of the evidence for reasoning. Also, modularizing the Bayesian network has enabled flexible response and efficient reasoning of environmental stimulus fluctuations within the space. To verify the performance of the system, we predict public emotion based on the brightness, volume, temperature, humidity, color temperature, sound, smell, and group emotion data collected in a kindergarten. Experimental results show that the accuracy of the proposed method is 85% greater than that of other classification methods. Using quantitative and qualitative analyses, we explore the possibilities and limitations of probabilistic methodology for predicting group emotion.

An Efficient Memory Allocation Scheme for Space Constrained Sensor Operating Systems (공간 제약적인 센서 운영체제를 위한 효율적인 메모리 할당 기법)

  • Yi Sang-Ho;Min Hong;Heo Jun-Youg;Cho Yoo-Kun;Hong Ji-Man
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.626-633
    • /
    • 2006
  • The wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Sensor operating systems that run on tiny sensor nodes are the key to the performance of the distributed computing environment for the wireless sensor networks. Therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. In this paper, we present an efficient memory allocation scheme to improve the time and space efficiency of memory management for the sensor operating systems. Our experimental results show that the proposed scheme performs efficiently in both time and space compared with existing memory allocation mechanisms.

Keywords Network Analysis of Articles in the North Korean Journal of Preventive Medicine $1997{\sim}2006$ (북한예방의학회지 ($1997{\sim}2006$) 게재논문의 핵심어 네트워크 분석)

  • Jung, Min-Soo;Chung, Dong-Jun;Choi, Man-Kyu
    • Journal of Preventive Medicine and Public Health
    • /
    • v.41 no.6
    • /
    • pp.365-372
    • /
    • 2008
  • Objectives : There are very few researches on North Korea's academic activities. Furthermore, it is doubtful that the available data are reliable. This study investigated research activities and knowledge structure in the field of Preventive Medicine in North Korea with a network analysis using co-authors and keywords. Methods : The data was composed of the North Korean Journal of preventive medicine ranged from Vol. 1 of 1997 to Vol. 4 of 2006. It was the matrix of 1,172 articles by 1,567 co-authors. We applied R procedure for keywords abstraction, and then sought for the outcome of network forms by spring-KK and shrinking network. Results : To comprehend the whole networks explicitly demonstrated that the academic activities in North Korea s preventive medicine were predisposed to centralization as similar as South Korea's, but on the other aspect they were prone to one-off intermittent segmentation. The principal co-author networks were formulated around some outstanding medical universities seemingly in addition to possible intervention by major researchers. The knowledge structure of network was based on experimentation judging from keywords such as drug, immunity, virus detection, infection, bacteria, anti-inflammation, etc. Conclusions : Though North Korea is a socialist regime, there were network of academic activities, which were deemed the existence of inducive mechanism affordable for free research. Article keywords has laid greater emphasis on experiment-based bacterial defection, sustainable immune system and prevention of infection. The kind of trend was a consistent characteristic in preventive medicine of North Korea haying close correlation with Koryo medical science.

A Study on the Performances of the Voice/Data Integrated Multiple Access Protocols for Cellular Packet Radio Networks (셀룰러 패켓 라디오망용 음성/데이타 집적 다중 엑세스 프로토콜의 성능 분석에 관한 연구)

  • 강군화;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.9
    • /
    • pp.1304-1314
    • /
    • 1993
  • During the last several years, the demand of mobile communication is increasing rapidly due to the convenience of usage. Therefore, the evoluation scenario toward the new cellular network is needed. In this paper, the future prospect of cellular network is considered, and movable-boundary TDMA/BTMA protocol is proposed as a new voice/data integrated multiple access protocol for the future cellular packet radio networks. Then, the performance of movable-bounary TDMA/BTMA protocol is analyzed and compared with that of PRMA protocol by computer simulation. In the proposed movable-boundary TDMA/BTMA protocol, the voice traffic sensitive to delay time is served by TDMA protocol and the data traffic sensitive to loss is served by BTMA protocol. Also, the boundary of voice and data can be moved adaptively by usign SYN character, control byte, voice call counter, ect. Therefore. it could be seen that the performance of movable-boundary TDMA/BTMA protocol is better than that of PRMA protocol with respect to delay and throughput.

  • PDF

Bandwidth Reservation Policy for Cellular Networks Using Geographical Information (지리적 정보를 사용한 셀룰러 네트워크 대역폭 예약 정책)

  • Yu, Jae-Bong;Park, Chan-Young;Park, Joon-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10B
    • /
    • pp.891-899
    • /
    • 2006
  • Generally, a geographical area consists of many regions called cells in wireless networks. Each mobile host(MH) in a cell communicates with a base station(BS) located in the center of the cell. The BSs are connected to each other by a static wired network. Since users are expected to move around during communication sessions, one of the most important QoS factors is related to the handoff. But, the handoff could fail due to unavailability of sufficient bandwidth in the next cell. As the individual cell size gradually shrinks to accommodate increasing the number of MHs, the probability of successful handoffs can be dropped. In this paper, we suppose a bandwidth reservation method to guarantee MHs against connection failure in case of frequent handoffs. This method predicts the mobility based on the geographical information and assigns the bandwidth reservation in proportion to the speed of MHs' motion. As a result, we can expect more exact moving path of MH and to reduce the waste of bandwidth.

Quorum-based Key Management Scheme in Wireless Sensor Networks

  • Wuu, Lih-Chyau;Hung, Chi-Hsiang;Chang, Chia-Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2442-2454
    • /
    • 2012
  • To ensure the security of wireless sensor networks, it is important to have a robust key management scheme. In this paper, we propose a Quorum-based key management scheme. A specific sensor, called as key distribution server (KDS), generates a key matrix and establishes a quorum system from the key matrix. The quorum system is a set system of subsets that the intersection of any two subsets is non-empty. In our scheme, each sensor is assigned a subset of the quorum system as its pre-distributed keys. Whenever any two sensors need a shared key, they exchange their IDs, and then each sensor by itself finds a common key from its assigned subset. A shared key is then generated by the two sensors individually based on the common key. By our scheme, no key is needed to be refreshed as a sensor leaves the network. Upon a sensor joining the network, the KDS broadcasts a message containing the joining sensor ID. After receiving the broadcast message, each sensor updates the key which is in common with the new joining one. Only XOR and hash operations are required to be executed during key update process, and each sensor needs to update one key only. Furthermore, if multiple sensors would like to have a secure group communication, the KDS broadcasts a message containing the partial information of a group key, and then each sensor in the group by itself is able to restore the group key by using the secret sharing technique without cooperating with other sensors in the group.

Hybrid S-ALOHA/TDMA Protocol for LTE/LTE-A Networks with Coexistence of H2H and M2M Traffic

  • Sui, Nannan;Wang, Cong;Xie, Wei;Xu, Youyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.687-708
    • /
    • 2017
  • The machine-to-machine (M2M) communication is featured by tremendous number of devices, small data transmission, and large uplink to downlink traffic ratio. The massive access requests generated by M2M devices would result in the current medium access control (MAC) protocol in LTE/LTE-A networks suffering from physical random access channel (PRACH) overload, high signaling overhead, and resource underutilization. As such, fairness should be carefully considered when M2M traffic coexists with human-to-human (H2H) traffic. To tackle these problems, we propose an adaptive Slotted ALOHA (S-ALOHA) and time division multiple access (TDMA) hybrid protocol. In particular, the proposed hybrid protocol divides the reserved uplink resource blocks (RBs) in a transmission cycle into the S-ALOHA part for M2M traffic with small-size packets and the TDMA part for H2H traffic with large-size packets. Adaptive resource allocation and access class barring (ACB) are exploited and optimized to maximize the channel utility with fairness constraint. Moreover, an upper performance bound for the proposed hybrid protocol is provided by performing the system equilibrium analysis. Simulation results demonstrate that, compared with pure S-ALOHA and pure TDMA protocol under a target fairness constraint of 0.9, our proposed hybrid protocol can improve the capacity by at least 9.44% when ${\lambda}_1:{\lambda}_2=1:1$and by at least 20.53% when ${\lambda}_1:{\lambda}_2=10:1$, where ${\lambda}_1,{\lambda}_2$ are traffic arrival rates of M2M and H2H traffic, respectively.