Forwarder Selection in Multi-Transmitter Networks

Download PDF.

“ Forwarder Selection in Multi-Transmitter Networks ” by Doug Carlson, Marcus Chang, Andreas Terzis, Yin Chen, and Omprakash Gnawali. In Proceedings of the 9th International Conference on Distributed Computing in Sensor Systems (DCOSS 2013) , May 2013.

Abstract

Recent work has shown that network protocols which rely on precisely-timed concurrent transmissions can achieve reliable, energy-efficient, and conceptually simple network flooding. While these multi-transmitter schemes work well, they require all nodes in the network to forward every data packet, which has inherent inefficiencies for non-flooding traffic patterns (where not all nodes need to receive the data). In this work, we formalize the concept of the useful forwarder set for point-to-point transmissions in low power multi-transmitter networks, those nodes which help forward data to the destination. We present a mechanism for approximating membership in this set based on simple heuristics. Incorporating forwarder selection on our 66-node testbed reduced radio duty cycle by 30% and increased throughput by 49% relative to concurrent flooding while preserving a 99.4% end-to-end packet reception ratio under the collection traffic pattern. We envision forwarder selection as a fundamental task in an efficient multi-transmitter networking stack. This work demonstrates that adding forwarder selection can improve energy efficiency and throughput while providing similar end-to-end packet delivery rates to flooding.

Download PDF.

BibTeX entry:

@inproceedings{forwarderdcoss2013,
   author = {Carlson, Doug and Chang, Marcus and Terzis, Andreas and
   Chen, Yin and Gnawali, Omprakash},
   title = {{ Forwarder Selection in Multi-Transmitter Networks }},
   booktitle = { Proceedings of the 9th International Conference on
	Distributed Computing in Sensor Systems (DCOSS 2013) },
   month = { May },
   year = {2013}
}