A survey on quality of service support in wireless sensor and actor networks: Requirements and challenges in the context of critical infrastructure protection

The emergence of low-cost and mature technologies in wireless communication, visual sensor devices, and digital signal processing facilitate of wireless multimedia sensor networks (WMSN). Like sensor networks which respond to sensory information such as temperature and humidity, WMSN interconnects autonomous devices for capturing and processing video and audio sensory information. This survey highlights the following topics (1) a summary of applications and challenges of WMSN; (2) an overview of advanced coding techniques for WMSN, including video and audio source coding, and distributed coding techniques; (3) a survey of WMSN communication protocols, including routing techniques and physical layer standards; and (4) a summary of Quality-of-Service (QoS) and security aspects of WMSN.

Wireless Multimedia Sensor Networks

The evaluation of existing and future distributed sensor processing system concepts can be done well using simulation, provided that the simulation is faithful in representing both the medium in which the sensors interface with the phenomena that they measure or detect and the medium in which the sensors interface with each other to achieve a distributed mode of operation. Performance criteria for distributed sensor processing over ad hoc wireless networks are stated and an architecture for analysis and simulation of this kind of system is described.

Distributed Sensor Processing Over an Ad Hoc Wireless Network: Simulation Framework and Performance Criteria

In wireless sensor networks (WSN) data transmission is usually performed by sensors in manner of multi-hop forwarding towards a central static control center (sink). A lot of cheap, low-powered and energy-limited sensors are deployed in the monitored area and some of these nodes closer to the sink node use up their energy more quickly than other nodes because they relay more packets. Although most of the sensor nodes have enough energy left to work, the energy consumption imbalance leads to connectivity holes and coverage holes, and finally the whole network failure. The main contributions of this paper include: (a) a new scheme based on multiple sink nodes is proposed to prolong the network lifetime and to reduce the response time. It is effective, especially in the target tracking applications, (b) the deployment strategy with given number of multiple sink nodes is explored in the grid sensor network, (c) Gene Expression Programming based Multiple Sink Nodes deployment algorithm (GEP-MSN) is proposed to optimally deploy multiple sink nodes over the monitored region, (d) a data transmission cost model (TCM) is introduced to measure the cost for optimizing during the transmission phase, (e) extensive simulations are conducted to show that the scheme can greatly extend the network lifetime by around 16.6% and 36.3% on average compared with two naive methods based on random distributed sink nodes.

Optimal Multiple Sink Nodes Deployment in Wireless Sensor Networks Based on Gene Expression Programming

Linear Programming: Methods and Applications.

In this paper we present and discuss several models for wireless sensor networks (\wsn s) where the focus is on selecting paths to relay data from sensors to the base station. We are concerned with high level protocols that assume complete knowledge of the local network topology at any node and rely on basic routines to address and forward packets from node to node. More precisely, for every sensor node that needs to send data to the base station, we want to select one or more routes involving perhaps several intermediate nodes along which data are sent. The route(s) are chosen to satisfy quality of service (QoS) requirements expressed by the maximum delay incurred by data from the moment they are captured by sensors to the moment they reach the base station.

QoS for data relaying in hierarchical wireless sensor networks

http://www.queenstrl.ca/uploads/4/6/3/1/4631596/qos_and_data_relaying_for_wireless_sensor_networks.pdf

QoS and data relaying for wireless sensor networks

Energy is often considered the primary resource constraint in a wireless sensor network. Compared to sensing and data processing, the cost of communication is among the highest in energy consumption. In this paper, we study the effects of relaying data in a wireless sensor network according to two different strategies. The first strategy allows traffic splitting, in which data can be sent on multiple paths from the source to the destination. The second strategy disallows traffic splitting, in which data must be sent on a single path from the source to the destination. We present algorithms based on linear and integer programming for finding an optimal allocation of splittable and unsplittable traffic in a wireless sensor network that minimizes total energy consumption. The technique provides optimal solutions, and can be used by designers of communication protocols to assess the energy efficiency of a data relaying scheme for a given network configuration. We also perform an empirical analysis to quantify the comparative performance gains and losses of a splittable and unsplittable traffic allocation strategy for wireless sensor networks. Results show that although the energy savings of a splittable traffic allocation strategy is relatively small when compared to the unsplittable case (on average, ranging from 0% to 1.82%), an allocation of splittable traffic can tolerate up to an additional 14.1% increase in network traffic load until any further load increase returns no feasible solutions.

A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks

Many mission-critical applications of wireless sensor networks generate traffic that have a stringent delay requirement. In this paper, we study the effects of relaying delay- constrained traffic in a wireless sensor network according to two different strategies. The first strategy allows traffic splitting, in which data flow can be split and sent on multiple paths from the source to the destination. The second strategy disallows traffic splitting, in which data flow cannot be split and must be sent on a single path from the source to the destination. We present a model based on linear and integer linear programming for finding an optimal allocation of splittable and unsplittable traffic in a wireless sensor network, in which traffic is subject to soft delay constraints. The objective is to minimize the total energy consumption spent on communication and the penalty incurred from the violation of delay constraints. Based on this model, we perform an empirical analysis to quantify the performance gains and losses of a splittable and unsplittable traffic allocation strategy for wireless sensor networks with delay-constrained traffic. The experiment results show that splitting traffic does not provide a significant advantage in energy consumption, but can afford strategies for relaying data with a lower delay penalty.

WSN10-6: An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic

In this paper, the concern is with the management of data traffic after node deployment. To address some of the shortcomings of both single and multihop communication, this paper work with a hybrid model. The WSNet architecture is comprised of three classes of sensor nodes, sensors, relay nodes, and relay gateways. Sensors - gather and send data values to one relay nodes. Relay nodes - receive data values from sensors and/or other relay nodes and forward them to relay nodes or relay gateways. Relay gateways - receive data values from RN and send them directly (in one hop) to the base station, possibly using a dedicated channel. Our goal is to select paths along which data packets can be relayed until they reach one or more relay gateways while satisfying several constraints. These decisions take place at the application level, are computed by a central algorithm running at the base station, and rely on routing protocols to deliver the messages. A fixed topology of directly communicating nodes were assumed and a long term data communication plan based on knowing the amount of data generated by sensor nodes. The optimality of the solution obtained was guaranteed

Sylvia Tai

Papers

QoS for data relaying in hierarchical wireless sensor networks

QoS and data relaying for wireless sensor networks

A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks

WSN10-6: An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic

Data relaying with optimal resource management in wireless sensor networks