NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Centroid virtual coordinates - A novel near-shortest path routing paradigm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of gradient-based routing protocols in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Performance evaluation of priority CSMA-CA mechanism on ISA100.11a wireless network
Computer Standards & Interfaces
Review: A gradient based routing scheme for street lighting wireless sensor networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
IETF ROLL has recently proposed gradient routing as a fundamental building block for data collection in Wireless Sensor Networks. This paper seconds this choice by presenting an implementation of gradient routing on current hardware, and by showing experimentally that gradient routing is robust against topological changes. To stress its self-healing quality, we design and implement a complete communication stack in which neighbor tables are built in a purely reactive fashion. We quantify the resulting topological changes, and show how gradient routing elegantly handles these dynamics. This paper presents, to the best of our knowledge, the first experimental study on gradient routing as advocated by IETF ROLL.