scholarly journals A Novel Privacy-Preserving Mobile-Coverage Scheme Based on Trustworthiness in HWSNs

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chunyang Qi ◽  
Jie Huang ◽  
Bin Wang ◽  
Hongkai Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Data Transmission ◽  
Discrete Logarithm ◽  
Privacy Preserving ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
The Novel ◽  
Network Coverage ◽  
Pollution Attacks ◽  
Previous Algorithm

To solve the problem of security deployment in a hybrid wireless sensor network, a novel privacy-preserving mobile coverage scheme based on trustworthiness is proposed. The novel scheme can efficiently mitigate some malicious attacks such as eavesdropping and pollution and optimize the coverage of hybrid wireless sensor networks (HWSNs) at the same time. Compared with the traditional mobile coverage scheme, the security of data transmission and mobility are considered in the deployment of HWSNs. Firstly, our scheme can mitigate the eavesdropping attacks efficiently utilizing privacy-preserving signature. Then, the trust mobile protocol based on the trustworthiness is used to defend the pollution attacks and improve the security of mobility. In privacy-preserving signature, the hardness of discrete logarithm determines the degree of security of the privacy-preserving signature. The correctness and effectiveness of signature algorithm are proven by the probabilities of the native messages which can be recovered and forged which is negligible. Furthermore, a mobile scheme based on the trustworthiness (MSTW) is proposed to optimize the network coverage and improve the security of mobility. Finally, the simulation compared with a previous algorithm is carried out, in which the communication overhead, computational complexity, and the coverage are given. The result of the simulation shows that our scheme has roughly the same network coverage as the previous schemes on the basis of ensuring the security of the data transmission and mobility.

scholarly journals Query Privacy Preserving for Data Aggregation in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
X. Liu ◽  
X. Zhang ◽  
J. Yu ◽  
C. Fu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Privacy ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Sensor Nodes ◽  
Experimental Simulation ◽  
Wireless Sensor ◽  
Communication Overhead

Wireless Sensor Networks (WSNs) are increasingly involved in many applications. However, communication overhead and energy efficiency of sensor nodes are the major concerns in WSNs. In addition, the broadcast communication mode of WSNs makes the network vulnerable to privacy disclosure when the sensor nodes are subject to malicious behaviours. Based on the abovementioned issues, we present a Queries Privacy Preserving mechanism for Data Aggregation (QPPDA) which may reduce energy consumption by allowing multiple queries to be aggregated into a single packet and preserve data privacy effectively by employing a privacy homomorphic encryption scheme. The performance evaluations obtained from the theoretical analysis and the experimental simulation show that our mechanism can reduce the communication overhead of the network and protect the private data from being compromised.

Data Aggregation Based on Saving Energy and Preserving Privacy in Wireless Sensor Networks

2014 ◽  
Vol 635-637 ◽  
pp. 878-881
Author(s):  
Gui Jun Shan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Privacy Preserving ◽  
Tree Structure ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Aggregation Tree ◽  
Time Pieces ◽  
The Internet Of Things

Privacy preserving plays an important role in application of the Internet of Things (IoT). As apart of the IT, Wireless Sensor Networks (WSNs) should provide the privacy preserving in data aggregation. This paper presents a novel energy-saving private-preserving aggregation scheme (ESPART) for Wireless Sensor Networks, which uses characteristic of the data aggregation tree structure to reduce communication overhead. It assigns the random time pieces to nodes with aim to avoid collision, and limits the scope of collusion data to reinforce data—loss resilience. Compared with the SMART algorithm have less communication overhead. ESPART uses data-dependent fusion characteristics of the tree structure to eliminate SMART algorithm for unnecessary communication node, so that in case of the same privacy protection security, the data transmission amount is reduced to about 48% of SMART.

An Energy Efficient Routing Approach to Enhance Coverage for Application Specific Wireless Sensor Networks using Genetic Algorithm

2019 ◽  
Vol 13 ◽  
Author(s):  
Amandeep Kaur Sohal ◽  
Ajay Kumar Sharma ◽  
Neetu Sood
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Cluster Formation ◽  
Green Computing ◽  
Wireless Sensor ◽  
Energy Efficient Routing

Background: An information gathering is a typical and important task in agriculture monitoring and military surveillance. In these applications, minimization of energy consumption and maximization of network lifetime have prime importance for green computing. As wireless sensor networks comprise of a large number of sensors with limited battery power and deployed at remote geographical locations for monitoring physical events, therefore it is imperative to have minimum consumption of energy during network coverage. The WSNs help in accurate monitoring of remote environment by collecting data intelligently from the individual sensors. Objective: The paper is motivated from green computing aspect of wireless sensor network and an Energy-efficient Weight-based Coverage Enhancing protocol using Genetic Algorithm (WCEGA) is presented. The WCEGA is designed to achieve continuously monitoring of remote areas for a longer time with least power consumption. Method: The cluster-based algorithm consists two phases: cluster formation and data transmission. In cluster formation, selection of cluster heads and cluster members areas based on energy and coverage efficient parameters. The governing parameters are residual energy, overlapping degree, node density and neighbor’s degree. The data transmission between CHs and sink is based on well-known evolution search algorithm i.e. Genetic Algorithm. Conclusion: The results of WCEGA are compared with other established protocols and shows significant improvement of full coverage and lifetime approximately 40% and 45% respectively.

