Protecting Location Privacy against Traffic Analysis in Wireless Sensor Networks with LEACH Routing Protocol

2014 ◽  
Vol 513-517 ◽  
pp. 1233-1240
Author(s):  
Yu Mei Wang ◽  
Xun Xue Cui ◽  
Xi Hui Fan
Keyword(s):  
Routing Protocol ◽  
Hot Spots ◽  
Location Privacy ◽  
Traffic Analysis ◽  
Base Station ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Traffic Pattern ◽  
Analysis Techniques ◽  
High Data

Traffic analysis attacks are always adopted to threaten the safety of base station in a wireless sensor network (WSN) which uses LEACH routing protocol. Typical packet traffic in such a network may expose the pronounced patterns which would allow an adversary analyzing traffic to deduce the location of base station. The paper proposes two defending algorithms based on LEACH routing protocol to deal with these traffic analysis techniques and conceal the true traffic pattern. First, a Random Hot Spots Algorithm (RHSA) has been developed to randomly construct several communication areas with fake local high data to protect the base station of a WSN. Secondly, an Anonymous Communication Algorithm (ACA) is proposed to hide identities of all nodes that participate in the process of packet transmission by generating pseudonyms dynamically. Simulation results show that RHSA and ACA can effectively deceive and misdirect the adversary, and protect the location of a base station against attacks.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

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.

scholarly journals Security Techniques for Wormhole Attack in Wireless Sensor Networks

2018 ◽  
Vol 7 (2.23) ◽  
pp. 59 ◽  
Author(s):  
Surinder Singh ◽  
Hardeep Singh Saini
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Base Station ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Security Threat ◽  
Wormhole Attack ◽  
Protocol Security ◽  
Routing Mechanism ◽  
Packet Drop

The wireless sensor network has group of sensors which can sense the data and route this data to base station. As there is no physical connection between sensor and base station the important data can be routed without wires. The broadcast nature of wireless sensor network makes it prone to security threat to the valuable data. The attacker node can detect the data by creating their own data aggregation and routing mechanism .The number of attacks can be possible on the network layer. Out of these attacks wormhole is one of the major attack which can change the routing method of the whole wireless sensor network. In this attack,the attacker node can control the packet transmission of whole network and route it to the tunnel of nodes. The major drawback of this attack is to increase the packet drop and disturbing the routing mechanism. A number of security techniques are developed by the researcher to reduce the packet drop ratio and secure the routing mechanism of the network. Out of all thesetechniquesfew related to packet drop ratio are discussed in this paper. TheLightweight countermeasure for the wormhole attack (LITEWORP) based on Dynamic Source routing (DSR) protocol security technique,Delay Per Hop Indication (Delphi) based on AODV(Avoidance Routing Protocol) Protocol security technique and MOBIWORP based on DSRprotocol security technique reduce the packet loss percentage 40%,43% and 35% respectively.   

scholarly journals An Enhanced Heterogeneous Gateway-Based Energy-Aware Multi-hop Routing Protocol for Wireless Sensor Networks

2022 ◽  
Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Base Station ◽  
Communication Strategy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Routing Scheme

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

Source Location Privacy Using Ant Colony Optimization in Wireless Sensor Networks

2016 ◽  
pp. 227-245
Author(s):  
Jyoti Prakash Singh ◽  
Paramartha Dutta
Keyword(s):  
Ant Colony Optimization ◽  
Location Privacy ◽  
Source Location ◽  
Base Station ◽  
Ant Colony ◽  
Source Node ◽  
Wireless Sensor ◽  
Difficult Situation ◽  
Source Location Privacy ◽  
Pheromone Level

One of the important application domain of sensor network is monitoring a region and/or tracking a target. In such type of applications, the location of the source node tracking that target is very important. At the same time, if the location of the node currently tracking the target is captured by an adversary then that target may fall into a difficult situation. In this chapter, a solution to source location privacy with the help of Ant Colony Optimization is proposed. The idea of pheromone level is normally used to find out the shortest path between the source node and the base station that to minimize the energy consumption of the networks. The pheromone level of the ants is used here to guide the ants to follow different paths to hide the source location from adversaries who uses traffic analysis to capture the source node.

Power Layer Energy Efficient Routing Protocol in Wireless Sensor Network (PLRP)

2013 ◽  
Vol 5 (1) ◽  
pp. 57-68 ◽  
Author(s):  
Sardjoeni Moedjiono ◽  
Aries Kusdaryono
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Node ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Energy Efficient Routing

Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, the authors propose power layer energy efficient routing protocol in wireless sensor network, named PLRP, which use power control and multi-hop routing protocol to control overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. The main idea of PLRP is the use of power control, which divide sensor node into group by base station uses layer of energy and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of PLRP compared to BCDCP and BIDRP based of hierarchical routing protocol. The simulation results show that PLRP achieve 25% and 30% of improvement on network lifetime.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

Sign in / Sign up

Export Citation Format

Share Document