Implementation and Evaluation of a Cooperative Vehicle-to-Pedestrian Safety Application

While the development of Vehicle-to-Vehicle (V2V) safety applications based on Dedicated Short-Range Communications (DSRC) has been extensively undergoing standardization for more than a decade, such applications are extremely missing for Vulnerable Road Users (VRUs). Nonexistence of collaborative systems between VRUs and vehicles was the main reason for this lack of attention. Recent developments in Wi-Fi Direct and DSRC-enabled smartphones are changing this perspective. Leveraging the existing V2V platforms, we propose a new framework using a DSRC-enabled smartphone to extend safety benefits to VRUs. The interoperability of applications between vehicles and portable DSRC enabled devices is achieved through the SAE J2735 Personal Safety Message (PSM). However, considering the fact that VRU movement dynamics, response times, and crash scenarios are fundamentally different from vehicles, a specific framework should be designed for VRU safety applications to study their performance. In this article, we first propose an end-to-end Vehicle-to-Pedestrian (V2P) framework to provide situational awareness and hazard detection based on the most common and injury-prone crash scenarios. The details of our VRU safety module, including target classification and collision detection algorithms, are explained next. Furthermore, we propose and evaluate a mitigating solution for congestion and power consumption issues in such systems. Finally, the whole system is implemented and analyzed for realistic crash scenarios

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

An MILP-Based Cross-Layer Optimization for a Multi-Reader Arbitration in the UHF RFID System

In RFID systems, the performance of each reader such as interrogation range and tag recognition rate may suffer from interferences from other readers. Since the reader interference can be mitigated by output signal power control, spectral and/or temporal separation among readers, the system performance depends on how to adapt the various reader arbitration metrics such as time, frequency, and output power to the system environment. However, complexity and difficulty of the optimization problem increase with respect to the variety of the arbitration metrics. Thus, most proposals in previous study have been suggested to primarily prevent the reader collision with consideration of one or two arbitration metrics. In this paper, we propose a novel cross-layer optimization design based on the concept of combining time division, frequency division, and power control not only to solve the reader interference problem, but also to achieve the multiple objectives such as minimum interrogation delay, maximum reader utilization, and energy efficiency. Based on the priority of the multiple objectives, our cross-layer design optimizes the system sequentially by means of the mixed-integer linear programming. In spite of the multi-stage optimization, the optimization design is formulated as a concise single mathematical form by properly assigning a weight to each objective. Numerical results demonstrate the effectiveness of the proposed optimization design

RAC-Multi: Reader Anti-Collision Algorithm for Multichannel Mobile RFID Networks

At present, RFID is installed on mobile devices such as mobile phones or PDAs and provides a means to obtain information about objects equipped with an RFID tag over a multi-channeled telecommunication networks. To use mobile RFIDs, reader collision problems should be addressed given that readers are continuously moving. Moreover, in a multichannel environment for mobile RFIDs, interference between adjacent channels should be considered. This work first defines a new concept of a reader collision problem between adjacent channels and then suggests a novel reader anti-collision algorithm for RFID readers that use multiple channels. To avoid interference with adjacent channels, the suggested algorithm separates data channels into odd and even numbered channels and allocates odd-numbered channels first to readers. It also sets an unused channel between the control channel and data channels to ensure that control messages and the signal of the adjacent channel experience no interference. Experimental results show that suggested algorithm shows throughput improvements ranging from 29% to 46% for tag identifications compared to the GENTLE reader anti-collision algorithm for multichannel RFID networks

Energy Efficient Protocols for Active RFID

