Download now Free registration required
This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. The authors focus on how to utilize the multiple channels to speed up four group communications including broadcast, aggregation, gathering, and gossiping in wireless networks under protocol interference model. Four scheduling algorithms are developed for these four group communications. They derive explicit tight bounds on the latencies of the four communication schedules produced by these algorithms. These latency bounds in general decrease with the number of channels and are also within constant factors of the respective minimum.
- Format: PDF
- Size: 131 KB