• Title/Summary/Keyword: 무선 정보 서비스

Search Result 3,149, Processing Time 0.028 seconds

User Scheduling Algorithm Based on Signal Quality and Inter-User Interference for Outage Minimization in Full-Duplex Cellular Networks (전이중 셀룰라 네트워크에서 아웃티지 최소화를 위한 신호 품질과 사용자간 간섭량 기반의 사용자 스케쥴링 알고리즘)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2576-2583
    • /
    • 2015
  • In a full-duplex (FD) wireless cellular network, uplink (UL) users induce the severe inter-user interference to downlink (DL) users. Therefore, a user scheduling that makes a pair of DL user and UL user to use the same radio resource simultaneously influences the system performances significantly. In this paper, we first formulate an optimization problem for user scheduling to minimize the occurrence of outage, aiming to guarantee the quality of service of users, and then we propose a suboptimal user scheduling algorithm with low complexity. The proposed scheduling algorithm is designed in a way where the DL user with a worse signal quality has a higher priority to choose its UL user that causes less interference. Simulation results show that the FD system using the proposed user scheduling algorithm achieves the optimal performance and significantly decreases the outage probability compared with the conventional half-duplex cellular system.

Device Personalization Methods for Enhancing Packet Delay in Small-cells based Internet of Things (스몰셀 기반 사물인터넷에서 패킷 지연시간 향상을 위한 디바이스 개인화 방법)

  • Lee, ByungBog;Han, Wang Seok;Kim, Se-Jin
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.25-31
    • /
    • 2016
  • Recently, with greatly improving the wireless communication technology, new services are created using smart sensors, i.e., machine-to-machine (M2M) and Internet of Things (IoT). In this paper, we propose a novel IoT device (IoTD) personalization method that adopt Small-cell Access Points (SAPs) to control IoTDs using user equipments (UEs), e.g., smart phones and tablet PC, from service users. First, we introduce a system architecture that consists of UE, IoTD, and SAP and propose the IoTD personalization method with two procedures, i.e., IoTD profile registration procedure and IoTD control procedure. Finally, through simulations, we evaluated the system performance of the proposed scheme and it is shown that the proposed scheme outperforms the conventional scheme in terms of the packet delay, packet loss probability, and normalized throughput.

An Adaptive Person/Vehicle Detection Algorithm for PIR Sensor (적외선 센서 기반의 사람/차량 탐지 적응 알고리즘)

  • Kim, Young-Man;Park, Jang-Ho;Kim, Li-Hyung;Park, Hong-Jae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.577-581
    • /
    • 2009
  • Recently, various new services based on ubiquitous computing and networking have been developed. In this paper, we contrive Adaptive PIR(Pyroelectric Infrared Radiation) Detection Algorithm (APIDA), a PIR-sensor based digital signal processing algorithm, that detects the movement of an invading object by the recognition of heat change in the detection area, since the object like person or car emits heat(i.e., infrared radition), We devised APIDA as a highly reliable signal processing algorithm that increases the successful detection rate and decreases the false alarm rate in the intruding object detection. According to performance evaluation experiment, APIDA shows the successful detection rate of 90% and low false alarm in the plain area.

Seamless handover protocol to reduce handover latency (핸드오버 지연 시간을 줄일 수 있는 심리스 핸드오버 프로토콜 제안 및 성능 분석)

  • Jang, Jong-Min;Lee, Yu-Tae;Lee, Soong-Hee;Kim, Dong-Il;Choi, Sam-Gil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.277-284
    • /
    • 2009
  • With significant development in wireless communication technologies, the needs to handover from one network to another have grown dramatically. Recently IETF developed MIPv6 and FMIPv6 which are used to handover between different access networks. These handover mechanisms have some known weaknesses. MIPv6 can not serve time-critical application because it causes long handover latency and packet loss. By these reasons, MIPv6 does not guarantee session continuity. FMIPv6 uses handover preparation phase to reduce DAD latency. However FMIPv66 still suffers from long handover latency, because it must perform binding update at the end of handover procedure. In this paper we propose new handover mechanism FMIPv6-PBU which eliminates binding update latency. The proposed mechanism has compatability with lagacy FMIPv6. In this paper propose FMIPv6-PBU handover procedure and explain its procedures and evaluate it with MIPv6 and FMIPv6.

A mobile data caching synchronization strategy based on in-demand replacement priority (수요에 따른 교체 우선 순위 기반 모바일 데이터베이스 캐쉬 동기화 정책)

  • Zhao, Jinhua;Xia, Ying;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.13-21
    • /
    • 2012
  • Mobile data caching is usually used as an effective way to improve the speed of local transaction processing and reduce server load. In mobile database environment, due to its characters - low bandwidth, excessive latency and intermittent network, caching is especially crucial. A lot of mobile data caching strategies have been proposed to handle these problems over the last few years. However, with smart phone widely application these approaches cannot support vast data requirements efficiently. In this paper, to make full use of cache data, lower wireless transmission quantity and raise transaction success rate, we design a new mobile data caching synchronization strategy based on in-demand and replacement priority. We experimentally verify that our techniques significantly reduce quantity of wireless transmission and improve transaction success rate, especially when mobile client request a large amount of data.

