• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.686-693
• /
• 2009

In this paper, we propose an efficient tag sleep method utilizing empty time slots for improving the tag collection performance in active RFID systems. In the proposed tag sleep method, the reader detects the occurrence of empty time slots by carrier sensing and utilizes the wasted empty time slots to transmit sleep commands to the collected tags throughout the framed slotted aloha-based tag collection process, resulting in reducing the time required for tag collection. Via the simulation experiments, we evaluated the performance of the tag collection applied with the proposed tag sleep method, compared with that of the basic tag collection. The simulation results showed that the tag collection applied with the proposed tag sleep method could reduce the average tag collection time by 12.28%, 12.30%, and 13.31 %, for the framed slotted aloha with the fixed 128 time slots and 256 time slots, and the dynamic framed slotted aloha anticollision protocols, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12B
• /
• pp.1665-1676
• /
• 2001

The effect of spreading gain control on the throughput of a CDMA slotted ALOHA system is considered. Mobile users transmit packets over a shared channel, and the packets transmitted in the same time slot over the shared channel act as simultaneous access interference (SAI). When using spread-spectrum signal, a CDMA slotted ALOHA channel achieves high probability of capture due to the property of high title resolution, and the bit rate of user information is determined by spreading gain. When the SAI level gets larger, the high value of spreading gain enhances the packet throughput by increasing the probability of a successful packet transmission, while it degrades the of the effective throughput by reducing the user information bits carried within a packer. To solve the problem, we investigated the effect of the capture probability and the SAI level on these system throughputs, and evaluated the throughput performance of the system for each spreading gain control scheme. The results showed that the maximum effective throughput could be achieved with an unified method despite the variation of the SAI level by deriving an optimal value of the spreading gain according to 171e system states.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12A
• /
• pp.1821-1827
• /
• 2000

차세대 이동 통신은 음성만이 아닌 멀티미디어 서비스 지원이 필수적이다. 그 중에서도 CLSP(Channel Load Sensing Protocol)에 의한 CDMA ALOHA 방식은 기지국에 있는 허브(HUB)에서 채널의 부하를 센싱하여 일정 문턱 값($\alpha$) 이상의 패킷이 기지국에 수신될 경우 모든 단말기에 접속 불가 명령을 송신함으로써 기존의 ALOHA 방식보다 처리효율을 높였다. 그러나 기존에 고정된 문턱 값은 가변적인 트리픽 부하에 따라서 처리율도 가변적으로 변함으로써 최상의 처리율을 얻지 못했다. 본 논문은 대역확산 Slotted ALOHA 네트워크의 처리율을 높이기 위해서 매 슬롯마다 허브에서 계산되어진 패킷 수를 이용하여 다음 슬롯에 최상의 처리율을 얻을 수 있도록 패킷 문턱 값($\alpha$)을 설정해 주는 알고리즘을 제안하였다. 또한 음성과 데이터 트래픽이 혼합된 멀티미디어 트래픽이 기지국에 수신될 때, 제안된 알고리즘을 사용하여 실시간 트래픽인 음성 트래픽에 따라 데이터 문턱 값(${\gamma}$)을 선택함으로써 실시간 트래픽에 대한 처리율을 향상시켰다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1889-1899
• /
• 2015

In this paper, we propose a multiple slot reservation scheme to transmit data rapidly in the satellite random access channel. In the R-CRDSA (Reservation scheme with Contention Resolution Diversity Slotted ALOHA), each satellite terminal can use only one slot in a frame. Therefore, many slots are wasting in the low traffic load and the satellite terminals which have large date needs many frame to transmit their data although there are unused slots. In the multiple slot reservation scheme, each satellite terminal transmits a packet with their data size and reserves many slots in the light of data size and slot reservation status. Therefore, each satellite terminal transmits their data faster than R-CRDSA. This is because they can reserve many slots in a frame. Furthermore, we simulate proposed scheme and validate the performance of proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1517-1530
• /
• 2017

Traditional anti-collision algorithms determine slot size of initial frame based on the information of number of collision slots, idle slots, and success slots. Since there is no information about collision at the beginning of tag information collection, traditional anti-collision algorithms can not determine the initial frame size. Considering that performance of anti-collision algorithm is very sensitive to initial slot size traditional anti-collision algorithms need some improvements. In this study two methods are proposed to determine slot size of initial frame efficiently, through which we can improve the performance of dynamic frame slotted aloha algorithm. To verify the performance of proposed algorithms, 2.4GHz RFID system is used. Throughput and delay time are derived through simulation, which is developed using JAVA. We have seen that proposed algorithm improves throughput by 9.6% and delay time by 9.8%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1173-1183
• /
• 1998

This paper proposes an SS-PRMA protocol for the integrated voice and data services in the packet radio networks. In this protocol, the uplink logical channels are provided by combining the time slots and the spreding codes. SS-PRMA protocol contains some features of existing protocols such as PRMA, slotted ALOHA, and CDMA. In the proposed protocol, the voice terminals use a reservation mechanism, and the dta terminals use a slotted ALOHA scheme. The analysis and the simulation results show that most of the performances for the voice traffic can be achieved by employing a few distinct spreading codes and the data traffic throughput is closely related to the number of spreading code channels. Also it shows that the data traffic performance can be significantly improved by applying an FEC scheme to the data link layer.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.29-36
• /
• 2010

Consider an RFID network configured as a star such that a single reader is surrounded by a crowd of tags. In the RFID network, prior to attaining the information stored at a tag, the reader must cognize the tags while arbitrating a collision among tags' responses. For this purpose, we present a tag cognizance scheme based on framed and slotted ALOHA, which statically provides a number of slots in each frame for the tags to respond. For the evaluation of the cognizance performance, we choose the cognizance completion probability and the expected cognizance completion time as key performance measures. Then, we present a method to numerically calculate the performance measures. Especially, for small numbers of tags, we derive them in a closed form. Next, we formulate a problem to find an optimal time structure which either maximizes the cognizance completion probability under a constraint on the cognizance time or minimizes the expected cognizance completion time. By solving the problem, we finally obtain an optimal number of slots per frame for the tags to respond. From numerical results, we confirm that there exist a finite optimal number of slots for the tags to respond. Also, we observe that the optimal number of slots maximizing the cognizance completion probability tends to approach to the optimal number of slots minimizing the expected cognizance completion time as the constraint on the cognizance time becomes loose.

• Proceedings of the KSR Conference
• /
• 2003.10c
• /
• pp.594-599
• /
• 2003

This paper proposed to compare and analyze the data throughput of ALOHA and Slotted-ALOHA method which were used to the communication of satellites in an early stage and apply to the data throughput of a transponder in an RFID system. The ALOHA method is the operation priority to a transponder but the Slotted ALOHA method is the operation priority to an reader in an RFID system. Because ALOHA method transmits the data to an reader as a authority of a transponder at random time when generating collisions, therefore, it seems reasonable to conclude that ALOHA method is inefficient for the data throughput and the efficiency of collision interval than Slotted-ALOHA method that synchronizes and controls the transponder in an reader.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.53-58
• /
• 2012

With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.502-510
• /
• 1994

CDMA technique has been largely focused for Wireless Data Communication and Personal Communication Network. ALOHA protocol also has been proven to be effective for Packet Radio Radio Network regardless of low throughput due to channel collisions. In this paper, we evaluate the performance of MS-CDMA-ALOHA (Mini-Slotted-CDMA-ALOHA) system, by analytic and simulation method. The superiority of the MS-CDMA-ALOHA system over conventional Slotted ALOHA and Slotted-CDMA-ALOHA systems are clearly demonstrated for throughput, delay and stability performances.