Proposition and validation of an original MAC layer with simultaneous medium accesses for low latency wireless control/command applications

Control/command processes require a transmission system with some characteristics like high reliability, low latency and strong guarantees on messages delivery. Concerning wire networks, field buses technologies like FIP offer this kind of service (periodic tasks, real time constraints...). Unfortunately, few wireless technologies can propose a communication system which respects such constraints. Indeed, wireless transmissions must deal with medium characteristics which make impossible the direct translation of mechanisms used with wire networks. The purpose of this paper is to present an original Medium Access Control (MAC) layer for a real time Low Power-Wireless Personal Area Network (LP-WPAN). The proposed MAC-layer has been validated by several complementary methods; in this paper, we focus on the specific Simultaneous Guaranteed Time Slot (SGTS) part

An efficient scalable scheduling mac protocol for underwater sensor networks

Underwater Sensor Networks (UWSNs) utilise acoustic waves with comparatively lower loss and longer range than those of electromagnetic waves. However, energy remains a challenging issue in addition to long latency, high bit error rate, and limited bandwidth. Thus, collision and retransmission should be efficiently handled at Medium Access Control (MAC) layer in order to reduce the energy cost and also to improve the throughput and fairness across the network. In this paper, we propose a new reservation-based distributed MAC protocol called ED-MAC, which employs a duty cycle mechanism to address the spatial-temporal uncertainty and the hidden node problem to effectively avoid collisions and retransmissions. ED-MAC is a conflict-free protocol, where each sensor schedules itself independently using local information. Hence, ED-MAC can guarantee conflict-free transmissions and receptions of data packets. Compared with other conflict-free MAC protocols, ED-MAC is distributed and more reliable, i.e., it schedules according to the priority of sensor nodes which based on their depth in the network. We then evaluate design choices and protocol performance through extensive simulation to study the load effects and network scalability in each protocol. The results show that ED-MAC outperforms the contention-based MAC protocols and achieves a significant improvement in terms of successful delivery ratio, throughput, energy consumption, and fairness under varying offered traffic and number of nodes

Advance Reservations of Bandwidth in Computer Networks

In dieser Arbeit wurden die unterschiedlichen Aspekte untersucht, die die Leistungsfähigkeit eines Systems zur Vorausreservierung in Computer-Netzwerken bestimmen. Basierend auf einer Architektur, welche den Basisdienst für Vorausreservierungen mittels Multiprotocol Label Switching (MPLS) zur Verfügung stellt, wurden innerhalb eines Netzwerkmanagementsystems unterschiedliche Dienste implementiert und simulativ auf ihre Auswirkungen auf die Leistungsfähigkeit des Netzwerks in Bezug auf Anzahl zugelassener Datenströme sowie transportierte Datenmenge untersucht. Diese Dienste erweitern in entscheidendem Maße auch die Breite des Dienstangebots in Netzwerken im Vergleich zu bisherigen Implementierungen. So ist es möglich bei Angabe einer festen Datenmenge vom Netzwerkmanagement geeignete Übertragungszeiten und raten bestimmen zu lassen. Diese Parameter werden dann, zum Beispiel in Form von Service Level Agreements (SLA), vom Netzwerkmanagement garantiert und sind insbesondere in Umgebungen wichtig, in denen die Übertragung sehr großer Datenmengen notwendig ist, beispielsweise in Grid-Computing- Systemen. Die erweiterten Dienste dienen jedoch nicht nur den Nutzern, sondern sind auch für Betreiber interessant, da sie es ermöglichen die Leistungsfähigkeit des Netzwerkes zu erhöhen. Dies ist insbesondere zusammen mit weiteren Verfahren möglich, die die zusätzlich zur Verfügung stehenden Informationen über zeitliche Aspekte, wie die Dauer von Übertragungen, nutzen. Im Vergleich zu den heute hauptsächlich betrachteten Systemen zur sog. unmittelbaren Reservierung, kann bei geschicktem Einsatz der hier implementierten Dienste und Verfahren eine deutliche Verbesserung der Leistung erzielt werden. Hinzu kommen bei Vorausreservierungen die erheblichen Vorteile für die Nutzer eines Netzwerkes, wie z.B. der oben beschriebene Datentransfer. Die Leistung eines Netzwerkes bemisst sich jedoch nicht nur an der transportierten Datenmenge, sondern auch am Verhalten im Fehlerfall und der Geschwindigkeit des Managementsystems. Dazu wurden im Rahmen dieser Arbeit mögliche Strategien zur Reaktion von Vorausreservierungssystemen im Fall von Link-Ausfällen entwickelt und untersucht. Auch hier kommt dem zeitlichen Aspekt eine wichtige Bedeutung zu. Es erwies sich als erfolgreich, nicht nur unmittelbar betroffene Datenströme sondern auch solche, die zwar bereits bekannt, jedoch noch nicht aktiv waren, in die Fehlerbehandlungsstrategie mit einzubeziehen. Datenstrukturen, die von der Zugangskontrolle des Managementsystems benötigt werden und dort die Geschwindigkeit maßgeblich bestimmen, wurden unter den Aspekten der Zugriffsgeschwindigkeit und des Speicherverbrauchs untersucht. Hierbei wurde gezeigt, dass Arrays erhebliche Vorteile im Hinblick auf beide Aspekte haben und in den meisten Fällen einer Baumstruktur, die speziell für die Aufgabe innerhalb der Zugangskontrolle entwickelt wurde, überlegen sind. Die Nutzung von Vorausreservierungen in Computer-Netzwerken ist damit eine nützliche und wichtige Erweiterung der Funktionalität eines Netzwerkes sowohl in Bezug auf das zur Verfügung stehende Angebot an Diensten, als auch im Hinblick auf die Leistungsfähigkeit des Netzwerkes.In this thesis, the impact of using advance reservations of bandwidth in a computer network on the performance for both clients and operators of the network is examined. Based on an architecture that uses multi-protocol label switching (MPLS) controlled by bandwidth brokers, a number of services that - compared to todays best-effort or immediate reservation networks - provide an enhanced functionality for clients were developed. These services allow clients to specify requests in a less stringent way than currently necessary, for example, it is possible to define only the amount of data to be transmitted between two network endpoints and the management system then determines suitable transmission parameters such as start and stop time and transmission rate. This functionality provides reliable feedback to clients and can serve as a foundation for providing service-level agreements, e.g., guaranteeing deadlines for the transmission of a certain amount of data. The additional services can also be used by network operators to improve the overall utilization of the network. In addition, the various opportunities of using the additional temporal dimension of the advance reservation service are suitable to improve the network performance. It can be shown that the amount of blocked requests and bandwidth can be considerably decreased making use of both services and the additional information available in the given environment. Besides the achievable throughout and amount of admitted requests, the term performance in the context of advance reservation systems also covers other aspects such as failure recovery strategies and the processing time required by the network management system. In the thesis, several strategies to be applied in case of link failures are outlined and examined with respect to their applicability and achievable performance. For example, it can be shown that it is worthwhile to consider not only flows which are active at the time a failure occurs but also to take inactive but already admitted flows into account in order to achieve the best possible performance. In addition to failure recovery, also the processing speed of the management system is of importance. For that purpose, in particular the data structures used to store the current and future network status need to be examined since they dominate the processing time of the management system. Two data structures, arrays and a tree which was especially designed for this purpose were examined, showing that arrays are superior with respect to processing speed and memory consumption in almost any environment

