Geographic Gossip: Efficient Averaging for Sensor Networks

Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\sqrt{n}$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $\epsilon$ using $O(\frac{n^{1.5}}{\sqrt{\log n}} \log \epsilon^{-1})$ radio transmissions, which yields a $\sqrt{\frac{n}{\log n}}$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.Comment: To appear, IEEE Transactions on Signal Processin

Coordinated control of mixed robot and sensor networks in distributed area exploration

Recent advancements in wireless communication and electronics has enabled the development of multifunctional sensor nodes that are small in size and communicate untethered in short distances. In the last decade, significant advantages have been made in the field of robotics, and robots have become more feasible in systems design. Therefore, we trust that a number of open problems with wireless sensor networks can be solved or diminished by including mobility capabilities in agents

Enabling Cyber Physical Systems with Wireless Sensor Networking Technologies

[[abstract]]Over the last few years, we have witnessed a growing interest in Cyber Physical Systems (CPSs) that rely on a strong synergy between computational and physical components. CPSs are expected to have a tremendous impact on many critical sectors (such as energy, manufacturing, healthcare, transportation, aerospace, etc) of the economy. CPSs have the ability to transform the way human-to-human, human-toobject, and object-to-object interactions take place in the physical and virtual worlds. The increasing pervasiveness of Wireless Sensor Networking (WSN) technologies in many applications make them an important component of emerging CPS designs. We present some of the most important design requirements of CPS architectures. We discuss key sensor network characteristics that can be leveraged in CPS designs. In addition, we also review a few well-known CPS application domains that depend on WSNs in their design architectures and implementations. Finally, we present some of the challenges that still need to be addressed to enable seamless integration of WSN with CPS designs.[[incitationindex]]SCI[[booktype]]紙

Multi-Level Multi-Objective Programming and Optimization for Integrated Air Defense System Disruption

The U.S. military\u27s ability to project military force is being challenged. This research develops and demonstrates the application of three respective sensor location, relocation, and network intrusion models to provide the mathematical basis for the strategic engagement of emerging technologically advanced, highly-mobile, Integrated Air Defense Systems. First, we propose a bilevel mathematical programming model for locating a heterogeneous set of sensors to maximize the minimum exposure of an intruder\u27s penetration path through a defended region. Next, we formulate a multi-objective, bilevel optimization model to relocate surviving sensors to maximize an intruder\u27s minimal expected exposure to traverse a defended border region, minimize the maximum sensor relocation time, and minimize the total number of sensors requiring relocation. Lastly, we present a trilevel, attacker-defender-attacker formulation for the heterogeneous sensor network intrusion problem to optimally incapacitate a subset of the defender\u27s sensors and degrade a subset of the defender\u27s network to ultimately determine the attacker\u27s optimal penetration path through a defended network

Development of a GIS-based method for sensor network deployment and coverage optimization

