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.     

Outage Behavior of Selective Relaying Schemes

Cooperative diversity techniques can improve the transmission rate and reliability of wireless networks. For systems employing such diversity techniques in slow-fading channels, outage probability and outage capacity are important performance measures. Existing studies have derived approximate expressions for these performance measures in different scenarios. In this paper, we derive the exact expressions for outage probabilities and outage capacities of three proactive cooperative diversity schemes that select a best relay from a set of relays to forward the information. The derived expressions are valid for arbitrary network topology and operating signalto- noise ratio, and serve as a useful tool for network design.     

Use of spare wavelengths for traffic restoration in a multiwavelength transport network

This article describes three network protection strategies for a single link failure using spare wavelengths in multiwavelength all-optical transparent networks. The use of spare wavelengths is shown to be effective and can be economical when a path restoration technique is used. It is also particularly suitable for high-bandwidth optical crossconnect nodes where the number of input and output ports are generally small. Based on the simulation results, the amount of redundancy required for fill protection is dependent on the protection approach employed. Two algorithms for finding and allocating spare wavelengths are introduced. The algorithms are based on the genetic and heuristic algorithms.