Abstract
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer d I ≥ 1, which implies that nodes within distance d I in the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compatible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and d I = 1. In fact we study the equivalent personalized broadcasting problem instead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bermond, J.-C., Corrêa, R., Yu, M.: Gathering algorithms on paths under interference constraints. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 115–126. Springer, Heidelberg (2006)
Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. Parallel Processing Letters 16(2), 165–183 (2006)
Bermond, J.-C., Gargano, L., Rescigno, A.A.: Gathering with minimum delay in tree sensor networks. In: Shvartsman, M.M.A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058. Springer, Heidelberg (2008)
Bermond, J.-C., Gargano, L., Rescigno, A.A., Vaccaro, U.: Fast gossiping by short messages. SIAM Journal on Computing 27(4), 917–941 (1998)
Bermond, J.-C., Peters, J.: Efficient Gathering in Radio Grids with Interference. In: AlgoTel 2005, Presqu’île de Giens, pp. 103–106 (May 2005)
Bertin, P., Bresse, J.-F., Le Sage, B.: Accès haut débit en zone rurale: une solution ”ad hoc”. France Telecom R&D 22, 16–18 (2005)
Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An approximation algorithm for the wireless gathering problem. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 328–338. Springer, Heidelberg (2006)
Christersson, M., Gasieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 377–389. Springer, Heidelberg (2002)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43(2), 177–189 (2002)
Elkin, M.L., Kortsarz, G.: Logarithmic Inapproximability of the Radio Broadcast Problem. Journal of Algorithms 52(1), 8–25 (2004)
Florens, C., Franceschetti, M., McEliece, R.: Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications 22(6), 1110–1120 (2004)
Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46(1), 1–20 (2003)
Gargano, L., Rescigno, A.: Optimally fast data gathering in sensor networks. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 399–411. Springer, Heidelberg (2006)
Gasieniec, L., Potapov, I.: Gossiping with Unit Messages in Known Radio Networks. In: Proceedings of the IFIP 17th World Computer Congress, pp. 193–205. Kluwer, B.V, Dordrecht (2002)
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Commmunication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer Monograph. Springer, Heidelberg (2004)
Klasing, R., Morales, N., Pérennes, S.: Complexity of bandwidth allocation in radio networks: the static case (to appear in Theoretical Computer Science)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermond, JC., Yu, ML. (2008). Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-85209-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85208-7
Online ISBN: 978-3-540-85209-4
eBook Packages: Computer ScienceComputer Science (R0)