scholarly journals An Efficient Anonymous Communication Scheme to Protect the Privacy of the Source Node Location in the Internet of Things

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Fengyin Li ◽  
Pei Ren ◽  
Guoyu Yang ◽  
Yuhong Sun ◽  
Yilei Wang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Location Privacy ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Source Node ◽  
Wireless Sensor ◽  
Anonymous Communication ◽  
Privacy Leakage ◽  
Communication Scheme

Advances in machine learning (ML) in recent years have enabled a dizzying array of applications such as data analytics, autonomous systems, and security diagnostics. As an important part of the Internet of Things (IoT), wireless sensor networks (WSNs) have been widely used in military, transportation, medical, and household fields. However, in the applications of wireless sensor networks, the adversary can infer the location of a source node and an event by backtracking attacks and traffic analysis. The location privacy leakage of a source node has become one of the most urgent problems to be solved in wireless sensor networks. To solve the problem of source location privacy leakage, in this paper, we first propose a proxy source node selection mechanism by constructing the candidate region. Secondly, based on the residual energy of the node, we propose a shortest routing algorithm to achieve better forwarding efficiency. Finally, by combining the proposed proxy source node selection mechanism with the proposed shortest routing algorithm based on the residual energy, we further propose a new, anonymous communication scheme. Meanwhile, the performance analysis indicates that the anonymous communication scheme can effectively protect the location privacy of the source nodes and reduce the network overhead.

A Novel Energy-Balanced Dynamic Routing Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 681 ◽  
pp. 235-238
Author(s):  
Xin Xin Zhou ◽  
Yan Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Dynamic Routing ◽  
Residual Energy ◽  
Wireless Sensor ◽  
The Novel ◽  
Balance Energy ◽  
Transfer Tasks

Wireless sensor networks (WSNs) is taking an increasing role in our lives. Because the energy of the sensors is limited how to efficiently use the energy to prolong the lifecycle of the sensor networks is very important. In this paper, a novel energy-balanced dynamic routing algorithm based on ACO is proposed. The novel routing algorithm can dynamically choose routing according to the residual energy of the sensors and the sensors with more power is taken more data transfer tasks. The simulation results show that the proposed routing algorithm can effectively balance energy consumption and prolong the lifecycle of the networks.

An Opportunistic Large Array Concentric Geographic Routing Algorithm with a Relay Node in Wireless Sensor Networks

2015 ◽  
Vol 764-765 ◽  
pp. 838-842
Author(s):  
Young Long Chen ◽  
Yung Chi Chang ◽  
Yu Ling Zeng
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Source Node ◽  
Wireless Sensor ◽  
Sink Node ◽  
Large Array

Wireless sensor networks (WSNs) are a group of wireless sensor nodes, those sensor nodes with sensing and monitoring of environmental information. Energy consumption is an important topic; the node's power is limited. Therefore, we proposed an Opportunistic Large Array Concentric Geographic Routing Algorithm (OLACGRA) to reduce the node’s energy consumption and analysis the characteristic of energy model. The sink position of our proposed OLACGRA is at the center of concentric topology architecture. The source node wants to transmit data that it needs to calculate the distance between source node and sink node. If this distance bigger than threshold value, we use the multi-hop manner. Otherwise, source node transmits data to sink node directly. Simulation results show that our proposed algorithm can effectively reduce the node’s energy consumption.

scholarly journals Multiparameter Fusion Decision Routing Algorithm for Energy-Constrained Wireless Sensor Networks

2020 ◽  
Vol 10 (8) ◽  
pp. 2747
Author(s):  
Jiangyu Yan ◽  
Jinqi Cai ◽  
Zhilin Lu ◽  
Liangrui Tang ◽  
Runze Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selection Strategy ◽  
Equilibrium Degree ◽  
Energy Equilibrium ◽  
Energy Constrained ◽  
Network Status

For energy-limited wireless sensor networks (WSNs), we propose a multiparameter fusion decision routing (MPFDR) algorithm in this study. This algorithm gives a comprehensive account of the residual energy and forward distance, single-hop transmission ratio, cache queue, and energy equilibrium degree. It calculates the routing evaluation parameters of the forward neighbors, realizing a multidirectional reflection of the network status. Simultaneously, combined with the defined routing selection strategy based on the parameter contribution degree and fuzzy contribution degree, the fusion contribution degree of each forward neighbor is obtained. Then, the node with the most considerable fusion contribution degree is selected as the next hop. Finally, the performance of the MPFDR algorithm is simulated and compared with other algorithms. Simulation results indicate that our algorithm has good congestion control ability in energy-limited wireless sensor networks and can significantly reduce the packet loss rate and average hops.

scholarly journals An Enhanced Source Location Privacy based on Data Dissemination in Wireless Sensor Networks (DeLP)

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2050 ◽  
Author(s):  
Naveed Jan ◽  
Ali Al-Bayatti ◽  
Naseer Alalwan ◽  
Ahmed Alzahrani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Location Privacy ◽  
Source Location ◽  
Base Station ◽  
Source Node ◽  
Wireless Sensor ◽  
Packet Delivery ◽  
Safety Period

