Building an efficient P2P overlay for energy-level queries in sensor networks

Abstract

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.

Sart

“…The master node of level i maintains information (in its local finger table) about all its slave nodes and 2 2 i−1 other master nodes (you can find more details about master and slave nodes in [15]). All queries are resolved in a distributed manner with a bound of O(log 2 b log N ) messages.…”

“…The majority of existing P2P overlays for sensornets were designed in a DHT fashion and the best current solution is the TChord. On the contrary, ELDT [15] is the only existing P2P protocol for sensornets, which combines the benefits of both DHT and hierarchical [14] clustering fashions. In this solution, sensor nodes are mapped to peers based on their energy level.…”

“…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 [15] presents a novel P2P overlay for Energy Level discovery in a sensornet. However, this solution is not dynamic, since requires periodical restructuring.…”

SART: Speeding up Query Processing in Sensor Networks with an Autonomous Range Tree Structure

“…The SART protocol (see figure 1) is an hierarchical arrangement of some sensor nodes (master nodes). The master node of level i maintains information (in its local finger table) about all its slave nodes and 2 2 i−1 other master nodes (you can find more details about master and slave nodes in [15]). All queries are resolved in a distributed manner with a bound of O(log 2 b log N ) messages.…”