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.     

Hybrid Metamodeling/Metaheuristic Assisted Multi-Transmitters Placement Planning

With every passing day, the demand for data traffic is increasing, and this urges the research community not only to look for an alternating spectrum for communication but also urges radio frequency planners to use the existing spectrum efficiently. Cell sizes are shrinking with every upcoming communication generation, which makes base station placement planning even more complex and cumbersome. In order to make the next-generation cost-effective, it is important to design a network in such a way that it utilizes the minimum number of base stations while ensuring seamless coverage and quality of service. This paper aims at the development of a new simulation-based optimization approach using a hybrid metaheuristic and metamodel applied in a novel mathematical formulation of the multi-transmitter placement planning (MTPP) problem. We first develop a new mathematical programming model for MTPP that is flexible to design the locations for any number of transmitters. To solve this constrained optimization problem, we propose a hybrid approach using the radial basis function (RBF) metamodel to assist the particle swarm optimizer (PSO) by mitigating the associated computational burden of the optimization procedure. We evaluate the effectiveness and applicability of the proposed algorithm by simulating the MTPP model with two, three, four and five transmitters and estimating the Pareto front for optimal locations of transmitters. The quantitative results show that almost maximum signal coverage can be obtained with four transmitters; thus, it is not a wise idea to use higher number of transmitters in the model. Furthermore, the limitations and future works are discussed.     

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.