A Matrix-Based Pair-Wise Key Establishment for Secure and Energy Efficient WSN-Assisted IoT

2019 ◽  
Vol 13 (3) ◽  
pp. 91-105 ◽  
Author(s):  
Anurag Shukla Shukla ◽  
Sarsij Tripathi
Keyword(s):  
Energy Efficient ◽  
Secure Communication ◽  
Symmetric Matrix ◽  
Routing Algorithm ◽  
Physical World ◽  
Secure Routing ◽  
Large Area ◽  
Hierarchical Topology ◽  
Wireless Medium ◽  
Efficient Scheme

The Internet of Things (IoT) is getting the reputation as one of the most optimistic networking paradigms that is reducing the gap between the cyber world and physical world. Most of the participating nodes in IoT network are sensors, which are limited in terms of resource such as energy, computation power, memory and so on. In IoT network, nodes communicate with each other via wireless medium, which makes the IoT network vulnerable to many security threats including eavesdropping. The IoT network is deployed in a large area and work on 24/7 hours, so an energy efficient scheme is one of the major issues in IoT. To achieve secure and energy efficient network, this article contributes: (1) A hierarchical topology for IoT network deployment; (2) symmetric matrix-based pair-wise key generation for secure communication; (3) A secure and energy efficient secure routing algorithm for the proposed model.

A secure and energy efficient ant routing algorithm

2020 ◽  
Vol 14 (3) ◽  
pp. 325-336
Author(s):  
Niranjan Panda ◽  
Pankajini Panda
Keyword(s):  
Routing Protocols ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Secure Routing ◽  
Cryptographic Primitives ◽  
Network Nodes ◽  
Prime Concern ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In Mobile Ad hoc Networks (MANETs), setting up an ideal and proficient route linking the conveying bodies is the essential objective of the routing protocols. But any assault during the routing stage may upset the communication, paralyzing the whole network. So, providing security in routing for a protected communication between nodes has become a prime concern. In the present study, we propose a Secure Energy Efficient Ant Routing Algorithm (SEEARA) based on Ant Colony Optimization (ACO) algorithm and cryptographic primitives that exercises on power control and secure routing between a pair of network nodes and increases the performance and longevity of the network. Also, it can be realized during simulation studies that SEEARA shows a better solution in comparison with the previously proposed routing protocols.

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.

Performance Analysis of Energy Efficient Opportunistic Routing Protocols in Wireless Sensor Network

2019 ◽  
Vol 09 ◽  
Author(s):  
Premkumar Chithaluru ◽  
Rajeev Tiwari ◽  
Kamal Kumar
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Data Communication ◽  
Opportunistic Routing ◽  
Link Quality ◽  
Delivery Ratio ◽  
Performance Parameters ◽  
Wireless Medium ◽  
Reduce Energy Consumption

Background: Energy Efficient wireless routing has been an area of research particularly to mitigate challenges surrounding performance in category of Wireless Networks. Objectives: The Opportunistic Routing (OR) technique was explored in recent times and exhibits benefits over many existing protocols and can significantly reduce energy consumption during data communication with very limited compromise on performance. Methods : Using broadcasting nature of the wireless medium, OR practices to discourse two foremost issues of variable link quality and unpredictable node agility in constrained WSNs. OR has a potential to reduce delay in order to increase the consistency of data delivery in network. Results : Various OR based routing protocols have shown varying performances. In this paper, a detailed conceptual and experimental analysis is carried out on different protocols that uses OR technique for providing more clear and definitive view on performance parameters like Message Success Rate, Packet Delivery Ratio and Energy Consumption.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

Sign in / Sign up

Export Citation Format

Share Document