Self-adaptive Route Selection for DHT in Wireless Sensor Networks
-
1
Osaka University, Graduate School of Information Science and Technology, Japan
Using distributed hash tables (DHTs) over wireless sensor networks (WSNs) as the overlay layer has gained much attention recently because of its well designed topology and efficient data management [1]. The data of sensor nodes are stored in the overlay network, which ensures the data integrity against node failures. Nodes in a WSN are randomly deployed and may switch to sleep mode or fail due to the energy depletion, which results in changes of the network topology. Retrieving data is therefore a challenging task in such distributed and varying environments. Query latency is the most important performance metric in DHT and may not be proportional to the hop count along a route. Proximity neighbor/route selection (PNS/PRS) are used to find the shortest route and reduce latency based on the basic DHT routing. However, most existing works on PNS and PRS suffer from high overhead and frequent node arrival and departure (churn). Therefore, we propose a proximity-aware routing algorithm based on Pastry [2], dubbed Pastry-AS, to provide self-adaptive selection of routes and neighbors based on attractor selection [3], a biologically inspired model which operates well in ambient and fluctuating environments. Attractor selection performs a stochastic adaptation of its system state taking into account environmental changes by to an activity term, and converges to a stable state known as an attractor.
In Pastry, each node has a unique ID and maintains a leafset and routing table, which corresponds to the partition of the node ID space. We propose a redundant routing table (RRT) to implement both route selection and parallel query forwarding. A passive routing table maintenance scheme is used to piggyback the routing information onto the query requests and ACKs. Only r candidates with IDs within a particular range are stored in the RRT entry as possible states, among which attractor selection is performed inspired by the equations in [3]. The performance of the selected route, such as the measured RTT, is mapped to the activity and influences the next selection. Finally, an attractor is selected from close-by neighbors. Since the topology of WSNs is always changing, whenever a node discovers new neighbors or their departure, the activity becomes low and drives the node to search for a new attractor solution. Thus, a low latency is achieved after several selections without any explicit probing and it is also maintained under churn. Parallel query forwarding is enabled by the nodes with sufficient bandwidth to achieve less timeouts and quick dissemination of the routing information. Compared with the original Pastry, we expect Pastry-AS to achieve lower latency in routing and less overhead in the routing table maintenance. In a dynamic network, RRT and parallel forwarding achieve a very low probability of timeouts, which further reduces the latency.
References
1. A.A.-B. Al-Mamou, H. Labiod. ScatterPastry: An overlay routing using a DHT over wireless sensor networks. In Proc. of IPC’07, October 2007.
2. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of Middleware’01, November 2001.
3. A. Kashiwagi, I. Urabe, K. Kaneko, and T. Yomo. Adaptive response of a gene network to environmental changes by fitness-induced attractor selection. PLoS ONE 1(1): e49, December 2006.
Conference:
2nd International Workshop on Sensor Networks and Ambient Intelligence In conjunction with PDCAT'09, Hiroshima, Japan, 8 Dec - 11 Dec, 2009.
Presentation Type:
Poster Presentation
Topic:
Poster Presentations
Citation:
Lin
R,
Leibnitz
K,
Wakamiya
N and
Murata
M
(2009). Self-adaptive Route Selection for DHT in Wireless Sensor Networks.
Front. Neuroinform.
Conference Abstract:
2nd International Workshop on Sensor Networks and Ambient Intelligence In conjunction with PDCAT'09.
doi: 10.3389/conf.neuro.11.2009.16.010
Copyright:
The abstracts in this collection have not been subject to any Frontiers peer review or checks, and are not endorsed by Frontiers.
They are made available through the Frontiers publishing platform as a service to conference organizers and presenters.
The copyright in the individual abstracts is owned by the author of each abstract or his/her employer unless otherwise stated.
Each abstract, as well as the collection of abstracts, are published under a Creative Commons CC-BY 4.0 (attribution) licence (https://creativecommons.org/licenses/by/4.0/) and may thus be reproduced, translated, adapted and be the subject of derivative works provided the authors and Frontiers are attributed.
For Frontiers’ terms and conditions please see https://www.frontiersin.org/legal/terms-and-conditions.
Received:
24 Nov 2009;
Published Online:
24 Nov 2009.
*
Correspondence:
Rui Lin, Osaka University, Graduate School of Information Science and Technology, Osaka, Japan, r-lin@ist.osaka-u.ac.jp