Search

Data Center (DC) management aims at promptly serving user requests while minimizing the energy consumed. This is achieved by turning off unnecessary servers to save energy and adapting the number of servers that are $on$ to the time-varying and heterogeneous user requests. A great change in the number of servers $on$ leads to a considerable management effort, also called control effort in the literature, which should be reduced as much as possible. Since feedback control can improve the performance of computing systems and networks, we propose to use it to achieve this dynamic capacity provisioning of the DC. In order to design this feedback control, first, we developed a dynamic model of the DC. The purpose of this paper is to design a feedback control strategy based on the DC model, able to optimize i) the Quality of Service, ii) the energy consumed and iii) the management effort. A simple Reactive open-loop Control which provides an amount of energy equal to the amount requested in the previous time interval is considered as a benchmark for comparison. Second, two feedback controls based on the balance equations of the DC are studied, namely i) Reactive Feedback Control providing an amount of energy equal to that provided by the reactive open-loop control but adding the accumulated demand that has not yet been served, and ii) Model Predictive Control optimizing a constrained cost that weights the management effort and the prediction error. Reactive Control, Reactive Feedback Control and Model Predictive Control are compared in terms of energy consumed, energy error and management effort. Quantitative results of the comparative performance evaluation are given, based on a data set collected from a real DC.

High accuracy air pollution monitoring in a smart city requires the deployment of a huge number of sensors in this city. One of the most appropriate wireless technologies expected to support high density deployment is LoRaWAN which belongs to the Low Power Wide Area Network (LPWAN) family and offers long communication range, multi-year battery lifetime and low cost end devices. It has been designed for End Devices (EDs) and applications that need to send small amounts of data a few times per hour. However, a high number of end devices breaks the orthogonality of LoRaWAN transmissions, which was one of the main advantages of LoRaWAN. Hence, network performances are strongly impacted. To solve this problem, we propose a solution called OAPM (Orthogonal Air Pollution Monitoring) which ensures the orthogonality of LoRaWAN transmissions and provides accurate air pollution monitoring. In this paper, we show how to organize EDs into clusters and sub-clusters, assign transmission times to EDs, configurate and synchronize them, taking into account the specificities of LoRaWAN and the features of the air pollution monitoring application. Simulation results corroborate the very good behavior of OAPM.

With the Internet of Things (IoT), the number of monitoring applications deployed is considerably increasing, whatever the field considered: smart city, smart agriculture, environment monitoring, air pollution monitoring, to name a few. The LoRaWAN (Long Range Wide Area Network)architecture with its long range communication, its robustness to interference and its reduced energy consumption is an excellent candidate to support such applications. However, if the number of end devices is high, the reliability of LoRaWAN, measured by the Packet Delivery Ratio (PDR), becomes unacceptable due to an excessive number of collisions. In this paper, we propose two different families of solutions ensuring collision-free transmissions. The first family is TDMA (Time-Division Multiple Access)-based. All clusters transmit in sequence and up to six end devices with different spreading factors belonging to the same cluster are allowed to transmit in parallel. The second family is FDMA (Frequency Divsion Multiple Access)-based. All clusters transmit in parallel, each cluster on its own frequency. Within each cluster, all end devices transmit in sequence. Their performance are compared in terms of PDR, energy consumption by end device and maximum number of end devices supported. Simulation results corroborate the theoretical results and show the high efficiency of the solutions proposed.

Location-based routing protocols for vehicular ad hoc networks (VANETs) use location information to determine routing decisions. This information is provided by a location service that is queried by nodes in order to properly forward packets to communication partners. This paper presents the semiflooding location service, a proactive flooding-based location service that drastically reduces the number of update packets sent over the network compared to traditional flooding-based location services. This goal is achieved by each node partially forwarding location information. We present both deterministic and probabilistic approaches for this algorithm, which remains very simple. A mathematical model is proposed to show the effectiveness of this solution. The cases of homogeneous 1D, 2D, and 3D networks were studied for both deterministic and probabilistic forwarding decisions. We compare our algorithm with simple flooding and with the multipoint-relay (MPR) flooding of the optimized-link-state-routing (OLSR) protocol, and we show that our algorithm, despite being very simple, has excellent scalability properties. The mean number of generated messages ranges with the mean number of the neighbors of one random network node.