Request Satisfaction Problem in Synchronous Radio Networks

  • Benoît Darties
  • Sylvain Durand
  • Jérôme Palaysi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5198)


We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in the following model: nodes send omnidirectional radio transmissions in synchronous slots; during a given slot, a node can receive a message from an adjacent node if and only if no other neighbour is transmitting - otherwise, radio interferences may occur if two or more neighbors transmit in the same slot -. The objective is to minimize the number of slots used. The two problems differ in that the routing policy may be imposed (DAWN-path), or not (DAWN-request). In this second case, a path must be assigned for each request, to define the nodes to use to reach the destination from the source. We present some complexity results, in particular showing that both problems are NP-hard when the network is restricted to a tree. We also present a polynomial algorithm in O(n 2K ) when the number of requests is bounded (by above) by a constant K.


Radio Network Request Satisfaction Complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290–298 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. In: FAWN 2006, Pisa, Italy (2006)Google Scholar
  3. 3.
    Bermond, J.-C., Peters, J.: Efficient gathering in radio grids with interference. In: Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2005), May 2005, pp. 103–106 (2005)Google Scholar
  4. 4.
    Chelius, G.: Architectures et Communications dans les réseaux spontanés sans fil. PhD thesis, INSA de Lyon, INRIA Rhône Alpes, France (April 2004)Google Scholar
  5. 5.
    Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33, 1240–1246 (1985)zbMATHCrossRefGoogle Scholar
  6. 6.
    Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio network. IEEE Transaction Communication (39), 426–433 (1991)CrossRefGoogle Scholar
  7. 7.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. Dunod (2001)Google Scholar
  8. 8.
    Darties, B.: Problémes algorithmiques et de complexité dans les réseaux sans fil. PhD thesis, LIRMM, Université Montpellier 2, France (December 2007)Google Scholar
  9. 9.
    Darties, B., Palaysi, J.: Satisfaction de requêtes par affectation de dates d’émissions dans les réseaux radios. In: Rencontres francophones du Parallélisme (RenPar’17), pp. 157–163 (2006)Google Scholar
  10. 10.
    Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. In: Proceedings of the international workshop on Broadcasting and gossiping, pp. 79–133. Elsevier North-Holland, Inc. (1994)Google Scholar
  11. 11.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  12. 12.
    Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319–349 (1986)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Kowalski, D.R., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: APPROX-RANDOM, pp. 171–182 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Benoît Darties
    • 1
  • Sylvain Durand
    • 1
  • Jérôme Palaysi
    • 1
  1. 1.LIRMMUniversité Montpellier IIMontpellier Cedex 5France

Personalised recommendations