Distributed Hash Table For Scalable Wireless Sensor Network

Abstract

In recent years, wireless sensor networks (WSNs) has gained a lot of attention in both research and application elds. A fundamental goal of researches in WSNs is to re- duce 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 sev- eral 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 pack- ets over multiple paths with Round Robin Algorithm to improve the Network Life Time.We have implemented Round Robin Algorithm over multiple paths and com- pared various implementations with parameters like Network Life Time, Throughput, End to End Delay.