• Title/Summary/Keyword: 슬롯 ALOHA

Search Result 67, Processing Time 0.024 seconds

A Survey of Interference Cancellation for TDMA System (TDMA 시스템에서의 간섭제거기법 연구)

  • 최영철;임용곤;박종원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.753-756
    • /
    • 2001
  • Automatic Identification System(ALS) employed SOTDMA for the multiple access method. In SOTDMA systems, slot reuse may result in discrimination or garbling. Especially Gaussian Minimum Shift Keying(GMSK) Co-Channel Interference(CCI) resulted from the slot reuse in the Aloha zone degrades the system performance such as capacity In this paper we introduce some useful techniques to cancel the CCI and discuss the methodology which is applicable to AIS-SOTDMA

  • PDF

Throughput Analysis of Slotted ALOHA in Cognitive Radios (인지무선통신 환경에서 슬롯-알로하 기법의 전송 효율 분석)

  • Wang, Hanho;Woo, Choongchae
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.1
    • /
    • pp.41-44
    • /
    • 2015
  • In cognitive radios, exponentially distributed idle period(EIP) is considered in this paper. In the EIP case, durations of idle periods are be limited and varied by primary traffic arrivals. Accordingly, we first analyze the idle period utilization which can be achieved by the slotted ALOHA in cognitive radio communications. The idle period utilization is a newly defined performance metric to measure the transmission performance of the secondary network as effective time durations utilized for successful secondary transmissions in an idle period. Then, the idle period utilization is maximized through controlling the data transmission time. All technical processes are mathematically analyzed and expressed as closed form solutions.

Dynamic Round size Decision Algorithm for Identification of REID Tag (RFID 태그 인식을 위한 동적 Round Size 결정 알고리즘)

  • Lee Seung-Hyuk;Park Il-Yong;Cho Tae-Kyung;Yoo Hyun-Joong;Park Byoung-Soo;Baek Hyun-Ok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.3
    • /
    • pp.373-378
    • /
    • 2006
  • One of the biggest problems that should be solved in present RFID systems is a reduction of identification efficiency by the collision of singals between different tags. As the number of tags, which should be identified, increases over the size of allocated round, more slots experiences the collision between them. It can causes generation of tag collision assigning the fixed round size and so, allocated round size should be regulated properly. This paper proposes the algorithm which can reduce collision between tags, and allocate specific round size dynamically for efficient tag identification. After each round is finished, the reader allocates the round size dynamically using the collision information of the slot. All collision informations of the slot consists of the number of slots which came into conflict, tags which were realized properly without any conflictions and empty slots. We used slotted aloha algorithm as the collision detection algorithm and finally, checked that this could be used very usefully when this algorithm which was proposed effectively could not know how many number of tags were exisisted through the simulation in advance.

  • PDF

Slotted ALOHA Random Access with Multiple Coverage Classes for IoT Applications (사물인터넷 응용을 위한 다중 커버리지 클래스를 지원하는 슬롯화된 알로하 랜덤 접속)

  • Kim, Sujin;Chae, Seungyeob;Cho, Sangjin;Rim, Minjoong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.554-561
    • /
    • 2017
  • IoT (Internet of Things) devices are often located in environments where indoor or underground, signals are difficult to reach. In addition, the transmission power is low, the base station should be designed to be able to receive signals even at low reception sensitivity. For this reason, a device having a poor channel condition can be transmitted at a low data rate using a low coding rate or repetition. When the coverage class is divided according to the channel condition and the data rate, the packet length may vary from one coverage class to another, and the performance of the slotted aloha random access may be degraded. We will focus on two methods of using shared-resource and seperate resources among multiple slotted aloha methods. In particular, when devices with different coverage classes use shared resources, performance of a device with a bad channel condition may deteriorate. Conversely, when using separate resources for each coverage class, there is a problem that congestion may occur which increases the number of devices that perform random access to one resource area. In this paper, we propose some methods to overcome this problem. This study is mainly focused on MTC devices, and is considered to be a high possibility of future development.

Performance Analysis of CDMA Reservation ALOHA for Multi-traffic Services (다중 트랙픽 지원을 위한 CDMA 예약 ALOHA 방안의 성능 분석)

  • Jo, Chun Geun;Heo, Gyeong Mu;Lee, Yeon U;Cha, Gyun Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1852-1861
    • /
    • 1999
  • In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.

  • PDF

