Network coding for reliable wireless sensor networks

Wireless sensor networks are used in many applications and are now a key element in the increasingly growing Internet of Things. These networks are composed of small nodes including wireless communication modules, and in most of the cases are able to autonomously con gure themselves into networks, to ensure sensed data delivery. As more and more sensor nodes and networks join the Internet of Things, collaboration between geographically distributed systems are expected. Peer to peer overlay networks can assist in the federation of these systems, for them to collaborate. Since participating peers/proxies contribute to storage and processing, there is no burden on speci c servers and bandwidth bottlenecks are avoided. Network coding can be used to improve the performance of wireless sensor networks. The idea is for data from multiple links to be combined at intermediate encoding nodes, before further transmission. This technique proved to have a lot of potential in a wide range of applications. In the particular case of sensor networks, network coding based protocols and algorithms try to achieve a balance between low packet error rate and energy consumption. For network coding based constrained networks to be federated using peer to peer overlays, it is necessary to enable the storage of encoding vectors and coded data by such distributed storage systems. Packets can arrive to the overlay through any gateway/proxy (peers in the overlay), and lost packets can be recovered by the overlay (or client) using original and coded data that has been stored. The decoding process requires a decoding service at the overlay network. Such architecture, which is the focus of this thesis, will allow constrained networks to reduce packet error rate in an energy e cient way, while bene ting from an e ective distributed storage solution for their federation. This will serve as a basis for the proposal of mathematical models and algorithms that determine the most e ective routing trees, for packet forwarding toward sink/gateway nodes, and best amount and placement of encoding nodes.As redes de sensores sem fios são usadas em muitas aplicações e são hoje consideradas um elemento-chave para o desenvolvimento da Internet das Coisas. Compostas por nós de pequena dimensão que incorporam módulos de comunicação sem fios, grande parte destas redes possuem a capacidade de se configurarem de forma autónoma, formando sistemas em rede para garantir a entrega dos dados recolhidos. (…

On the Data Gathering Capacity and Latency in Wireless

In this paper, we investigate the fundamental properties of data gathering in wirelesssensor networks, in terms of both transport capacity and latency. We consider a scenarioin which s(n) out of n total network nodes have to deliver data to a set of d(n) sink nodesat a constant rate f(n; s(n); d(n)). The goal is to characterize the maximum achievablerate, and the latency in data delivery. We present a simple data gathering scheme thatachieves asymptotically optimal data gathering capacity and latency with arbitrary net-work deployments when d(n) = 1, and for most scaling regimes of s(n) and d(n) whend(n) > 1 in case of square grid and random node deployments. Differently from mostprevious work, our results and the presented data gathering scheme do not sacrifice en-ergy efficiency to the need of maximizing capacity and minimizing latency. Finally, weconsider the effects of a simple form of data aggregation on data gathering performance,and show that capacity can be increased of a factor f(n) with respect to the case of nodata aggregation, where f(n) is the node density. To the best of our knowledge, theones presented in this paper are the first results showing that asymptotically optimal datagathering capacity and latency can be achieved in arbitrary networks in an energy efficientway

On the Time Complexity of Information Dissemination via Linear Iterative Strategies

Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of timesteps required for some (or all) of the nodes to gather all of the initial values via a linear iterative strategy. At each time-step in this strategy, each node in the network transmits a weighted linear combination of its previous transmission and the most recent transmissions of its neighbors. We show that for almost any choice of real-valued weights in the linear iteration (i.e., for all but a set of measure zero), the number of time-steps required for any node to accumulate all of the initial values is upper-bounded by the size of the largest tree in a certain subgraph of the network; we use this fact to show that the linear iterative strategy is time-optimal for information dissemination in certain networks. In the process of deriving our results, we also obtain a characterization of the observability index for a class of linear structured systems

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

[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

A survey of distributed data aggregation algorithms

Distributed data aggregation is an important task, allowing the decentralized determination of meaningful global properties, which can then be used to direct the execution of other applications. The resulting values are derived by the distributed computation of functions like COUNT, SUM, and AVERAGE. Some application examples deal with the determination of the network size, total storage capacity, average load, majorities and many others. In the last decade, many different approaches have been proposed, with different trade-offs in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of aggregation algorithms, it can be difficult and time consuming to determine which techniques will be more appropriate to use in specific settings, justifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally defines the concept of aggregation, characterizing the different types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.info:eu-repo/semantics/publishedVersio

Efficient Information Access in Data-Intensive Sensor Networks

Recent advances in wireless communications and microelectronics have enabled wide deployment of smart sensor networks. Such networks naturally apply to a broad range of applications that involve system monitoring and information tracking (e.g., fine-grained weather/environmental monitoring, structural health monitoring, urban-scale traffic or parking monitoring, gunshot detection, monitoring volcanic eruptions, measuring rate of melting glaciers, forest fire detection, emergency medical care, disaster response, airport security infrastructure, monitoring of children in metropolitan areas, product transition in warehouse networks etc.).Meanwhile, existing wireless sensor networks (WSNs) perform poorly when the applications have high bandwidth needs for data transmission and stringent delay constraints against the network communication. Such requirements are common for Data Intensive Sensor Networks (DISNs) implementing Mission-Critical Monitoring applications (MCM applications).We propose to enhance existing wireless network standards with flexible query optimization strategies that take into account network constraints and application-specific data delivery patterns in order to meet high performance requirements of MCM applications.In this respect, this dissertation has two major contributions: First, we have developed an algebraic framework called Data Transmission Algebra (DTA) for collision-aware concurrent data transmissions. Here, we have merged the serialization concept from the databases with the knowledge of wireless network characteristics. We have developed an optimizer that uses the DTA framework, and generates an optimal data transmission schedule with respect to latency, throughput, and energy usage. We have extended the DTA framework to handle location-based trust and sensor mobility. We improved DTA scalability with Whirlpool data delivery mechanism, which takes advantage of partitioning of the network. Second, we propose relaxed optimization strategy and develop an adaptive approach to deliver data in data-intensive wireless sensor networks. In particular, we have shown that local actions at nodes help network to adapt in worse network conditions and perform better. We show that local decisions at the nodes can converge towards desirable global network properties e.g.,high packet success ratio for the network. We have also developed a network monitoring tool to assess the state and dynamic convergence of the WSN, and force it towards better performance

QoS BASED ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORK

A Wireless Sensor Networks (WSN) is composed of a large number of low-powered sensor nodes that are randomly deployed to collect environmental data. In a WSN, because of energy scarceness, energy efficient gathering of sensed information is one of the most critical issues. Thus, most of the WSN routing protocols found in the literature have considered energy awareness as a key design issue. Factors like throughput, latency and delay are not considered as critical issues in these protocols. However, emerging WSN applications that involve multimedia and imagining sensors require end-to-end delay within acceptable limits. Hence, in addition to energy efficiency, the parameters (delay, packet loss ratio, throughput and coverage) have now become issues of primary concern. Such performance metrics are usually referred to as the Quality of Service (QoS) in communication systems. Therefore, to have efficient use of a sensor node’s energy, and the ability to transmit the imaging and multimedia data in a timely manner, requires both a QoS based and energy efficient routing protocol. In this research work, a QoS based energy efficient routing protocol for WSN is proposed. To achieve QoS based energy efficient routing, three protocols are proposed, namely the QoS based Energy Efficient Clustering (QoSEC) for a WSN, the QoS based Energy Efficient Sleep/Wake Scheduling (QoSES) for a WSN, and the QoS based Energy Efficient Mobile Sink (QoSEM) based Routing for a Clustered WSN. Firstly, in the QoSEC, to achieve energy efficiency and to prolong network/coverage lifetime, some nodes with additional energy resources, termed as super-nodes, in addition to normal capability nodes, are deployed. Multi-hierarchy clustering is done by having super-nodes (acting as a local sink) at the top tier, cluster head (normal node) at the middle tier, and cluster member (normal node) at the lowest tier in the hierarchy. Clustering within normal sensor nodes is done by optimizing the network/coverage lifetime through a cluster-head-selection algorithm and a sleep/wake scheduling algorithm. QoSEC resolves the hot spot problem and prolongs network/coverage lifetime. Secondly, the QoSES addressed the delay-minimization problem in sleep/wake scheduling for event-driven sensor networks for delay-sensitive applications. For this purpose, QoSES assigns different sleep/wake intervals (longer wake interval) to potential overloaded nodes, according to their varied traffic load requirement defined a) by node position in the network, b) by node topological importance, and c) by handling burst traffic in the proximity of the event occurrence node. Using these heuristics, QoSES minimizes the congestion at nodes having heavy traffic loads and ultimately reduces end-to-end delay while maximizing the throughput. Lastly, the QoSEM addresses hot spot problem, delay minimization, and QoS assurance. To address hot-spot problem, mobile sink is used, that move in the network to gather data by virtue of which nodes near to the mobile sink changes with each movement, consequently hot spot problem is minimized. To achieve delay minimization, static sink is used in addition to the mobile sink. Delay sensitive data is forwarded to the static sink, while the delay tolerant data is sent through the mobile sink. For QoS assurance, incoming traffic is divided into different traffic classes and each traffic class is assigned different priority based on their QoS requirement (bandwidth, delay) determine by its message type and content. Furthermore, to minimize delay in mobile sink data gathering, the mobile sink is moved throughout the network based on the priority messages at the nodes. Using these heuristics, QoSEM incur less end-to-end delay, is energy efficient, as well as being able to ensure QoS. Simulations are carried out to evaluate the performance of the proposed protocols of QoSEC, QoSES and QoSEM, by comparing their performance with the established contemporary protocols. Simulation results have demonstrated that when compared with contemporary protocols, each of the proposed protocol significantly prolong the network and coverage lifetime, as well as improve the other QoS routing parameters, such as delay, packet loss ratio, and throughput