Mac protocols for linear wireless (sensor) networks

Wireless sensor networks (WSNs) consist of a large number of sensor nodes, characterized by low power constraint, limited transmission range and limited computational capabilities [1][2].The cost of these devices is constantly decreasing, making it possible to use a large number of sensor devices in a wide array of commercial, environmental, military, and healthcare fields. Some of these applications involve placing the sensors evenly spaced on a straight line for example in roads, bridges, tunnels, water catchments and water pipelines, city drainages, oil and gas pipelines etc., making a special class of these networks which we define as a Linear Wireless Network (LWN). In LWNs, data transmission happens hop by hop from the source to the destination, through a route composed of multiple relays. The peculiarity of the topology of LWNs, motivates the design of specialized protocols, taking advantage of the linearity of such networks, in order to increase reliability, communication efficiency, energy savings, network lifetime and to minimize the end-to-end delay [3]. In this thesis a novel contention based Medium Access Control (MAC) protocol called L-CSMA, specifically devised for LWNs is presented. The basic idea of L-CSMA is to assign different priorities to nodes based on their position along the line. The priority is assigned in terms of sensing duration, whereby nodes closer to the destination are assigned shorter sensing time compared to the rest of the nodes and hence higher priority. This mechanism speeds up the transmission of packets which are already in the path, making transmission flow more efficient. Using NS-3 simulator, the performance of L-CSMA in terms of packets success rate, that is, the percentage of packets that reach destination, and throughput are compared with that of IEEE 802.15.4 MAC protocol, de-facto standard for wireless sensor networks. In general, L-CSMA outperforms the IEEE 802.15.4 MAC protocol.

Dispersion and energy relations in periodic chains and grids

In this study wave propagation, dispersion relations, and energy relations for linear elastic periodic systems are analyzed. In particular, the dispersion relations for monoatomic chain of infinite dimension are obtained analytically by writing the Block-type wave equation for a unit cell in order to capture the dynamic behavior for chains under prescribed vibration. By comparing the discretized model (mass-spring chain) with the solid bar system, the nonlinearity of the dispersion relation for chain indicates that the periodic lattice is dispersive in contrast to the continuous rod, which is non dispersive. Further investigations have been performed considering one-dimensional diatomic linear elastic mass-spring chain. The dispersion relations, energy velocity, and group velocity have been derived. At certain range of frequencies harmonic plane waves do not propagate in contrast with monoatomic chain. Also, since the diatomic chain considered is a linear elastic chain, both of the energy velocity and the group velocity are identical. As long as the linear elastic condition is considered the results show zero flux condition without residual energy. In addition, this paper shows that the diatomic chain dispersion relations are independent on the unit cell scheme. Finally, an extension for the study covers the dispersion and energy relations for 2D- grid system. The 2x2 grid system show a periodicity of the dispersion surface in the wavenumber domain. In addition, the symmetry of the surface can be exploited to identify an Irreducible Brillouin Zone (IBZ). Compact representations of the dispersion properties of multidimensional periodic systems are obtained by plotting frequency as the wave vector’s components vary along the boundary of the IBZ, which leads to a widely accepted and effective visualization of bandgaps and overall dispersion properties.

Distributed non-cooperative robust economic predictive control for dynamically coupled linear systems.

In this thesis, a tube-based Distributed Economic Predictive Control (DEPC) scheme is presented for a group of dynamically coupled linear subsystems. These subsystems are components of a large scale system and control inputs are computed based on optimizing a local economic objective. Each subsystem is interacting with its neighbors by sending its future reference trajectory, at each sampling time. It solves a local optimization problem in parallel, based on the received future reference trajectories of the other subsystems. To ensure recursive feasibility and a performance bound, each subsystem is constrained to not deviate too much from its communicated reference trajectory. This difference between the plan trajectory and the communicated one is interpreted as a disturbance on the local level. Then, to ensure the satisfaction of both state and input constraints, they are tightened by considering explicitly the effect of these local disturbances. The proposed approach averages over all possible disturbances, handles tightened state and input constraints, while satisfies the compatibility constraints to guarantee that the actual trajectory lies within a certain bound in the neighborhood of the reference one. Each subsystem is optimizing a local arbitrary economic objective function in parallel while considering a local terminal constraint to guarantee recursive feasibility. In this framework, economic performance guarantees for a tube-based distributed predictive control (DPC) scheme are developed rigorously. It is presented that the closed-loop nominal subsystem has a robust average performance bound locally which is no worse than that of a local robust steady state. Since a robust algorithm is applying on the states of the real (with disturbances) subsystems, this bound can be interpreted as an average performance result for the real closed-loop system. To this end, we present our outcomes on local and global performance, illustrated by a numerical example.