• Title/Summary/Keyword: slotted ALOHA

Search Result 130, Processing Time 0.028 seconds

Multiple Access Scheme by Dynamically Applying the Power Increasing Method in the UHF RFID System (UHF대역 RFID system에서 전력상승기법을 동적으로 적용한 다중접속방법)

  • Yim, You-Seok;Hwang, Jae-Ho;Sohn, Sung-Hwan;Kim, Jae-Moung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.5
    • /
    • pp.12-20
    • /
    • 2008
  • RFID(Radio frequency indentification) technology, that the reader detect the tag information attached on the objects without contact, is considered the kernel of realizing tile Ubiquitous Sensor Network. Particularly, because there are lots of tags(which the reader have to detect) in the UHF RFID system(that is applied at the Logistic & Distribution industry). In the UHF RFID system the negative effects, we called the tag-collision, may occur and we should solve these effects. So, in the EPCglobal Gen2 protocol they present the Slotted Random Anti-collision algorithm to prevent the tag-collision effect. In this paper, in order to minimize the tag-collision effect and bring on the system efficiency, we propose the Power Increasing Method that controls the transmission power of the reader depending on the environment and verily the improved performance.

Efficient Anti-collision Method based on Tag Estimation in RFID systems (RFID시스템에서 태그 수 추정을 이용한 효율적인 충돌 회피 기법)

  • Shin, Song-Yong;Hwang, Gyung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.616-619
    • /
    • 2012
  • When multiple Tags transmit their IDs to the Reader, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, a new anti-collision method is proposed. The method estimates the number of tags and allocates proper number of slots based on the DFSA. The performance of proposed method is compared with existing methods through extensive simulations.

  • PDF

