scholarly journals Cluster-Based Arithmetic Coding for Data Provenance Compression in Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Qinbao Xu ◽  
Rizwan Akhtar ◽  
Xing Zhang ◽  
Changda Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Base Station ◽  
Arithmetic Coding ◽  
Wireless Sensor ◽  
Data Provenance ◽  
Mathematical Function ◽  
Test Bed ◽  
Coding Method ◽  
Data Source

In wireless sensor networks (WSNs), data provenance records the data source and the forwarding and the aggregating information of a packet on its way to the base station (BS). To conserve the energy and wireless communication bandwidth, the provenances are compressed at each node along the packet path. To perform the provenances compression in resource-tightened WSNs, we present a cluster-based arithmetic coding method which not only has a higher compression rate but also can encode and decode the provenance in an incremental manner; i.e., the provenance can be zoomed in and out like Google Maps. Such a decoding method raises the efficiencies of the provenance decoding and the data trust assessment. Furthermore, the relationship between the clustering size and the provenance size is formally analyzed, and then the optimal clustering size is derived as a mathematical function of the WSN’s size. Both the simulation and the test-bed experimental results show that our scheme outperforms the known arithmetic coding based provenance compression schemes with respect to the average provenance size, the energy consumption, and the communication bandwidth consumption.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

PERFORMANCE EVALUATION ANALYSIS OF WIRELESS SENSOR NETWORKS ROUTING PROTOCOLS IN SMART GRIDS

2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Smart Grids ◽  
Network Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Delay Jitter ◽  
La Red

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.

The Debris Flow Disaster Faster-Than-Early Forecast System (DFS) with Multi-Sensors Integrated Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 975-979
Author(s):  
Rong Zhao ◽  
Cai Hong Li ◽  
Yun Jian Tan ◽  
Jun Shi ◽  
Fu Qiang Mu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Debris Flow ◽  
Real Time ◽  
Debris Flows ◽  
Base Station ◽  
Base Stations ◽  
Wireless Sensor ◽  
Forecast System ◽  
Debris Flow Disaster

This paper presents a Debris Flow Disaster Faster-than-early Forecast System (DFS) with wireless sensor networks. Debris flows carrying saturated solid materials in water flowing downslope often cause severe damage to the lives and properties in their path. Faster-than-early or faster-than-real-time forecasts are imperative to save lives and reduce damage. This paper presents a novel multi-sensor networks for monitoring debris flows. The main idea is to let these sensors drift with the debris flow, to collect flow information as they move along, and to transmit the collected data to base stations in real time. The Raw data are sent to the cloud processing center from the base station. And the processed data and the video of the debris flow are display on the remote PC. The design of the system address many challenging issues, including cost, deployment efforts, and fast reaction.

scholarly journals Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Direct Access ◽  
Session Key ◽  
Dynamic Key Management ◽  
Dynamic Key

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.

scholarly journals Searching Algorithm of Dormant Node in Wireless Sensor Networks

2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Delaunay Triangulation ◽  
Base Station ◽  
Wireless Sensor ◽  
Effective Mechanism ◽  
Dormant State ◽  
Important Nodes

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.

Sign in / Sign up

Export Citation Format

Share Document