• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.756-758
• /
• 2010

Fixed frame size is used in the RFID system with the frame-based slot ALOHA algorithm. Therefore, it is anticipated that the tag identification performances will highly depend on the number of tags within the reader's identification range and the frame size. In this paper, we propose a tag number estimation scheme and analyze the performance with the computer simulations. The proposed scheme is based on the status of slots that the tags respond during a query round as well as the probabilistic calculations.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11A
• /
• pp.1630-1641
• /
• 2000

본 논문은 셀룰러 시스템 상향 링크에서 음성데이터 및 실시간 영상데이터로 구성된 화상전화서비스, 고속 및 저속 데이터베이스의 다중 전송률 멀티미디어 서비스를 통합 지원할수 있는 CDMA R-ALOHA 프로토콜을 제안하였다. 제안된 프로토콜은 액세스슬롯과 전송슬롯으로 구분된 프레임의 구조를 이용한 코드할당 방식으로 전송슬롯에서의 간섭을 줄였다. 그리고, 각 서비스의 트래픽 특성에 따른 전송코드 예약과 화상전화서비스 사용자의 핸드오프호를 고려하여 분석된 각 서비스 부시스템의 Markov-chain 모델을 이용한 각 서비스의 채널 경쟁 사용자수 추정을 기반으로 서비스별 액세스 허용확률을 제안하여, 액세스슬롯에서의 패킷 충돌을 감소시키고 핸드오프호의 우선권을 보장할 수있다. 또한 화상전화서비스의 영상데이터 전송정보를 이용한 코드 예약방식을 제안하여, 음성 트래픽을 패킷의 손실이 없이 지원하였고 고속 및 저속 데이터베이스를 통해 채널 이용효율을 극대화하였다.

• 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.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.2
• /
• pp.21-28
• /
• 2011

We consider an RFID network configured as a star in which tags stationarily move into and out of the vicinity of the reader. To cognize the neighboring tags in the RFID network, we propose a scheme based on dynamic framed and slotted ALOHA which determines the number of slots belonging to a frame in a dynamic fashion. The tag cognizance scheme distinctively employs a rule for estimating the expected number of neighboring tags, identified as R-retrospective maximum likelihood rule, where the observations attained in the R previous frames are used in maximizing the likelihood of expected number of tags. Simulation result shows that a slight increase in depth of retrospect is able to significantly improve the cognizance performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1569-1574
• /
• 2008

Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA 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.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.141-155
• /
• 2002

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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.33-41
• /
• 2008

As RFID technology is developing and increasingly being used in many applications, the implementation is changing from single reader to multiple readers even dense readers. Since the number of readers is increasing, there are more collisions between readers and much interference between readers and tags. Therefore, to avoid interference or collision, many algorithms have being proposed, such as Gen2 dense mode, LBT(listen before talk), TDMA based method. In this paper, we propose a null frame algorithm, which calculates the collision probability in frame slotted aloha scheme and use this information to avoid the possible collisions. Comparing with conventional scheme, our proposed algorithm has some advantages in terms of reader collision number and required frame numbers.

• 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.