On the Computational Power of Radio Channels

Radio networks can be a challenging platform for which to develop distributed algorithms, because the network nodes must contend for a shared channel. In some cases, though, the shared medium is an advantage rather than a disadvantage: for example, many radio network algorithms cleverly use the shared channel to approximate the degree of a node, or estimate the contention. In this paper we ask how far the inherent power of a shared radio channel goes, and whether it can efficiently compute "classicaly hard" functions such as Majority, Approximate Sum, and Parity. Using techniques from circuit complexity, we show that in many cases, the answer is "no". We show that simple radio channels, such as the beeping model or the channel with collision-detection, can be approximated by a low-degree polynomial, which makes them subject to known lower bounds on functions such as Parity and Majority; we obtain round lower bounds of the form Omega(n^{delta}) on these functions, for delta in (0,1). Next, we use the technique of random restrictions, used to prove AC^0 lower bounds, to prove a tight lower bound of Omega(1/epsilon^2) on computing a (1 +/- epsilon)-approximation to the sum of the nodes\u27 inputs. Our techniques are general, and apply to many types of radio channels studied in the literature

Backscattering UWB/UHF hybrid solutions for multi-reader multi-tag passive RFID systems

Ultra-wideband (UWB) technology is foreseen as a promising solution to overcome the limits of ultra-high frequency (UHF) techniques toward the development of green radio frequency identification (RFID) systems with low energy consumption and localization capabilities. While UWB techniques have been already employed for active tags, passive tags solutions are more appealing also due to their lower cost. With the fundamental requirement of maintaining backward compatibility in the RFID domain, we propose a hybrid UWB/UHF architecture to improve passive tag identification both in single-reader and multi-reader scenarios. We then develop two hybrid algorithms: the first one exploits the UWB signal to improve ISO/IEC 18000-6C UHF standard, while the other one exploits UWB to enhance a compressive sensing (CS) technique for tag identification in the multi-reader, multi-tag scenario. Both solutions are able to improve success rate and reading speed in the tag identification process and reduce the energy consumption. The multi-reader version of the proposed approaches is based on a cooperative scheme in order to manage reader-tag collisions and reader-reader collisions besides the typical tag-tag collisions. Furthermore, timing synchronization non-idealities are analyzed for the proposed solutions and simulation results reveal the effectiveness of the developed schemes

Towards Extended Bit Tracking for Scalable and Robust RFID Tag Identification Systems

The surge in demand for Internet of Things (IoT) systems and applications has motivated a paradigm shift in the development of viable radio frequency identification technology (RFID)-based solutions for ubiquitous real-Time monitoring and tracking. Bit tracking-based anti-collision algorithms have attracted considerable attention, recently, due to its positive impact on decreasing the identification time. We aim to extend bit tracking to work effectively over erroneous channels and scalable multi RFID readers systems. Towards this objective, we extend the bit tracking technique along two dimensions. First, we introduce and evaluate a type of bit errors that appears only in bit tracking-based anti-collision algorithms called false collided bit error in single reader RFID systems. A false collided bit error occurs when a reader perceives a bit sent by tag as an erroneous bit due to channel imperfection and not because of a physical collision. This phenomenon results in a significant increase in the identification delay. We introduce a novel, zero overhead algorithm called false collided bit error selective recovery tackling the error. There is a repetition gain in bit tracking-based anti-collision algorithms due to their nature, which can be utilized to detect and correct false collided bit errors without adding extra coding bits. Second, we extend bit tracking to 'error-free' scalable mutli-reader systems, while leaving the study of multi-readers tag identification over imperfect channels for future work. We propose the multi-reader RFID tag identification using bit tracking (MRTI-BT) algorithm which allows concurrent tag identification, by neighboring RFID readers, as opposed to time-consuming scheduling. MRTI-BT identifies tags exclusive to different RFIDs, concurrently. The concept of bit tracking and the proposed parallel identification property are leveraged to reduce the identification time compared to the state-of-The-Art. 2013 IEEE.This work was supported by the Qatar National Research Fund (a member of Qatar Foundation) through NPRP under Grant 7-684-1-127. The work of A. Fahim and T. ElBatt was supported by the Vodafone Egypt Foundation.Scopu

Protocol for Extreme Low Latency M2M Communication Networks

As technology evolves, more Machine to Machine (M2M) deployments and mission critical services are expected to grow massively, generating new and diverse forms of data traffic, posing unprecedented challenges in requirements such as delay, reliability, energy consumption and scalability. This new paradigm vindicates a new set of stringent requirements that the current mobile networks do not support. A new generation of mobile networks is needed to attend to this innovative services and requirements - the The fifth generation of mobile networks (5G) networks. Specifically, achieving ultra-reliable low latency communication for machine to machine networks represents a major challenge, that requires a new approach to the design of the Physical (PHY) and Medium Access Control (MAC) layer to provide these novel services and handle the new heterogeneous environment in 5G. The current LTE Advanced (LTE-A) radio access network orthogonality and synchronization requirements are obstacles for this new 5G architecture, since devices in M2M generate bursty and sporadic traffic, and therefore should not be obliged to follow the synchronization of the LTE-A PHY layer. A non-orthogonal access scheme is required, that enables asynchronous access and that does not degrade the spectrum. This dissertation addresses the requirements of URLLC M2M traffic at the MAC layer. It proposes an extension of the M2M H-NDMA protocol for a multi base station scenario and a power control scheme to adapt the protocol to the requirements of URLLC. The system and power control schemes performance and the introduction of more base stations are analyzed in a system level simulator developed in MATLAB, which implements the MAC protocol and applies the power control algorithm. Results showed that with the increase in the number of base stations, delay can be significantly reduced and the protocol supports more devices without compromising delay or reliability bounds for Ultra-Reliable and Low Latency Communication (URLLC), while also increasing the throughput. The extension of the protocol will enable the study of different power control algorithms for more complex scenarios and access schemes that combine asynchronous and synchronous access

Understanding RFID counting protocols

10.1145/2500423.2500431Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM291-30