Discrete Mathematics - Topics on domination
A lower bound for radio broadcast
Journal of Computer and System Sciences
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Journal of Computer and System Sciences
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A new model for scheduling packet radio networks
Wireless Networks
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Spine routing in ad hoc networks
Cluster Computing
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Centralized broadcast in multihop radio networks
Journal of Algorithms
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Scheduling of broadcasts in multihop wireless networks
The handbook of ad hoc wireless networks
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
Broadcast is a fundamental operation in wireless network, and naïve flooding is simply not practical. Previous results showed that although broadcast scheduling can achieve constant approximation ratios in respect of latency, the current state-of-the-art algorithm's ratio is still overwhelmingly large (≈650). In this paper we present two basic broadcast scheduling algorithms that both achieve small ratios 51 and 24, while preserving low redundancy 1 and 4 (in terms of number of retransmissions a node has to make). Moreover, we also present a highly efficient algorithm whose latency is $R+O(\sqrt{R}\log^{1.5}R)$ (where R is the network radius) and each node only has to transmit up to 5 times. This result, in a sense of approximation, is nearly optimal since $O(\sqrt{R}\log^{1.5}R)$ is negligible when R is large. Moreover, R is itself a lower bound for latency, so the approximation ratio is nearly 1 and this algorithm is nearly optimal.