Performance Control in Wireless Sensor Networks

Most of the currently deployed wireless sensor networks applications do not require performance control. The goal of the GINSENG project is sensor networks that meet application-specific performance targets, in particular with respect to latency and reliability. We present scenarios within the GALP oil re¿nery where the system will be deployed and some initial technical insights with respect to deterministic communication

Performance Evaluation of Routing Protocols in Wireless Sensor Networks

The growing field of information technology enhanced the capabilities of the wireless communication. The large usage of WSN in the various fields of the real world is scaling with the wide variety of roles for wireless sensor network performance is challenging tasks. The issues of performance in the wireless sensor networks in many literatures, yet more studies are being done on the performance because the user and application needs are keep increasing,to encounter the challenges of the performance issues are studied here by digging out the routing protocols performance in WSN. To conduct the study and analysis on performance of WSN protocols the there are various performance metrics used for the evaluation of performance in WSN. This study will be carried out to come up with the simulation experiments over the directed diffusion (DD) and LEACH routing protocols in terms of energy consumption, congestion and reliability in the wireless sensor networks (WSN) environment with the low power consumptions. The simulation experiments in this study are based on the reliability, delay and other constraints to compare the speed, reliability and electricity saving data communication in the wireless sensor networks (WSN). The discussion of the conducted simulation experiments describes the steps which are pertaining to the protocols and tradeoffs and complexity of the data traffic for the efficiency. The NS2 simulation is used for the simulation based experiments for performance of wireless sensor network (WSN) communications which is demonstrating the comparative effectiveness of the routing protocols in the recent concepts. The results of the simulation are lightening the ways for the minimization of the delay and enhancement in the reliability issues in wireless sensor networks (WSN)

Predictable Reliability In Inter-Vehicle Communications

Predictably reliable communication in wireless networked sensing and control systems (WSC) is a basic enabler for performance guarantee. Yet current research efforts are either focus on maximizing throughput or based on inaccurate interference modelling methods, which yield unsatisfactory results in terms of communication reliability. In this dissertation, we discuss techniques that enable reliable communication in both traditional wireless sensor networks and highly mobile inter-vehicle communication networks. We focus our discussion on traditional wireless sensor networks in Chapter 2 where we discuss mechanisms that enable predictable and reliable communications with no centralized infrastructures. With the promising results in Chapter 2, we extend our methods to inter-vehicle communication networks in Chapter 3. We focus on the broadcast communication paradigm and the unique challenges in applying the PRK interference model into broadcast problems in highly mobile inter-vehicle communication networks. While Chapter 2 and Chapter 3 focus on average reliability, we switch our problem to a more challenging aspect: guaranteeing short-term per-packet reception probability in Chapter 4. Specifically, we describe the PRKS protocol in Chapter 2 which considers unicast transmission paradigm in traditional static wireless sensor networks. PRKS uses the PRK interference model as a basis for interference relation identification that captures characteristics of wireless communications. For communication reliability control, we design a controller that runs at each link receiver and is able to control the average link reliability to be no lower than an application requirement as well as minimizing reliability variation. We further evaluate PRKS with extensive ns-3 simulations. The CPS protocol described in Chapter 3 considers an one-hop broadcast problem in multi-hop inter-vehicle communication networks. We analyze the challenges of applying the PRK model in this particular setting and propose an approximated PRK model, i.e., gPRK model, that addresses the challenges. We further design principles that CPS uses to instantiate the gPRK model in inter-vehicle communications. We implement the CPS scheduling framework in an integrated platform with SUMO and ns-3 to evaluate our design. In Chapter 4, we conservatively estimate the background interference plus noise while nodes are receiving packets. In the meantime, receivers decide minimum power levels their sender should use and feedback their decisions to their senders. Senders fuse feedbacks and choose a power level that guarantees expected packet reception probability at each receivers’ side. We notice in our evaluation that guaranteeing short-term reliability causes extra concurrency loss

Predictable Reliability In Inter-Vehicle Communications

