• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.20-21
• /
• 2008

In the IEEE 802.16 Wireless MAN standard, the best effort service class is ranked on the lowest position in priority so that only scarce resource may be available for it. Also, the best effort service is usually assisted by a MAC scheme based on reservation ALOHA without explicit acknowledgement. However, the standard only specifies the skeleton of the MAC scheme. In this paper, we propose some rules to specify the indefinite part of the MAC scheme as well as to improve the throughput and delay performance of the MAC scheme. As generic rules for demanding and granting resource, we first propose non-gated exhaustive, gated exhaustive, non-gated limited, and gated limited demand rules, and deficient and full grant rules. Secondly, we propose grant regulation rules, identified as replacement and lifetime rules, to avoid excessive grant incurred by not giving acknowledgement. Noting the residual resource is inflated by adopting a grant regulation rule, we finally propose a rule for investing the residual resource to a subscriber station. Simulation results confirm that a combination of proposed rules improves the performance of the MAC scheme.

• IE interfaces
• /
• v.22 no.3
• /
• pp.278-286
• /
• 2009

The anti-collision algorithms to identify a number of tags in real-time in RFID systems are divided into the anti-collision algorithms based on the Framed slotted ALOHA that randomly select multiple slots to identify the tags, and the anti-collision algorithms based on the Tree-based algorithm that repeat the questions and answer process to identify the tags. In the hybrid algorithm which is combined the advantages of these algorithms, tags are distributed over the frames by selecting one frame among them and then identified by using the Query tree frame by frame. In this hybrid algorithm, however, the time of identifying all tags may increase if many tags are concentrated in a few frames. In this study, to improve the performance of the hybrid algorithm, we suggest an improved algorithm that the tags select a specific group of frames based on the earlier bits of the tag ID so that the tags are distribute equally over the frames. By using the simulation and mathematical analysis, we show that the suggested algorithm outperforms traditional hybrid algorithm from the viewpoint of the number of queries per frame and the time of identifying all tags.

• Journal of the Korean Society of Safety
• /
• v.31 no.6
• /
• pp.32-38
• /
• 2016

In general, lots of containers including various dangerous materials are transported to the port located in big cities such as Busan where massive residents live. Thus, it's really important how to make the emergency response for the leak accidents of dangerous materials and evaluate the direct or indirect damages to adjacent areas. In this study, in order to make reasonable emergency plans, CA (Consequence Analysis) is employed after selecting a key hazardous and noxious material, hydrogen fluroide. This material accounts for the third largest portion of cargo volume among all dangerous materials and can cause a huge damage in case of leakages. As a case study, Busan North port is selected as a test port since the portion of dangerous materials is higher than that of other ports in Busan. It is assumed that 1 ton of hydrogen fluoride is spilled at Busan North port. CA is performed to assess the impact of this accident. Throughout CA, the ERPG-2 range of a leak accident can be evaluated and this result can be used for decision making tools for mitigating the impact of a leak accident. To mitigate the damage of this accident, suitable a protective equipment and resident evacuation procedures should be prepared. Finally, this study can provide a systematic approach to make the emergency plan for reducing economical and personal losses.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.806-811
• /
• 2006

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.281-285
• /
• 2011

One of the key issues in implementing RFID systems is to design anti-collision protocols for identifying all the tags in the interrogation zone of a RFID reader with the minimum identification delay. In this paper, Furthermore, in designing such protocols, the limited resources in tags and readers in terms of memory and computing capability should be fully taken into consideration. we first investigate two typical RFID anti-collision algorithms, namely RFID Gen2 Q algorithm (accepted as the worldwide standard in industrial domain) and FAFQ algorithm including their drawbacks and propose a new RFID anti-collision algorithm, which can improve the performance of RFID systems in terms of tag identification time considerably. Further, we compared performance of the proposed algorithm with Q algorithm and FAFQ algorithm through computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.736-752
• /
• 2010

We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed considering the adequacy for the indoor tracking system. We prove the superiority of the slotted ALOHA in comparison with CSMA for short and fixed length packets like an ID message in RFID. Observed results show that they are not applicable for active type RFID in terms of energy efficiency. Putting these all together, we propose a dedicated collision avoidance algorithm considering the unique features of the indoor tracking system. The proposed method includes a scheduled tag access period (STAP) as well as a random tag access period (RTAP) to address both of the static and dynamic characteristics of the system. The system parameters are determined through a quantitative analysis of the throughput and energy efficiency. Especially, some mathematical techniques have been deployed to obtain the optimal slot count for RTAP. Finally, simulation results are provided to illustrate the performance of the proposed method with variations of the parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2643-2648
• /
• 2012

In the RFID Sytem, When leaders recognize the tag, a anti-collision scheme is an important factor in the performance of the system. Probabilistic-based anti-collision scheme using the slot status is a technique to estimate the number of tags. the schemes to quickly and accurately estimate the number of tags has been a lot of research. However, A initial number tag are not considering in the number of tags unknown environment. In the paper, estimation scheme for the initial number of tag is proposed to solve the problems. we analyze the performance by the initial number of tag and the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2305-2312
• /
• 1998

This paper analyzed the delay characteristics of speech packets in virtual cellular network(VCN). The probability distribution of packet delay is obtained using the markov chain model when periodic speech packets are transmitted by slotted-ALOHA protocol. The effects of probility of capture and retransmission policy on the performance were also analyzed. At first, the probability cumulative function of packet delay is calculated from the probability of capture as a function of location of mobile terminal. In order to investigate the effects of backoff delay, we defined a parameter NPr, where N is the period (frame size) of the speech packets and Pr is the retransmission probability for each speech packet. We also obtained the 1% outage delay for various frame size N.