• 정보저장시스템학회논문집
• /
• 제2권1호
• /
• pp.43-49
• /
• 2006

Fractal/angle multiplexing is a $LiNBO_3$ crystal using a X-Y Galvano mirror, and the random access concept in fractal/angle multiplexing are discussed in this paper. First, the brief introduction of the designed holographic digital data storage system is presented. Then, the average access time concept for the storage system is newly defined, and the comparison of the average access time between the holographic storage and a conventional optical disk is performed. Second, the basic simulation and experiment to find the X-Y Galvano mirror dynamics are conducted. From this analysis, we find that the average access time in our HDDS which has 6 degree scan angle is about 5 msec. This result is very high performance when it compared with the average access time of a conventional optical disk. Finally, some recording results using fractal/angle multiplexing are presented, then, the relationship between bit error rate and angle mismatch for the each multiplexing are discussed.

• 한국ITS학회 논문지
• /
• 제4권1호
• /
• pp.107-115
• /
• 2005

For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

• 한국정보통신학회논문지
• /
• 제25권10호
• /
• pp.1391-1396
• /
• 2021

경계 기반 보안체계는 보안 솔루션의 운영 효율성이 높고 관리가 쉬운 장점이 있으며 외부의 보안 위협을 차단하기에는 적합하다. 그러나 신뢰된 사용자를 전제로 운영되기 때문에, 내부에서 발생하는 보안 위협은 차단하기에는 적합하지 않다. 경계 기반의 보안체계의 이러한 문제점을 해결하고자 제로 트러스트 접근통제 모델이 제안되었다. 제로 트러스트 접근통제 모델에서는 실시간 보안 이벤트 모니터링에 대한 보안 요구사항을 만족해야 한다. 본 연구에서는 실시간 모니터링 기능 중 가장 기본적인 파일 접근에 대한 모니터링 방법을 제안한다. 제안하는 모니터링 방법은 kernel level에서 동작하여 사용자의 파일 우회 접근에 의한 모니터링 회피를 원천적으로 방지할 수 있는 장점이 있다. 다만 본 연구는 모니터링 방법에 집중하고 있어, 이를 접근통제 기능까지 확대하기 위한 추가 연구는 계속되어야 한다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.1-11
• /
• 2021

Development of ICT technologies leads exponential growth of various sharing economy over the last couple of years. The intuitive advantage of the sharing economy is efficient utilization of idle goods and services, but there are safety and security concerns. In this paper, we propose a onetime password based access control system to support secure accommodation sharing service and show the implementation results. To provide a secure service to both the provider and the user, the proposed system issues a onetime access password that is valid only during the sharing period reserved by the user, thereafter access returns to the accommodation owner. Especially, our system provides secure user access by merging the two elements of speaker recognition using voice and a one-time password to open and close the door lock. In this paper, we propose a secure system for accommodation sharing services as a use-case, but the proposed system can be applicable to various sharing services utilizing security-sensitive facilities.

• 한국경영과학회지
• /
• 제28권2호
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• Journal of information and communication convergence engineering
• /
• 제5권2호
• /
• pp.88-92
• /
• 2007

In this paper, an SS-RRA protocol that is based on Code Division Multiple Access is proposed and analyzed under the integrated voice and data traffic load. The backward logical channels consist of slotted time division frames with multiple spreading codes per slot. The protocol uses a reservation mechanism for the voice traffic, and a random access scheme for the data traffic. A discrete-time, discrete-state Markov chain is used to evaluate the performance. The numerical results show that the performance can be significantly improved by a few distinct spreading codes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
• /
• pp.248-251
• /
• 2000

The ATM-PON is regarded as an effective access network because the system transmits the various user's information through the passive optical splitter in a single platform. The ranging technology is to place all ONUs at the same distance virtually in order to form ATM-PON based on the Time Division Multiplexing (TDM). In This paper, We show the steps about ranging protocol based on ITU-T G.983.1 and ranging procedure modeling. Also, We implement the simulator that considers various environments to verify the time specifications of G.983.1. By using the simulator, We find out the wasted bandwidth which influences active ONUs during the ranging procedure.