Predictably reliable communication in wireless networked sensing and control systems (WSC) is a basic enabler for performance guarantee. Yet current research efforts are either focus on maximizing throughput or based on inaccurate interference modelling methods, which yield unsatisfactory results in terms of communication reliability. In this dissertation, we discuss techniques that enable reliable communication in both traditional wireless sensor networks and highly mobile inter-vehicle communication networks. We focus our discussion on traditional wireless sensor networks in Chapter 2 where we discuss mechanisms that enable predictable and reliable communications with no centralized infrastructures. With the promising results in Chapter 2, we extend our methods to inter-vehicle communication networks in Chapter 3. We focus on the broadcast communication paradigm and the unique challenges in applying the PRK interference model into broadcast problems in highly mobile inter-vehicle communication networks. While Chapter 2 and Chapter 3 focus on average reliability, we switch our problem to a more challenging aspect: guaranteeing short-term per-packet reception probability in Chapter 4. Specifically, we describe the PRKS protocol in Chapter 2 which considers unicast transmission paradigm in traditional static wireless sensor networks. PRKS uses the PRK interference model as a basis for interference relation identification that captures characteristics of wireless communications. For communication reliability control, we design a controller that runs at each link receiver and is able to control the average link reliability to be no lower than an application requirement as well as minimizing reliability variation. We further evaluate PRKS with extensive ns-3 simulations. The CPS protocol described in Chapter 3 considers an one-hop broadcast problem in multi-hop inter-vehicle communication networks. We analyze the challenges of applying the PRK model in this particular setting and propose an approximated PRK model, i.e., gPRK model, that addresses the challenges. We further design principles that CPS uses to instantiate the gPRK model in inter-vehicle communications. We implement the CPS scheduling framework in an integrated platform with SUMO and ns-3 to evaluate our design. In Chapter 4, we conservatively estimate the background interference plus noise while nodes are receiving packets. In the meantime, receivers decide minimum power levels their sender should use and feedback their decisions to their senders. Senders fuse feedbacks and choose a power level that guarantees expected packet reception probability at each receivers’ side. We notice in our evaluation that guaranteeing short-term reliability causes extra concurrency loss

Analyzing Energy-efficiency and Route-selection of Multi-level Hierarchal Routing Protocols in WSNs

The advent and development in the field of Wireless Sensor Networks (WSNs) in recent years has seen the growth of extremely small and low-cost sensors that possess sensing, signal processing and wireless communication capabilities. These sensors can be expended at a much lower cost and are capable of detecting conditions such as temperature, sound, security or any other system. A good protocol design should be able to scale well both in energy heterogeneous and homogeneous environment, meet the demands of different application scenarios and guarantee reliability. On this basis, we have compared six different protocols of different scenarios which are presenting their own schemes of energy minimizing, clustering and route selection in order to have more effective communication. This research is motivated to have an insight that which of the under consideration protocols suit well in which application and can be a guide-line for the design of a more robust and efficient protocol. MATLAB simulations are performed to analyze and compare the performance of LEACH, multi-level hierarchal LEACH and multihop LEACH.Comment: NGWMN with 7th IEEE Inter- national Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA 2012), Victoria, Canada, 201

Analysis of Qos Aware Cloud Based Routing for Improved Security

The recent advances and the convergence of micro electro-mechanical systems technology, integrated circuit technologies, microprocessor hardware and Nano-technology, wireless communications, Ad-hoc networking routing protocols, distributed signal processing, and embedded systems have made the concept of Wireless Sensor Networks (WSNs). Sensor network nodes are limited with respect to energy supply, restricted computational capacity and communication bandwidth. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. Even though sensor networks are primarily designed for monitoring and reporting events, since they are application dependent, a single routing protocol cannot be efficient for sensor networks across all applications. In this paper, we analyze the design issues of sensor networks and present a classification and comparison of routing protocols. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. A reliable transmission of packet data information, with low latency and high energy-efficiency, is truly essential for wireless sensor networks, employed in delay sensitive industrial control applications. The proper selection of the routing protocol to achieve maximum efficiency is a challenging task, since latency, reliability and energy consumption are inter-related with each other. It is observed that, Quality of Service (QoS) of the network can improve by minimizing delay in packet delivery, and life time of the network, can be extend by using suitable energy efficient routing protocol

Reliable routing protocols for dynamic wireless ad hoc and sensor networks

