Wireless sensor networks has been one of the major research topics in recent years because of its great potential for a wide range of applications. In some application scenarios, sensor nodes intend to report the sensing data to a far-field destination, which cannot be realized by traditional transmission techniques. Due to the energy limitations and the hardware constraints of sensor nodes, distributed transmit beamforming is considered as an attractive candidate for long-range communications in such scenarios as it can reduce energy requirement of each sensor node and extend the communication range. However, unlike conventional beamforming, which is performed by a centralized antenna array, distributed beamforming is performed by a virtual antenna array composed of randomly located sensor nodes, each of which has an independent oscillator. Sensor nodes have to coordinate with each other and adjust their transmitting signals to collaboratively act as a distributed beamformer. The most crucial problem of realizing distributed beamforming is to achieve carrier phase alignment at the destination. This thesis will investigate distributed beamforming from both theoretical and practical aspects. First, the bit error ratio performance of distributed beamforming with phase errors is analyzed, which is a key metric to measure the system performance in practice. We derive two distinct expressions to approximate the error probability over Rayleigh fading channels corresponding to small numbers of nodes and large numbers of nodes respectively. The accuracy of both expressions is demonstrated by simulation results. The impact of phase errors on the system performance is examined for various numbers of nodes and different levels of transmit power. Second, a novel iterative algorithm is proposed to achieve carrier phase alignment at the destination in static channels, which only requires one-bit feedback from the destination. This algorithm is obtained by combining two novel schemes, both of which can greatly improve the convergence speed of phase alignment. The advantages in the convergence speed are obtained by exploiting the feedback information more efficiently compared to existing solutions. Third, the proposed phase alignment algorithm is modified to track time-varying channels. The modified algorithm has the ability to detect channel amplitude and phase changes that arise over time due to motion of the sensors or the destination. The algorithm can adjust key parameters adaptively according to the changes, which makes it more robust in practical implementation.

This thesis focuses on developing a high data rate wireless sensor network framework that could be integrated with hardware prototypes to monitor structural health of buildings. In order to better understand the wireless sensor network architecture and its consideration in structural health monitoring, a detailed literature review on wireless sensor networks has been carried out. Through research, it was found that there are numerous simulation software packages available for wireless sensor network simulation. One suitable software was selected for modelling the framework. Research showed that Matlab/Simulink was the most suitable environment, and as a result, a wireless sensor network framework was designed in Matlab/Simulink. Further, the thesis illustrates modeling of a simple accelerometer sensor, such as those used in wireless sensor networks in Matlab/Simulink using a mathematical description. Finally, the framework operation is demonstrated with 10 nodes, and data integrity is analyzed with cyclic redundancy check and transmission error rate calculations.

Wireless sensor networks are composed of sensor nodes, which can monitor an environment and observe events of interest. These networks are applied in various fields including but not limited to environmental, industrial and habitat monitoring. In many applications, the exact location of the sensor nodes is unknown after deployment. Localization is a process used to find sensor node's positional coordinates, which is vital information. The localization is generally assisted by anchor nodes that are also sensor nodes but with known locations. Anchor nodes generally are expensive and need to be optimally placed for effective localization. Passive localization is one of the localization techniques where the sensor nodes silently listen to the global events like thunder sounds, seismic waves, lighting, etc. According to previous studies, the ideal location to place anchor nodes was on the perimeter of the sensor network. This may not be the case in passive localization, since the function of anchor nodes here is different than the anchor nodes used in other localization systems. I do extensive studies on positioning anchor nodes for effective localization. Several simulations are run in dense and sparse networks for proper positioning of anchor nodes. I show that, for effective passive localization, the optimal placement of the anchor nodes is at the center of the network in such a way that no three anchor nodes share linearity. The more the non-linearity, the better the localization. The localization for our network design proves better when I place anchor nodes at right angles.

