A Time‐Optimal Anti‐collision Algorithm for FSA‐Based RFID Systems

With the introduction of the new generation RFID technology, EPCglobal Class‐1 Generation‐2, there is considerable interest in improving the performance of the framed slotted Aloha (FSA)‐based tag collision arbitration protocol. We suggest a novel time‐optimal anti‐collision algorithm for the FSA protocol. Our performance evaluation demonstrates that our algorithm outperforms other tag collision arbitration schemes.     

A Scheme to Increase Throughput in Framed‐ALOHA‐Based RFID Systems with Capture

In this paper, a scheme to increase the throughput of RFID systems is presented, which considers the capture effect in the context of framed ALOHA protocol. Under the capture model in which the probability of one tag is identified successfully depending on the number of tags involved in the collision, two probabilistic methods for estimating the unknown number of tags are proposed. The first method is the maximum likelihood estimation method, and the second method is an approximate algorithm for reducing the computational time. The optimal frame size condition to maximize the system throughput by considering the capture effect is also presented.     

Gen2‐Based Tag Anti‐collision Algorithms Using Chebyshev's Inequality and Adjustable Frame Size

Arbitration of tag collision is a significant issue for fast tag identification in RFID systems. A good tag anti‐collision algorithm can reduce collisions and increase the efficiency of tag identification. EPCglobal Generation‐2 (Gen2) for passive RFID systems uses probabilistic slotted ALOHA with a Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti‐collision algorithm. In this paper, we analyze the performance of the Q algorithm used in Gen2, and analyze the methods for estimating the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose new tag anti‐collision algorithms, namely, Chebyshev's inequality, fixed adjustable framed Q, adaptive adjustable framed Q, and hybrid Q. The simulation results show that all the proposed algorithms outperform the conventional Q algorithm used in Gen2. Of all the proposed algorithms, AAFQ provides the best performance in terms of identification time and collision ratio and maximizes throughput and system efficiency. However, there is a tradeoff of complexity and performance between the CHI and AAFQ algorithms.     

Array‐based reader anti‐collision scheme for highly efficient RFID network applications

Radio frequency identification (RFID) is a technology for identifying objects by radio signal. The reader collision problem is caused by the interrogation zones overlap of multiple readers, and leading to incorrect and unreliable data. This study proposes an array‐based reader anti‐collision scheme (ARCS) for solving the reader‐to‐tag interference problem. This mechanism uses array and grouping techniques to schedule the active readers to reduce the read cycle (RC) time. The ‘RC’ and ‘collision ratio (CR)’ measures serve as performance indexes in the proposed scheme. From ‘RC’ comparison, the ARCS mechanism has the maximum improvement of 55 per cent as compared with the existing mechanisms. Furthermore, take ‘CR’ index, ARCS has the maximum improvement of 42 per cent as compared to the others. Copyright © 2008 John Wiley & Sons, Ltd.     

Conception and Performance Analysis of Efficient CDMA‐Based Full‐Duplex Anti‐collision Scheme

