Hardness and approximation of gathering in static radio networks

Parallel Processing Letters

Volumn 16, Issue 2, 2006, Pages 165-183

  Bermond, Jean Claude ^a   Galtier, Jerome ^b   Klasing, Ralf ^c   Morales, Nelson ^a   Perennes, Stephane ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b ORANGE LABS   (France)

^c UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Approximation algoritms; Gathering; Hardness; Interference constraints; Radio networks

Indexed keywords

APPROXIMATION ALGORITHMS; GATHERING; INTERFERENCE CONSTRAINTS; RADIO NETWORKS;

ALGORITHMS; DATA ACQUISITION; GRAPH THEORY; HARDNESS; MATHEMATICAL MODELS; PROBLEM SOLVING; RADIO INTERFERENCE; RADIO TRANSMISSION; STRATEGIC PLANNING;

RADIO SYSTEMS;

EID: 33746185436     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626406002551     Document Type: Article

References (22)

1. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
2. J.-C. Bermond, R. Corrêa, and J. Yu. Gathering algorithms on paths under interference constraints. 6th Conference on Algorithms and Complexity, May 29-31, Rome, 2006.
3. J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Perennes. Gathering in specific radio networks. In 8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, May 2006.
4. J.-C. Bermond, L. Gargano, and S. Perennes. Optimal sequential gossiping by short messages. Discrete Applied Mathematics, 86:145-155, 1998.
5. J.-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917-941, 1998.
6. J.-C. Bermond, T. Kodate, and S. Perennes. Gossiping in Cayley graphs by packets. In Proceedings of 8-th Franco-Japanese, 4-th Franco-Chinese Conference on Combinatorics and Computer Science, volume 1120 of Lecture Notes on Computer Science, pages 301-315. Springer, 1995.
7. J.-C. Bermond and J. Peters. Efficient gathering in radio grids with interference. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), pages 103-106, Presqu'le de Giens, May 2005.
8. P. Bertin, J.-F. Bresse, and B.L. Sage. Accès haut débit en zone rurale: une solution "ad hoc". France Telecom R&D, 22:16-18, 2005.
9. G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE Journal of Selected Areas of Communication, 18:535-547, 2000.
10. V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, and L. Stougie. An approximation algorithm for the wireless gathering problem. In 10th Scandinavian Workshop on Algorithm Theory (SWAT), 2006.
11. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Transaction on Communications, 39(3):426-433, 1991.
12. M. Christersson, L. Gasieniec, and A. Lingas. Gossiping with bounded size messages in ad-hoc radio networks. In Proceedings of 29th International Colloquium on Automata, Languages and Programming (ICALP'02), volume 2380 of Lecture Notes in Computer Science, pages 377-389. Springer-Verlag, 2002.
13. M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2): 177-189, 2002.
14. S.A. Cook. The complexity of theorem proving procedures. In Proc. 3rd Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
15. M.L. Elkin and G. Kortsarz. Logarithmic inapproximability of the radio broadcast problem. Journal of Algorithms, 52(1):8-25, 2004.
16. I. Gaber and Y. Mansour. Centralized broadcast in multihop radio networks. Journal of Algorithms, 46(1): 1-20, 2003.
17. J. Galtier. Optimizing the IEEE 802.11b performance using slow congestion window decrease. In Proc. 16th ITC Specialist Seminar on Performance Evaluation of Wireless and Mobile Systems, pages 165-176, 2004.
18. L. Gasieniec and I. Potapov. Gossiping with unit messages in known radio networks. In Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, pages 193-205. Kluwer, B.V., 2002.
19. 1-ε. Acta Mathematica, 182:105-142, 1999.
20. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer Monograph. Springer-Verlag, 2005.
21. R. Klasing, N. Morales, and S. Perennes. On the complexity of bandwidth allocation in radio networks with steady traffic demands. Technical report, INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR, 2004.
22. P. Mühlethaler. 802.11 et les réseaux sans fil. Eyrolles, 2002.