Optimal gathering protocols on paths under interference constraints

Discrete Mathematics

Volumn 309, Issue 18, 2009, Pages 5574-5587

  Bermond, Jean Claude ^a   Corrêa, Ricardo C ^b   Yu, Minli ^c  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

^c UNIVERSITY OF THE FRASER VALLEY   (Canada)

Author keywords

Gathering algorithms; Interference; Multi hop radio network; Path

Indexed keywords

DESTINATION NODES; FIXED INTEGERS; GATHERING ALGORITHMS; GATHERING PROBLEM; INTERFERENCE; INTERFERENCE CONSTRAINTS; LOWER BOUNDS; MULTI-HOP RADIO NETWORK; MULTI-HOP RADIO NETWORKS; PATH; REACHABILITY;

CONTROL THEORY; GRAPH THEORY; RADIO; WIRELESS SENSOR NETWORKS;

NETWORK PROTOCOLS;

EID: 69649084584     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.04.037     Document Type: Article

References (16)

1. J.-C. Bermond, R. Corrêa, M. Yu, Gathering algorithms on paths under interference constraints, in: 6th Conference on Algorithms and Complexity, in: LNCS, vol. 3998, Roma, Italy, May 2006, pp. 115-126
2. Bermond J.-C., Galtier J., Klasing R., Morales N., and Pérennes S. Hardness and approximation of gathering in static radio networks. Parallel Processing Letters 16 2 (2006) 165-183
3. Bermond J.-C., Gargano L., Rescigno A.A., and Vaccaro U. Fast gossiping by short messages. SIAM Journal on Computing 27 4 (1998) 917-941
4. Bermond J.-C., and Peters J. Efficient gathering in radio grids with interference. AlgoTel'05 (May 2005), Presqu'île de Giens 103-106
5. Bertin P., Bresse J.-F., and Le Sage B. Accès haut débit en zone rurale: Une solution "ad hoc". France Telecom R&D 22 (2005) 16-18
6. Bonifaci V., Korteweg P., Marchetti-Spaccamela A., and Stougie L. An approximation algorithm for the wireless gathering problem. In: Arge L., and Freivalds R. (Eds). SWAT. Lecture Notes in Computer Science vol. 4059 (2006), Springer-Verlag 328-338
7. Christersson M., Gasieniec L., and Lingas A. Gossiping with bounded size messages in ad-hoc radio networks. Proc. of ICALP'02. Lecture Notes in Computer Science vol. 2380 (2002), Springer-Verlag 377-389
8. Chrobak M., Gasieniec L., and Rytter W. Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43 2 (2002) 177-189
9. Elkin M.L., and Kortsarz G. Logarithmic inapproximability of the radio broadcast problem. Journal of Algorithms 52 1 (2004) 8-25
10. Florens C., Franceschetti M., and McEliece R. Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications 22 6 (2004) 1110-1120
11. Gaber I., and Mansour Y. Centralized broadcast in multihop radio networks. Journal of Algorithms 46 1 (2003) 1-20
12. Gargano L., and Rescigno A. Optimally fast data gathering in sensor networks. In: Královič R., and Urzyczyn P. (Eds). Proc. of MCFS'06. Lecture Notes in Computer Science vol. 4162 (2006), Springer-Verlag 399-411
13. Gasieniec L., and Potapov I. Gossiping with unit messages in known radio networks. Proceedings of the IFIP 17th World Computer Congress (2002), Kluwer, B.V 193-205
14. Hromkovic J., Klasing R., Pelc A., Ruzicka P., and Unger W. Dissemination of Information in Commmunication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer Monograph (2004), Springer-Verlag
15. R. Klasing, N. Morales, S. Pérennes, Complexity of bandwidth allocation in radio networks: The static case, Theoretical Computer Science, 2008 (in press)
16. Zhu X., Tang B., and Gupta H. Delay efficient data gathering in sensor network. In: Jia X., Wu J., and He Y. (Eds). Proc. of MSN'05. Lecture Notes in Computer Science vol. 3794 (2005), Springer-Verlag 380-389