Ultra‐high‐frequency radio‐frequency identification (UHF RFID) is widely applied in different industries. The Frame Slotted ALOHA in EPC C1G2 suffers severe collisions that limit the efficiency of tag recognition. An efficient full‐duplex anti‐collision scheme is proposed to reduce the rate of collision by coordinating the transmitting process of CDMA UWB uplink and UHF downlink. The relevant mathematical models are built to analyze the performance of the proposed scheme. Through simulation, some important findings are gained. The maximum number of identified tags in one slot is g/e (g is the number of PN codes and e is Euler's constant) when the number of tags is equal to mg (m is the number of slots). Unlike the Frame Slotted ALOHA, even if the frame size is small and the number of tags is large, there aren't too many collisions if the number of PN codes is large enough. Our approach with 7‐bit Gold codes, 15‐bit Gold codes, or 31‐bit Gold codes operates 1.4 times, 1.7 times, or 3 times faster than the CDMA Slotted ALOHA, respectively, and 14.5 times, 16.2 times, or 18.5 times faster than the EPC C1 G2 system, respectively. More than 2,000 tags can be processed within 300 ms in our approach.     

A dynamic CSFICA and feature‐based collision detection method in multichannel space‐based AIS

To detect message collisions in multichannel spaced‐based automatic identification system (AIS), a dynamic complex symmetric fast independent component analysis (CSFICA) and feature‐based collision detection method is proposed in this paper. A fast and stable blind source separation algorithm, dynamic CSFICA, is utilized to separate signals dynamically and improve the signal‐to‐interference ratio (SIR) in each channel. A frequency and phase offset insensitive feature detection algorithm is used to calculate the test statistics in each channel. The false alarm is suppressed by applying the arithmetic to geometric mean (AGM) method, and test statistics of channels with sufficient signal quality are extracted to detect the preamble. Simulation results show that the proposed algorithm outperforms the reference feature detection algorithm under collision conditions and is insensitive to the SIR. The proposed algorithm is more resistant to false alarm caused by signal (FAS) than the differential correlation (DC) algorithm.     

A fast tag identification anti‐collision algorithm for RFID systems

In this work, we propose a highly efficient binary tree‐based anti‐collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS‐MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS‐MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000‐6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS‐MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well‐performed algorithms.     

Dual‐reader wireless protocols for dense active RFID identification

Radio Frequency Identification (RFID) becomes increasingly widespread in various applications. However, data collision is one of the most concerns in dense active RFID systems. Data collision will cause serious data loss, slow identification speed and high energy consumption. In this paper, data collision problem is addressed and two communication protocols are presented based on the dual‐reader structure. One is the master–slave dual‐reader (MSDR) protocol, and the other is called the dual‐reader DCMA (DRDCMA) protocol. Both protocols are implemented in the hardware platform and their performances are compared with other conventional anti‐collision protocols. Experimental results show that our proposed protocols outperform the conventional ones in terms of identification rate, identification speed and energy consumption. Compared to the Single‐reader (SR) protocol, the proposed MSDR protocol can improve the identification rate by 82.9%, reduce the access latency and energy consumption by 47.0%. Besides, the proposed DRDCMA protocol can reduce the access latency and energy consumption by 69.1 and 78.3%, respectively, in comparison with DCMA. Moreover, MSDR has the fastest identification speed and it can improve nearly 100% over SR when the communication load is large enough. DRDCMA presents the highest identification rate with nearly no data loss, while the identification rate in MSDR is 40.6% and decreases dramatically with the increment in communication load. Copyright © 2011 John Wiley & Sons, Ltd.     

An improved anti‐collision protocol for radio frequency identification tag

Many anti‐collision protocols have been proposed at present. Almost all known protocols exhibit an overall identification efficiency smaller than 50%. And all of them are proposed for general purpose applications and do not consider the distribution characteristic of tag IDs in different radio frequency identification (RFID) systems. In real world, there are many RFID systems, in which the tag IDs are mostly distributed continuously, such as in container terminals, warehouse management, supply chain management, and so on. This paper presents an efficient anti‐collision protocol, named improved collision tree protocol (ICT), to identify RFID tags simultaneously. The main novelties of this paper include that the duality and certainty principle is introduced and used in ICT to improve the tag identification efficiency, and the continuous and partially continuous distributions of tag IDs are taken into account in this paper. Both the theoretical and experimental results indicate that ICT improves the tag identification efficiency up to 100% when the tag IDs are distributed continuously, and always above 50% even when the tag IDs are distributed uniformly. For straightforward and efficient, ICT can be used in various RFID tag identification conditions, especially when the tag IDs are distributed continuously or partially continuously. Copyright © 2013 John Wiley & Sons, Ltd.     

A new anti‐collision protocol based on information of collided tags in RFID systems

Radio frequency identification (RFID) technology has recently become an integral part of a wide range of applications. One of the challenges in RFID systems is the tag anti‐collision issue, for which several anti‐collision tag identification protocols have been proposed. This paper proposes a novel slotted ALOHA‐based RFID tag anti‐collision algorithm which can be employed for tag identification. The main idea of this algorithm is to use the information available in collision slots, called collided data, to identify tags uniquely. For this purpose, the collision slots that include only two tags are selected. Then, the non‐conflict bits in these slots are used to possibly identifying the tags. Because in the proposed algorithm readers use both single slots and also the collision slots for tag identification, the performance is increased significantly compared with other protocols. Results of the study indicate that in the proposed algorithm, the optimal frame size for an individual tag number is equal to the half of tags number and the efficiency of the proposed protocol is improved to about 73%. Copyright © 2015 John Wiley & Sons, Ltd.     

Towards providing optimal energy‐efficiency and throughput for IEEE 802.11 WLANs

IEEE 802.11 wireless network standard has become one of the most used wireless networking technologies for smart devices as it offers mobility support and low cost deployment. However, these devices deeply rely on the energy provided by their batteries, which results in limited running time. IEEE 802.11 network standard provides stations with carrier sense multiple access with collision avoidance for the medium access. Yet it results in stations to consume an important amount of power. Therefore, minimizing WiFi‐based energy consumption in smart devices has been received substantial attention in both academia and industry. Accordingly, this paper * proposes a novel beacon‐based energy‐efficient collision‐free medium access control protocol for any type of IEEE 802.11 stations, regardless of being stationary or mobile, or having different amount of traffic flow, transmission rates, or traffic types. The proposed scheme is valid for all types of low or wide bandwidth, single or multiuser multiple‐input multiple‐output WLAN channels, such as IEEE 802.11a\b\g\n\ac. In the proposed scheme, energy saving is achieved, enabling stations to transmit on the right time and maintaining stations in the doze state during a predetermined sleep_time interval after each successful frame transmission, by making use of modified control and management frames of the standard IEEE 802.11 protocol. The proposed scheme reduces the probability of collisions and may allow stations to enter the collision‐free state, regardless of the number of stations on the channel and their traffic types. Widespread simulations have been executed to validate the efficiency of the proposed method. The results demonstrate that the proposed method significantly increases overall throughput and reduces power consumption of stations over IEEE 802.11 WLANs.     

Coexisting with the dynamic PU,the effect of PU‐returns on a secondary network

Coexisting with a dynamic primary user network is a challenge in cognitive radio networks, since the rate at which primary user reoccupies the spectrum is high. Therefore, it is important to investigate deeply the effect of primary traffic dynamics on secondary network performance metrics. To do that, interference due to both sensing error and primary user re‐occupancy must be formulated and considered in throughput and collision probability. Besides them, secondary packet retransmissions due to such interference should be considered in metrics such as average energy consumption and average packet delay. In this study, we formulate the mentioned secondary network metrics regarding to such kinds of interference and secondary packet retransmission. Numerical results along with discussions are given to clarify derived expressions. Simulations are also performed to justify the theoretical results, and optimum operating point for secondary network settings is derived by genetic algorithm.     

New Type of Collision Attack on First‐Order Masked AESs

This paper introduces a new type of collision attack on first‐order masked Advanced Encryption Standards. This attack is a known‐plaintext attack, while the existing collision attacks are chosen‐plaintext attacks. In addition, our method requires significantly fewer power measurements than any second‐order differential power analysis or existing collision attacks.     

Modeling and performance analysis of VI‐CRA: A congestion control algorithm for vehicular networks

This study proposes a Vehicle ID‐based CAM Rate Adaptation (VI‐CRA) algorithm for beacon messages in the vehicular network. Foremost, an improved vehicle ID–based analytical model is proposed at the MAC layer of vehicular network. The model weighs the random back‐off number chosen by vehicles participating in the back‐off process, with the vehicle ID incorporated in their respective CAMs. This eventually leads to the selection of a vehicle ID–based random back‐off number, minimizing the probability of collision due to same back‐off number selection. It is worth noting that the improved analytical model outperforms the existing works in terms of average packet delay since only one fourth of the contention window size is used throughout the simulation. To enhance the performance of the analytical model, the paper incorporates a congestion control algorithm, by adapting the rate of CAM broadcast over the control channel. The algorithm is designed considering a wide range of scenarios, ranging from nonsaturated to extremely saturated network (in terms of collision probability) and sparsely distributed to teemed network (in terms of vehicular density). For better analyses of simulation results, the algorithm is applied over different vehicle ID–based back‐off numbers. Simulation results for all the back‐off numbers show that vehicle ID–based CAM rate adaptation algorithm performs better than the traditional fixed CAM rate IEEE 802.11p, even at high vehicular density.     

激光场中电子与氢原子的非弹性碰撞

导出了低频激光场存在时电子与氢原子非弹性碰撞的N光子吸收微分截面公式和有关的求和规则。对高能区域做了计算和讨论。     

A Dual‐Functional Graphene‐Based Self‐Alarm Health‐Monitoring E‐Skin

Diseases such as cardiovascular problems and sleep apnea cause mass deaths annually due to a lack of timely and portable monitoring and alarm measures. Various wearable devices for health monitoring have been intensely researched to reduce mortality. However, these devices themselves can only detect physiological signals; they cannot sound an alarm. Therefore, they must rely on mobile phones or other peripheral devices such as speakers or vibration motors to sound an alarm, which may result in a patient missing the optimal treatment. It is valuable to develop a self‐alarm health monitoring device with the dual functions of physiological signal detection and sound alarm simultaneously. A one‐step laser‐induced graphene (LIG)‐based electronic skin (E‐skin) is fabricated to perform health monitoring and alarm at the same time, which benefit from its both excellent mechanical and acoustical performance. These customized shutter‐patterned E‐skins have an ultrahigh sensitivity of 316.3 and can detect various biosignals such as wrist pulse, respiratory, etc. They also have a self‐alarm function and can sound an alarm when detecting abnormal situations. This study addresses the multifunctional integration required for multisensors, which will open further applications in wearable sensors and health‐care devices.     

Low‐Power‐Photon Up‐Conversion in Dual‐Dye‐Loaded Polymer Nanoparticles

Sensitized triplet–triplet annihilation in multicomponent organic systems is already demonstrated to be suitable for obtaining efficient up‐conversion in solution with excitation power densities comparable to solar irradiance, but loses efficiency in the solid state. Here, it is demonstrated that it is possible to reduce this limitation by incorporating a standard bicomponent system in polymer nanoparticles. The confinement of all of the involved photophysical processes in a nanometer‐scale volume makes each nanoparticle a single and isolated high‐efficiency up‐converting unit. As a consequence, these dual‐dye‐loaded nanoparticles can be used to produce drop‐cast films, as well as dopants for polymeric matrices, preserving the performances of the starting moieties in solution.     

多卫星成像任务规划的冲突消解

分析了多卫星成像任务规划中多卫星之间的任务冲突,印多卫星成像任务冲突和多卫星下传任务冲突,研究了这两类冲突的消解方法;提出了基于拍摄概率的多卫星成像任务冲突消解算法和基于非互斥链的多卫星下传任务冲突消解算法.将多卫星成像任务规划问题转换成各卫星独立的成像调度问题,从而降低了问题的复杂度.实验表明,该方法解决了多卫星之间的冲突问题,使星地资源得到均衡有效的利用.     

Thin‐Film‐Based Integrated High‐Transition‐Temperature Superconductor Devices

Since the discovery of superconductivity at temperatures above the technologically promising liquid nitrogen temperatures, applications based on superconductors have expanded and are being put to commercial use. However, superconductivity at higher temperatures typically occurs in complex materials requiring stringent material and environmental constraints. Such restraints make the realization and integration of these materials with normal materials a nontrivial aspect. In this progress report, unique features of these superconductors in terms of their synthesis, physical properties determining interface electrical transport, and their applications are discussed. A detailed progress report on these applications with remarks on efforts taken to integrate these devices with traditional platforms and semiconducting materials is provided.