DPUid: distributed algorithm for proximity-based unique id in wireless sensor networks
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
| Hi-index | 0.00 |
Efficiently locate data is a fundamental problem for future applications of wireless sensor networks (WSNs). It is known that distributed hash table (DHT) based In- ternet peer-to-peer (P2P) protocols provide near-optimum data lookup times for queries made on networks of dis- tributed nodes. In this paper we propose a novel two-tier Chord based network protocol for serving efficient queries in WSNs (C2WSN), which has a O (log M +log i) bounded times for data lookup, where M is the number of cluster and i is the maximal number of sensor nodes within a clus- ter, respectively. Furthermore, in C2WSN a new dynamic rotation mechanism of cluster head is presented, which in- creases the network lifetime greatly.