An O(n1.5) deterministic gossiping algorithm for radio networks

Algorithmica (New York)

Volumn 36, Issue 1, 2003, Pages 93-96

  Xu, Ying ^a,b  

^a PEKING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Deterministic algorithm; Gossiping; Radio network

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RADIO BROADCASTING; TOPOLOGY;

BROADCASTING COMPLEXITY; DETERMINISTIC ALGORITHM; GOSSIPING ALGORITHM; RADIO NETWORKS;

ALGORITHMS;

EID: 0345656721     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-1010-5     Document Type: Article

References (5)

1. L. Gasieniec and A. Lingas, On adaptive deterministic gossiping in ad hoc radio networks, Inform. Process. Lett., 2 (2002), 89-93.
2. M. Chrobak, L. Gasieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, in Proc. 41st IEEE Symposium on Foundations of Computer Science, 2000, pp. 575-581.
3. M. Chrobak, L. Gasieniec, and W. Rytter, A randomized algorithm for gossiping in radio networks, in Proc. 7th Annual International Computing and Combinatorics Conference, 2001, pp. 483-492.
4. P. Indyk, Explicit constructions of selectors and related combinatorial structures with applications, in Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 697-703.
5. D. Liu and M. Prabhakaran, On randomized broadcasting and gossiping in radio networks. in Proc. 8th Annual International Computing and Combinatorics Conference, 2002, pp. 340-349.