Comparative Analysis of Methods to Support Dynamic Adaptive Streaming over HTTP (HTTP 기반 동적 적응형 스트리밍 연구의 비교·분석)

  • Jin, Feng;Kim, Mijung;Yoon, Ilchul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.527-530
    • /
    • 2014
  • DASH is a well-known streaming technology, which was proposed in 2010 by MPEG and standardized in 2011. Major multimedia contents service providers, including Apple, Microsoft, and Adobe are all using this technology to support their media streaming services. Whenever a new service is requested to the server, the DASH technology helps servicing the multimedia streaming to client by recognizing the capacity of network and by adapting the quality of the multimedia contents. In DASH, the quality of multimedia contents will be automatically lowered to meet the fluctuating network status, when undesirable breaks interrupt the network. In this paper, we classified and analysed the advantages and disadvantages of DASH researches in three aspects: bit-rate measurement method, bandwidth aggregation method; rate adaptation metrics, algorithms and logics; user's experiences and QoE.

  • PDF

Technology and Policy for Blockchain-based Spectrum Sharing (블록체인 기반의 전파 공유 기술과 전파 정책)

  • Shin, Na Yeon;Nam, Ji-Hyun;Choi, Ye Jin;Lee, Il-Gu
    • Journal of Digital Convergence
    • /
    • v.17 no.10
    • /
    • pp.13-21
    • /
    • 2019
  • The restricted network or the unbalanced distribution of spectrum is causing the problems of lack of spectrum resources and deterioration of the service quality. In addition, the existing centralized radio sharing method has not been a fundamental solution for radio sharing and is inefficient in terms of cost, convenience, and security. In this paper, we propose a blockchain-based spectrum sharing as a low-cost, trustworthy, high-efficiency platform that can distribute and share spectrum resources, and propose policies to realize this. In the spectrum sharing platform, spectrum information about Wi-Fi AP and LTE mobile hotspot is registered in the blockchain, and spectrum sharers and users can conclude peer-to-peer spectrum sharing contract quickly and efficiently through smart contract. The pay for the shared spectrum resources and reward for spectrum quality management open platform ecosystem to activate the circulation-sharing and it can provide a convenient and efficient public wireless infrastructure.

A Group Key based Authentication Protocol Providing Fast Handoff in IEEE 802.11 (IEEE 802.11 환경에서 빠른 핸드오프를 제공하는 그룹키 기반의 인증 프로토콜)

  • Lee, Chang-Yong;Kim, Sang-Jin;Oh, Hee-Kuck;Park, Choon-Sik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.103-113
    • /
    • 2008
  • Reducing handoff latency is essential in providing seamless multimedia service in Wireless LAN based on the IEEE 802.11 standard. Reducing authentication delay is critical in reducing handoff latency. To this end, several authentication protocols for fBst handoff have been proposed. Mishra et al. used proactive key distribution to improve the authentication delay incurred in the current standard and Park et al. proposed a new authentication protocol based on Blom's key pre-distribution scheme. In this paper, we propose an enhanced authentication protocol based on Bresson et al.'s group key protocol. If a mobile node has previously access the network, our proposed protocol only requires simple hash operations in providing mutual authentication between a mobile node and access points. Our protocol is more efficient than Park et al.'s and Mishra et al.'s technique can be used in our protocol to further enhance our protocol.

Stochastic Mobility Model Design in Mobile WSN (WSN 노드 이동 환경에서 stochastic 모델 설계)

  • Yun, Dai Yeol;Yoon, Chang-Pyo;Hwang, Chi-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.8
    • /
    • pp.1082-1087
    • /
    • 2021
  • In MANET(mobile ad hoc network), Mobility models vary according to the application-specific goals. The most widely used Random WayPoint Mobility Model(RWPMM) is advantageous because it is simple and easy to implement, but the random characteristic of nodes' movement is not enough to express the mobile characteristics of the entire sensor nodes' movements. The random mobility model is insufficient to express the inherent movement characteristics of the entire sensor nodes' movements. In the proposed Stochastic mobility model, To express the overall nodes movement characteristics of the network, the moving nodes are treated as random variables having a specific probability distribution characteristic. The proposed Stochastic mobility model is more stable and energy-efficient than the existing random mobility model applies to the routing protocol to ensure improved performances in terms of energy efficiency.

Cascade AOA Estimation Algorithm Based on FMCCA Antenna (FMCCA 안테나 기반 캐스케이드 도래각 추정 알고리즘)

  • Kim, Tae-Yun;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1081-1088
    • /
    • 2021
  • The modern wireless communication system employes the beamforming technique based on a massive array antenna with a number of elements, for supporting the smooth communication services. A reliable beamforming technology requires the Angle-of-Arrival(: AOA) information for the signal incident to the receiving antenna, which is generally estimated by the high-resolution AOA estimation algorithm such as Multiple Signal Classification(: MUSIC). Although the MUSIC algorithm has the excellent estimation performance, it is difficult to estimate AOA in real time for the massive array antenna due to the extremely high computational complexity. In order to enhance this problem, in this paper, we propose the cascade AOA estimation algorithm based on a Flexible Massive Concentric Circular Array(: FMCCA) antenna with the On/Off function for antenna elements. The proposed cascade algorithm consists of the CAPON algorithm using some elements among entire antenna elements and the Beamspace MUSIC algorithm using entire elements. We provide computer simulation results for various scenarios to demonstrate the AOA estimation performance of the proposed approach.