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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.315-327
• /
• 2013

Wireless Body Area Network (WBAN) is a network around a human body within 3~5m which consists of medical or non-medical device. WBAN has to satisfy many kinds of demands such as low-power, a variety of data rate and a data priority. Especially, it is hard for the nodes for monitoring vital signs to replace battery. Thus energy and channel efficiency is important because the battery power is limited. In this thesis, a novel algorithm for reducing the energy consumption is proposed. The proposed algorithm adjusts transmission period according to traffic. by means of determining transmission period by amount of data, the node can reduce energy consumption. Energy detection is performed in order to guarantee data priority before attempting to transmit. In case of failing to transmit, it is proposed that energy consumption is reduced through avoiding collision by changing priority. The comparison result shows that the proposed algorithm reduces power consumption and increasing maximum channel efficiency by avoiding collision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.871-885
• /
• 2015

The improved DFSA for 2.4GHz multi-tags active RFID is suggested in 2 different ways: 1) simplified tag collection and Ack procedure using query command and 2) modified Schoute's method to control the number of slots in the frame. To evaluate the performance of the improved system we develop the simulation model. Varying the number of tags in the system we track the performance measures such as throughput, recognition time for multi-tags and tag recognition rate during a given time. The suggested method shows the best performance over all measures. Simplification of collection and Ack commands using query commands contributes to reducing tag recognition time. And the modified Schoute's method which controls the frame size using $k_1$ and $k_2$ contributes to throughput improvement and reduces target cognition time by reducing the number of collection rounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.85-94
• /
• 2010

Many RFID systems use dynamic slotted ALOHA to identify the label information of the RFID tags. One of the key problems in the RFID system is how to estimate the number of RFID tags up to the desired level of accuracy. In this paper, we present the framework of tag estimation algorithm for the collision-oblivious (CO) reader which can only decide whether the tag response is successful or not. Thus, the CO reader must rely on the success estimator to predict the RFID tag population. We propose two estimation algorithms to predict the number of RFID tags, named the memoryless success estimator (MSE) and the intersection-based success estimator (ISE). The MSE considers only the estimate obtained at the current inventory round, while the ISE finds an appropriate intersection interval of the existing estimates collected at every inventory round. Through the simulation results, we demonstrate that the ISE is a fast, accurate, and controllable estimator whose performance is close to that of the collision/idle estimators.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.561-569
• /
• 2014

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the multiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1031-1041
• /
• 2014

In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2014-2021
• /
• 2015

Opportunistic interference alignment (OIA) has been proposed for multi-cell random access networks (RAN), which minimizes the generating interference to neighboring RANs and yields better performance compared with the conventional techniques. The OIA for RANs considers both physical (PHY) and medium access control (MAC) layers. In this paper, we introduce a protocol of which each user maximizes the transmit signal regardless of the generating interference to neighboring RANs, contrary to the OIA technique. In addition, we compare the performance of the signal-maximization technique with the OIA technique.

• Journal of Advanced Navigation Technology
• /
• v.17 no.5
• /
• pp.497-505
• /
• 2013

In TETRA(TErrestrial Trunked RAdio) standard, TMO(Trunked Mode Operation) communicates with the UE through the base station and it has a higher priority than DMO(Direct Mode Operation) which communicates with UE directly for channel allocation. As a result, the UE needs an algorithm which restricts the frequency allocation by TMO so that DMO can have a successful communication within the network. However, the TETRA DMO standard does not consider this issue. In this paper, we propose an active DMO channel selection algorithm which allocates a channel based on some additional information such as channel usage state of TMO and channel utilization of DMO. The experimental results show that the proposed algorithm outperforms existing DMO channel allocation scheme in terms of the transmission efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1459-1467
• /
• 2009

In this paper, we propose a novel method for improving the tag collection performance in active RFID systems by modifying the tag collection algorithm in the ISO/IEC 18000-7 standard. The proposed method enables to reduce the time slot size by reducing the response message size from the tag and to decrease the number of command messages from the reader throughout the tag collection process. This results in reducing the time required for tag collection and the battery consumption on tags by decreasing the total amount of messages. Via the simulation experiments, we evaluated the performance of the tag collection applied with the proposed method, compared with that of the basic tag collection complying with the standard. The simulation results showed that the proposed method could decrease the total amount of messages between the reader and tags dramatically and reduce the average tag collection time by 19.99% and 16.03% when the reader requested the additional data of 50 bytes and 100 bytes from the tags, respectively.