3,662 research outputs found
A Case for Time Slotted Channel Hopping for ICN in the IoT
Recent proposals to simplify the operation of the IoT include the use of
Information Centric Networking (ICN) paradigms. While this is promising,
several challenges remain. In this paper, our core contributions (a) leverage
ICN communication patterns to dynamically optimize the use of TSCH (Time
Slotted Channel Hopping), a wireless link layer technology increasingly popular
in the IoT, and (b) make IoT-style routing adaptive to names, resources, and
traffic patterns throughout the network--both without cross-layering. Through a
series of experiments on the FIT IoT-LAB interconnecting typical IoT hardware,
we find that our approach is fully robust against wireless interference, and
almost halves the energy consumed for transmission when compared to CSMA. Most
importantly, our adaptive scheduling prevents the time-slotted MAC layer from
sacrificing throughput and delay
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
Leveraging Physical Layer Capabilites: Distributed Scheduling in Interference Networks with Local Views
In most wireless networks, nodes have only limited local information about
the state of the network, which includes connectivity and channel state
information. With limited local information about the network, each node's
knowledge is mismatched; therefore, they must make distributed decisions. In
this paper, we pose the following question - if every node has network state
information only about a small neighborhood, how and when should nodes choose
to transmit? While link scheduling answers the above question for
point-to-point physical layers which are designed for an interference-avoidance
paradigm, we look for answers in cases when interference can be embraced by
advanced PHY layer design, as suggested by results in network information
theory.
To make progress on this challenging problem, we propose a constructive
distributed algorithm that achieves rates higher than link scheduling based on
interference avoidance, especially if each node knows more than one hop of
network state information. We compare our new aggressive algorithm to a
conservative algorithm we have presented in [1]. Both algorithms schedule
sub-networks such that each sub-network can employ advanced
interference-embracing coding schemes to achieve higher rates. Our innovation
is in the identification, selection and scheduling of sub-networks, especially
when sub-networks are larger than a single link.Comment: 14 pages, Submitted to IEEE/ACM Transactions on Networking, October
201
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
To ensure a long-lived network of wireless communicating sensors, we are in need of a medium access control protocol that is able to prevent energy-wasting effects like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish a non-conflicting schedule. In this paper, we present such a mechanism which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. In our solution, we do not assume any hierarchical organization in the network and all operation is localized. We empirically show that our localized algorithm is successful within a factor 2 of the minimum necessary time slots in random networks; well in range of the expected (worst case) factor 3-approximation of known first-fit algorithms. Our algorithm assures similar minimum distance between simultaneous transmissions as CSMA(/CD)-based approaches
- …