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

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

Survey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks

The use of radio frequency identification (RFID) technologies is becoming widespread in all kind of wireless network-based applications. As expected, applications based on sensor networks, ad-hoc or mobile ad hoc networks (MANETs) can be highly benefited from the adoption of RFID solutions. There is a strong need to employ lightweight cryptographic primitives for many security applications because of the tight cost and constrained resource requirement of sensor based networks. This paper mainly focuses on the security analysis of lightweight protocols and algorithms proposed for the security of RFID systems. A large number of research solutions have been proposed to implement lightweight cryptographic primitives and protocols in sensor and RFID integration based resource constraint networks. In this work, an overview of the currently discussed lightweight primitives and their attributes has been done. These primitives and protocols have been compared based on gate equivalents (GEs), power, technology, strengths, weaknesses and attacks. Further, an integration of primitives and protocols is compared with the possibilities of their applications in practical scenarios

Performance evaluation of non-persistent CSMA as anti-collision protocol for active RFID tags.

In this paper we propose the use of non-persistent CSMA as an anti-collision procedure for RFID active tags. Current proposals for both passive and active tags are based on the framed slotted ALOHA protocol, which does not scale well requiring additional procedures for frame length adaptation. However, active RFID devices already include carrier sense capabilities with no additional cost and, thus, CSMA may be employed seamlessly. Nevertheless, selecting the contention micro-slots of CSMA in the classical way (i.e., with a uniform distribution and an exponential back-off algorithm) does not result in an efficient identification process, as we will demonstrate. Fortunately, better choices can be found. Recently, an optimal distribution for the selection of micro-slots for event-driven sensor networks has been computed, as well as a practical implementation: the Sift distribution. In this work we propose the application of the quasi-optimal Sift distribution along with CSMA for active tag identification. By means of an analytical study, we evaluate the average time needed for identification with this mechanism and compare it with the current ISO 18000-7 and EPC “Gen 2” standard. The results reveal that the Sift-based non-persistent CSMA outperforms both of them. Moreover, it also scales much better, without the need for further adaptation mechanismsThis work has been funded by the Spanish Ministerio de Educación y Ciencia with the projects DEP2006-56158-C03-03/EQUI and m:ciudad (FIT-330503- 2006-2, partially funded by ERDF) and by the Spanish Research Council with the ARPaq project (TEC2004-05622-C04-02/TCM)

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

Special Issue on Recent Advance on Mobile Sensor Systems

Shu, L.; Vasilakos, AV.; Lloret, J.; Pathan, AK. (2011). Special Issue on Recent Advance on Mobile Sensor Systems. Telecommunication Systems. doi:10.1007/s11235-011-9560-y

Reliable Communication in Wireless Networks

Wireless communication systems are increasingly being used in industries and infrastructures since they offer significant advantages such as cost effectiveness and scalability with respect to wired communication system. However, the broadcast feature and the unreliable links in the wireless communication system may cause more communication collisions and redundant transmissions. Consequently, guaranteeing reliable and efficient transmission in wireless communication systems has become a big challenging issue. In particular, analysis and evaluation of reliable transmission protocols in wireless sensor networks (WSNs) and radio frequency identification system (RFID) are strongly required. This thesis proposes to model, analyze and evaluate self-configuration algorithms in wireless communication systems. The objective is to propose innovative solutions for communication protocols in WSNs and RFID systems, aiming at optimizing the performance of the algorithms in terms of throughput, reliability and power consumption. The first activity focuses on communication protocols in WSNs, which have been investigated, evaluated and optimized, in order to ensure fast and reliable data transmission between sensor nodes. The second research topic addresses the interference problem in RFID systems. The target is to evaluate and develop precise models for accurately describing the interference among readers. Based on these models, new solutions for reducing collision in RFID systems have been investigated

Protocol-level performance analysis and implementation for anti-collision protocols in RFID systems

In this thesis, we provide an analytical approach to evaluate the performance of anti-collision protocols in Radio-frequency identification RFID systems. The analysis is given at protocol-level using performance metrics such as the number of state transitions and clock cycles involved in the protocols\u27 state diagrams, their power and energy consumption. Different protocols were also implemented at different level of abstractions and accurate power analysis was performed in layout level. Discussion and comparison are based on worst-case scenario that represents the process of identifying the last tag when multiple tags are simultaneously available in the system. In particular, a new protocol is proposed for performance improvement. This protocol not only provides fast tag identification mechanism but also reduces tag\u27s power and energy consumptions as compared to other protocols that were covered in this study

Performance of BFSA Based Anti-Collision Protocols for RFID Networks Supporting Identical Tags

Radio Frequency Identification (RFID) is a powerful emerging technology widely used for asset tracking, supply chain management, animal identification, military applications, payment systems, and access control. Over the years, RFID has emerged as a popular technology in various industries because of its ability to track moving objects. As RFID is becoming less expensive and more robust, many companies and vendors are developing tags to track objects. Multiple vendors manufacture RFID tags worldwide. Therefore, it is quite possible that they manufacture tags with the same identification code (ID) as vendor ID code data sets may not be synchronized or may be subject to tag id errors. Due to this drawback, there is the possibility that non-unique tags exist along with unique tags in the same RFID system. As existing implementations optimize the performance of RFID systems performance based on the assumption of unique tags, it is important to study the effect of non-unique tags on RFID systems. This thesis focuses on a formal analysis of the Basic Frame Slotted ALOHA (BFSA) Muting RFID system with non-unique tags. An RFID network was modeled with OPNET Modeler 14.5. An evaluation model was built to measure the total census delay, optimal frame size, and network throughput for an RFID network based on a BFSA protocol for non-unique tags and support for muting. The evaluation results are in agreement with results obtained from the evaluation of a similar model for unique tags [Kang08]. Comparing total census delay for unique and non-unique tags for variable frame sizes showed an increase in total census delay with an increase in the number of tags. Comparing minimum network throughput, mean network throughput, and maximum network throughput for unique and non-unique tags for variable frame sizes showed a decrease in network throughput with an increase in the number of tags

Contention tree-based access for wireless machine-to-machine networks with energy harvesting

©2017 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.In this paper, we consider a wireless machine-to-machine network composed of end-devices with energy harvesters that periodically transmit data to a gateway. While energy harvesting allows for perpetual operation, the uncertain amount of harvested energy may not guarantee fully continuous operation due to temporary energy shortages. This fact needs to be addressed at the medium access control layer. We thus investigate the performance of an energy harvesting-aware contention tree-based access (EH-CTA) protocol, which uses a tree-splitting algorithm to resolve collisions and takes energy availability into account. We derive a theoretical model to compute the probability of delivery and the time efficiency. In addition, we conduct a performance comparison of EH-CTA using an EH-aware dynamic frame slotted-ALOHA (EH-DFSA) as a benchmark. We determine the parameters that maximize performance and analyze how it is influenced by the amount of harvested energy and the number of end-devices. Results reveal the superior performance of EH-CTA over EH-DFSA. While EH-DFSA requires an estimate of the number of contending end-devices per frame to adapt the frame length, EH-CTA uses short and fixed frame lengths, which enables scalability and facilitates synchronization as the network density increases.Peer ReviewedPostprint (author's final draft