Suguru KAMEDA Kei OHYA Tomohide TAKAHASHI Hiroshi OGUMA Noriharu SUEMATSU
For capacity expansion of the Quasi-Zenith Satellite System (QZSS) safety confirmation system, frame slotted ALOHA with flag method has previously been proposed as an access control scheme. While it is always able to communicate in an optimum state, its maximum channel efficiency is only 36.8%. In this paper, we propose adding a reservation channel (R-Ch) to the frame slotted ALOHA with flag method to increase the upper limit of the channel efficiency. With an R-Ch, collision due to random channel selection is decreased by selecting channels in multiple steps, and the channel efficiency is improved up to 84.0%. The time required for accommodating 3 million mobile terminals, each sending one message, when using the flag method only and the flag method with an R-Ch are compared. It is shown that the accommodating time can be reduced to less than half by adding an R-Ch to the flag method.
In this letter, we consider several optimization problems associated with the configuration of grouping-based framed slotted ALOHA protocols. Closed-form formulas for determining the optimal values of system parameters such as the process termination time and confidence levels for partitioned groups are presented. Further, we address the maximum group size required for meaningful grouping gain and the effectiveness of the grouping technique in light of signaling overhead.
Reiki KUSAKARI Akira NAKAMURA Kohei OHNO Makoto ITAMI
Currently, IEEE802.11p and ARIB STD T-109 are available as the typical inter-vehicle communication (IVC) standards. Carrier sense multiple access/collision avoidance (CSMA/CA) and orthogonal frequency division multiplexing (OFDM) are used in these standards. However, the performance degrades when there are hidden terminals. In this paper, IVC system that using a direct sequence spread spectrum (DS/SS) modulation scheme is discussed because it has code division multiple access (CDMA) capability. In DS/SS-IVC scheme, it is possible to avoid hidden terminal problem. On the other hand, near-far problem (NFP), multiple access interference (MAI) and interference by equivalent pseudo noise (PN) codes occurs in DS/SS communication. These problems cause performance degradation. In this paper, interference cancellation scheme and slotted ALOHA scheme with code sensing are applied so as to mitigate the impact of MAI, NFP and interference by equivalent PN code. By applying interference cancellation scheme and slotted ALOHA scheme with code sensing, the performance of DS/SS-IVC is improved. In this paper, location oriented PN code allocation is focused on as a method of PN code assignment. However, DS/SS-IVC scheme based on location oriented PN code allocation has a problem. Since each vehicle obtain PN code based on the position that is estimated by GPS, performance degrades when GPS positioning error occurs. Therefore, the positioning system of DS/SS-IVC scheme is also discussed in this paper. Elimination of ranging data that has large ranging error is proposed in addition to interference cancellation scheme and slotted ALOHA scheme with code sensing in order to improve the performance of positioning. From the simulation results, the positioning error can be mitigated by applying these proposed techniques.
Junwoo JUNG Jaesung LIM Haengik KANG Hyungwon PARK
Signals transmitted by multiple stations through different multiple subchannels may arrive at a particular station, such as an access point (AP), with different time delays. If the difference in arrival time delays exceeds the cyclic prefix duration, the orthogonality among the subchannels can be broken, which leads to multiple access interference (MAI) among the stations. In this paper, we propose a multichannel slotted Aloha scheme based on an MAI-free group for a simple orthogonal frequency division multiple access (OFDMA) wireless network. Each MAI-free group consists of stations whose signals arrive at the AP within the cyclic prefix duration. The proposed scheme outperforms a conventional scheme using a fast retrial algorithm in terms of throughput due to smaller cyclic prefix duration, lower collision probability, and lower block probability. While the proposed scheme has higher delay overhead in a low arrival rate region, its delay approaches that of the conventional scheme as the arrival rate increases.
Xiaodong DENG Mengtian RONG Tao LIU
As RFID technology is being more widely adopted, it is fairly common to read mobile tags using RFID systems, such as packages on conveyer belt and unit loads on pallet jack or forklift truck. In RFID systems, multiple tags use a shared medium for communicating with a reader. It is quite possible that tags will exit the reading area without being read, which results in tag leaking. In this letter, a reliable tag anti-collision algorithm for mobile tags is proposed. It reliably estimates the expectation of the number of tags arriving during a time slot when new tags continually enter the reader's reading area and no tag leaves without being read. In addition, it gives priority to tags that arrived early among read cycles and applies the expectation of the number of tags arriving during a time slot to the determination of the number of slots in the initial inventory round of the next read cycle. Simulation results show that the reliability of the proposed algorithm is close to that of DFSA algorithm when the expectation of the number of tags entering the reading area during a time slot is a given, and is better than that of DFSA algorithm when the number of time slots in the initial inventory round of next read cycle is set to 1 assuming that the number of tags arriving during a time slot follows Poisson distribution.
Won-Ju YOON Sang-Hwa CHUNG Dong-Chul SHIN
The tag collection algorithm in ISO/IEC 18000-7 has difficulty in collecting data from massive numbers of active RFID tags in a timely manner, so it should be improved to allow successful application in a wide variety of industrial fields. We propose two novel methods, a reduced-message method to improve the performance of data-tag collection and an efficient-sleep method to improve the performance of ID-tag collection. The reduced-message method decreases the slot size for a tag response by reducing the response size from the tag and reduces the number of commands issued from the reader. The efficient-sleep method utilizes redundant empty slots within the frame period to transmit sleep commands to the tags collected previously. We evaluated the performance improvement of tag collection by the proposed methods experimentally using an active RFID reader and 60 tags that we prepared for this study. The experimental results showed that the reduced-message method and the efficient-sleep method decreased the average tag collection time by 16.7% for data-tag collection and 9.3% for ID-tag collection compared with the standard tag collection. We also developed a simulation model for the active RFID system, reflecting the capture effect in wireless communication, and performed simulations to evaluate the proposed methods with a massive number of tags. The simulation results with up to 300 tags confirmed that the proposed methods could improve the tag collection performance, confirming the experimental results, even with larger numbers of tags.
Sunghyun CHO Young-Ho JUNG Cheolwoo YOU
This paper proposes a stabilized multichannel random access protocol based on slotted ALOHA for relay deployed cellular networks. To ensure the stability of random access, the proposed protocol dynamically controls the number of random access channels in a BS and a RS and the retransmission probability of the random access packets under heavy load conditions. A mathematical formula is also developed that derives an optimal partition ratio of the shared random access channels between a base station and a relay station without and with capture effect. Numerical results show that the proposed protocol can guarantee the required utilization and delay even in high offered load, which otherwise can cause bistable problem of slotted ALOHA.
In this paper we propose a novel RFID anti-collision technique that intelligently combines polling and random access schemes. These two fundamentally different medium access control protocols are coherently integrated in our design while functionally complementing each other. The polling mode is designed to enable fast collision-free identification for the tags that exist within reader's coverage across the sessions. In contrast, the random access mode attempts to read the tags uncovered by the polling mode. Our proposed technique is particularly suited for a class of RFID applications in which a stationary reader periodically attempts to identify the tags with slow mobility. Numerical results show that our proposed technique yields much faster identification time against the existing approaches under various operating conditions.
Yuusuke KAWAKITA Osamu NAKAMURA Jun MURAI
UHF radio frequency identification (RFID) has gathered significant interest in the field of long-distance automatic identification applications. Since UHF RFID shares the frequency band with other RFID and/or other wireless systems, it is important to determine how much interference can be applied without causing a significant degradation of anti-collision speed. In this paper, the permissible link quality for RFID anti-collision in a practical environment is discussed by considering an erroneous communication link, taking into account of bit encoding and the type of interference. We approach the quantification of permissible link quality experimentally along with protocol simulations and the mathematical analyses. An international standard protocol, employing frame slotted ALOHA, was used as the air protocol. For these investigations, the present authors developed a protocol simulator. The simulation results were compared with analytical values based on Poisson distribution. The investigation in the return (tag to reader) link, and the forward (reader to tag) link, were analyzed separately. As result of the protocol simulation, it is generally important to secure the Pulse Error Rate 10-4 or better in both return and forward links for the anti-collision of 64 or less tags. The quality of the return link may be relaxed when the application does not require fast anti-collision. The degradation of the forward link, on the other hand, may entail loss of important commands, resulting in extremely slow anti-collision. It is measured experimentally that the required link quality can be relaxed by up to 10 dB in the return links and by 5 dB in the forward link when the primary source of interference originates in the interfering readers.
Radio frequency identification (RFID) technology is becoming increasingly attractive because of its high storage capacity and reprogrammability. There is a challenge to be overcome when a reader needs to read a number of tags within the reader's interrogation zone at the same time. In this paper, we present an anti-collision scheme in a RFID system. The scheme is based on the dynamic framed ALOHA protocol developed for radio networks. In our scheme, we propose two methods to estimate the number of tags. Simulation results indicate that the total number of time slots for reading all tags is about 4 times the number of tags that need to be read, including acknowledgement time slots. The main advantages of our scheme are the great performance of uplink throughput and its easy implementation for both readers and tags.
Yukihiro TADOKORO Hiraku OKADA Takaya YAMAZATO Masaaki KATAYAMA
Packet-recognition/code-acquisition (PR/CA) is one of the most important issues in packet communication systems. In a CDMA Unslotted ALOHA system, Multiple Access Interference (MAI) may bring about errors in PR/CA. The MAI mainly stems from already recognized packets and newly arriving packets under the execution of PR/CA. This characteristic of asynchronous transmission in CDMA U-ALOHA systems implies that only one or a few packets arrive at the receiver within a short interval of a execution. Furthermore, newly arriving packets are recognized and code-acquired by using a short preamble part. Consequently, the MAI from the packets under the execution of the PR/CA will be small. Focusing on that point, this paper proposes applying the IC scheme in order to suppress the MAI from the already recognized and code-acquired packets. A performance evaluation demonstrates that such an application is valid due to the small amount of MAI from the packets under the execution of PR/CA. In addition, we demonstrates that the scheme reduces false recognition rather than mis-recognition. Such a scheme improves the performance of not only PR/CA, but also the throughput.
Katsumi SAKAKIBARA Jiro YAMAKITA
Stability of slotted ALOHA systems with retransmission cutoff, in which a packet is discarded after the certain number of unsuccessful transmissions, is investigated on slow-frequency-hopped channels with the aid of the catastrophe theory. The result of this paper can be viewed as extension of the result derived by Kim. The balance function is first formulated. Then, the cusp point and the bifurcation sets are numerically evaluated. We visualize how retransmission cutoff effects on bistable region. Using the result, we can design parameters of slotted ALOHA systems with retransmission cutoff such that the system operates with the unique stable equilibrium point.
To satisfy huge service demand and multi-traffic requirements with limited bandwidth, this paper proposes two different procedures of multi-channel multiple access schemes with the slotted ALOHA operation for both data and voice traffic and presents an exact analysis to numerically evaluate the performance of the systems. In scheme I, there is no limitation on access between data transmissions and voice transmissions, i.e., all channels can be accessed by all transmissions. In scheme II, a channel reservation policy is applied, where a number of channels are used exclusively for voice packets while the remaining channels are used for both data packets and voice packets. We call the system using scheme I "Non-reservation system" and call the system using scheme II "Reservation system. " Performance characteristics we obtained include loss probability for voice traffic, average packet delay for data traffic and channel utilization for both traffic. The performance of the schemes and the effects of the design parameters are numerically evaluated and compared to a wide-bandwidth conventional single-channel slotted ALOHA system with single data traffic. The analysis presented in this paper will be not only useful for the performance evaluation and the optimum design of multi-channel multi-traffic systems in wireless environments, but also applicable to evaluate other performance measures in priority networks, cellular mobile radio networks or multi-hop wireless networks.
Jun-Kui AHN Een-Kee HONG Tae-Joong KIM Keum-Chan WHANG
In this paper, a slot-averaged SIR model is derived to analyze the performances of 1/N-slotted DS-CDMA packet radio networks. DS-CDMA packet radio networks can be analyzed with channel threshold model, but it is not appropriate for a 1/N-slotted access scheme since the interference level varies slot by slot during a packet transmission time. A packet in a DS-CDMA system will be channel-encoded and interleaved so that an excessive interference of some slots does not result in a corruption of a packet directly. In a 1/N-slotted DS-CDMA packet system, interleaving and channel coding can cope with the excessive interference in some slots. Proposed slot-averaged SIR model reflects this effect and is simple enough to be used in the performance analyses of various packet access control schemes. This paper verifies the slot-averaged SIR model and evaluates the throughputs of 1/N-slotted access schemes using it. This paper also compares the results with those of the conventional channel threshold model. Packet access schemes such as slotted ALOHA, slotted CLSP and slotted CLSP/CC are analyzed. The results show that many different aspects from the results of the previous works can be evaluated and this work will offer more accurate view on the behavior of 1/N-slotted DS-CDMA packet radio networks.
Masato SAITO Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
We propose the analytical calculation method of average packet success probability of CDMA Slotted ALOHA systems, which derives accurate probability, and that is applicable to the system with any spreading codes and any amplitude distributions. In the method, we consider the bit-to-bit dependence of amplitude of signals, used spreading sequences, relative timing delays, and relative carrier phases. This bit-to-bit dependence is the case that the parameters above mentioned are constant for a slot time. By using the method to obtain the average packet success probability, we derive useful throughput performance of CDMA Slotted ALOHA systems on fading channel, and show that the normalized throughput becomes worse in the case of larger spreading factor.
Masato SAITO Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
One of unique features of CDMA slotted ALOHA (CDMA S-ALOHA) is that user must synchronize his transmission to given slot. Thus orthogonal sequence as spreading sequence would achieve ideal throughput if each of packets accomplish perfect synchronization. In the presence of any ambiguity in synchronizations, however, quasi-synchronous (QS) sequences suit well with CDMA S-ALOHA system. In this paper, we introduce new QS-sequences obtained from the orthogonal Gold sequences and discuss their performance when applying to CDMA S-ALOHA systems. As a result, withstanding to access timing error, good performance is ensured with this sequence under the environment of AWGN, MAI (multiple access interference) and frequency non-selective fading, that is, micro or pico cellular systems and indoor wireless LANs.
Katsumi SAKAKIBARA Michiru HANAOKA Yoshiharu YUBA
The stability of slotted ALOHA systems with various types of capture phenomena and multiple packet reception capability is discussed in conjunction with the cusp catastrophe. The slotted ALOHA systems considered are classified into; 1) single packet reception with geometric capture, 2) independent multiple packet reception with geometric capture, 3) single packet reception with M-out-of-N capture (M N), 4) multiple packet reception with M-out-of-N capture, and 5) single packet reception with perfect capture. First, general expressions for the cusp points and the bifurcation sets are derived. Then, we present explicit formula for the stability of slotted ALOHA systems for the five types of capture and multi-packet reception capability and demonstrate how the bistable behavior is mitigated due to capture effect and multi-packet reception capability.
Hiraku OKADA Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
CDMA unslotted ALOHA system with finite size of queueing buffers is discussed in this paper. We introduce an analytical model in which the system is divided into two Markov chains; one is in the user part, and the other is in the channel part. In the user part, we can model the queueing behavior of the user station as an M/G/1/B queue. In the channel part, we can consider the number of simultaneously transmitted packets as an M1 + M2/D///K queue. We analyze the queueing system by using this analytical model, and evaluate the effect of buffer capacity in terms of the throughput, the rejection probability and the average delay. As a result, increase in the buffer size brings about an improvement in the grade of service in terms of higher throughput and lower rejection probability.
Hiraku OKADA Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
In this paper, CDMA slotted ALOHA system with finite size of buffers is proposed. To analyze the system performance, we use the linear approximate solution based on restricted occupancy urn models. We evaluate the system performance in terms of throughput, average delay, and rejection probability and clarify the effect of buffer capacity.
Tae-Joong KIM Ki-Jun KIM Seung-Hoon HWANG Keum-Chan WHANG
This paper presents a new CLSP/CC (Channel Load Sensing Protocol/Channel Clearance) in order to obtain better performances in spread slotted ALOHA networks. This protocol can decrease a wasteful utilization of channel by prohibiting continuous transmission of the packets destroyed in previous slot, with little added network complexities. For channel clearance technique, hub station broadcasts NAK to all mobile stations when the number of packets transmitted in a slot exceeds the channel capacity, and mobile stations cease own packet transmissions at NAK broadcast. The performances of the proposed CLSP/CC are obtained and compared with those of conventional CLSP by simulations. The performances include network throughput, average processing time and the number of mobile stations in backlogged state. As simulation results, the proposed CLSP/CC outperforms conventional CLSP, especially in highly offered load environment. Also as the proposed CLSP/CC obtain maximum throughputs at higher offered loads and the larger number of mobile stations in backlogged state than the conventional CLSP, it is found that our protocol can support more mobile stations and higher occurrence probabilities.