Attacks and Secure Geographic Routing In Wireless Sensor Networks

2017 ◽  
Vol 5 (1) ◽  
pp. 147 ◽  
Author(s):  
Sabri Yassine ◽  
Najib El Kamoun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Average Energy ◽  
Geographic Routing ◽  
Trust Model ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Wormhole Attack

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks. GRPW, a geographical routing protocol for wireless sensor networks, is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. The wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s. Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node, which is suitable for the sensor network.

scholarly journals Energy-Efficient MAC Protocol for Wireless Sensor Networks - A Review

2012 ◽  
pp. 107-111
Author(s):  
Smriti Joshi ◽  
Anant Kr. Jayswal
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Load Balance ◽  
Mac Protocol ◽  
Average Energy ◽  
Wireless Sensor ◽  
Wsn Lifetime

Energy efficiency is the kernel issue in the designing of wireless sensor network(WSN) MAC protocols. Energy efficiency is a major consideration while designing wireless sensor network nodes. Most sensor network applications require energy autonomy for the complete lifetime of the node, which may span up to several years. These energy constraints require that the system be built such that Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. Each component consumes minimum possible power, ensure the average successful transmission rate, decrease the data packet average waiting time, and reduce the average energy consumption. Influencing by the design principles of traditional layered protocol stack, current MAC protocol designing for wireless sensor networks (WSN) seldom takes load balance into consideration, which greatly restricts WSN lifetime. As a novel Forwarding Election-based MAC protocol, is presented to prolong WSN lifetime by means of improving energy efficiency and enhancing load balance.

Improving DV-Hop-Based Localization Algorithms in Wireless Sensor Networks by Considering Only Closest Anchors

2020 ◽  
Vol 14 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Amanpreet Kaur ◽  
Padam Kumar ◽  
Govind P. Gupta
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Geographic Routing ◽  
Location Based Services ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Significant Attention

Localization problem has gained a significant attention in the field of wireless sensor networks in order to support location-based services or information such as supporting geographic routing protocols, tracking events, targets, and providing security protection techniques. A number of variants of DV-Hop-based localization algorithms have been proposed and their performance is measured in terms of localization error. In all these algorithms, while determining the location of a non-anchor node, all the anchor nodes are taken into consideration. However, if only the anchors close to the node are considered, it will be possible to reduce the localization error significantly. This paper explores the effect of the close anchors in the performance of the DV-Hop-based localization algorithms and an improvement is proposed by considering only the closest anchors. The simulation results show that considering closest anchors for estimation of the location reduces localization error significantly as compared to considering all the anchors.

Dynamic Queue Synchronization for Congestion Control Over Wireless Sensor Networks

2020 ◽  
Vol 17 (6) ◽  
pp. 2562-2574
Author(s):  
Shilpy Ghai ◽  
Vijay Kumar ◽  
Rohit Vaid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Sensor Network ◽  
Routing Protocols ◽  
End Users ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Buffer Length ◽  
Critical Challenge

Congestion control over resource constrained sensor network is a critical challenge and it is also quite hard to fulfill the QoS constraints for end users. In this paper, a dynamic queue synchronization (DQS) scheme is introduced that can alter the data rate dynamically as per the current buffer length. Its performance is compared with existing schemes i.e., Dynamic Round Robin (DRR) and Random Early Discard (RED) using different routing protocols i.e., LEACH/PEGASIS/TEEN under various constraints (Throughput/End-to-End Delay/Routing Load/Energy).

scholarly journals Hierarchical Energy Efficient Routing in Wireless Sensor Networks and its Challenges

2019 ◽  
Vol 9 (1) ◽  
pp. 4024-4027
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Route Of Transmission

Wireless sensor network consists of various sensor nodes connected through wireless media. Sensor nodes are tiny devices having lesser energy capabilities. Sensor nodes are either ad-hoc or mobile in their environment. Wireless sensor network route of transmission media is discovered by routing protocols and responsible for secure communication between sensor nodes. Energy is a precious resource of sensor nodes, and the entire lifetime of WSNs is depending on the energy capability of the sensor nodes. The fundamental problem is how to organize topology of WSN for deployed sensor nodes with lesser power consumption as possible. Major problems in wireless sensor networks which consume extra energy are interference, control message overhead, packet delay, unnecessary transmission, and bandwidth utilization. Therefore, energy efficient techniques are needed to overcome these problems. Hierarchical routing is the best routing method for finding optimal path between sensor nodes which enhance the lifetime of the network. This paper focuses towards various hierarchical energy efficient routing in wireless sensor networks and analyzes various features of WSN that should consider during designing of routing protocols.

scholarly journals Detecting and Preventing Sybil Attacks in Wireless Sensor Networks Using Message Authentication and Passing Method

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Udaya Suriya Raj Kumar Dhamodharan ◽  
Rajamani Vayanaperumal
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Message Authentication ◽  
Sybil Attack ◽  
Verification Method ◽  
Wormhole Attack ◽  
Network Protection

Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting.

STBCP: An Energy Efficient Sub-threshold Bee Colony-based Protocol for Wireless Sensor Networks

2019 ◽  
Vol 9 (4) ◽  
pp. 443-453
Author(s):  
Ghazaleh Kia ◽  
Alireza Hassanzadeh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Efficient ◽  
Average Energy ◽  
Wireless Sensor ◽  
Battery Lifetime ◽  
Bee Colony

Background & Objective: In this paper, a new energy efficient LEACH-based protocol for wireless sensor network is presented. One of the main issues in Wireless Sensor Networks (WSNs) is the battery consumption. In fact, changing batteries is a time consuming task and expensive. It is even impossible in many remote WSNs. Methods: The main goal of the presented protocol is to decrease the energy consumption of each node and increase the network lifetime. Lower power consumption results in longer battery lifetime. This protocol takes the advantage of sub-threshold technique and bee colony algorithm in order to optimize the energy consumption of a WSN. Simulation results show that the energy consumption of the wireless sensor network reduces by 25 percent using STBCP in comparison with recent LEACHbased protocols. It has been shown that the average energy of the network remains balanced and the distribution of residual energy in each round is equitable. Conclusion: In addition, the lifetime of a network using STBCP protocol has been increased by 23 percent regarding recently presented routing protocols.

Sign in / Sign up

Export Citation Format

Share Document