<p>U doktorskoj disertaciji razmatrana je mogućnost lokalizacije proizvoda primenom tehnologija Interneta stvari. Postavljen je model za lokalizaciju proizvoda koji primenjuje RFID tehnologiju i bežične senzorske mreže. U okviru modela, predložen je i realizovan hibridni metod za lokalizaciju proizvoda koji kombinuje podatke dobijene metodom najbližih suseda i metodom optimizacije rojem čestica, a zatim i hibridni metod za lokalizaciju proizvoda koji kombinuje podatke dobijene u RFID sistemu i u bežičnoj senzorskoj mreži. Mogućnosti primene predloženog modela su eksperimentalno ispitane u simuliranim sistemima i u laboratorijskoj okolini sa industrijskim elementima..</p> / <p>This dissertation discusses the possibilities of product localization based on Internet of things technologies. A model for product localization has been proposed based on RFID technology and wireless sensor networks. Within the model, a hybrid localization method which combines outputs from nearest neighbours method and particle swarm optimization for product localization has been proposed and developed, followed by a hybrid localization method which combines data from RFID system and wireless sensor network. The application possibilities for the proposed model have been experimentally tested in simulated systems and in laboratory conditions with industrial elements.</p>

Simulations are a good method for the verification of the correct operation of solar-powered sensor nodes over the desired lifetime. They do, however, require accurate models to capture the influences of the loads and solar energy harvesting system. Artificial neural networks promise a simplification and acceleration of the modeling process in comparison to state-of-the-art modeling methods. This work focuses on the influence of the modeling process's different configurations on the accuracy of the model. It was found that certain parameters, such as the network's number of neurons and layers, heavily influence the outcome, and that these factors need to be determined individually for each modeled harvesting system. But having found a good configuration for the neural network, the model can predict the supercapacitor's charge depending on the solar current fairly accurately. This is also true in comparison to the reference models in this work. Nonetheless, the results also show a crucial need for improvements regarding the acquisition and composition of the neural network's training set.

Collecting data from sensor nodes to designated sinks is a common and challenging task in a wide variety of wireless sensor network (WSN) applications, ranging from animal monitoring to security surveillance. A number of approaches exploiting sink mobility have been proposed in recent years: some are proactive, in that sensor nodes push their read- ings to storage nodes from where they are collected by roaming mobile sinks, whereas others are reactive, in that mobile sinks pull readings from nearby sensor nodes as they traverse the sensor network. In this thesis, we point out that deciding which data collection approach is more energy-efficient depends on application characteristics, includ- ing the mobility patterns of sinks and the desired latency of collected data. We introduce novel adaptive data collection schemes that are able to automatically adjust to changing sink visiting patterns or data requirements, thereby significantly easing the deployment of a WSN. We illustrate cases where combining proactive and reactive modes of data collection is particularly beneficial. This motivates the design of TwinRoute, a novel hybrid algorithm that can flexibly mix the two col- lection modes at appropriate levels depending on the application sce- nario. Our extensive experimental evaluation, which uses synthetic and real-world sink traces, allows us to identify scenario characteristics that suit proactive, reactive or hybrid data collection schemes. It shows that TwinRoute outperforms the pure approaches in most scenarios, achiev- ing desirable tradeoffs between communication cost and timely delivery of sensor data.

This dissertation investigates data reduction strategies from a signal processing perspective in centralized detection and estimation applications. First, it considers a deterministic source observed by a network of sensors and develops an analytical strategy for ranking sensor transmissions based on the magnitude of their test statistics. The benefit of the proposed strategy is that the decision to transmit or not to transmit observations to the fusion center can be made at the sensor level resulting in significant savings in transmission costs. A sensor network based on target tracking application is simulated to demonstrate the benefits of the proposed strategy over the unconstrained energy approach. Second, it considers the detection of random signals in noisy measurements and evaluates the performance of eigenvalue-based signal detectors. Due to their computational simplicity, robustness and performance, these detectors have recently received a lot of attention. When the observed random signal is correlated, several researchers claim that the performance of eigenvalue-based detectors exceeds that of the classical energy detector. However, such claims fail to consider the fact that when the signal is correlated, the optimal detector is the estimator-correlator and not the energy detector. In this dissertation, through theoretical analyses and Monte Carlo simulations, eigenvalue-based detectors are shown to be suboptimal when compared to the energy detector and the estimator-correlator.

