• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.123-140
• /
• 2011

In this paper, we propose an Energy Efficient Media Access Control (EE-MAC) protocol for wireless sensor networks. The proposed scheme is designed to save power consumption and guarantee quality-of-service for real-time traffic. EE-MAC uses the superframe structure which is bounded by the transmission of a beacon frame and can have an active and an inactive portion. The active period is divided into the contention free period (CFP) for real-time traffic transmission and the contention access period (CAP) for non-real-time traffic transmission. We propose the exclusively allocated backoff scheme which assigns a unique backoff time value to each real-time node based on bandwidth allocation and admission control. This scheme can avoid collision between real-time nodes by controlling distributed fashion and take effect a statistical time division multiple access. We also propose the algorithm to change the duty cycle adaptively according to channel utilization of media depending on network traffic load. This algorithm can prolong network lifetime by reducing the amount of energy wasted on idle listening.

• 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.

• 한국통신학회논문지
• /
• 제34권2B호
• /
• pp.162-169
• /
• 2009

메시지 인증 코드 (Message Authentication Code, MAC)는 메시지의 변조를 확인하기 위하여 사용되고 Mobile WiMAX 네트워크에서는 관리 메시지 (management message)의 인증을 위하여 Cipher-based 메시지 인증 코드 (Cipher-based MAC, CMAC)를 사용한다. 이 때 계산된 CMAC값 128 비트 중 하위 64 비트만을 사용하고 상위 64 비트 값은 잘라내어 사용하지 않는다. 본 연구에서는 이렇게 사용되지 않는 CMAC의 상위 64 비트를 공유 인증 정보 (Shared Authentication Information, SAI)라 하고 Mobile WiMAX 네트워크에서 유휴 모드 (idle mode) 상의 보안 취약점을 이용한 분산 서비스 거부 공격을 방어하는 수단으로 사용한다. 공유 인증 정보는 CMAC 값 중 사용되지 않는 64 비트를 사용하는 것이기 때문에 CMAC 값과 같은 보안성을 제공하며 CMAC 값을 계산하는 과정에서 얻을 수 있기 때문에 추가적인 계산이 필요 없다. 또한 사용하기 전까지 무선 구간에서 전송되지 않아 노출될 염려가 없으며 CMAC 키를 아는 기지국, 접근 서비스망 게이트웨이 (Access Service Network Gateway, ASN GW), 무선 단말 사이에서만 공유되기 때문에 안전하다. 이런 특성들로 인하여 공유 인증 정보는 분산 서비스 거부 공격 시에 기지국과 접근 서비스망 게이트웨이의 부하를 줄임으로써 효율적으로 분산 서비스 거부 공격을 방어할 수 있다.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.389-393
• /
• 2008

This paper describes a single-server queue where the server is unavailable during some intervals of time, which is referred to as vacations. The major contribution of this work is to derive general formulas for the additional delay in the vacation models of the single vacations, head of line priority queues with non-preemptive service, and multiple vacations and idle time.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.469-474
• /
• 2011

In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.

• 한국통신학회논문지
• /
• 제17권3호
• /
• pp.247-259
• /
• 1992

본 연구에서는 이동 통신의 AMPS 방식에서 통화를 하기 위해 셀 사이트와 이동체간에 오고 가는 데이터를 분석한 후, 광대역 데이터를 처리하기 위한 시스템을 설계하고 제작하였다. AMPS 방식에서 이동체가 셀 사이트와 통화를 하기 이전에 채널의 상태를 판단하는데 필요한 BUSY / IDLE 비트를 추\ulcorner라흔 회로, 동기 감지 회로, 인터럽트 방식의 데이터 송,수신 회로 및 적은 버퍼 용량을 차지하면서 실시간 처리를 할 수 있는 majority vote, BCH 인코딩 및 디코딩을 하는데 있어서 기존 방법에 따른 계산상의 복잡성을 해결하는 실시간 처리 소프트 웨어를 제안하였다.

• 산업경영시스템학회지
• /
• 제42권4호
• /
• pp.91-105
• /
• 2019

Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1 ≤ n ≤ K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

• Journal of Communications and Networks
• /
• 제6권3호
• /
• pp.245-257
• /
• 2004

Driven by the growing number of the mobile subscribers, efficient channel resource management plays a key role for provisioning multimedia service in the next generation personal communication systems. To reuse limited channel resources, diminishing the coverage areas of cells seems to be the ultimate solution. Thus, however, causes more handover events. To provide seamless connection environment for mobile terminals and applications, this article presents a novel handover scheme called the intelligent channel reservation (ICR) scheme, which exploits the location prediction technologies to accurately reserve channel resources for handover connections. Considering the fact that each mobile terminal has its individual mobility characteristic, the ICR scheme utilizes a channel reserving notification procedure (CRNP) to collect adequate parameters for predicting the future location of individual mobile terminals. These parameters will be utilized by the handover prediction function to estimate the expected handover blocking rate and the expected number of idle channels. Based on the handover prediction estimations, a cost function for calculating the damages from blocking the handover connections and idling channel resources, and a corresponding algorithm for minimizing the cost function are proposed. In addition, a guard channel decision maker (GCDM) determines the appropriate number of guard channels. The experimental results show that the ICR scheme does reduce the handover-blocking rate while keeping the number of idle channels small.

• 한국통신학회논문지
• /
• 제36권7B호
• /
• pp.780-788
• /
• 2011

IEEE 802.11 DCF 모드는 QoS 제공 기능을 포함하고 있지 않으므로, 무선랜에서 실시간 멀티미디어 서비스들을 제공하는 것이 어렵다. 본 논문에서는 IEEE 802.11b DCF 환경에서 실시간 멀티미디어 서비스 제공의 기반이 되는 가용대역폭 측정을 위한 효과적인 방법을 제안한다. 제안 방법은 매 측정 기간마다 총 채널 휴지 시간과 충돌 확률을 측정한다. 그리고 이들 측정값들과 전송과정에서의 MAC과 PHY 계층에서의 오버헤드를 고려하여, 가용대역폭을 측정한다. 실험은 OPNET을 사용하여 수행되었으며, 실험 결과는 제안 방법에서 측정한 가용대역폭이 기존의 방법들 보다 더 정확한 결과값을 제공함을 보여준다.

• ETRI Journal
• /
• 제44권2호
• /
• pp.220-231
• /
• 2022

Building smart transportation services in urban cities has become a worldwide problem owing to the rapidly increasing global population and the development of Internet-of-Things applications. Traffic congestion and environmental concerns can be alleviated by sharing mobility, which reduces the number of vehicles on the road network. The taxi-parcel sharing problem has been considered as an efficient planning model for people and goods flows. In this paper, we enhance the functionality of a current people-parcel taxi sharing model. The adapted model analyzes the historical request data and predicts the current service demands. We then propose two novel online routing algorithms that construct optimal routes in real-time. The objectives are to maximize (as far as possible) both the parcel delivery requests and ride requests while minimizing the idle time and travel distance of the taxis. The proposed online routing algorithms are evaluated on instances adapted from real Cabspotting datasets. After implementing our routing algorithms, the total idle travel distance per day was 9.64% to 12.76% lower than that of the existing taxi-parcel sharing method. Our online routing algorithms can be incorporated into an efficient smart shared taxi system.