CTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks
Published in ACM Transactions on Sensor Networks (TOSN), November 2013.
Abstract
We describe CTP, a collection routing protocol for wireless sensor networks. CTP uses three techniques to provide efficient, robust, and reliable routing in highly dynamic network conditions. CTP’s link estimator accurately estimates link qualities by using feedback from both the data and control planes, using information from multiple layers through narrow, platform-independent interfaces. Second, CTP uses the Trickle algorithm to time the control traffic, sending few beacons in stable topologies yet quickly adapting to changes. Finally, CTP actively probes the topology with data traffic, quickly discovering and fixing routing failures. Through experiments on 13 different testbeds, encompassing 7 platforms, 6 link layers, and multiple densities and frequencies, and detailed observations of a long-running sensor network application that uses CTP, we study how these three techniques contribute to CTP’s overall performance.
Paper (1MB)
BibTeX entry
@inproceedings{ctp-tosn14, author = "Omprakash Gnawali and Rodrigo Fonseca and Kyle Jamieson and Maria Kazandjieva and David Moss and Philip Levis", title = "{CTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks}", booktitle = "{ACM Transactions on Sensor Networks (TOSN)}", year = {2013}, month = {November} }





Login