Wireless Sensor Network is a network of large number of nodes with limited power and computational capabilities. It has the potential of event monitoring in unattended locations where there is a chance of unauthorized access. The work that is presented here identifies and addresses the problem of eavesdropping in the exposed environment of the sensor network, which makes it easy for the adversary to trace the packets to find the originator source node, hence compromising the contextual privacy. Our scheme provides an enhanced three-level security system for source location privacy. The base station is at the center of square grid of four quadrants and it is surrounded by a ring of flooding nodes, which act as a first step in confusing the adversary. The fake node is deployed in the opposite quadrant of actual source and start reporting base station. The selection of phantom node using our algorithm in another quadrant provides the third level of confusion. The results show that Dissemination in Wireless Sensor Networks (DeLP) has reduced the energy utilization by 50% percent, increased the safety period by 26%, while providing a six times more packet delivery ratio along with a further 15% decrease in the packet delivery delay as compared to the tree-based scheme. It also provides 334% more safety period than the phantom routing, while it lags behind in other parameters due to the simplicity of phantom scheme. This work illustrates the privacy protection of the source node and the designed procedure may be useful in designing more robust algorithms for location privacy.

scholarly journals A Restricted Multipath Routing Algorithm in Wireless Sensor Networks Using a Virtual Cylinder: Bypassing Black hole and Selective Forwarding Attacks

2019 ◽  
Vol 3 (2) ◽  
pp. 51
Author(s):  
Elham Bahmani ◽  
Aso Mohammad Darwesh Darwesh ◽  
Mojtaba Jamshidi ◽  
Somaieh Bali
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Source Node ◽  
Wireless Sensor ◽  
Sink Node ◽  
Packet Delivery ◽  
Selective Forwarding ◽  
Routing Method

In this paper, a simple and novel routing algorithm is presented to improve the packet delivery in harsh conditions such as selective forwarding and blackhole attacks to the wireless sensor networks. The proposed algorithm is based on restricted multi-path broadcast based on a virtual cylinder from the source node to the sink node. In this algorithm, when a packet is broadcast by a source node, a virtual cylinder with radius w is created from the source node to a sink node. All the nodes located in this virtual cylinder are allowed to forwardthe packet to the sink. Thus, data is forwarded to sink via multiple paths, but in a restricted manner so that the nodes do not consume a high amount of energy. If there are some compromised nodes in this virtual cylinder, the packets may be forwarded to the sink via other nodes of the virtual cylinder. The proposed algorithm is simulated and evaluated in terms of packet delivery rate and energy consumption. The experiment results show that the proposed algorithm increases packet delivery rate 7 times compared to the single-path routing method and reduces energy consumption up to three times compared to flooding routing method.

A Energy-Aware QoS Routing Protocol for Wireless Sensor Networks

2013 ◽  
Vol 373-375 ◽  
pp. 323-328
Author(s):  
Long Gao ◽  
La Yuan Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Qos Routing ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Multiple Paths ◽  
Qos Routing Algorithm

As the different QoS requirements of different businesses in wireless sensor networks, we proposed a QoS routing algorithm-EAQoS. The algorithm built multiple paths to sink node by recording the minimum hops of neighbors to sink. Then data was sent by the path that satisfied its QoS requirements and had enough residual energy. According to the comparisons with the SAR routing algorithm, this algorithm has obvious advantages in providing different services and prolonging the lifetime of network.

scholarly journals Source Anonymity against Global Adversary in WSNs Using Dummy Packet Injections: A Survey

Electronics ◽  
2018 ◽  
Vol 7 (10) ◽  
pp. 250 ◽  
Author(s):  
Anas Bushnag ◽  
Abdelshakour Abuzneid ◽  
Ausif Mahmood
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Location Privacy ◽  
Source Node ◽  
Wireless Sensor ◽  
Basic Notion ◽  
Full View ◽  
Security Issues ◽  
Advantages And Disadvantages ◽  
Expected Outcome

Source anonymity in wireless sensor networks (WSNs) becomes a real concern in several applications such as tracking and monitoring. A global adversary that has sophisticated resources, high computation and full view of the network is an obvious threat to such applications. The network and applications need to be protected and secured to provide the expected outcome. Source anonymity is one of the fundamental WSNs security issues. It is all about preventing the adversary from reaching the origin by analyzing the traffic of the network. There are many methods to provide source anonymity, which is also known as Source Location Privacy (SLP). One of these methods is based on dummy packets. The basic notion is to inject the network with dummy packets to confuse the adversary about the location of the transmitting source node. This paper provides a survey of protocols for anonymity that use dummy packet injections. We discuss each technique from the point of their advantages and disadvantages. Further, We provide a comparison for the most promising techniques provided in the literature which use dummy packet injections. A comparison for the adversary assumptions and capabilities will be provided as well.

scholarly journals An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3477 ◽  
Author(s):  
Liangrui Tang ◽  
Zhilin Lu ◽  
Jinqi Cai ◽  
Jiangyu Yan
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Equilibrium Strategy ◽  
Term Operation ◽  
Link Cost ◽  
Transmission Energy Consumption

In energy-constrained wireless sensor networks (WSNs), the design of an energy-efficient smart strategy is a key to extend the network lifetime, but the unbalance of energy consumption and node load severely restrict the long-term operation of the network. To address these issues, a novel routing algorithm which considers both energy saving and load balancing is proposed in this paper. First of all, the transmission energy consumption, node residual energy and path hops are considered to create the link cost, and then a minimum routing graph is generated based on the link cost. Finally, in order to ensure the balance of traffic and residual energy of each node in the network, an “edge-cutting” strategy is proposed to optimize the minimum routing graph and turn it into a minimum routing tree. The simulation results show that, the proposed algorithm not only can balance the network load and prolong the lifetime of network, but meet the needs of delay and packet loss rate.

Sign in / Sign up

Export Citation Format

Share Document