KDSR

2020 ◽  
pp. 301-320 ◽  
Author(s):  
Abderrahmen Guermazi ◽  
Abdelfettah Belghith ◽  
Mohamed Abid
Keyword(s):  
Large Scale ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Storage Space ◽  
Replay Attacks ◽  
Node Capture ◽  
Simulation Results ◽  
Secure Network ◽  
Global Broadcast

This article deals with a key distribution protocol to secure routing in large-scale Wireless Sensor Networks (WSNs) and proposes a new protocol called KDSR. The authors' protocol has two originalities: to provide a secure network structure for large-scale WSNs, and to use lightweight local process to share efficiently the Local Broadcast Keys, the Pairwise Keys and the Global Broadcast Key. These keys are useful to secure several communication patterns in WSNs: one-to-many, one-to-one and one-to-all. Security analyses show that KDSR can withstand several attacks against WSNs. Through fast node revocation process, KDSR offers a good resilience against node capture. Immunity against MiM and replay attacks are well checked with the AVISPA tools. The experimentations are done on real TelosB motes and through the TOSSIM simulator. Simulation results confirm that KDSR is scalable, provides a good key connectivity and a good resilience. Comparison to earlier work shows that KDSR causes less computation complexity, less communication overhead and much less storage space even for large-scale WSNs.

KDSR

2018 ◽  
Vol 14 (1) ◽  
pp. 27-45
Author(s):  
Abderrahmen Guermazi ◽  
Abdelfettah Belghith ◽  
Mohamed Abid
Keyword(s):  
Large Scale ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Storage Space ◽  
Computation Complexity ◽  
Replay Attacks ◽  
Node Capture ◽  
Secure Network ◽  
Global Broadcast

This article deals with a key distribution protocol to secure routing in large-scale Wireless Sensor Networks (WSNs) and proposes a new protocol called KDSR. The authors' protocol has two originalities: to provide a secure network structure for large-scale WSNs, and to use lightweight local process to share efficiently the Local Broadcast Keys, the Pairwise Keys and the Global Broadcast Key. These keys are useful to secure several communication patterns in WSNs: one-to-many, one-to-one and one-to-all. Security analyses show that KDSR can withstand several attacks against WSNs. Through fast node revocation process, KDSR offers a good resilience against node capture. Immunity against MiM and replay attacks are well checked with the AVISPA tools. The experimentations are done on real TelosB motes and through the TOSSIM simulator. Simulation results confirm that KDSR is scalable, provides a good key connectivity and a good resilience. Comparison to earlier work shows that KDSR causes less computation complexity, less communication overhead and much less storage space even for large-scale WSNs.

Wireless Sensor Network Mobile Agent Routing Based on the Improved Ant Colony Algorithm

2014 ◽  
Vol 587-589 ◽  
pp. 2339-2345
Author(s):  
Jia Yan Li ◽  
Jun Ping Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Agent ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Redundant Data

This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

2012 ◽  
pp. 55-68
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Characteristic ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Movement Path ◽  
Random Movement ◽  
Simulation Results

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.

scholarly journals Node Deployment in Farmland Wireless Sensor Networks based on Renewable Energy

2016 ◽  
Vol 12 (10) ◽  
pp. 62
Author(s):  
Jianwei Wu ◽  
Yisheng Miao
Keyword(s):  
Wireless Sensor Networks ◽  
Power Consumption ◽  
Large Scale ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Low Power Consumption ◽  
Network Coverage ◽  
Font Size ◽  
Deployment Strategy ◽  
Simulation Results

<p><span style="font-size: small;"><span style="font-family: Times New Roman;">Wireless sensor network (WSN) plays an important role in the large scale farmland environmental monitoring. The complex farmland environment has a great impact on the WSN performance. Extremely low power consumption of WSN is required because of the long monitoring period and limited energy. In the considering of network coverage, connectivity, organization and power consumption, this paper proposes a new deployment strategy in the consideration of solar power nodes. A mixed deployment method combining with structure and random filling deployment is used. The hot-spot nodes in the network are replaced by solar nodes in order to get a longer lifetime. The simulation results show that the new method has a better performance than the traditional algorithms.</span></span></p>

scholarly journals A Time Difference of Arrival-based Localization Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 80 ◽  
Author(s):  
Songbo Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Electromagnetic Wave ◽  
Sensor Networks ◽  
Large Scale ◽  
Time Difference ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Time Difference Of Arrival ◽  
Positioning Accuracy ◽  
Simulation Results

<p class="Abstract"><span lang="EN-US">Aimed at solving the problem of local divergence and low data accuracy, this paper introduces a new Time Difference of Arrival(TDOA)-based localization algorithm (TBL) for the large-scale, high-density wireless sensor networks which are designed for real-time surveillance and unexpected incidents management. In particular, several means to improve the accuracy of distance measurement are investigated, and the TDOA method, based on the sound wave and electromagnetic wave to locate in the large-scale WSN, is discussed. Also, the well-designed circular location process has the advantage of better positioning accuracy and coverage percentage. Simulation results have confirmed the effectiveness of the formed TBL algorithm.</span></p>

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

2011 ◽  
Vol 2 (3) ◽  
pp. 49-63 ◽  
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Characteristic ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Movement Path ◽  
Random Movement ◽  
Simulation Results

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of . Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.

Sign in / Sign up

Export Citation Format

Share Document