Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A case for hierarchical routing in low-power wireless embedded networks

A case for hierarchical routing in low-power wireless embedded networks A Case for Hierarchical Routing in Low-Power Wireless Embedded Networks KONRAD IWANICKI, University of Warsaw MAARTEN VAN STEEN, VU University Amsterdam Hierarchical routing has often been mentioned as an appealing point-to-point routing technique for wireless sensor networks (sensornets). While there is a volume of analytical and high-level simulation results demonstrating its merits, there has been little work evaluating it in actual sensornet settings. This article bridges the gap between theory and practice. Having analyzed a number of proposed hierarchical routing protocols, we have developed a framework that captures the common characteristics of the protocols and identifies design points at which the protocols differ. We use a sensornet implementation of the framework in TOSSIM and on a 60-node testbed to study various trade-offs that hierarchical routing introduces, as well as to compare the performance of hierarchical routing with the performance of other routing techniques, namely shortest-path routing, compact routing, and beacon vector routing. The results show that hierarchical routing is a compelling routing technique also in practice. In particular, despite only logarithmic routing state, it can offer small routing stretch: an average of 1.25 and a 99th percentile of 2. It can also be robust, minimizing the maintenance traffic http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Sensor Networks (TOSN) Association for Computing Machinery

A case for hierarchical routing in low-power wireless embedded networks

Download PDF
34 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-case-for-hierarchical-routing-in-low-power-wireless-embedded-a3fC8uIIu1
Publisher
Association for Computing Machinery
Copyright
Copyright © 2012 by ACM Inc.
ISSN
1550-4859
DOI
10.1145/2240092.2240099
Publisher site
See Article on Publisher Site

Abstract

A Case for Hierarchical Routing in Low-Power Wireless Embedded Networks KONRAD IWANICKI, University of Warsaw MAARTEN VAN STEEN, VU University Amsterdam Hierarchical routing has often been mentioned as an appealing point-to-point routing technique for wireless sensor networks (sensornets). While there is a volume of analytical and high-level simulation results demonstrating its merits, there has been little work evaluating it in actual sensornet settings. This article bridges the gap between theory and practice. Having analyzed a number of proposed hierarchical routing protocols, we have developed a framework that captures the common characteristics of the protocols and identifies design points at which the protocols differ. We use a sensornet implementation of the framework in TOSSIM and on a 60-node testbed to study various trade-offs that hierarchical routing introduces, as well as to compare the performance of hierarchical routing with the performance of other routing techniques, namely shortest-path routing, compact routing, and beacon vector routing. The results show that hierarchical routing is a compelling routing technique also in practice. In particular, despite only logarithmic routing state, it can offer small routing stretch: an average of 1.25 and a 99th percentile of 2. It can also be robust, minimizing the maintenance traffic

Journal

ACM Transactions on Sensor Networks (TOSN) – Association for Computing Machinery

Published: Jul 1, 2012

There are no references for this article.