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 ◽  
...  
Author(s):  
Riaz Ahmed Shaikh ◽  
Brian J. dAuriol ◽  
Heejo Lee ◽  
Sungyoung Lee

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.


Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne

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.


2019 ◽  
Vol 28 (05) ◽  
pp. 1930005 ◽  
Author(s):  
Sergio Diaz ◽  
Diego Mendez ◽  
Rolf Kraemer

We present the state-of-the-art related to self-organizing and self-healing techniques. On the one hand, self-organization is the nodes’ ability to construct a network topology without any human intervention and any previous topology knowledge. On the other hand, self-healing is the network’s ability to recover from failures by using hardware and software redundancies. By using both techniques, Wireless Sensor Networks (WSNs) can be deployed in unattended and harsh environments where on-site technical service is unfeasible. In the last few years, a large amount of work has been done in these two research areas, but these different techniques occur at different layers and with no general classification or effort to consolidate them. One of the contributions of this paper is the consolidation of the most significant and relevant mechanisms in these two areas, and additionally, we made an effort to organize and classify them. In this review, we explain in detail the two stages of self-organization, namely topology construction and management. Moreover, we present a comprehensive study of the four steps in a self-healing technique, namely, information collection, fault detection, fault classification and fault recovery. By introducing relevant work, comparative tables, and future trends, we provide the reader with a complete picture of the state-of-the-art. Another contribution is the proposal of a unified framework that employs self-organizing and self-healing mechanisms to achieve a fault-tolerant network.


2012 ◽  
pp. 120-129
Author(s):  
Isabelle Augé-Blum ◽  
Fei Yang ◽  
Thomas Watteyne

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.


2022 ◽  
Vol 18 (1) ◽  
pp. 1-41
Author(s):  
Pamela Bezerra ◽  
Po-Yu Chen ◽  
Julie A. McCann ◽  
Weiren Yu

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.


Sign in / Sign up

Export Citation Format

Share Document