• Title/Summary/Keyword: 셀룰라 시스템

Search Result 205, Processing Time 0.02 seconds

A Threshold-Based Distributed User Scheduling with Transmit Power Control for Uplink Multi-Cell Networks (다중 셀 상향링크 네트워크에서 송신전력제어를 이용한 임계값 기반 분산 사용자 스케쥴링)

  • Cho, Moon-Je;Ban, Tae-Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2607-2612
    • /
    • 2014
  • In this paper, we propose a distributed user scheduling with transmit power control based on the amount of interference inflicted to other BSs in multi-cell uplink networks. Assuming that the channel reciprocity time-division duplexing(TDD) system is used, the channel state information (CSI) can be obtained at each user from pilot signals from other BSs. The amount of generating interference to other BSs will be calculated at each user. Especially, in this paper, we propose the threshold-based transmit power control, in which a user decrease its transmit power if its generating interference to other BSs is larger than a predetermined threshold. Simulation results show that the proposed technique significantly outperforms the existing user scheduling algorithms.

Improving QoS using Mobility Management in Wireless Internet Environment (무선 인터넷에서 셀룰라 IP 이동성 관리에 의한 QoS 개선)

  • Yoon Young-Ji;Suk Kyung-Hyu;Park Dung-Suk;Hong Sung-Soo;Bae Chul-Soo;Na Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.495-500
    • /
    • 2006
  • 본 논문에서는 셀 환경에서 QoS를 보장하기 위해 통합된 페이징과 루프 정보 관리 캐시를 사용하는 Cellular IP 특성을 가진 Cellular-IP/PRC 네트워크를 제안한다. 제안한 호 수락 방식은, 이동 노드의 홈 기지국 용량이 충분하고, 인접 셀 이동 노드가 흠 기지국에서 호가 수락되었다고 가정할 경우 받을 간섭의 증가량을 고려해 통화 품질이 보장될 때, 홈 기지국은 새로운 호를 이동 노드의 송신 전력 예측에 기반을 둔 호 수락 방식이다. 무선인터넷 네트워크 내의 페이징과 라우터를 관리하기 위해 사용되었던 PC(Paging Cache)와 RC(Routing Cache)를 하나의 PRC(Paging Router Cache)로 통합 관리하고, 모든 노드 내에 구성하여 운용토록 하고, 이동 노드의 핸드 오프 및 로밍 상태를 효율적으로 관리 할 수 있도록 이동 노드에 핸드오프 상태 머신을 추가하고, 노드에서 관련 기능을 수행하도록 하였다. 시스템 환경에서 통화량에 영향을 주는 인자를 각 링크 통화권 및 불균형 정도를 예측, 하향링크에 의해 통화권이 제한을 판단하여 송수신 전력을 기반으로 한 알고리즘과 제안한 알고리즘을 비교하여 QoS가 호 차단 확률과 호 탈락 확률, GoS, 셀 용량의 효율을 예측할 수 있는 QoS로 성능 개선을 연구한다.

  • PDF

HIMIPv6: An Efficient IP Mobility Management Protocol for Broadband Wireless Networks (HIMIPv6: 광대역 무선 통신 네트워크를 위한 효율적인 IP 이동성 관리 프로토콜)

  • Jeong Hyeon-Gu;Kim Young-Tak;Maeng Seung-Ryoul;Chae Young-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.291-302
    • /
    • 2006
  • With the increasing deployment of mobile devices and the advent of broadband wireless access systems such as WiBro, WiMAX, and HSDPA, an efficient IP mobility management protocol becomes one of the most important technical issues for the successful deployment of the broadband wireless data networking service. IETF has proposed the Mobile IPv6(MIPv6) as the basic mobilitymanagement protocol for IPv6 networks. To enhance the performance of the basic MIPv6, researchers have been actively working on HMIPv6 and FMIPv6 protocols. In this paper, we propose a new mobility management protocol, HIMIPv6 (Highly Integrated MIPv6), which tightly integrates the hierarchical mobility management mechanism of the HMIPv6 and the proactive handover support of the FMIPv6 to enhance the handover performance especially for the cellular networking environment with high frequent handover activities. We have performed extensive simulation study using ns-2 and the results show that the proposed HIMIPv6 outperforms MIPv6, FMIPv6 and HMIPv6 in terms of signaling overhead, service interruption and packet lost during handovers.

Design and Analysis of Pseudorandom Number Generators Based on Programmable Maximum Length CA (프로그램 가능 최대길이 CA기반 의사난수열 생성기의 설계와 분석)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Han-Doo;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.2
    • /
    • pp.319-326
    • /
    • 2020
  • PRNGs(Pseudorandom number generators) are essential for generating encryption keys for to secure online communication. A bitstream generated by the PRNG must be generated at high speed to encrypt the big data effectively in a symmetric key cryptosystem and should ensure the randomness of the level to pass through the several statistical tests. CA(Cellular Automata) based PRNGs are known to be easy to implement in hardware and to have better randomness than LFSR based PRNGs. In this paper, we design PRNGs based on PMLCA(Programable Maximum Length CA) that can generate effective key sequences in symmetric key cryptosystem. The proposed PRNGs generate bit streams through nonlinear control method. First, we design a PRNG based on an (m,n)-cell PMLCA ℙ with a single complement vector that produces linear sequences with the long period and analyze the period and the generating polynomial of ℙ. Next, we design an (m,n)-cell PC-MLCA based PRNG with two complement vectors that have the same period as ℙ and generate nonlinear sequences, and analyze the location of outputting the nonlinear sequence.

Characteristic Polynomials of 90/150 CA <10 ⋯ 0> (90/150 CA <10 ⋯ 0>의 특성다항식)

  • Kim, Jin-Gyoung;Cho, Sung-Jin;Choi, Un-Sook;Kim, Han-Doo;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.6
    • /
    • pp.1301-1308
    • /
    • 2018
  • 90/150 CA which are used as key generators of the cipher system have more randomness than LFSRs, but synthesis methods of 90/150 CA are difficult. Therefore, 90/150 CA synthesis methods have been studied by many researchers. In order to synthesize a suitable CA, the analysis of the characteristic polynomial of 90/150 CA should be preceded. In general, the characteristic of polynomial ${\Delta}_n$ of n cell 90/150 CA is obtained by using ${\Delta}_{n-1}$ and ${\Delta}_{n-2}$. Choi et al. analyzed $H_{2^n}(x)$ and $H_{2^n-1}(x)$, where $H_k(x)$ is the characteristic polynomial of k cell 90/150 CA with state transition rule <$10{\cdots}0$>. In this paper, we propose an efficient method to obtain $H_n(x)$ from $H_{n-1}(x)$ and an efficient algorithm to obtain $H_{2^n+i}(x)$ and $H_{2^n-i}(x)$ ($1{\leq}i{\leq}2^{n-1}$) from $H_{2^n}(x)$ by using this method.