Secure Key Establishment in Wireless Sensor Networks

Author(s):  
Suman Bala ◽  
Gaurav Sharma ◽  
Anil K. Verma

Over the last two decades, advancement in pervasive sensing, embedded computing and wireless communication has lead an attention to a new research area of engineered systems termed as Cyber-Physical Systems (CPS). CPS has bridged the gap between the physical world to the cyber world. It is envisioned that Wireless Sensor Networks (WSN) plays an important role in the actuality of CPS. Due to wireless communication in WSN, it is more vulnerable to security threats. Key establishment is an approach, which is responsible for establishing a session between two communicating parties and therefore, a lightweight key establishment scheme is essential. In this chapter, we review the state of the art of these solutions by discussing key establishment in WSN. Also, a discussion has been carried out to capture few challenges in implementing them in real and future research directions in this area are explored to transport the field to an improved level.

2018 ◽  
pp. 883-908
Author(s):  
Suman Bala ◽  
Gaurav Sharma ◽  
Anil K. Verma

Over the last two decades, advancement in pervasive sensing, embedded computing and wireless communication has lead an attention to a new research area of engineered systems termed as Cyber-Physical Systems (CPS). CPS has bridged the gap between the physical world to the cyber world. It is envisioned that Wireless Sensor Networks (WSN) plays an important role in the actuality of CPS. Due to wireless communication in WSN, it is more vulnerable to security threats. Key establishment is an approach, which is responsible for establishing a session between two communicating parties and therefore, a lightweight key establishment scheme is essential. In this chapter, we review the state of the art of these solutions by discussing key establishment in WSN. Also, a discussion has been carried out to capture few challenges in implementing them in real and future research directions in this area are explored to transport the field to an improved level.


2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Beom-Su Kim ◽  
HoSung Park ◽  
Kyong Hoon Kim ◽  
Daniel Godfrey ◽  
Ki-Il Kim

Generally, various traffic requirements in wireless sensor network are mostly dependent on specific application types, that is, event-driven, continuous, and query-driven types. In these applications, real-time delivery is one of the important research challenges. However, due to harsh networking environment around a node, many researchers usually take different approach from conventional networks. In order to discuss and analyze the advantage or disadvantage of these approaches, some comprehensive survey literatures were published; however they are either out of date or compiled for communication protocols on single layer. Based on this deficiency, in this paper, we present the up-to-date research approaches and discuss the important features related to real-time communications in wireless sensor networks. As for grouping, we categorize the approaches into hard, soft, and firm real-time model. Furthermore, in all these categories, research has been focused on MAC and scheduling and routing according to research area or objective in second level. Finally, the article also suggests potential directions for future research in the field.


Author(s):  
Noor Zaman ◽  
Low Tang Jung ◽  
Vasaki Ponnusamy

Wireless Sensor Networks (WSNs) are gaining popularity in many monitoring and event detection areas. But the limitation of low power sensors needs to be further researched to combat the self-healing aspect of sensor networks. Therefore this paper aims to present a survey on application of self-healing routing protocols in wireless sensor networks that have been designed by analyzing their operation, advantages and disadvantages. This presents an outline of each application of the protocol and an idea of how these features could be adapted into future research area in self-healing wireless sensor networks in terms of energy aspect. The self-healing characteristics are mainly derived from biologically-inspired mechanisms for autonomic behavior. Autonomic behavior systems are characterized into four functional systems as self-configuration, self-healing, self-optimization and self-protection. This survey mainly focuses on self-healing characteristics from the biologically-inspired perspectives as well as non-bio-inspired perspectives.


2020 ◽  
pp. 1601-1618
Author(s):  
Noor Zaman ◽  
Low Tang Jung ◽  
Vasaki Ponnusamy

Wireless Sensor Networks (WSNs) are gaining popularity in many monitoring and event detection areas. But the limitation of low power sensors needs to be further researched to combat the self-healing aspect of sensor networks. Therefore this paper aims to present a survey on application of self-healing routing protocols in wireless sensor networks that have been designed by analyzing their operation, advantages and disadvantages. This presents an outline of each application of the protocol and an idea of how these features could be adapted into future research area in self-healing wireless sensor networks in terms of energy aspect. The self-healing characteristics are mainly derived from biologically-inspired mechanisms for autonomic behavior. Autonomic behavior systems are characterized into four functional systems as self-configuration, self-healing, self-optimization and self-protection. This survey mainly focuses on self-healing characteristics from the biologically-inspired perspectives as well as non-bio-inspired perspectives.


2016 ◽  
Vol 10 (6) ◽  
pp. 50 ◽  
Author(s):  
Tayebeh Ramezani ◽  
Tahereh Ramezani

In recent years most of the research in the field of sensor networks is allocated to the wireless sensor and actor networks due to their complicacy and vastness of research area. This type of network is a group of sensors and actors wirelessly linked to each other. Sensors gather information of physical world while actors take appropriate decisions on the basis of gathered information and then perform proper actions upon the environment. In wireless sensor and actor networks, it is very important to maintain the connection between actors. Failure of one or more actors can break up the network into separated parts and this failure acts as a barrier to the network to perform its duties. The purpose of the present paper was to provide a genetic algorithm in wireless sensor and actor networks, to improve evaluation and to maintain the connection between actors’ networks. In order to evaluate strong points and weaknesses of the recommended approach, the OMNet++ simulation was used and the outcomes of the simulation were indicative of the recommended approach’s validity.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2011 ◽  
Vol 55 (8) ◽  
pp. 1849-1863 ◽  
Author(s):  
Ali Fanian ◽  
Mehdi Berenjkoub ◽  
Hossein Saidi ◽  
T. Aaron Gulliver

Sign in / Sign up

Export Citation Format

Share Document