Au cours des dernières années, les réseaux de capteurs ont été de plus en plus utilisés dans différents contextes d’application allant de la surveillance de l’environnement au suivi des objets en mouvement, au développement des villes intelligentes et aux systèmes de transport intelligent, etc. Un réseau de capteurs est généralement constitué de nombreux dispositifs sans fil déployés dans une région d'intérêt. Une question fondamentale dans un réseau de capteurs est l'optimisation de sa couverture spatiale. La complexité de l'environnement de détection avec la présence de divers obstacles empêche la couverture optimale de plusieurs zones. Par conséquent, la position du capteur affecte la façon dont une région est couverte ainsi que le coût de construction du réseau. Pour un déploiement efficace d'un réseau de capteurs, plusieurs algorithmes d'optimisation ont été développés et appliqués au cours des dernières années. La plupart de ces algorithmes reposent souvent sur des modèles de capteurs et de réseaux simplifiés. En outre, ils ne considèrent pas certaines informations spatiales de l'environnement comme les modèles numériques de terrain, les infrastructures construites humaines et la présence de divers obstacles dans le processus d'optimisation. L'objectif global de cette thèse est d'améliorer les processus de déploiement des capteurs en intégrant des informations et des connaissances géospatiales dans les algorithmes d'optimisation. Pour ce faire, trois objectifs spécifiques sont définis. Tout d'abord, un cadre conceptuel est développé pour l'intégration de l'information contextuelle dans les processus de déploiement des réseaux de capteurs. Ensuite, sur la base du cadre proposé, un algorithme d'optimisation sensible au contexte local est développé. L'approche élargie est un algorithme local générique pour le déploiement du capteur qui a la capacité de prendre en considération de l'information spatiale, temporelle et thématique dans différents contextes d'applications. Ensuite, l'analyse de l'évaluation de la précision et de la propagation d'erreurs est effectuée afin de déterminer l'impact de l'exactitude des informations contextuelles sur la méthode d'optimisation du réseau de capteurs proposée. Dans cette thèse, l'information contextuelle a été intégrée aux méthodes d'optimisation locales pour le déploiement de réseaux de capteurs. L'algorithme développé est basé sur le diagramme de Voronoï pour la modélisation et la représentation de la structure géométrique des réseaux de capteurs. Dans l'approche proposée, les capteurs change leur emplacement en fonction des informations contextuelles locales (l'environnement physique, les informations de réseau et les caractéristiques des capteurs) visant à améliorer la couverture du réseau. La méthode proposée est implémentée dans MATLAB et est testée avec plusieurs jeux de données obtenus à partir des bases de données spatiales de la ville de Québec. Les résultats obtenus à partir de différentes études de cas montrent l'efficacité de notre approche.In recent years, sensor networks have been increasingly used for different applications ranging from environmental monitoring, tracking of moving objects, development of smart cities and smart transportation system, etc. A sensor network usually consists of numerous wireless devices deployed in a region of interest. A fundamental issue in a sensor network is the optimization of its spatial coverage. The complexity of the sensing environment with the presence of diverse obstacles results in several uncovered areas. Consequently, sensor placement affects how well a region is covered by sensors as well as the cost for constructing the network. For efficient deployment of a sensor network, several optimization algorithms are developed and applied in recent years. Most of these algorithms often rely on oversimplified sensor and network models. In addition, they do not consider spatial environmental information such as terrain models, human built infrastructures, and the presence of diverse obstacles in the optimization process. The global objective of this thesis is to improve sensor deployment processes by integrating geospatial information and knowledge in optimization algorithms. To achieve this objective three specific objectives are defined. First, a conceptual framework is developed for the integration of contextual information in sensor network deployment processes. Then, a local context-aware optimization algorithm is developed based on the proposed framework. The extended approach is a generic local algorithm for sensor deployment, which accepts spatial, temporal, and thematic contextual information in different situations. Next, an accuracy assessment and error propagation analysis is conducted to determine the impact of the accuracy of contextual information on the proposed sensor network optimization method. In this thesis, the contextual information has been integrated in to the local optimization methods for sensor network deployment. The extended algorithm is developed based on point Voronoi diagram in order to represent geometrical structure of sensor networks. In the proposed approach sensors change their location based on local contextual information (physical environment, network information and sensor characteristics) aiming to enhance the network coverage. The proposed method is implemented in MATLAB and tested with several data sets obtained from Quebec City spatial database. Obtained results from different case studies show the effectiveness of our approach

Mobile Network Data Analytics for Intelligent Transportation Systems

In this dissertation, we explore how the interplay between transportation and mobile networks manifests itself in mobile network billing and signaling data, and we show how to use this data to estimate different transportation supply and demand models. To perform the necessary simulation studies for this dissertation, we present a simula- tion scenario of Luxembourg, which allows the simulation of vehicular Long-Term Evolu- tion (LTE) connectivity with realistic mobility. We first focus on modeling travel time from Cell Dwell Time (CDT), and show – on a synthetic data set– that we can achieve a prediction Mean Absolute Percentage Error (MAPE) below 12%. We also encounter proportionality between the square of the mean CDT and the number of handovers in the system, which we confirmed in the aforementioned simulation scenario. This motivated our later studies of traffic state models generated from mobile network data. We also consider mobile network data for supporting synthetic population generation and demand estimation. In a study on Call Detail Records (CDR) data from Senegal, we estimate CDT distributions to allow generating the duration of user activities, and validate them at a large scale against a data set from China. In a different study, we show how mobile network signaling data can be used for initializing the seed Origin- Destination (O-D) matrix in demand estimation schemes, and show that it increases the rate of convergence. Finally, we address the traffic state estimation problem, by showing how handovers can be used as a proxy metric for flows in the underlying urban road network. Using a traffic flow theory model, we show that clusters of mobile network cells behave characteristically, and with this model we reach a MAPE of 11.1% with respect to floating-car data as ground truth. The presented model can be used in regions without traffic counting infrastructure, or complement existing traffic state estimation systems

New Coding/Decoding Techniques for Wireless Communication Systems

