Real-Time Communications in Wireless Sensor Networks

2012 ◽  
pp. 120-129
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

Real-Time Communications in Wireless Sensor Networks

2010 ◽  
pp. 69-78
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Communication Protocols ◽  
The State ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Trends ◽  
Wireless Links

This chapter presents the state-of-the-art of real-time communication in the challenging topic of Wireless Sensor Networks (WSNs). In real-time communication, the duration between the event which initiates the sending of a message, and the instant this message is received must be smaller than a known delay. Because topologies are extremely dynamic and not known priori, this type of constraint is very hard to meet in WSNs. In this chapter, the different communication protocols proposed in the literatures, together with their respective advantages and drawbacks, are discussed. We focus on MAC and routing because they are key layers in real-time communication. As most existing protocols are not suitable under realistic constraints where sensor nodes and wireless links are unreliable, we give, at the end of this chapter, some insights about future trends in designing real-time protocols. We hope to give the reader an overview of recent research works in this complex topic which we consider to be essential in critical applications.

Adaptive Monitor Placement for Near Real-time Node Failure Localisation in Wireless Sensor Networks

2022 ◽  
Vol 18 (1) ◽  
pp. 1-41
Author(s):  
Pamela Bezerra ◽  
Po-Yu Chen ◽  
Julie A. McCann ◽  
Weiren Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Global Analysis ◽  
Wireless Sensor ◽  
Greedy Heuristics ◽  
Network Tomography ◽  
Topology Changes ◽  
End To End

As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent approach, has been successful in localising complex failures (i.e., observable by end-to-end global analysis) in traditional networks. Applying network tomography to wireless sensor networks (WSNs), however, is challenging. First, WSN topology changes due to environmental interactions (e.g., interference). Additionally, the selection of devices for running network monitoring processes (monitors) is an NP-hard problem. Monitors observe end-to-end in-network properties to identify failures, with their placement impacting the number of identifiable failures. Since monitoring consumes more in-node resources, it is essential to minimise their number while maintaining network tomography’s effectiveness. Unfortunately, state-of-the-art solutions solve this optimisation problem using time-consuming greedy heuristics. In this article, we propose two solutions for efficiently applying Network Tomography in WSNs: a graph compression scheme, enabling faster monitor placement by reducing the number of edges in the network, and an adaptive monitor placement algorithm for recovering the monitor placement given topology changes. The experiments show that our solution is at least 1,000× faster than the state-of-the-art approaches and efficiently copes with topology variations in large-scale WSNs.

Privacy and Trust Management Schemes of Wireless Sensor Networks

2010 ◽  
pp. 290-309 ◽  
Author(s):  
Riaz Ahmed Shaikh ◽  
Brian J. dAuriol ◽  
Heejo Lee ◽  
Sungyoung Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Trust Management ◽  
State Of The Art ◽  
The State ◽  
Wireless Sensor ◽  
Security Issues ◽  
Management Schemes ◽  
Art Research

Until recently, researchers have focused on the cryptographic-based security issues more intensively than the privacy and trust issues. However, without the incorporation of trust and privacy features, cryptographic-based security mechanisms are not capable of singlehandedly providing robustness, reliability and completeness in a security solution. In this chapter, we present generic and flexible taxonomies of privacy and trust. We also give detailed critical analyses of the state-of-the-art research, in the field of privacy and trust that is currently not available in the literature. This chapter also highlights the challenging issues and problems.

scholarly journals A Combined Localization Algorithm for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaogang Qi ◽  
Xiaoke Liu ◽  
Lifang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Vehicle Tracking ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Environment And Health ◽  
Anchor Nodes ◽  
Positioning Algorithm

Wireless sensor networks (WSNs) are widely used in various fields to monitor and track various targets by gathering information, such as vehicle tracking and environment and health monitoring. The information gathered by the sensor nodes becomes meaningful only if it is known where it was collected from. Considering that multilateral algorithm and MDS algorithm can locate the position of each node, we proposed a localization algorithm combining the merits of these two approaches, which is called MA-MDS, to reduce the accumulation of errors in the process of multilateral positioning algorithm and improve the nodes’ positioning accuracy in WSNs. It works in more robust fashion for noise sparse networks, even with less number of anchor nodes. In the MDS positioning phase of this algorithm, the Prussian Analysis algorithm is used to obtain more accurate coordinate transformation. Through extensive simulations and the repeatable experiments under diverse representative networks, it can be confirmed that the proposed algorithm is more accurate and more efficient than the state-of-the-art algorithms.

Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards

2007 ◽  
Vol 30 (7) ◽  
pp. 1655-1695 ◽  
Author(s):  
Paolo Baronti ◽  
Prashant Pillai ◽  
Vince W.C. Chook ◽  
Stefano Chessa ◽  
Alberto Gotta ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
State Of The Art ◽  
The State ◽  
Wireless Sensor

scholarly journals Deployment of Wireless Sensor Networks for Oilfield Monitoring by Multiobjective Discrete Binary Particle Swarm Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Zhen-Lun Yang ◽  
Angus Wu ◽  
Hua-Qing Min
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Real Time ◽  
Monitoring System ◽  
Particle Swarm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization

The deployment problem of wireless sensor networks for real time oilfield monitoring is studied. As a characteristic of oilfield monitoring system, all sensor nodes have to be installed on designated spots. For the energy efficiency, some relay nodes and sink nodes are deployed as a delivery subsystem. The major concern of the construction of the monitoring system is the optimum placement of data delivery subsystem to ensure the full connectivity of the sensor nodes while keeping the construction cost as low as possible, with least construction and maintenance complexity. Due to the complicated landform of oilfields, in general, it is rather difficult to satisfy these requirements simultaneously. The deployment problem is formulated as a constrained multiobjective optimization problem and solved through a novel scheme based on multiobjective discrete binary particle swarm optimization to produce optimal solutions from the minimum financial cost to the minimum complexity of construction and maintenance. Simulation results validated that comparing to the three existing state-of-the-art algorithms, that is, NSGA-II, JGGA, and SPEA2, the proposed scheme is superior in locating the Pareto-optimal front and maintaining the diversity of the solutions, thus providing superior candidate solutions for the design of real time monitoring systems in oilfields.

scholarly journals RELAY DEPLOYMENT ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY

2018 ◽  
Vol 14 (2) ◽  
pp. 131-137
Author(s):  
Lanny Sitanayah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Fault Tolerant ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Alternate Routes ◽  
Relay Deployment

Wireless Sensor Networks (WSNs) are subject to failures. Even though reliable routing protocols for WSNs exist and are well-understood, the physical network topology must ensure that alternate routes with an acceptable length to the sinksare in fact available when failures occur. This requires a sensor network deployment to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures do occur the protocols can continue to offer reliable delivery. To ensure that sensor nodes have sufficient paths, it may be necessary to add a number of additional relay nodes, which do not sense, but only forward data from other nodes. In this paper, we review a range of existing algorithms to deploy relay nodes for fault tolerance. We classify the state-of-the-art relay placement algorithms based on routing structures, connectivity requirements, deployment locations, and fault-tolerant requirements.

Sign in / Sign up

Export Citation Format

Share Document