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
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
P2P Networking and Applications
P2P Networking and Applications
Building an efficient P2P overlay for energy-level queries in sensor networks
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.00 |
We consider the problem of constructing efficient P2P overlays for sensornets providing "Energy-Level Application and Services". In this context, assuming that a sensor is responsible for executing some program task but unfortunately it's energy-level is lower than a pre-defined threshold. Then, this sensor should be able to introduce a query to the whole system in order to discover efficiently another sensor with the desired energy level, in which the task overhead must be eventually forwarded. In this way, the "Life-Expectancy" of the whole network could be increased. 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 operation is very crucial for the efficient scalability of the proposed system. Similarly, as the energy level of a sensor node becomes extremely low, that node may want to forward it's task to another node with the desired energy level. The method presented in [10] presents a novel P2P overlay for Energy Level discovery in a sensornet. However, this solution is not dynamic, since requires periodical restructuring. In particular, it is not able to support neither join of sensor_nodes with energy level out of the ranges supported by the existing p2p overlay nor leave of empty overlay_peers to which no sensor_nodes are currently associated. On this purpose and based on the efficient P2P method presented in [11], we design a dynamic P2P overlay for Energy Level discovery in a sensornet, the so-called SART (Sensors' Autonomous Range Tree). The adaptation of the P2P index presented in [11] guarantees the best-known dynamic query performance of the above operation. We experimentally verify this performance, via the D-P2P-Sim simulator.