Forwarder Selection in Multi-transmitter Networks

DCOSS(2013)

引用 45|浏览44
暂无评分
摘要
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.
更多
查看译文
关键词
forwarder selection,multi-transmitter scheme,end-to-end packet reception ratio,data packet,low power multi-transmitter network,recent work,network protocol,efficient multi-transmitter network,concurrent flooding,multi-transmitter networks,conceptually simple network flooding,network protocols,approximation theory,reliability,network flooding,protocols,interference,schedules,measurement,routing protocols,routing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要