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

Network-Level Performance Evaluation of a Two-Relay Cooperative Random Access Wireless System

In wireless networks relay nodes can be used to assist the users' transmissions to reach their destination. Work on relay cooperation, from a physical layer perspective, has up to now yielded well-known results. This paper takes a different stance focusing on network-level cooperation. Extending previous results for a single relay, we investigate here the benefits from the deployment of a second one. We assume that the two relays do not generate packets of their own and the system employs random access to the medium; we further consider slotted time and that the users have saturated queues. We obtain analytical expressions for the arrival and service rates of the queues of the two relays and the stability conditions. We investigate a model of the system, in which the users are divided into clusters, each being served by one relay, and show its advantages in terms of aggregate and throughput per user. We quantify the above, analytically for the case of the collision channel and through simulations for the case of Multi-Packet Reception (MPR), and we provide insight on when the deployment of a second relay in the system can yield significant advantages.Comment: Submitted for journal publicatio

Selecting source image sensor nodes based on 2-hop information to improve image transmissions to mobile robot sinks in search \& rescue operations

We consider Robot-assisted Search $\&$ Rescue operations enhanced with some fixed image sensor nodes capable of capturing and sending visual information to a robot sink. In order to increase the performance of image transfer from image sensor nodes to the robot sinks we propose a 2-hop neighborhood information-based cover set selection to determine the most relevant image sensor nodes to activate. Then, in order to be consistent with our proposed approach, a multi-path extension of Greedy Perimeter Stateless Routing (called T-GPSR) wherein routing decisions are also based on 2-hop neighborhood information is proposed. Simulation results show that our proposal reduces packet losses, enabling fast packet delivery and higher visual quality of received images at the robot sink

RF Energy Harvesting Enabled Power Sharing in Relay Networks

Through simultaneous energy and information transfer, radio frequency (RF) energy harvesting (EH) reduces the energy consumption of the wireless networks. It also provides a new approach for the wireless devices to share each other's energy storage, without relying on the power grid or traffic offloading. In this paper, we study RF energy harvesting enabled power balancing within the decode-and-forward (DF) relaying-enhanced cooperative wireless system. An optimal power allocation policy is proposed for the scenario where both source and relay nodes can draw power from the radio frequency signals transmitted by each other. To maximize the overall throughput while meeting the energy constraints imposed by the RF sources, an optimization problem is formulated and solved. Based on different harvesting efficiency and channel condition, closed form solutions for optimal joint source and relay power allocation are derived.Comment: An abbreviated version will be presented at IEEE online GreenComm, Nov., 201

Information exchange in randomly deployed dense WSNs with wireless energy harvesting capabilities

©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.As large-scale dense and often randomly deployed wireless sensor networks (WSNs) become widespread, local information exchange between colocated sets of nodes may play a significant role in handling the excessive traffic volume. Moreover, to account for the limited life-span of the wireless devices, harvesting the energy of the network transmissions provides significant benefits to the lifetime of such networks. In this paper, we study the performance of communication in dense networks with wireless energy harvesting (WEH)-enabled sensor nodes. In particular, we examine two different communication scenarios (direct and cooperative) for data exchange and we provide theoretical expressions for the probability of successful communication. Then, considering the importance of lifetime in WSNs, we employ state-of-the-art WEH techniques and realistic energy converters, quantifying the potential energy gains that can be achieved in the network. Our analytical derivations, which are validated by extensive Monte-Carlo simulations, highlight the importance of WEH in dense networks and identify the tradeoffs between the direct and cooperative communication scenarios.Peer ReviewedPostprint (author's final draft