• 한국컴퓨터정보학회논문지
• /
• 제9권2호
• /
• pp.41-48
• /
• 2004

유비쿼터스 시대에 접근제어 프로토콜은 외부 이동단말이 내부 정보서버로 접속 시에 접근제어를 위한 검증을 하여야 한다. 본 논문에서 제안하는 외부 이동단말을 위한 IP 접근제어 프로토콜은 이동단말기에서 서명의 암호화 연산 시 연산시간의 효율성을 고려한다. 신뢰성 있는 통신기관에서 발급해준 개인 식별정보를 공개키로 사용하도록 하고, 서명 암호화 생성과 검증에 사용되는 암호화 알고리즘은 ECDSA에서 정의한 변수를 사용하며, 타원 곡선상의 키값은 160비트 이상을 사용한다. 또한 접근제어는 IP 계층에서 실시하며 IPv6의 프레임 구조를 갖도록 설계한다. 외부 이동단말의 접근제어를 위한 암호화 인증과 검증의 과정에서 프로토콜의 보안성을 강화하였고, 기존의 프로토콜들에 연산시간에 비해 4배 이상의 성능향 상이 이루어졌음을 증명하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.447-448
• /
• 2021

경계 기반 보안 관리체계는 보안 솔루션 배치가 쉽고, 그 운영 효율성이 높은 장점이 있다. 경계 기반 보안 관리체계는 외부에서 발생하는 보안 위협을 차단하기 적합하지만, 내부에서 발생하는 보안 위협을 차단하기에는 부적합하다. 안타깝게도 내부에서 발생하는 보안 위협은 갈수록 그 빈도가 증가하고 있다. 이러한 한계점을 극복하기 위하여 제로 트러스트 모델이 제안되었다. 제로 트러스트 모델에서는 다양한 정보 자원에 접근하는 주체의 행위를 분석하기 위하여, 실시간 모니터링 기능을 요구하고 있다. 그러나 시스템에 신뢰된 것으로 확인된 주체의 파일 접근을 실시간으로 모니터링 하는 것은 그 한계가 있다. 이에 따라 본 연구에서는 사용자의 파일 접근을 실시간으로 모니터링 할 수 있는 방법을 제안한다. 제안하는 모니터링 방법의 실효성을 검증하기 위하여 실증 구현 후 목표하는 기능을 검증하였다. 그 결과, 본 연구에서 제안하는 방법은 파일에 대한 접근을 실시간으로 모니터링 할 수 있다고 확인되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권1호
• /
• pp.185-201
• /
• 2023

Grant-free random access (GFRA) can reduce the access delay and signaling cost, and satisfy the short transmission packet and strict delay constraints requirement in internet of things (IoT). IoT is a major trend in the future, which is characterized by the variety of applications and devices. However, most existing studies on GFRA only consider a single type of device and omit the effect of access delay. In this paper, we study GFRA in multicell massive multipleinput multiple-output (MIMO) systems where different types of devices with various configurations and requirements co-exist. By introducing the backoff mechanism, each device is randomly activated according to the backoff parameter, and active devices randomly select an orthogonal pilot sequence from a predefined pilot pool. An analytical approximation of the average spectral efficiency for each type of device is derived. Based on it, we obtain the optimal backoff parameter for each type of devices under their delay constraints. It is found that the optimal backoff parameters are closely related to the device number and delay constraint. In general, devices that have larger quantity should have more backoff time before they are allowed to access. However, as the delay constraint become stricter, the required backoff time reduces gradually, and the device with larger quantity may have less backoff time than that with smaller quantity when its delay constraint is extremely strict. When the pilot length is short, the effect of delay constraints mentioned above works more obviously.