• Title/Summary/Keyword: Closed access

Search Result 180, Processing Time 0.022 seconds

Corrective Control of Input/Output Asynchronous Sequential Machines for Overcoming Disturbance Inputs (외란 입력을 극복하기 위한 입력/출력 비동기 머신의 교정 제어)

  • Yang, Jung-Min;Kwak, Seong-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.3
    • /
    • pp.591-597
    • /
    • 2009
  • The problem of controlling a finite-state asynchronous sequential machine is examined. The considered machine is governed by input/output control, where access to the state of the machine is not available. In particular, disturbance inputs can infiltrate into the asynchronous machine and provoke unauthorized state transitions. The control objective is to use output feedback to compensate the machine so that the closed-loop system drive the faulty asynchronous machine from a failed state to the original one. Necessary and sufficient condition for the existence of appropriate controllers are presented in a theoretical framework. As a case study, the closed-loop system of an asynchronous machine with the proposed control scheme is implemented in VHDL code.

A Simulation of Bridge using the Spanning Tree Protocol (스패닝 트리 프로토콜을 이용한 브릿지 시뮬레이션)

  • Lee, Sook-Young;Lee, Eun-Wha;Lee, Mee-Jeong;Chae, Ki-Joon;Choi, Kil-Young;Kang, Hun
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.2
    • /
    • pp.45-57
    • /
    • 1997
  • MAC (media access control) bridge is used to interconnect separate LANs and to relay frames between the BLANs (bridged LANs). Bridge architecture consists of MAC entity, MAC relay entity and bridge protocol entity protocol entity and performs learning, filtering and forwarding functions using filtering database. In this paper, we simulate these functions of bridge and the STP (spanning tree protocol). The STP derives an active topology from an arbitrarily connected BLAN. Our simulation model assumes a BLAN consisted of three bridge forming a closed loop. In order to remove the loop, each bridge process exchanges configruation BPDU (bridge protocol data unit0 with other bridge processes connected to the bridge itself. To simulate the communication between bridges, we implement the IPC (inter-process communication) server using message queues. Our simulation results show that the assumed BLAN contains no closed loop and then there is no alternative route and no unnecessary traffic.

  • PDF

Security Technique using SSH Tunneling for CCTV Remote Access (SSH 터널링을 이용한 CCTV 원격접속 보안기법)

  • HWANG, GIJIN;PARK, JAEPYO;YANG, SEUNGMIN
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.11
    • /
    • pp.148-154
    • /
    • 2016
  • Video security has recently emerged as an important issue owing to CCTV video image spill accidents over the Internet. KISA recommends the use of encryption protocols for remote access through its guidelines for CCTV personal video information protection. But still, many products do not adhere to the guidelines, and those products are easily exposed to security threats, such as hacking. To solve these security vulnerabilities, this paper proposes a CCTV system that connects from remote locations, and is implemented by using secure shell (SSH) tunneling techniques. The system enhances security by transmitting encrypted data by using SSH. By using the tunneling technique, it also solves the problem of not being able to access a CCTV recorder located inside a firewall. For evaluation of the system, this paper compares various CCTV remote access schemes and security. Experimental results on the effectiveness of the system show it is possible to obtain remote access without a significant difference in transmission quality and time. Applying the method proposed in this paper, you can configure a system secure from the threats of hacking.

Up/Downlink Hybrid Inter-Cell Coordination Patterns of the TDD/MC-CDMA System, TDD/MC-CDMA

  • Han, Sang-Jin;Lee, Sung-Jin;Lee, Sang-Hoon;Gil, Gye-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5A
    • /
    • pp.421-428
    • /
    • 2009
  • Inter-cell coordination has been an emerging issue for mitigating inter-cell interference in broadband wireless access networks such as IEEE802.16 and 3GPP LTE (Long Term Evolution). This paper proposes uplink/downlink hybrid inter-cell coordination patterns for a TDD (Time Division Duplex)/MC-CDMA (Multi-Carrier Code Division Multiple Access) system. For the performance analysis, closed forms of inter-cell interferences are derived when uplink and downlink transmissions coexist over a multi-cell environment. In the analysis, we find an optimal ratio of downlink transmit powers of BSs (Base Stations) based on the target outage probability and the performance according to ratios of uplink/downlink transmit powers of MSs (Mobile Stations)/BSs is explored. Our numerical results show that interference mitigation utilizing the characteristics of the uplink and downlink power ratio is very effective in improving system performance in terms of QoS.

Performance Analysis of Transmission rate Scheduling Schemes for non-real Service in Burst-Switching (DS/CDMA) System (버스트 교환 방식 CDMA 시스템에서의 패킷 데이터 서비스를 위한 전송률 스케줄링 기법 비교 분석)

  • 김미정;김수원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5A
    • /
    • pp.574-582
    • /
    • 2004
  • This paper shows the performance comparisons of several different rate scheduling schemes for non-real time data service over the uplink of burst switching-based direct sequencecode division multiple access (DS/CDMA) system to support the integrated voice/data service. The closed-form solution of optimal scheduling formulation, which minimizes average transmission delay when all of the active data users are transmitting simultaneously, is presented and mathematical analyses with other rate scheduling schemes, which provide efficiency criterion of transmission delay for rate scheduling schemes, are performed. Numerical results show the analyses explicitly.

A Spectral Efficient NOMA-based Two-Way Relaying Scheme for Wireless Networks with Two Relays

  • Li, Guosheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.365-382
    • /
    • 2021
  • This paper proposes a novel two-way relaying (TWR) approach for a two-relay wireless network based on non-orthogonal multiple access (NOMA), where two terminals exchange messages with a cellular base station (BS) via two intermediate relay stations (RSs). We propose a NOMA-based TWR approach with two relaying schemes, i.e., amplify-and-forward (AF) and decode-and-forward (DF), referred to as NOMA-AF and NOMA-DF. The sum-rate performance of our proposed NOMA-AF and NOMA-DF is analyzed. A closed-form sum-rate upper bound for the NOMA-AF is obtained, and the exact ergodic sum-rate of NOMA-DF is also derived. The asymptotic sum-rate of NOMA-AF and NOMA-DF is also analyzed. Simulation results show that the proposed scheme outperforms conventional orthogonal multiple access based transmission schemes. It is also shown that increasing the transmit power budget of the relays only cannot always improve the sum-rates.

Sum-Rate Performance of A NOMA-based Two-Way Relay Approach for A Two-User Cellular Network

  • Li, Guosheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1944-1956
    • /
    • 2021
  • This paper considers a cellular two-way relay network with one base station (BS), one relay station (RS), and two users. The two users are far from the BS and no direct links exist, and the two users exchange messages with the BS via the RS. A non-orthogonal multiple access (NOMA) and network coding (NC)-based decode-and-forward (DF) two-way relaying (TWR) scheme TWR-NOMA-NC is proposed, which is able to reduce the number of channel-uses to three from four in conventional time-division multiple access (TDMA) based TWR approaches. The achievable sum-rate performance of the proposed approach is analyzed, and a closed-form expression for the sum-rate upper bound is derived. Numerical results show that the analytical sum-rate upper bound is tight, and the proposed TWR-NOMA-NC scheme significantly outperforms the TDMA-based TWR and NOMA-based one-way relaying counterparts.

Implementation of Android-Based Mobile Messenger with Security Function Using Specific AP (특정 AP를 이용한 안드로이드 기반 모바일 보안 메신저 구현)

  • Kim, Ji-Hyung;Lee, Choong-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.3
    • /
    • pp.102-107
    • /
    • 2015
  • Personal information leakage is one of the great recent issues, which can be caused by hacking or censorship when a messenger program is used between user groups in Android-based smartphones, In order to solve these problems, companies generally apply complex security procedures inside the messenger, but which degrade the efficiency of work. This paper proposes a method which can improve work efficiency and strengthen security by allowing only the clients that can access a particular AP, and implementing a closed messenger group. The proposed method is validated by implementing on the Android-based smartphones.

Throughput Analysis and Optimization of Distributed Collision Detection Protocols in Dense Wireless Local Area Networks

  • Choi, Hyun-Ho;Lee, Howon;Kim, Sanghoon;Lee, In-Ho
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.502-512
    • /
    • 2016
  • The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

Multi-homing in Heterogeneous Wireless Access Networks: A Stackelberg Game for Pricing

  • Lee, Joohyung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.1973-1991
    • /
    • 2018
  • Multimedia applications over wireless networks have been evolving to augmented reality or virtual reality services. However, a rich data size compared to conventional multimedia services causes bandwidth bottlenecks over wireless networks, which is one of the main reasons why those applications are not used widely. To overcome this limitation, bandwidth aggregation techniques, which exploit a multi-path transmission, have been considered to maximize link utilization. Currently, most of the conventional researches have been focusing on the user end problems to improve the quality of service (QoS) through optimal load distribution. In this paper, we address the joint pricing and load distribution problem for multi-homing in heterogeneous wireless access networks (ANs), considering the interests of both the users and the service providers. Specifically, we consider profit from resource allocation and cost of power consumption expenditure for operation as an utility of each service provider. Here, users decide how much to request the resource and how to split the resource over heterogeneous wireless ANs to minimize their cost while supporting the required QoS. Then, service providers compete with each other by setting the price to maximize their utilities over user reactions. We study the behaviors of users and service providers by analyzing their hierarchical decision-making process as a multileader-, multifollower Stackelberg game. We show that both the user and service provider strategies are closed form solutions. Finally, we discuss how the proposed scheme is well converged to equilibrium points.