scholarly journals Stable routing and energy-conserved data transmission over wireless sensor networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Suzan Shukry
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Data Transmission ◽  
Source Node ◽  
Wireless Sensor ◽  
Dominant Factor ◽  
Communication Overhead ◽  
Forwarding Node ◽  
Stable Path ◽  
Stable Routing

AbstractStable routing and energy conservation over a wireless sensor network (WSN) is a major issue in Internet of Things applications. The network lifetime can be increased when studying this issue with interest. Data transmission is a dominant factor in IoT networks for communication overhead and energy consumption. A proposed efficient node stable routing ($$ENSR$$ ENSR ) protocol is introduced to guarantee the stability of transmission data between the source and destination nodes, in a dynamic WSN conditions. $$ENSR$$ ENSR minimizes energy consumption and selects more stable nodes for packets forwarding. Stability becomes the most important factor that qualifies the node's centrality. A node’s stability is characterized by residual energy, link quality, and number of hops needed to reach the destination from the node. To calculate node's stability, an enhanced centrality concept, known as stable betweenness centrality ($$SBC$$ SBC ) is introduced. In $$ENSR$$ ENSR , at first, some nodes will be selected as the stable forwarding nodes, usually with maximum $$SBC$$ SBC between their neighbors within a limited communication radio range of a particular region. Furthermore, each stable forwarding node then broadcasts its identity, including $$SBC$$ SBC , to the source node separately. The source node can compute a stable path to forward packets to the corresponding stable forwarding node, based on a proper designed stable path routing metric ($$SPRM$$ SPRM ). Then, the stable forwarding node will behave as a new source node and start another stable path routing process until the packets are forwarded and reached to the destination node. In addition, the change of stable nodes over time balances and conserves node energy consumption, thereby mitigating “hot spots”. The proposed routing protocol is validated through simulation. The numerical results show that the proposed protocol outperforms the existing algorithms, global and local reliability-based routing ($$GLRR$$ GLRR ) and reliable energy-aware routing protocol $$(RER)$$ ( R E R ) , in terms of network efficiency and reliability.

scholarly journals A Data-Based Fault-Detection Model for Wireless Sensor Networks

2019 ◽  
Vol 11 (21) ◽  
pp. 6171 ◽  
Author(s):  
Jangsik Bae ◽  
Meonghun Lee ◽  
Changsun Shin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Data Transmission ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sensors And Actuators ◽  
Detection Model ◽  
Management Platform

With the expansion of smart agriculture, wireless sensor networks are being increasingly applied. These networks collect environmental information, such as temperature, humidity, and CO2 rates. However, if a faulty sensor node operates continuously in the network, unnecessary data transmission adversely impacts the network. Accordingly, a data-based fault-detection algorithm was implemented in this study to analyze data of sensor nodes and determine faults, to prevent the corresponding nodes from transmitting data; thus, minimizing damage to the network. A cloud-based “farm as a service” optimized for smart farms was implemented as an example, and resource management of sensors and actuators was provided using the oneM2M common platform. The effectiveness of the proposed fault-detection model was verified on an integrated management platform based on the Internet of Things by collecting and analyzing data. The results confirm that when a faulty sensor node is not separated from the network, unnecessary data transmission of other sensor nodes occurs due to continuous abnormal data transmission; thus, increasing energy consumption and reducing the network lifetime.

Design of Tungsten Tailing Reservoir Safety Monitoring and Warning System Based on Wireless Sensor Networks and LabVIEW

2013 ◽  
Vol 427-429 ◽  
pp. 1268-1271
Author(s):  
Xue Wen He ◽  
Ying Fei Sheng ◽  
Kuan Gang Fan ◽  
Le Ping Zheng ◽  
Qing Mei Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Communication Protocol ◽  
Warning System ◽  
Safety Monitoring ◽  
Wireless Sensor ◽  
Serial Port ◽  
Rf Transceiver ◽  
New Type

In view of the existing flaws of traditional manual observations, a new type of tailing reservoir safety monitoring and warning system based on ZigBee and LabVIEW was designed. The system chose SoC chip CC2530 as the RF transceiver and designed the low-power wireless sensor networks nodes to collect and process the data of tailing reservoir. It chose ZigBee 2007 as the network communication protocol, and uploaded the data to PC by RS232 serial port. The monitoring and warning interface of PC was completed with LabVIEW. The testing results show that the data transmission of the network is stable and the system is suitable for real-time monitoring and warning of the tungsten tailing reservoir.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

Sign in / Sign up

Export Citation Format

Share Document