Dynamic Resource Allocation of Random Access for MTC Devices

  • Lee, Sung-Hyung;Jung, So-Yi;Kim, Jae-Hyun
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.546-557
    • /
    • 2017
  • In a long term evolution-advanced (LTE-A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta-distributed arrivals of devices, respectively.

A Mechanism for Dynamic Allocation of Frame Size in RFID System

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.364-369
    • /
    • 2008
  • The FSA algorithm for identifying multiple tags in RFID systems is based on the slotted ALOHA scheme with a fixed frame size. The performance of FSA algorithm is dependent on the frame size and the number of tags in the reader's identification range. Therefore, this paper proposes a new ODFSA. The proposed ODFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

Wavelength Division Multiple Access Protocols for High-Speed Optical Fiber Local Area Networks (고속 광 지역망을 위한 파장 분할 다중 접근 프로토콜)

  • 조원홍;이준호;이상배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.21-29
    • /
    • 1994
  • Three protocols based on the slotted Aloha technique are proposed for very high-speed optical fiber local area networks using wavelength division multiplexing (WDM) passive star topology and the throughputs and delays are derived. For getting a high probability in successful transmission of control packets determining the transmission of a data packet, we adopt control mini slot groups in these protocols. The retransmission probability is also considered in analysis. Both throughput and delay of three protocols are compared and analyzed by varying the number of control solt groups, the retransmission probability the length of a data packet and the number of channels. The numerical analysis shows that the proposed protocols adopted the control slot groups give the increase of throughput and the decrease of delay.

  • PDF

Priority oriented dobule reservation probocol for very high speed wireless LANs (초고속 무선 LAN을 위한 Priority Oriented Dobule Reservation 프로토콜)

  • 조광민;정상일;강철신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.1
    • /
    • pp.151-161
    • /
    • 1997
  • In this paper we designed a high speed wireless multiple access protocol, which is suitable for future multimedia wireless LAN systems which support high quality video teleconferencing, telephony and graphic databases. In the proposed protocol, Slotted-ALOHA protocol is used for transmitting random data packets and the packet reservation multiple access(PRMA) protocol for transmitting periodic data packets. The use of minislot is introduced for the reservation scheme. In order to measure the performance characteristic of the proposed protocol, a simulator is designed using an object oriented programming language, C++, and an exhaustive simulation study is carried out. From the simulation results, it is observed that the proposed protocol and the existing PRMA protocol have almost the same delay characteristic when network traffic is low. However, the proposed protocol is superior to the PRMA protocol when traffic becomes higher. The proposed protocol and the results can be utilized for the design of the wireless access systems and future broadband wireless LANs.

  • PDF

Design and Performance Analysis of a Contention-Based Reservation Protocol for a Local Area Optical Internet

  • Choi, Jin-Seek;Lee, Jang-Won;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.142-152
    • /
    • 2002
  • In this paper, we propose and analyze a new multiple access protocol for a local area optical Internet based on a wavelength division multiplexing technique which uses a passive star coupler. The proposed contention-based reservation protocol can support variable-length as well as fixed-length messages for transporting Internet packets with one reservation of a minislot at the beginning of a packet transmission. The minislot is used to reserve the data channel on the basis of the slotted ALOHA protocol and the control node ensures subsequent message transmission on the same wavelength. Thus, all messages need not be broken down to many fixed-length packets, and consecutive messages are transmitted through the same wavelength. Moreover, the proposed protocol reduces the collision probability of minislots and improves wavelength utilization. We determine the maximum throughput and verify the results with simulation.

  • PDF

An MAC Protocol based on Code Status Sensing and Acquisition Indication in CDMA Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.181-184
    • /
    • 2007
  • In this paper, a CSSMA/AI MAC protocol in packet CDMA network is presented. The main features of this protocol are the code status sensing and reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

Dynamic Slot Allocation Scheme for Voice Service in WATM (WATM에서 음성 서비스를 위한 동적 슬롯 할당 알고리즘)

  • 김관웅;박준성;정경택;전병실
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.9A
    • /
    • pp.1601-1608
    • /
    • 2001
  • 본 논문에서는 무선 ATM 환경에서 음성과 같은 실시간 서비스가 요구되는 트래픽의 QoS를 보장하기 위한 구현 방법을 제안하였다. 음성은 셀이 발생되는 토크스퍼트 구간과 셀이 발생되지 않는 휴지구간이 주기적으로 반복되는 특성을 갖는다. 따라서 음성과 같은 실시간 서비스의 QoS를 보장하기 위해서는 휴지구간 상태에 있는 음성단말의 수와 음성단말의 상태를 고려하여 음성단말의 수에 관계없이 일정한 QoS를 보장할 수 있어야 한다. 음성단말의 수에 관계없이 일정한 연결 지연시간을 제공하기 위하여, 휴지 상태에 있는 음성 단말 수와 휴지 상태의 지속시간에 따라서 동적으로 음성 예약 슬롯을 할당하는 방식을 제안한다. 컴퓨터 시뮬레이션을 통하여 slotted-ALOHA나 NC-PRMA 같은 기존의 슬롯 할당방법과 비교하였으며, 그 결과 제안된 방법이 동적으로 예약슬롯을 할당하여 부하에 관계없이 음성 트래픽에 일정한 지연시간과 낮은 충돌율을 제공하면서 프레임에 예약슬롯의 오버헤드를 최소화하므로, 채널 사용 효율을 높일 수 있음을 알 수 있었다.

  • PDF

Accelerating RFID Tag Identification Processes with Frame Size Constraint Relaxation

  • Park, Young-Jae;Kim, Young-Beom
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.242-247
    • /
    • 2012
  • In the determination of suitable frame sizes associated with dynamic framed slotted Aloha used in radio frequency identification tag identification processes, the widely imposed constraint $L=2^Q$ often yields inappropriate values deviating far from the optimal values, while a straightforward use of the estimated optimal frame sizes causes frequent restarts of read procedures, both resulting in long identification delays. Taking a trade-off, in this paper, we propose a new method for determining effective frame sizes where the effective frame size changes in a multiple of a predetermined step size, namely ${\Delta}$. Through computer simulations, we show that the proposed scheme works fairly well in terms of identification delay.