MAC Protocol based on Spreading Code Status-Sensing Scheme for Integrated Voice/Data Services (확산코드 상태 감지 기법에 의한 통합 음성/데이터 서비스 MAC 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.916-922
    • /
    • 2001
  • A medium access control protocol is proposed for integrated voice and data services in the packet CDMA network with a small coverage. Uplink channels are composed of time slots and multiple spreading codes for each slot. This protocol gives higher access priority to the delay-sensitive voice traffic than to the data traffic. During a talkspurt, voice terminals reserve a spreading code to transmit multiple voice packets. On the other hand, whenever generating a data packet, data terminals transmit a packet based on the status Information of spreading codes in the current slot, which is received from base station. In this protocol, voice packet does not come into collision with data packet. Therefore, this protocol can increase the maximum number of voice terminals.

  • PDF

A Study on initial value Q of Anti-collision Algorithm in Gen2 Protocol Based RFID Systems (GEN2 기반 RFID 시스템에서의 충돌방지 알고리즘의 초기 값 Q에 대한 연구)

  • Im, Song-Bin;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.33-39
    • /
    • 2010
  • In this paper, we propose an improved anti-collision algorithm. We have designed an anti-collision unit using this algorithm for the 18000-6 Type C Class 1 Generation 2 standard (Gen2). The Gen2 standard uses a Q-algorithm for incremental method on the Dynamic Slot-Aloha algorithm. It has basically enhanced performance over the Slot-Aloha algorithm. Unfortunately, there are several non-clarified parts: initial value. If an incorrect value is selected, it causes degradation in performance. To increase throughput and system efficiency, and to decrease tag identification time, we propose an improved anti-collision algorithm. prorosed Q algorithm has an increment of 5% of system efficiency and a decrement of 9% of tag identification time.

Modeling and Analysis of Link Initialization Access of RE-DSRC (RF-DSRC 링크초기접속 모델링 및 분석)

  • Lee Min-Heui;Kwag Su-Jin;Jung Jong-In;Lee Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.4 no.2 s.7
    • /
    • pp.23-31
    • /
    • 2005
  • ITS(Intelligent Transportation System) implementing information collection services and information support services for cars of moving fast needs a communication system of special aim such as RF-DSRC(Radio Frequency Dedicated Short Range Communication). Before RSE(Road Side Equipment) and OBE(On-Board Equipment) will be able to communicate RF-DSRC, OBE first have to request Link Initialization Access using ACTC(Activation Channel) in allocated ACTS(Activation Slot) by Slotted ALOHA. Even though Link Initialization Access is a important element to decide performance of communication system, optimal mathematic modeling study of Link Initialization Access which is adapted RF-DSRC characteristics is not enoush. So, in this paper, we propose mathematical modeling about Link Initialization Access of RF-DSRC. And then we computed Link Initialization Access probability defining offer load(G) which is adapted RF-DSRC characteristics for analyzing performance of modeling.

  • PDF

Reserved Slot Allocation Scheme for Voice Service in WATM MAC (무선 비동기 전송모드 매체 접근제어에서 음성서비스를 위한 예약 슬롯 할당 알고리즘)

  • 김관웅;배성환;전병실
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.7
    • /
    • pp.101-108
    • /
    • 2001
  • In this paper we focus on dynamic reservation slot allocation scheme for supporting QoS of a voice traffic in WATM MAC. Especially, voice traffic is the most important real-time object, and so we propose a new MAC protocol for voice traffic over WATM networks in the multimedia environment. According to the characteristics of voice traffic which is repeatedly in silent state and active state, new protocol allocates reservation slots dynamically with respect to the number of silent voice source of which starting time is stored to the state table in base station (BS). The simulation results show that the proposed protocol has better performance than slotted ALOHA in average access delay, collision rate, better than NC-PRMA(Non Collision Packet Reservation Multiple Access) in band width efficiency, and can provide a certain level of QoS requirement by the given slot assignment even though the number of voice terminals is increased.

  • PDF

Improvement of Tag Collection Performance for Active RFID Systems (능동형 RFID 시스템을 위한 태그 수집 성능 개선)

  • Yoon, Won-Ju;Chung, Sang-Hwa;Moon, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.518-527
    • /
    • 2008
  • Tag collection is one of the major functions in Radio Frequency Identification (RFID) systems. IS0/IEC 18000-7 defines the tag collection algorithm using the anti-collision algorithm, based on the framed slotted ALOHA for active RFID systems. However, it has inefficiency problems that reduce tag collection performance by deciding non-optimum slot size or using point-to-point commands to put collected tags to sleep. In this paper, we propose two mechanisms to overcome the inefficiency problems and improve tag collection performance: 1) a new slot size decision mechanism to allow the reader to choose the optimum slot size flexibly and 2) a broadcast-based sleep mechanism to put collected tags to sleep effectively. We also implemented an active RFID system, composed of an active RFID reader and multiple tags, and the reader is designed to maximize tag collection performance when the proposed mechanisms are applied. In experiments, we evaluated the tag collection performance using one reader and 50 tags in the real-world environment. The experimental results show that when two mechanisms are applied and the initial number of slots is chosen appropriately, the performance of the proposed tag collection algorithm is greatly enhanced, compared with that of the standard.