Les travaux de recherche de cette thèse s’inscrivent dans le cadre de la sécurité par chaos des réseaux locaux sans fil, en particulier les réseaux de capteurs sans fil. L’originalité de cette thèse consiste à proposer des cryptosystèmes à base de chaos plus adaptés aux réseaux de capteurs, en termes de consommation d’énergie, que les algorithmes conventionnels et à réaliser une implémentation sur une plateforme réelle. Nous présentons en premier lieu un état de l’art des réseaux, les menaces, les contraintes limitant le processus de sécurité des informations ainsi que les principales techniques de cryptographie. Nous donnons un aperçu sur la théorie de chaos et nous validons l’aspect aléatoire de plusieurs suites chaotiques par les tests statistiques du NIST. Nous proposons ensuite des nouvelles méthodes de construction de S-Box chaotiques tout en prouvant leur robustesse contre les attaques traditionnelles. Nous proposons enfin un nouvel algorithme de cryptage d’image dédié au réseau de capteurs sans fil. La validation de nos contributions est effectuée par simulation et par des mesures expérimentales sur une plateforme de réseaux de capteurs réels (SensLab). / The security of wireless sensor network is a growing field of research hampered by limited battery life time and computing constraints. The originality of this thesis is to provide Low Power chaotic cryptosystems for sensor networks more suitable than conventional algorithms and achieve an implementation on a real platform.. We present first a state of the art of wireless networks, threats and constraints of the security process as well as conventional cryptographic techniques. We give an overview of the chaos theory and we validate the randomness of several chaotic maps by the NIST statistical tests. Then, we propose new methods of chaotic S-Box construction, while demonstrating their robustness against traditional attacks. Finally, we propose a new image encryption algorithm dedicated to wireless sensor network. Validation of our contributions is performed by simulation and experimental measurements on a platform of real sensor networks (SensLab).

