Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
CSN: A Network Protocol for Serving Dynamic Queries in Large-Scale Wireless Sensor Networks
CNSR '04 Proceedings of the Second Annual Conference on Communication Networks and Services Research
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
ADCOM '07 Proceedings of the 15th International Conference on Advanced Computing and Communications
ScatterPastry: An Overlay Routing Using a DHT over Wireless Sensor Networks
IPC '07 Proceedings of the The 2007 International Conference on Intelligent Pervasive Computing
Hi-index | 0.00 |
Peer-to-Peer (P2P) overlay can be applied on wireless sensor networks (WSN) for efficient data lookup and enabling the whole network online. Most of the P2P lookup techniques are distributed hash table (DHT) based id routing protocol. Applying P2P overlay on WSN mandates a distributed algorithm for unique id assignment to each sensor nodes. This paper presents DPUid, an efficient distributed algorithm for proximity based unique id assignment for each sensor node. The concept of DPUid is supported by necessary experimental results.