A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
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
Peer-to-Peer Spatial Queries in Sensor Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
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
P-tree: a p2p index for resource discovery applications
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Making the world (of communications) a different place
ACM SIGCOMM Computer Communication Review
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A unifying link abstraction for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Speeding up search in peer-to-peer networks with a multi-way tree structure
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
NBDT: an efficient P2P indexing scheme for web service discovery
International Journal of Web Engineering and Technology
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
SART: dynamic P2P query processing in sensor networks with probabilistic guarantees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
SART: speeding up query processing in sensor networks with an autonomous range tree structure
ACM SIGAPP Applied Computing Review
| Hi-index | 0.00 |
After the debunking of some myths about why P2P overlays are not feasible in sensornets, many such solutions have been proposed. None of the existing P2P overlays for sensornets provide "Energy-Level Application and Services". On this purpose and based on the efficient P2P method presented in [16], we design a novel P2P overlay for Energy Level discovery in a sensornet, the so-called ELDT (Energy Level Distributed Tree). Sensor nodes are mapped to peers based on their energy level. As the energy levels change, the sensor nodes would have to move from one peer to another and this oparation is the most crucial for the efficient scalability of the proposed system. Similarly, as the energy level of a sensor node becomes extremelly low, that node may want to forward it's task to another node with the desired energy level. The adaptation of the P2P index presented in [16] quarantees the best-known query performance of the above operation. We experimentally verify this performance via an appropriate simulator we have designed for this purpose.