Maximum Finding in the Symmetric Radio Networks with Collision Detection

Authors:
František Galčík;Gabriel Semanišin
Affiliations:
Institute of Computer Science, P.J. Šafárik University, Faculty of Science, Jesenná 5, 041 54 Košice, Slovak Republic,;Institute of Computer Science, P.J. Šafárik University, Faculty of Science, Jesenná 5, 041 54 Košice, Slovak Republic,
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 6
Cited 0

Maximum finding on a multiple access broadcast network

Information Processing Letters
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
An optimal algorithm of acknowledged broadcasting in ad hoc radio networks

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem of computing the maximal value associated to the nodes of a network in the model of unknown symmetric radio network with availability of collision detection. We assume that the nodes have no initial knowledge about the network topology, number of nodes and even they have no identifiers. The network contains one distinguished node, called initiator, that starts the process of computing. We design a series of algorithms that result into an asymptotically optimal deterministic algorithm completing the task in 茂戮驴(ecc+ logMax) rounds, where eccis the eccentricity of the initiator and Maxis the maximal value among the integer values associated to the nodes. Some other utilisations of the developed algorithm are presented as well.