scholarly journals CIDF-WSN: A Collaborative Interest and Data Forwarding Strategy for Named Data Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5174
Author(s):  
Muhammad Salah ud din ◽  
Muhammad Atif Ur Rehman ◽  
Byung-Seo Kim

Recent years have witnessed the huge popularity of Information-Centric Networking (ICN) and its realization as Named Data Networking (NDN) in the context of wireless sensor networks (WSNs). The participating nodes in WSNs are usually equipped with a single radio interface. The existing solutions lack in providing the efficient next forwarder selection in NDN-based single radio WSNs. In this work, we propose a collaborative Interest and Data Forwarding (CIDF-WSN) Strategy for Named Data Wireless Sensor Networks. CIDF-WSN develop a Neighbor Information Base (NFIB) which enables the node to select the optimal next-hop relay in Interest packet forwarding. An efficient Interest packet processing mechanism assisted by the Interest Cache Table (ICT) is provided to avoid Interest packets loss and frequent re-transmissions. In addition, CIDF-WSN also provides a robust Data packet transfer mechanism accompanied by the Temp Cache Table (TCT) to avoid Data packet losses and to ensure well-timed content delivery. Simulation results reveal that CIDF-WSN outperforms the recently published works in terms of Interest satisfaction rate, total energy consumption, Data retrieval delays, and communication overhead.

Author(s):  
Y. Harold Robinson ◽  
R. Santhana Krishnan ◽  
K. Lakshmi Narayanan ◽  
Y. Reeginal ◽  
G.Vinoth Rajkumar ◽  
...  

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Haiping Huang ◽  
Qinglong Huang ◽  
Fu Xiao ◽  
Wenming Wang ◽  
Qi Li ◽  
...  

Broadcast authentication is a fundamental security primitive in wireless sensor networks (WSNs), which is a critical sensing component of IoT. Although symmetric-key-based μTESLA protocol has been proposed, some concerns about the difficulty of predicting the network lifecycle in advance and the security problems caused by an overlong long hash chain still remain. This paper presents a scalable broadcast authentication scheme named DH-μTESLA, which is an extension and improvement of μTESLA and Multilevel μTESLA, to achieve several vital properties, such as infinite lifecycle of hash chains, security authentication, scalability, and strong tolerance of message loss. The proposal consists of the t,n-threshold-based self-reinitializable hash chain scheme (SRHC-TD) and the d-left-counting-Bloom-filter-based authentication scheme (AdlCBF). In comparison to other broadcast authentication protocols, our proposal achieves more security properties such as fresh node’s participation and DoS resistance. Furthermore, the reinitializable hash chain constructed in SRHC-TD is proved to be secure and has less computation and communication overhead compared with typical solutions, and efficient storage is realized based on AdlCBF, which can also defend against DoS attacks.


Sensors ◽  
2011 ◽  
Vol 11 (1) ◽  
pp. 964-991 ◽  
Author(s):  
Carlene E.-A. Campbell ◽  
Kok-Keong Loo ◽  
Orhan Gemikonakli ◽  
Shafiullah Khan ◽  
Dhananjay Singh

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769198
Author(s):  
Dongwei Li ◽  
Jingli Du ◽  
Linfeng Liu

The underwater wireless sensor networks composed of sensor nodes are deployed underwater for monitoring and gathering submarine data. Since the underwater environment is usually unpredictable, making the nodes move or be damaged easily, such that there are several vital objectives in the data forwarding issue, such as the delivery success rate, the error rate, and the energy consumption. To this end, we propose a data forwarding algorithm based on Markov thought, which logically transforms the underwater three-dimensional deployment model into a two-dimensional model, and thus the nodes are considered to be hierarchically deployed. The data delivery is then achieved through a “bottom to top” forwarding mode, where the delivery success rate is improved and the energy consumption is reduced because the established paths are more stable, and the proposed algorithm is self-adaptive to the dynamic routing loads.


Sign in / Sign up

Export Citation Format

Share Document