Radio frequency identification (RFID) systems come in different flavours; passive, active, semi-passive, or semi-active. Those different types of RFID are supported by different, internationally accepted protocol standards as well as by several accepted proprietary protocols. Even though the diversity is large between the flavours and between the standards, the RFID technology has evolved to be a mature technology, which is ready to be used in a large variety of applications. This thesis explores active RFID technology and how to develop and apply data communication protocols that are energy efficient and which comply with the different application constraints. The use of RFID technology is growing rapidly, and today mostly “passive” RFID systems are used because no onboard energy source is needed on the transponder (tag). However, the use of “active” RFID-tags with onboard power sources adds a range of opportunities not possible with passive tags. Besides that Active RFID offers increased working distance between the interrogator (RFID-reader) and tags, the onboard power source also enables the tags to do sensor measurements, calculations and storage even when no RFID-reader is in the vicinity of the tags. To obtain energy efficiency in an Active RFID system the communication protocol to be used should be carefully designed. This thesis describes how energy consumption can be calculated, to be used in protocol definition, and how evaluation of protocols in this respect can be made. The performance of such a new protocol, in terms of energy efficiency, aggregated throughput, delay, and number of collisions in the radio channel is evaluated and compared to an existing, commercially available protocol for Active RFID, as well as to the IEEE standard 802.15.4 (used, e.g., in the Zigbee medium-access layer). Simulations show that, by acknowledging the payload and using deep sleep mode on the tag, the lifetime of a tag is increased. For all types of protocols using a radio channel, when arbitrating information, it is obvious that the utilization of that channel is maximized when no collisions occur. To avoid and minimize collisions in the media it is possible to intercept channel interference by using carrier sense technology. The knowledge that the channel is occupied should result in a back-off and a later retry, instead of persistently listening to the channel which would require constant energy consumption. We study the effect on tag energy cost and packet delay incurred by some typical back-off algorithms (constant, linear, and exponential) used in a contention based CSMA/CA (Carrier Sense Multiple Access/ Collision Avoidance) protocol for Active RFID communication. The study shows that, by selecting the proper back-off algorithm coefficients (based on the number of tags and the application constraints), i.e., the initial contention window size and back-off interval coefficient, the tag energy consumption and read-out delays can be significantly lowered. The initial communication between reader and tag, on a control channel, establishes those important protocol parameters in the tag so that it tries to deliver its information according to the current application scenario in an energy efficient way. The decision making involved in calculating the protocol parameters is conducted in the local RFID-reader for highest efficiency. This can be done by using local statistics or based on knowledge provided by the logistic backbone databases. As the CMOS circuit technology evolves, new possibilities arise for mass production of low price and long life active tags. The use of wake-up radio technology makes it possible for active tags to react on an RFID-reader at any time, in contrast to tags with cyclic wake-up behaviour. The two main drawbacks with an additional wake-up circuit in a tag are the added die area and the added energy consumption. Within this project the solution is a complete wake-up radio transceiver consisting of only one hi-frequency very low power, and small area oscillator. To support this tag topology we propose and investigate a novel reader-tag communication protocol, the frequency binary tree protocol

Critical Management Issues for Implementing RFID in Supply Chain Management

The benefits of radio frequency identification (RFID) technology in the supply chain are fairly compelling. It has the potential to revolutionise the efficiency, accuracy and security of the supply chain with significant impact on overall profitability. A number of companies are actively involved in testing and adopting this technology. It is estimated that the market for RFID products and services will increase significantly in the next few years. Despite this trend, there are major impediments to RFID adoption in supply chain. While RFID systems have been around for several decades, the technology for supply chain management is still emerging. We describe many of the challenges, setbacks and barriers facing RFID implementations in supply chains, discuss the critical issues for management and offer some suggestions. In the process, we take an in-depth look at cost, technology, standards, privacy and security and business process reengineering related issues surrounding RFID technology in supply chains

Energy analysis of contention tree-based access protocols in dense machine-to-machine area networks

Machine-to-Machine (M2M) area networks aim at connecting an M2M gateway with a large number of energy-constrained devices that must operate autonomously for years. Therefore, attaining high energy efficiency is essential in the deployment of M2M networks. In this paper, we consider a dense M2M area network composed of hundreds or thousands of devices that periodically transmit data upon request from a gateway or coordinator. We theoretically analyse the devices’ energy consumption using two Medium Access Control (MAC) protocols which are based on a tree-splitting algorithm to resolve collisions among devices: the Contention Tree Algorithm (CTA) and the Distributed Queuing (DQ) access. We have carried out computer-based simulations to validate the accuracy of the theoretical models and to compare the energy performance using DQ, CTA, and Frame Slotted-ALOHA (FSA) in M2M area networks with devices in compliance with the IEEE 802.15.4 physical layer. Results show that the performance of DQ is totally independent of the number of contending devices, and it can reduce the energy consumed per device in more than 35% with respect to CTA and in more than 80% with respect to FSA.Peer ReviewedPostprint (published version

From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification

The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost

Energy efficient anti-collision algorithm for the RFID networks

Energy efficiency is crucial for radio frequency identification (RFID) systems as the readers are often battery operated. The main source of the energy wastage is the collision which happens when tags access the communication medium at the same time. Thus, an efficient anti-collision protocol could minimize the energy wastage and prolong the lifetime of the RFID systems. In this regard, EPCGlobal-Class1-Generation2 (EPC-C1G2) protocol is currently being used in the commercial RFID readers to provide fast tag identification through efficient collision arbitration using the Q algorithm. However, this protocol requires a lot of control message overheads for its operation. Thus, a reinforcement learning based anti-collision protocol (RL-DFSA) is proposed to provide better time system efficiency while being energy efficient through the minimization of control message overheads. The proposed RL-DFSA was evaluated through extensive simulations and compared with the variants of EPC-Class 1 Generation 2 algorithms that are currently being used in the commercial readers. The results show conclusively that the proposed RL-DFSA performs identically to the very efficient EPC-C1G2 protocol in terms of time system efficiency but readily outperforms the compared protocol in the number of control message overhead required for the operation