Evaluating Mobility Predictors in Wireless Networks for Improving Handoff and Opportunistic Routing

We evaluate mobility predictors in wireless networks. Handoff prediction in wireless networks has long been considered as a mechanism to improve the quality of service provided to mobile wireless users. Most prior studies, however, were based on theoretical analysis, simulation with synthetic mobility models, or small wireless network traces. We study the effect of mobility prediction for a large realistic wireless situation. We tackle the problem by using traces collected from a large production wireless network to evaluate several major families of handoff-location prediction techniques, a set of handoff-time predictors, and a predictor that jointly predicts handoff location and time. We also propose a fallback mechanism, which uses a lower-order predictor whenever a higher-order predictor fails to predict. We found that low-order Markov predictors, with our proposed fallback mechanisms, performed as well or better than the more complex and more space-consuming compression-based handoff-location predictors. Although our handoff-time predictor had modest prediction accuracy, in the context of mobile voice applications we found that bandwidth reservation strategies can benefit from the combined location and time handoff predictor, significantly reducing the call-drop rate without significantly increasing the call-block rate. We also developed a prediction-based routing protocol for mobile opportunistic networks. We evaluated and compared our protocol\u27s performance to five existing routing protocols, using simulations driven by real mobility traces. We found that the basic routing protocols are not practical for large-scale opportunistic networks. Prediction-based routing protocols trade off the message delivery ratio against resource usage and performed well and comparable to each other

Optimum Allocation of Distributed Service Workflows with Probabilistic Real-Time Guarantees

This paper addresses the problem of optimum allocation of distributed real-time workflows with probabilistic service guarantees over a set of physical resources. The discussion focuses on how such a problem may be mathematically formalized, in terms of both constraints and objective function to be optimized, which also accounts for possible business rules for regulating the deployment of the workflows. The presented formal problem constitutes a probabilistic admission control test that may be run by a provider in order to decide whether or not it is worth to admit new workflows into the system and to decide what the optimum allocation of the workflow to the available resources is. Various options are presented, which may be plugged into the formal problem description, depending on the specific needs of individual workflows. The presented problem has been implemented using GAMS and has been tested under various solvers. An illustrative numerical example and an analysis of the results of the implemented model under realistic settings are presented

A traffic-aware electric vehicle charging management system for smart cities

© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/The expected increase in the number of electric vehicles (EVs) in the coming years will contribute to reducing CO2 pollution in our cities. Currently, EVs' users may suffer from distress due to long charging service times and overloaded charging stations (CSs). Critical traffic conditions (e.g., traffic jams) affect EVs' trip time (TT) towards CSs and thus influence the total trip duration. With this concern, Intelligent transport systems (ITS) and more specifically connected vehicle technologies, can leverage an efficient real-time EV charging service by jointly considering CSs status and traffic conditions in the city. In this work, we propose a scheme to manage EVs' charging planning, focusing on the selection of a CS for the energy-requiring EV. The proposed scheme considers anticipated charging slots reservations performed through a vehicular ad hoc network (VANET), which has been regarded as a cost-efficient communication framework. In specific, we consider two aspects: 1) the EV's total trip time towards its destination considering an intermediate charging at each candidate CS, and 2) the communication delay of the VANET routing protocol. First, in order to estimate the EV's total trip time, our CS selection scheme takes into account the average road speed, traffic lights, and route distance, along the path of the EV. The optimal CS that produces the minimum total charging service time (including the TT) is suggested to that energy-requiring EV. Then, we introduce two communication modes based on geographical routing protocols for VANETs to attain an anticipated charging slot reservation. Simulation results show that with our charging scheme EVs' charging service time is reduced and more EVs are successfully charged.Peer ReviewedPostprint (author's final draft