Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks
Information Processing Letters
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Faster centralized communication in radio networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Wireless Mesh Networks (WMNs) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc WMNs. Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. We show an approximation scheme that can complete gossiping task in O(n log3/2n) time units with high probability at least 1-1/n in any ad-hoc WMN of size n. Our algorithm allows the labels (identifiers) of the mesh nodes to be polynomially large in n. To the best of our knowledge, this is the first time that randomized algorithm has been considered in ad-hoc WMNs with large labels. Moreover, our gossiping scheme also significantly improved all current gossiping algorithms in terms of approximation ratio. Our work has approximation ratio at most O(log32n) which is a great improvement of the current best known state-of-the-art algorithm with approximation ratio O(log3/2 n) but for linearly large node labels by Czumaj and Rytter[11].