Multiple communication im multihop radio networks
SIAM Journal on Computing
Asymptotically optimal gossiping in radio networks
Discrete Applied Mathematics
Fast Gossiping by Short Messages
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
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
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
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
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
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
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
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
| Hi-index | 0.00 |
We studied the minimum-latency gossiping (all-to-all broadcast) problem in multi-hop wireless networks defined as follows. Each node in the network is initially given a message and the objective is to design a minimum-latency schedule such that each node distributes its message to all other nodes. We considered the unit-size message model, in which different messages cannot be combined as one message, and the unit disk graph model, in which a link exists between two nodes if and only if their Euclidean distance is less than 1. This problem is known to be NP-hard in such models. In this work we designed a gossiping scheme that significantly improved all current gossiping algorithms in terms of approximation ratio. Our work has approximation ratio 27, a great improvement of the current state-of-the-art algorithm (which has ratio 1000+).