Wireless communication encompasses cellular telephony systems (mobile communication), wireless sensor networks, satellite communication systems and many other applications. Studies relevant to wireless communication deal with maintaining reliable and efficient exchange of information between the transmitter and receiver over a wireless channel. The most practical approach to facilitate reliable communication is using channel coding. In this dissertation we propose novel coding and decoding approaches for practical wireless systems. These approaches include variable-rate convolutional encoder, modified turbo decoder for local content in Single-Frequency Networks, and blind encoder parameter estimation for turbo codes. On the other hand, energy efficiency is major performance issue in wireless sensor networks. In this dissertation, we propose a novel hexagonal-tessellation based clustering and cluster-head selection scheme to maximize the lifetime of a wireless sensor network. For each proposed approach, the system performance evaluation is also provided. In this dissertation the reliability performance is expressed in terms of bit-error-rate (BER), and the energy efficiency is expressed in terms of network lifetime

Assurance, Provision, Management and Enhancement of QoS in 5G Communication Networks

Enhancement of QoS in PS network as 5G communication network is non trivial endeavour which faces a host of new challenges beyond 3G and 4G communication networks. The number of nodes, the homogeneity of the access technologies, the conflicting network management objectives, resource usage minimization, and the division between limited physical resources and elastic virtual resources is driving a complete change in the vision and methodologies for efficient management of the available network resources. QoS is the measure of the reliability and performance of the networks’ nodes and links, particularly as perceivedbytheendusersoftheservicesandapplicationthataretransportedviaPSnetwork. Furthermore, QoS is a composite metric as it based on a number of multiple factors, which indicate the E2E characteristics and performance of the network condition, applications and services. Hence, reductions or improvements in the QoS level can brought about through a number of combined factors. This thesis tries to introduce a vision of Quality of Service (QoS) enhancement and management based on the 5th generation network requirements and solutions by: Firstly: Proposing a traffic flow management policy, which allocates and organises Machine Type Communication (MTC) traffic flow’s network resources sharing within Evolved Packet System (EPS), with an access element as a Wireless Sensor Network (WSN) gateway for providing an overlaying access channel between the Machine Type Devices (MTDs) and EPS. This proposal addresses the effect and interaction in the heterogeneity of applications, services and terminal devices and the related QoS issues among them. The introduced work inthisproposalovercomestheproblemsofnetworkresourcestarvationbypreventingdeterioration of network performance. The scheme is validated through simulation, which indicates the proposed traffic flow management policy outperforms the current traffic management policy. Specifically, simulation results show that the proposed model achieves an enhancement in QoS performance for the MTC traffic flows, including a decrease of 99.45% in Packet Loss Rate (PLR), a decrease of 99.89% in packet End to End (E2E) delay, a decrease of 99.21% in Packet Delay Variation (PDV). Furthermore, it retains the perceived Quality of Experience (QoE) of the real time application users within high satisfaction levels, such as the Voice over Long Term Evolution (VoLTE) service possessing a Mean Opinion Score (MOS)of4.349andenhancingtheQoSofavideoconferenceservicewithinthestandardised values of a 3GPP body, with a decrease of 85.28% in PLR, a decrease of 85% in packet E2E delay and a decrease of 88.5% in PDV. Secondly: Proposing an approach for allocating existing 4G installed network radio access nodes to multiple Base Band Unit (BBU) pools, which is proposed to deploy 5G Cloud-Radio Access Network (C-RAN) and improve the offered Network QoS (NQoS). The proposed approach involves performing radio access nodes clustering based on the Particle Swarm Optimization (PSO) algorithm, model selection Bayesian Information Criterion (BIC), Measure of spread technique and Voronoi tessellation. The proposed scheme is used to consider a Dynamic C-RAN (DC-RAN) operation, that adaptively adjusts the main Radio Remote Head (RRH) coverage range according to the traffic load requirement as well as considering energy saving. The numerical results of the approach show that the optimized partition of the proposed network model is 41 BBU pools, with an average density of RRHs per pool area, which matches the primary average density of the radio access nodes per network area. Thirdly: Developing mathematical framework that investigates the Power Consumption (PC) profile for the interaction of Internet of Thing (IoT) Application QoS (AQoS) with NQoS in wireless Software Defined Network (SDN) as SDN for WIreless SEnsor network (SDN-WISE). This profile model offers flexibility for managing the structure of the Machine to Machine (M2M) system in IoT. It enables controlling the provided NQoS, precisely the achieved PHY layer transmission link throughput, combined with the AQoS, represented by IoT data stream payload size. The investigation is composed of two essential SDN traffic parts, they are control plane signalling and data plane traffic PCs and their relevance with QoS. The results show that 98% PC in data plane companion with a control plane PC of 2% in overall of the proposed system power, these figures were achieved with control plane signalling Transmission Time Interval (TTI) of 5 sec and a maximum data plane payload size of 92 Bytes as a worst case scenario.Ministry of Higher Education and Scientific Research (MOHESR), Cultural Attache and University of Wasit in Ira