754 research outputs found

    A Secure and Low-Energy Zone-based Wireless Sensor Networks Routing Protocol for Pollution Monitoring

    Full text link
    [EN] Sensor networks can be used in many sorts of environments. The increase of pollution and carbon footprint are nowadays an important environmental problem. The use of sensors and sensor networks can help to make an early detection in order to mitigate their effect over the medium. The deployment of wireless sensor networks (WSNs) requires high-energy efficiency and secures mechanisms to ensure the data veracity. Moreover, when WSNs are deployed in harsh environments, it is very difficult to recharge or replace the sensor's batteries. For this reason, the increase of network lifetime is highly desired. WSNs also work in unattended environments, which is vulnerable to different sort of attacks. Therefore, both energy efficiency and security must be considered in the development of routing protocols for WSNs. In this paper, we present a novel Secure and Low-energy Zone-based Routing Protocol (SeLeZoR) where the nodes of the WSN are split into zones and each zone is separated into clusters. Each cluster is controlled by a cluster head. Firstly, the information is securely sent to the zone-head using a secret key; then, the zone-head sends the data to the base station using the secure and energy efficient mechanism. This paper demonstrates that SeLeZoR achieves better energy efficiency and security levels than existing routing protocols for WSNs.Mehmood, A.; Lloret, J.; Sendra, S. (2016). A Secure and Low-Energy Zone-based Wireless Sensor Networks Routing Protocol for Pollution Monitoring. Wireless Communications and Mobile Computing. 16(17):2869-2883. https://doi.org/10.1002/wcm.2734S286928831617Sendra S Deployment of efficient wireless sensor nodes for monitoring in rural, indoor and underwater environments 2013Javaid, N., Qureshi, T. N., Khan, A. H., Iqbal, A., Akhtar, E., & Ishfaq, M. (2013). EDDEEC: Enhanced Developed Distributed Energy-efficient Clustering for Heterogeneous Wireless Sensor Networks. Procedia Computer Science, 19, 914-919. doi:10.1016/j.procs.2013.06.125Garcia, M., Sendra, S., Lloret, J., & Canovas, A. (2011). Saving energy and improving communications using cooperative group-based Wireless Sensor Networks. Telecommunication Systems, 52(4), 2489-2502. doi:10.1007/s11235-011-9568-3Garcia, M., Lloret, J., Sendra, S., & Rodrigues, J. J. P. C. (2011). Taking Cooperative Decisions in Group-Based Wireless Sensor Networks. Cooperative Design, Visualization, and Engineering, 61-65. doi:10.1007/978-3-642-23734-8_9Garcia, M., & Lloret, J. (2009). A Cooperative Group-Based Sensor Network for Environmental Monitoring. Cooperative Design, Visualization, and Engineering, 276-279. doi:10.1007/978-3-642-04265-2_41Jain T Wireless environmental monitoring system (wems) using data aggregation in a bidirectional hybrid protocol In Proc of the 6th International Conference ICISTM 2012 2012Senouci, M. R., Mellouk, A., Senouci, H., & Aissani, A. (2012). Performance evaluation of network lifetime spatial-temporal distribution for WSN routing protocols. Journal of Network and Computer Applications, 35(4), 1317-1328. doi:10.1016/j.jnca.2012.01.016Heinzelman WR Chandrakasan A Balakrishnan H Energy-efficient communication protocol for wireless microsensor networks In proc of the 33rd Annual Hawaii International Conference on System Sciences 2000 2000Xiangning F Yulin S Improvement on LEACH protocol of wireless sensor network In proc of the 2007 International Conference on Sensor Technologies and Applications SensorComm 2007 2007Tong M Tang M LEACH-B: an improved LEACH protocol for wireless sensor network In proc of the 6th International Conference on Wireless Communications Networking and Mobile Computing WiCOM 2010 2010Mohammad El-Basioni, B. M., Abd El-kader, S. M., Eissa, H. S., & Zahra, M. M. (2011). An Optimized Energy-aware Routing Protocol for Wireless Sensor Network. Egyptian Informatics Journal, 12(2), 61-72. doi:10.1016/j.eij.2011.03.001Younis O Fahmy S Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach In proc of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2004 2004Noack, A., & Spitz, S. (2009). Dynamic Threshold Cryptosystem without Group Manager. Network Protocols and Algorithms, 1(1). doi:10.5296/npa.v1i1.161Nasser, N., & Chen, Y. (2007). SEEM: Secure and energy-efficient multipath routing protocol for wireless sensor networks. Computer Communications, 30(11-12), 2401-2412. doi:10.1016/j.comcom.2007.04.014Alippi, C., Camplani, R., Galperti, C., & Roveri, M. (2011). A Robust, Adaptive, Solar-Powered WSN Framework for Aquatic Environmental Monitoring. IEEE Sensors Journal, 11(1), 45-55. doi:10.1109/jsen.2010.2051539Parra L Sendra S Jimenez JM Lloret J Smart system to detect and track pollution in marine environments, in proc. of the 2015 2015 1503 1508Atto, M., & Guy, C. (2014). Routing Protocols and Quality of Services for Security Based Applications Using Wireless Video Sensor Networks. Network Protocols and Algorithms, 6(3), 119. doi:10.5296/npa.v6i3.5802Liu, Z., Zheng, Q., Xue, L., & Guan, X. (2012). A distributed energy-efficient clustering algorithm with improved coverage in wireless sensor networks. Future Generation Computer Systems, 28(5), 780-790. doi:10.1016/j.future.2011.04.019Bri D Sendra S Coll H Lloret J How the atmospheric variables affect to the WLAN datalink layer parameters 2010Ganesh, S., & Amutha, R. (2013). Efficient and secure routing protocol for wireless sensor networks through SNR based dynamic clustering mechanisms. Journal of Communications and Networks, 15(4), 422-429. doi:10.1109/jcn.2013.000073Amjad M 2014 Energy efficient multi level and distance clustering mechanism for wireless sensor networksMeghanathan, N. (2015). A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks. Network Protocols and Algorithms, 7(3), 18. doi:10.5296/npa.v7i3.796

    Prospectiva de seguridad de las redes de sensores inalámbricos

    Get PDF
    En las Redes de Sensores Inalámbricos (WSN), los nodos son vulnerables a los ataques de seguridad porque están instalados en un entorno difícil, con energía y memoria limitadas, baja capacidad de procesamiento y transmisión de difusión media; por lo tanto, identificar las amenazas, los retos y las soluciones de seguridad y privacidad es un tema candente hoy en día. En este artículo se analizan los trabajos de investigación que se han realizado sobre los mecanismos de seguridad para la protección de las WSN frente a amenazas y ataques, así como las tendencias que surgen en otros países junto con futuras líneas de investigación. Desde el punto de vista metodológico, este análisis se muestra a través de la visualización y estudio de trabajos indexados en bases de datos como IEEE, ACM, Scopus y Springer, con un rango de 7 años como ventana de observación, desde 2013 hasta 2019. Se obtuvieron un total de 4.728 publicaciones, con un alto índice de colaboración entre China e India. La investigación planteó desarrollos, como avances en los principios de seguridad y mecanismos de defensa, que han llevado al diseño de contramedidas en la detección de intrusiones. Por último, los resultados muestran el interés de la comunidad científica y empresarial por el uso de la inteligencia artificial y el aprendizaje automático (ML) para optimizar las medidas de rendimiento.In Wireless Sensor Networks (WSN), nodes are vulnerable to security attacks because they are installed in a harsh environment with limited power and memory, low processing power, and medium broadcast transmission. Therefore, identifying threats, challenges, and solutions of security and privacy is a talking topic today. This article analyzes the research work that has been carried out on the security mechanisms for the protection of WSN against threats and attacks, as well as the trends that emerge in other countries combined with future research lines. From the methodological point of view, this analysis is shown through the visualization and study of works indexed in databases such as IEEE, ACM, Scopus, and Springer, with a range of 7 years as an observation window, from 2013 to 2019. A total of 4,728 publications were obtained, with a high rate of collaboration between China and India. The research raised developments, such as advances in security principles and defense mechanisms, which have led to the design of countermeasures in intrusion detection. Finally, the results show the interest of the scientific and business community in the use of artificial intelligence and machine learning (ML) to optimize performance measurements

    Several Categories of Energy Harvested Routing Protocols, Challenges, and Characteristics in WSN: A Review

    Get PDF
    The routing protocol is a technique for determining the most efficient channel for data transmission. The route selection procedure, which relies on the kind of network, channel conditions, and measurement systems, presents several challenges. Routing is essential in Wireless Sensor Networks (WSNs) for environmental monitoring, traffic monitoring, and other applications. WSNs are small nodes that can sense, interpret data, and communicate wirelessly. Many routing, power control, and data dissemination techniques have been developed specifically for WSNs, where energy efficiency is a crucial design factor. On the other hand, the focus has been on energy harvesting and standard routing methods, which can vary depending on the design and network architecture. In a Wireless Sensor Network (WSN), the data collected by the sensor nodes is typically transferred to the base station, which connects the sensor network to other networks (such as the internet), where it is processed and necessary action is taken. WSN has recently been developed to allow various applications, including traffic enforcement building automation, smart warfare, environmental sensing, and many more.WSN integrates several sensors or nodes deployed around a specific node to perform computational processes

    Analysis and Ad-hoc Networking Solutions for Cooperative Relaying Systems

    Get PDF
    Users of mobile networks are increasingly demanding higher data rates from their service providers. To cater to this demand, various signal processing and networking algorithms have been proposed. Amongst them the multiple input multiple output (MIMO) scheme of wireless communications is one of the most promising options. However, due to certain physical restrictions, e.g., size, it is not possible for many devices to have multiple antennas on them. Also, most of the devices currently in use are single-antenna devices. Such devices can make use of the MIMO scheme by employing cooperative MIMO methods. This involves nearby nodes utilizing the antennas of each other to form virtual antenna arrays (VAAs). Nodes with limited communication ranges can further employ multi-hopping to be able to communicate with far away nodes. However, an ad-hoc communications scheme with cooperative MIMO multi-hopping can be challenging to implement because of its de-centralized nature and lack of a centralized controling entity such as a base-station. This thesis looks at methods to alleviate the problems faced by such networks.In the first part of this thesis, we look, analytically, at the relaying scheme under consideration and derive closed form expressions for certain performance measures (signal to noise ratio (SNR), symbol error rate (SER), bit error rate (BER), and capacity) for the co-located and cooperative multiple antenna schemes in different relaying configurations (amplify-and-forward and decode-and-forward) and different antenna configurations (single input single output (SISO), single input multiple output (SIMO) and MIMO). These expressions show the importance of reducing the number of hops in multi-hop communications to achieve a better performance. We can also see the impact of different antenna configurations and different transmit powers on the number of hops through these simplified expressions.We also look at the impact of synchronization errors on the cooperative MIMO communications scheme and derive a lower bound of the SINR and an expression for the BER in the high SNR regime. These expressions can help the network designers to ensure that the quality of service (QoS) is satisfied even in the worst-case scenarios. In the second part of the thesis we present some algorithms developed by us to help the set-up and functioning of cluster-based ad-hoc networks that employ cooperative relaying. We present a clustering algorithm that takes into account the battery status of nodes in order to ensure a longer network life-time. We also present a routing mechanism that is tailored for use in cooperative MIMO multi-hop relaying. The benefits of both schemes are shown through simulations.A method to handle data in ad-hoc networks using distributed hash tables (DHTs) is also presented. Moreover, we also present a physical layer security mechanism for multi-hop relaying. We also analyze the physical layer security mechanism for the cooperative MIMO scheme. This analysis shows that the cooperative MIMO scheme is more beneficial than co-located MIMO in terms of the information theoretic limits of the physical layer security.Nutzer mobiler Netzwerke fordern zunehmend höhere Datenraten von ihren Dienstleistern. Um diesem Bedarf gerecht zu werden, wurden verschiedene Signalverarbeitungsalgorithmen entwickelt. Dabei ist das "Multiple input multiple output" (MIMO)-Verfahren für die drahtlose Kommunikation eine der vielversprechendsten Techniken. Jedoch ist aufgrund bestimmter physikalischer Beschränkungen, wie zum Beispiel die Baugröße, die Verwendung von mehreren Antennen für viele Endgeräte nicht möglich. Dennoch können solche Ein-Antennen-Geräte durch den Einsatz kooperativer MIMO-Verfahren von den Vorteilen des MIMO-Prinzips profitieren. Dabei schließen sich naheliegende Knoten zusammen um ein sogenanntes virtuelles Antennen-Array zu bilden. Weiterhin können Knoten mit beschränktem Kommunikationsbereich durch mehrere Hops mit weiter entfernten Knoten kommunizieren. Allerdings stellt der Aufbau eines solchen Ad-hoc-Netzwerks mit kooperativen MIMO-Fähigkeiten aufgrund der dezentralen Natur und das Fehlen einer zentral-steuernden Einheit, wie einer Basisstation, eine große Herausforderung dar. Diese Arbeit befasst sich mit den Problemstellungen dieser Netzwerke und bietet verschiedene Lösungsansätze.Im ersten Teil dieser Arbeit werden analytisch in sich geschlossene Ausdrücke für ein kooperatives Relaying-System bezüglicher verschiedener Metriken, wie das Signal-Rausch-Verhältnis, die Symbolfehlerrate, die Bitfehlerrate und die Kapazität, hergeleitet. Dabei werden die "Amplify-and forward" und "Decode-and-forward" Relaying-Protokolle, sowie unterschiedliche Mehrantennen-Konfigurationen, wie "Single input single output" (SISO), "Single input multiple output" (SIMO) und MIMO betrachtet. Diese Ausdrücke zeigen die Bedeutung der Reduzierung der Hop-Anzahl in Mehr-Hop-Systemen, um eine höhere Leistung zu erzielen. Zudem werden die Auswirkungen verschiedener Antennen-Konfigurationen und Sendeleistungen auf die Anzahl der Hops analysiert.  Weiterhin wird der Einfluss von Synchronisationsfehlern auf das kooperative MIMO-Verfahren herausgestellt und daraus eine untere Grenze für das Signal-zu-Interferenz-und-Rausch-Verhältnis, sowie ein Ausdruck für die Bitfehlerrate bei hohem Signal-Rausch-Verhältnis entwickelt. Diese Zusammenhänge sollen Netzwerk-Designern helfen die Qualität des Services auch in den Worst-Case-Szenarien sicherzustellen. Im zweiten Teil der Arbeit werden einige innovative Algorithmen vorgestellt, die die Einrichtung und die Funktionsweise von Cluster-basierten Ad-hoc-Netzwerken, die kooperative Relays verwenden, erleichtern und verbessern. Darunter befinden sich ein Clustering-Algorithmus, der den Batteriestatus der Knoten berücksichtigt, um eine längere Lebensdauer des Netzwerks zu gewährleisten und ein Routing-Mechanismus, der auf den Einsatz in kooperativen MIMO Mehr-Hop-Systemen zugeschnitten ist. Die Vorteile beider Algorithmen werden durch Simulationen veranschaulicht. Eine Methode, die Daten in Ad-hoc-Netzwerken mit verteilten Hash-Tabellen behandelt wird ebenfalls vorgestellt. Darüber hinaus wird auch ein Sicherheitsmechanismus für die physikalische Schicht in Multi-Hop-Systemen und kooperativen MIMO-Systemen präsentiert. Eine Analyse zeigt, dass das kooperative MIMO-Verfahren deutliche Vorteile gegenüber dem konventionellen MIMO-Verfahren hinsichtlich der informationstheoretischen Grenzen der Sicherheit auf der physikalischen Schicht aufweist

    Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

    Get PDF
    Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

    Smart Wireless Sensor Networks

    Get PDF
    The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks

    Energy efficient chain based routing protocol for deterministic node deployment in wireless sensor networks

    Get PDF
    Wireless Sensor Network (WSN) consists of small sensor devices, which are connected wirelessly for sensing and delivering specific data to Base Station (BS). Routing protocols in WSN becomes an active area for both researchers and industrial, due to its responsibility for delivering data, extending network lifetime, reducing the delay and saving the node’s energy. According to hierarchical approach, chain base routing protocol is a promising type that can prolong the network lifetime and decrease the energy consumption. However, it is still suffering from long/single chain impacts such as delay, data redundancy, distance between the neighbors, chain head (CH) energy consumption and bottleneck. This research proposes a Deterministic Chain-Based Routing Protocol (DCBRP) for uniform nodes deployment, which consists of Backbone Construction Mechanism (BCM), Chain Heads Selection mechanism (CHS) and Next Hop Connection mechanism (NHC). BCM is responsible for chain construction by using multi chain concept, so it will divide the network to specific number of clusters depending on the number of columns. While, CHS is answerable on the number of chain heads and CH nodes selection based on their ability for data delivery. On the other hand, NHC is responsible for next hop connection in each row based on the energy and distance between the nodes to eliminate the weak nodes to be in the main chain. Network Simulator 3 (ns-3) is used to simulate DCBRP and it is evaluated with the closest routing protocols in the deterministic deployment in WSN, which are Chain-Cluster Mixed protocol (CCM) and Two Stage Chain based Protocol (TSCP). The results show that DCBRP outperforms CCM and TSCP in terms of end to end delay, CH energy consumption, overall energy consumption, network lifetime and energy*delay metrics. DCBRP or one of its mechanisms helps WSN applications by extending the sensor nodes lifetime and saving the energy for sensing purposes as long as possible
    corecore