Distributed Hash Table For Scalable Wireless Sensor Network
In recent years, wireless sensor networks (WSNs) has gained a lot of attention in both research and application fields. A fundamental goal of researches in WSNs is to reduce the communication operations and prolong the total lifetime of sensor networks. Therefore, researchers are focusing on optimal routing techniques which are one of the main factors to reduce energy usage of sensor nodes and wireless sensor networks.
Distributed Hash Tables (DHTs) over WSNs is a new routing paradigm promises several advantages over conventional routing protocols. This thesis presents an overview of using DHTs in WSNs, especially routing techniques using DHTs over WSNs such as GHT, CSN, CHR, T-DHT, VRR and ScatterPastry and how can we transmit packets over multiple paths with Round Robin Algorithm to improve the Network Life Time. We have implemented Round Robin Algorithm over multiple paths and compared various implementations with parameters like Network Life Time, Throughput,End to End Delay.
// <![CDATA[ (function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){ (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o), m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m) })(window,document,'script','//www.google-analytics.com/analytics.js','ga'); ga('create', 'UA-39522914-1', 'tumblr.com'); ga('send', 'pageview'); // ]]>
