Unified clustering and communication protocol for wireless sensor networks

In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service

Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\xi$, and then combine them into frames of uniform size, $\tau$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $\delta$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size. We demonstrate that this problem has no solution when the frame size is $\tau < \max\{2\delta,\chi_2\}$, where $\chi_2$ is the chromatic number for distance-$2$ vertex coloring. As a complement to this lower bound, we focus on proving the existence of collision-free self-stabilizing TDMA algorithms that use constant frame size of $\tau$. We consider basic settings (no hardware support for collision detection and no prior clock synchronization), and the collision of concurrent transmissions from transmitters that are at most two hops apart. In the context of self-stabilizing systems that have no external reference, we are the first to study this problem (to the best of our knowledge), and use simulations to show convergence even with computation time uncertainties

TDMAとDCFの組み合わせによるアドホックネットワーク上でのQoS通信の実現方式

　An ad hoc network does not rely on the fixed network infrastructure; it uses a distributed network management method. With the popularity of the smart devices, ad hoc network has received more and more attention, supporting QoS in ad hoc network has become inevitable. Many researches have been done for provision of QoS in ad hoc networks. These researches can be divided into three types.　The first type is contention-based approach which is the most widely used. IEEE 802.11e MAC (media access control) protocol belongs to this type which is an extension of IEEE 802.11 DCF(Distributed Coordination Function). It specifies a procedure to guarantee QoS by providing more transmission opportunities for high priority data. However, since IEEE 802.11eis designed based on the premise that access points are used, when the number of QoS flows increases, packet collisions could occur in multi-hop ad hoc network.　The second type is using TDMA-based approach. The TDMA approach can provide contention-free access for QoS traffics through the appropriate time slot reservation. The current TDMA approaches reserve time slots for both QoS traffics and best-effort traffics. However, it is difficult for TDMA as the only approach to allocating channel access time for best-effort traffics sincet he required bandwidth of the best-effort traffics changes frequently.　We propose a QoS scheme, which takes advantage of both contention-based approach and TDMA-based approach. In the proposed scheme, contention-based approach DCF provides easy and fair channel time for best-effort traffics, and TDMA approach serves the QoS traffics. A time frame structure is designed to manage the bandwidth allocation. A time frame is divided into two periods, specifically the TDMA periods and the DCF periods. The proportion of two periods is decided by QoS traffics. Therefore the QoS traffics are given absolutely higher priority than best-effort traffics. In order to guarantee the transmission of each QoS packet in TDMA period, a time slot assignment algorithm based on QoS data rate has been proposed. The proposed scheme also employs an admission control scheme, which rejects the new QoS user when the channel capacity is reached. In addition, we provide the configuration of the proposed scheme in the mobile environment. The procedures are designed for route changes and new-adding users. 　The proposed scheme is simulated in the QualNet simulator. In the static environment, the performance of the proposed scheme is evaluated in the case of a gradual increase in the number TCP flows and in the case of gradual increase in QoS data rate. Simulation results show that in the static environment the proposed scheme can not only provide effective QoS performance, but also can provide good support for best-effort flows. In the mobile environment, we simulated the performance of the proposed scheme at different moving speed (maximum is 5 Km/h) when the ARF (Auto Rate Fallback) is available. From the simulation results, in a specific mobile environment, the proposed scheme can support the QoS transmission well.電気通信大学201

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks

This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications

Time division multiple access scheduling strategies for emerging vehicular ad hoc network medium access control protocols: a survey

[EN] Vehicular ad hoc network (VANET) is an emerging and promising technology, which allows vehicles while moving on the road to communicate and share resources. These resources are aimed at improving traffic safety and providing comfort to drivers and passengers. The resources use applications that have to meet high reliability and delay constraints. However, to implement these applications, VANET relies on medium access control (MAC) protocol. Many approaches have been proposed in the literature using time division multiple access (TDMA) scheme to enhance the efficiency of MAC protocol. Nevertheless, this technique has encountered some challenges including access and merging collisions due to inefficient time slot allocation strategy and hidden terminal problem. Despite several attempts to study this class of protocol, issues such as channel access and time slot scheduling strategy have not been given much attention. In this paper, we have relatively examined the most prominent TDMA MAC protocols which were proposed in the literature from 2010 to 2018. These protocols were classified based on scheduling strategy and the technique adopted. Also, we have comparatively analyzed them based on different parameters and performance metrics used. Finally, some open issues are presented for future deployment.Tambawal, AB.; Noor, RM.; Salleh, R.; Chembe, C.; Anisi, MH.; Michael, O.; Lloret, J. (2019). Time division multiple access scheduling strategies for emerging vehicular ad hoc network medium access control protocols: a survey. Telecommunication Systems. 70(4):595-616. https://doi.org/10.1007/s11235-018-00542-8S59561670

Rapid Convergecast on Commodity Hardware: Performance Limits and Optimal Policies

ReSensePromo

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