Abstract
Distributed Hash Table (DHT)-based protocols are new approaches proposed to Wireless Sensor Networks (WSN). Their main advantage resides on the easy integration of DHT-based WSN into the Internet Of Things. However, these protocols face multiple challenges in their bootstrapping phase, especially at the case of randomly deployed WSN. We presented in a recent work a bootstrapping protocol for use in DHT-based protocols having the structure of ring in static WSN. However, in most cases, there are some nodes that may fail or move in the network. Bootstrapping should take into account such situations in order to achieve better performance. In this paper, we propose a distributed local recovery method for use in our bootstrapping protocol that allows it to handle efficiently nodes failure and mobility. Simulation results have shown that our proposed approach is able to ensure the local recovery in a timely and energy-efficient manner.
Highlights
The Internet Of Things (IOT) [17] is the future vision of Internet: Internet is no more related to the virtual world but it is extended to our real life
We propose a distributed local recovery method for use in our bootstrapping protocol that allows it to handle efficiently nodes failure and mobility
We propose a distributed local recovery mechanism that can be integrated into our proposed bootstrapping protocol in order to handle efficiently nodes failure and/or mobility in the network
Summary
The Internet Of Things (IOT) [17] is the future vision of Internet: Internet is no more related to the virtual world but it is extended to our real life. The bootstrapping phase of these DHT-based protocols is so challenging at the case of randomly deployed WSN since all the nodes are scattered simultaneously and start joining the network at the same time. They will exchange lot of simultaneous messages which leads to interference problems. In a recent work [15], we have proposed a bootstrapping approach that avoids concurrent joining and that forms directly one global consistent ring in randomly deployed static WSN This is ensured by organizing all the nodes into a tree and orchestrating the nodes joining from root to children nodes in a way that at a given time only one node joins the network.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Recent Contributions from Engineering, Science & IT (iJES)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
