Building an efficient P2P overlay for energy-level queries in sensor networks
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
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
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 |
A fundamental problem that confronts future applicationsof sensor networks is how to efficiently locate the sensornode that stores a particular data item. It is knownthat distributed hash table (DHT) based Internet peer-to-peer(P2P) protocols provide near-optimum data lookuptimes for queries made on networks of distributed nodes[2, 23-25]. A generic mapping of these protocols to sensornetworks is, however, perceived as difficult [1]. Wepresent a novel DHT based network protocol for sensornetworks 驴 Chord for Sensor Networks (CSN) 驴 for whichbounded times for data lookup, in the order of O(logN)messages, can be achieved in an energy efficient manner.CSN makes system lifetime of the sensor network proportionalto its effective use. Furthermore, CSN scales wellto large-scale sensor networks when the information aboutother nodes logarithmically increases with an increase inthe number of sensor nodes.