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

Optimal Fair Scheduling in S-TDMA Sensor Networks for Monitoring River Plumes

Underwater wireless sensor networks (UWSNs) are a promising technology to provide oceanographers with environmental data in real time. Suitable network topologies to monitor estuaries are formed by strings coming together to a sink node.This network may be understood as an oriented graph. A number of MAC techniques can be used in UWSNs, but Spatial-TDMA is preferred for fixed networks. In this paper, a scheduling procedure to obtain the optimal fair frame is presented, under ideal conditions of synchronization and transmission errors. The main objective is to find the theoretical maximum throughput by overlapping the transmissions of the nodes while keeping a balanced received data rate from each sensor, regardless of its location in the network. The procedure searches for all cliques of the compatibility matrix of the network graph and solves a Multiple-Vector Bin Packing (MVBP) problem. This work addresses the optimization problem and provides analytical and numerical results for both the minimum frame length and the maximum achievable throughput

Optimal scheduling and fair servicepolicy for STDMA in underwater networks with acoustic communications

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index

A dynamic distributed multi-channel TDMA slot management protocol for ad hoc networks

With the emergence of new technologies and standards for wireless communications and an increase in application and user requirements, the number and density of deployed wireless ad hoc networks is increasing. For deterministic ad hoc networks, Time-Division Multiple Access (TDMA) is a popular medium access scheme, with many distributed TDMA scheduling algorithms being proposed. However, with increasing traffic demands and the number of wireless devices, proposed protocols are facing scalability issues. Besides, these protocols are achieving suboptimal spatial spectrum reuse as a result of the unsolved exposed node problem. Due to a shortage of available spectrum, a shift from fixed spectrum allocation to more dynamic spectrum sharing is anticipated. For dynamic spectrum sharing, improved distributed scheduling protocols are needed to increase spectral efficiency and support the coexistence of multiple co-located networks. Hence, in this paper, we propose a dynamic distributed multi-channel TDMA (DDMC-TDMA) slot management protocol based on control messages exchanged between one-hop network neighbors and execution of slot allocation and removal procedures between sender and receiver nodes. DDMC-TDMA is a topology-agnostic slot management protocol suitable for large-scale and high-density ad hoc networks. The performance of DDMC-TDMA has been evaluated for various topologies and scenarios in the ns-3 simulator. Simulation results indicate that DDMC-TDMA offers near-optimal spectrum utilization by solving both hidden and exposed node problems. Moreover, it proves to be a highly scalable protocol, showing no performance degradation for large-scale and high-density networks and achieving coexistence with unknown wireless networks operating in the same wireless domain

Planificación S-TDMA en redes submarinas de comunicaciones inalámbricas

Las redes submarinas de sensores son de importancia en la vigilancia y monitorización del medio submarino. Si se desea que las redes sean inalámbricas y con un alcance superior a unos pocos metros, las comunicaciones han de ser acústicas. El canal acústico submarino es de poca capacidad de transmisión y muy hostil en términos de ruido y desvanecimiento, ya que es selectivo en frecuencia. Además, estas redes inalámbricas plantean el problema añadido de la alimentación eléctrica. En redes de tráfico saturado, el procedimiento más eficiente de acceso al medio es TDMA espacial, por los menores “overheads” y la práctica ausencia de “handshaking”. En esta comunicación se presenta un procedimiento para la obtención de una planificación eficiente en redes submarinas de comunicaciones que utilicen TDMA espacial. El procedimiento está basado en dos algoritmos heurísticos encadenados y encuentra una planificación temporal eficiente para conseguir la misma cantidad de información de los sensores de cada nodo de la red.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tec

The Design of Medium Access Control (MAC) Protocols for Energy Efficient and QoS Provision in Wireless Sensor Networks

This thesis work focuses on innovative design of media access control (MAC) protocols in wireless sensor networks (WNSs). The characteristics of the WSN inquire that the network service design considers both energy efficiency and the associated application requirement. However, most existing protocols address only the issue of energy efficiency. In this thesis, a MAC protocol has been proposed (referred to as Q-MAC) that not only minimized the energy consumption in multi-hop WSNs, but also provides Quality of Service (QoS) by differentiating network services based on priority levels prescribed by different applications. The priority levels reflect the state of system resources including residual energy and queue occupancies. Q-MAC contains both intra- and inter- node arbitration mechanisms. The intra-node packet scheduling employs a multiple queuing architectures, and applies a scheduling scheme consisting of packet classification and weighted arbitration. We introduce the Power Conservation MACAW (PC-MACAW), a power-aware scheduling mechanism which, together with the Loosely Prioritized Random Access (LPRA) algorithm, govern the inter-node scheduling. Performance evaluation are conducted between Q-MAC and S-MAC with respect to two performance metrics: energy consumption and average latency. Simulation results indicate Q-MAC achieves comparable performance to that of S-MAC in non-prioritized traffic scenarios. When packets with different priorities are introduced, Q-MAC yields noticeable average latency differentiations between the classes of service, while preserving the same degree of energy consumption as that of S-MAC. Since the high density nature of WSN may introduce heavy traffic load and thus consume large amount of energy for communication, another MAC protocol, referred to as the Deployment-oriented MAC (D-MAC)has been further proposed. D-MAC minimalizes both sensing and communication redundancy by putting majority of redundant nodes into the sleep state. The idea is to establish a sensing and communication backbone covering the whole sensing field with the least sensing and communication redundancy. In specific, we use equal-size rectangular cells to partition the sensing field and chose the size of each cell in a way such that regardless of the actual location within the cell, a node can always sense the whole cell and communicate with all the nodes in neighboring cells. Once the sensing field has been partitioned using these cells, a localized Location-aware Selection Algorithm (LSA) is carried out to pick up only one node within each cell to be active for a fixed amount of period. This selection is energy-oriented, only nodes with a maximum energy will be on and the rest of nodes will be put into the sleep state once the selection process is over. To balance the energy consumption, the selection algorithm is periodically conducted until all the nodes are out of power. Simulation results indicated that D-MAC saves around 80% energy compared to that of S-MAC and Q-MAC, while maintaining 99% coverage. D-MAC is also superior to S-MAC and Q-MAC in terms of average latency. However, the use of GPS in D-MAC in identifying the nodes within the same cell, would cause extra cost and complexity for the design of sensor nodes