L’apparition récente de petits capteurs peu couteux fonctionnant sur batteries, capables de traiter les données acquises et de les transmettre par ondes radio ont le potentiel de révolutionner les applications de surveillance traditionnelles. Les réseaux sans fils composés de nœuds capteurs autonomes proches de la cible à surveiller permettent des tâches de surveillance précises allant du contrôle de la température dans des bâtiments jusqu`a la détection de feux de forêt. Récemment, de nouvelles applications de réseaux de capteurs sans fil telles que des applications multimédia ou dans le domaine de la santé ont émergé. Les réseaux sous-jacents déployés pour ces applications sont souvent compos´es de nœuds hétérogènes comportant différents capteurs et doivent fournir un niveau de service conforme aux exigences des différents types de trafic en s’adaptant à la charge variable. Cependant, concevoir des protocoles efficaces adaptés à ces applications tout en s’accommodant des ressources limitées des réseaux de capteurs est une tâche difficile. Dans cette thèse, nous nous focalisons sur le support de la qualité de service au niveau de la couche MAC, car cette couche conditionne et détermine largement les performances du réseau étant donné qu’elle est responsable de l’organisation de l’accès au canal. Dans un premier temps, nous étudions les contraintes spécifiques des applications ayant des exigences fortes ainsi que des applications hétérogènes et nous examinons les travaux proposés dans la littérature. Etant donné l’inadéquation des solutions existantes en présence d’un trafic important, nous proposons AMPH, un protocole MAC adaptatif avec qualité de service pour les réseaux de capteurs sans fil hétérogènes. Notre solution consiste en une méthode d’accès au canal hybride basée sur le multiplexage temporel, dans laquelle tous les nœuds peuvent accéder au canal à chaque division de temps en utilisant un nouveau mécanisme de compétition qui favorise le trafic prioritaire. Grâce à ces techniques, AMPH utilise efficacement le canal quelque soit la charge de trafic et assure une latence faible au trafic temps réel. Nous vérifions les performances d’AMPH à l’aide de simulations et d’un modèle mathématique. / The availability of small, low-cost, battery operated devices capable of sensing, performing simple processing and transmitting data via wireless communications have the potential to revolutionize traditional monitoring applications. Wireless networks composed of autonomous sensor nodes enable ubiquitous monitoring tasks from environmental control of office buildings to the detection of forest fires. Recently, new applications for wireless sensor networks such as healthcare and multimedia applications have emerged. These applications often have heterogeneous sensing capabilities and require that the network supports different types of QoS-constrained traffic at variable rates. However, designing efficient protocols that provide an appropriate level of performance to these applications while coping with the limited resources of sensor networks is a challenging task. In this thesis, we focus on QoS provisioning at the MAC layer. Since this layer is responsible for the organization of channel access, it determines to a large extent the overall performance of the network. We start by studying the specific requirements of demanding and heterogeneous applications, then we discuss related work of the literature. Given the inadequacy of existing solutions in the presence of important traffic loads, we propose AMPH, an adaptive MAC protocol with QoS support for heterogeneous wireless sensor networks. Our solution is a hybrid channelaccess method based on time division where all nodes may contend to access the channel at each time slot using a new contention mechanism which favors high priority traffic. Through these efficient techniques, AMPH achieves high channel utilization under variable traffic loads and provides low latency to real-time traffic. We verify the efficiency of AMPH through simulation experiments and a mathematical analysis.

Wireless sensor network (WSN) technology has gained significant importance due to its potential support for a wide range of applications. Most of the WSN applications consist of a large numbers of distributed nodes that work together to achieve common objects. Running a large number of nodes requires an efficient mechanism to bring them all together in order to form a multi-hop wireless network that can accomplish some specific tasks. Even with recent developments made in WSN technology, numbers of important challenges still stand as vulnerabilities for WSNs, including energy waste sources, synchronisation leaks, low network capacity and self-configuration difficulties. However, energy efficiency remains the priority challenging problem due to the scarce energy resources available in sensor nodes. These concerns are managed by medium access control (MAC) layer protocols. MAC protocols designed specifically for WSN have an additional responsibility of managing radio activity to conserve energy in addition to the traditional functions. This thesis presents advanced research work carried out in the context of saving energy whilst achieving the desired network performance. Firstly the thesis contributes by proposing Overlapped Schedules for MAC layer, in which the schedules of the neighbour clusters are overlapped by introducing a small shift time between them, aiming to compensate the synchronisation errors. Secondly, this thesis proposed a modified architecture derived from S-MAC protocol which significantly supports higher traffic levels whilst achieving better energy efficiency. This is achieved by applying a parallel transmission concept on the communicating nodes. As a result, the overall efficiency of the channel contention mechanism increases and leads to higher throughput with lower energy consumption. Finally, this thesis proposed the use of the Adaptive scheme on Border Nodes to increase the power efficiency of the system under light traffic load conditions. The scheme focuses on saving energy by forcing the network border nodes to go off when not needed. These three contributions minimise the contention window period whilst maximising the capacity of the available channel, which as a result increase network performance in terms of energy efficiency, throughput and latency. The proposed system is shown to be backwards compatible and able to satisfy both traditional and advanced applications. The new MAC protocol has been implemented and evaluated using NS-2 simulator, under different traffic loads and varying duty cycle values. Results have shown that the proposed solutions are able to significantly enhance the performance of WSNs by improving the energy efficiency, increasing the system throughput and reducing the communication delay.