Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
A lower bound for radio broadcast
Journal of Computer and System Sciences
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Proceedings of the international workshop on Broadcasting and gossiping 1990
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
Faster broadcasting in unknown radio networks
Information Processing Letters
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
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
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
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
Novel reconfigurable randomized broadcast algorithm for channel-aware wireless networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
IEEE Transactions on Wireless Communications
Almost optimal distributed M2M multicasting in wireless mesh networks
Theoretical Computer Science
| Hi-index | 0.00 |
We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r. A signal from this node can reach all nodes at distance at most r from it but if a node is situated within range of two nodes transmitting simultaneously it cannot get any message. Each node knows the part of the network within knowledge radius s from it, i.e., it knows the positions, labels and ranges of all nodes at distance at most s.The aim of this paper is to investigate tradeoffs between knowledge radius s and time of deterministic broadcasting in a GRN with n nodes and eccentricity D of the source. For s exceeding the largest range, or s exceeding the largest distance between any two nodes, we design an (optimal) broadcasting algorithm working in time O(D), while for any positive s we show how to broadcast in time &Ogr;(D(1+log(n/D))). For s = 0, i.e., when knowledge of each node is limited to itself, broadcasting can always be performed in time &Ogr;(n) and cannot be improved even for some symmetric GRN of constant diameter. In contrast to the upper bound&Ogr;(n) which assumes that each node knows its own position, we show a surprising result that broadcasting requires time &OHgr;(n log n) for some GRN whose nodes do not have this knowledge. If the collision detection capability is additionally assumed, we show that optimal broadcasting time in symmetric GRN is &THgr;(D + log n).These results show sharp contrasts between the efficiency of broadcasting in geometric radio networks as compared to broadcasting in arbitrary graphs. They also show quantitatively the impact of various types of knowledge available to nodes, on broadcasting time in GRN. The type of knowledge influencing efficiency of broadcasting includes knowledge radius, knowledge of individual positions when knowledge radius is zero, and awareness of collisions.