The vision of ubiquitous computing requires the development of devices and technologies, which can be pervasive without being intrusive. The basic components of such a smart environment will be small nodes with sensing and wireless communications capabilities, able to organize flexibly into a network for data collection and delivery. The constant improvements in digital circuit technology, has made the deployment of such small, inexpensive, low-power, distributed devices, which are capable of information gathering, processing, and communication in miniature packaging, a reality.\ud Realizing such a network presents very significant challenges, especially at the protocol and software level. Major steps forward are required in the field of communications protocol, data processing, and application support. Although sensor nodes will be equipped with a power supply (battery) and embedded processor that makes them autonomous and self-aware, their functionality and capabilities will be very limited. The resource limitations of Wireless Sensor Networks (WSN), especially in terms of energy, require novel and collaborative approach for the wireless communication. Therefore, collaboration between nodes is essential to deliver smart services in a ubiquitous setting. Current research in this area generally assumes a rather static network, leading to a strong performance degradation in a dynamic environment. In this thesis we investigate new algorithms for routing in dynamic wireless environment and evaluate their feasibility through experimentation. These algorithms will be key for building self-organizing and collaborative sensor networks\ud that show emergent behavior and can operate in a challenging environment where\ud nodes move, fail and energy is a scarce resource.\ud We develop the technology needed for building self-organizing and collabora-\ud tive sensor networks using reconfigurable smart sensor nodes, which are self-aware,self-reconfigurable and autonomous. This technology will enable the creation of a new generation of sensors, which can effectively network together so as to provide a flexible platform for the support of a large variety of mobile sensor network applications. In this thesis, we address the dynamics of sink nodes, sensor nodes and event in the routing of wireless sensor networks, while maintaining high reliability and low energy consumption. The hypothesis is that this requires different routing protocols and approaches. The varying application scenarios of wireless sensor\ud networks require different routing protocols and approaches as well.\ud This thesis has three major contributions to the routing in dynamic wireless\ud sensor networks. Firstly, a combination between a new multipath on-Demand Rout-\ud ing protocol and a data-splitting scheme which results in an e±cient solution for high reliability and low traffic. Secondly, a cross-layered approach with a self-organizing medium access control protocol and a tightly integrated source routing protocol is designed for high mobility sensor networks. Finally, a data-centric approach based on cost estimation is designed to disseminate aggregated data from data source to destination with high efficiency

Efficiency metrics computing in combined sensor networks

This paper discusses the computer-aided design of combined networks for offices and building automation systems based on diverse wired and wireless standards. The design requirements for these networks are often contradictive and have to consider performance, energy and cost efficiency together. For usual office communication, quality of service is more important. In the wireless sensor networks, the energy efficiency is a critical requirement to ensure their long life, to reduce maintenance costs and to increase reliability. The network optimization problem has been solved under considering of overall-costs as objective and quality of service including throughput, delay, packet losses etc. with energy efficiency as required constraints. This can be achieved by a combination of different planning methods like placement of wired and wireless nodes, tracing of cabling systems, energy-efficient sensor management and event-based sampling. A successful application of these methods requires a combined harmonized design at different levels of the networks. This paper aims to demonstrate how these methods are realized in the network planning. These tools provide optimized wired and wireless topologies under considering of costs, distances, transmitted power, frequencies, propagation environments and obstacles given in computer-aided design compatible formats

Cooperative Detection and Network Coding in Wireless Networks

In cooperative communication systems, multiple terminals in wireless networks share their antennas and resources for information exchange and processing. Recently, cooperative communications have been shown to achieve significant performance improvements in terms of transmission reliability, coverage area extension, and network throughput, with respect to existing classical communication systems. This dissertation is focused on two important applications of cooperative communications, namely: (i) cooperative distributed detection in wireless sensor networks, and (ii) many-to-many communications via cooperative space-time network coding. The first application of cooperative communications presented in this dissertation is concerned with the analysis and modeling of the deployment of cooperative relay nodes in wireless sensor networks. Particularly, in dense wireless sensor networks, sensor nodes continuously observe and collect measurements of a physical phenomenon. Such observations can be highly correlated, depending on the spatial separation between the sensor nodes as well as how the physical properties of the phenomenon are evolving over time. This unique characteristic of wireless sensor networks can be effectively exploited with cooperative communications and relays deployment such that the distributed detection performance is significantly improved as well as the energy efficiency. In particular, this dissertation studies the Amplify-and-Forward (AF) relays deployment as a function of the correlation of the observations and analyzes the achievable spatial diversity gains as compared with the classical wireless sensor networks. Moreover, it is demonstrated that the gains of cooperation can be further leveraged to alleviate bandwidth utilization inefficiencies in current sensor networks. Specifically, the deployment of cognitive AF cooperative relays to exploit empty/under-utilized time-slots and the resulting energy savings are studied, quantified and compared. The multiple terminal communication and information exchange form the second application of cooperative communications in this dissertation. Specifically, the novel concept of Space-Time-Network Coding (STNC) that is concerned with formulation of the many-to-many cooperative communications over Decode-and-Forward (DF) nodes is studied and analyzed. Moreover, the exact theoretical analysis as well as upper-bounds on the network symbol error rate performance are derived. In addition, the tradeoff between the number of communicating nodes and the timing synchronization errors is analyzed and provided as a network design guideline. With STNC, it is illustrated that cooperative diversity gains are fully exploited per node and significant performance improvements are achieved. It is concluded that the STNC scheme serves as a potential many-to-many cooperative communications scheme and that its scope goes much further beyond the generic source-relay-destination communications