Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Broadcast Scheduling in Interference Environment
IEEE Transactions on Mobile Computing
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An approximation algorithm for the wireless gathering problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Minimum latency data aggregation in wireless sensor network with directional antenna
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
FAVOR: frequency allocation for versatile occupancy of spectrum in wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Theoretical Computer Science
Hi-index | 0.00 |
This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We 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. We 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.