Skip to main content
SpringerLink
Log in

On the Complexity of Distributed Self-Configuration in Wireless Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition into coordinating cliques, Hamiltonian cycle formation and conflict-free channel allocation. We show that the probabilities of accomplishing these tasks undergo zero-one phase transitions with respect to the transmission range of individual nodes. We model these tasks as distributed constraint satisfaction problems (DCSPs) and show that, even though they are NP-hard in general, these problems can be solved efficiently on average when the network is operated sufficiently far from the transition region. Phase transition analysis is shown to be a useful mechanism for quantifying the critical range of energy and bandwidth resources needed for the scalable performance of self-configuring wireless networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Achlioptas, Setting two variables at a time yields a new lower bound for random 3-SAT, in: Proc. of 32nd Annual ACM Symposium on Theory of Computing, 2000.

  2. L. Bao and J.J. Garcia-Luna-Aceves, Collision-free topology-dependent channel access scheduling, in: 21st Century Military Communications Conference Proceedings, MILCOM 2000, pp. 507–511.

  3. [Beame et al.] P. Beame et al., On the complexity of unsatisfiability proofs for random formulas, in:Proc. of 30th Annual ACM Symposium on Theory of Computing, 1998.

  4. R. Bejar et al., Distributed constraint satisfaction in a wireless sensor tracking system, in: Workshop on Distributed Constraint Reasoning, IJCAI-01, 2001.

  5. R. Bejar et al., Capturing structure with satisfiability, in: Proc. of 7th International Conference on Principles and Practice of Constraint Programming (CP2001), 2001.

  6. B. Bollobás, Random Graphs (Academic Press, New York, 1985).

    Google Scholar 

  7. N. Bulusu et al., Scalable coordination for wireless sensor networks: Self-configuring localization systems, in: Proc. of the 6th International Symposium on Communication Theory and Applications (ISCTA'01), Ambleside, UK.

  8. J.C. Cano and P. Manzoni, A low power protocol to broadcast real-time data traffic in a clustered ad hoc network, in: Proc. of IEEE GlobeCom, 2001.

  9. G. Cao and M. Singhal, Efficient distributed channel allocation for mobile cellular networks, in: Proc. of 7th International Conference on Computer Communications and Networks, 1998, pp. 50–57.

  10. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proc. of IJCAI-91, Vol. 1, 1991, pp. 331–337.

    Google Scholar 

  11. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Communications of the ACM 5 (1962) 394–397.

    Google Scholar 

  12. R. Dechter and D. Frost, Backtracking algorithms for constraint satisfaction problems, Technical Report, Information and Computer Science Department, UC Irvine (1999); http://www.ics.uci.edu/~csp/r56-backtracking.pdf.

    Google Scholar 

  13. O. Dubois, Y. Boufkhad and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, in: Symposium on Discrete Algorithms, 2000.

  14. D. Estrin et al., Instrumenting the world with wireless sensor networks, in: Proc. of International Conference on Acoustics, Speech and Signal Processing (ICASSP 2001), 2001.

  15. D. Estrin et al., Embedded, everywhere: A research agenda for networked systems of embedded computers, National Research Council Report (2001).

  16. E. Friedgut, Sharp thresholds of graph proprties, and the k-SAT problem, J. Amer. Math. Soc. 12(4) (1999) 1017–1054.

    Google Scholar 

  17. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc. 124 (1996) 2993–3002.

    Google Scholar 

  18. [18] [Frieze and Suen] A.M. Frieze and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, Journal of Algorithms 20 (1996) 312–355.

    Google Scholar 

  19. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).

    Google Scholar 

  20. P. Gupta and P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, in: Stochastic Analysis, Control, Optimization and Applications, eds. W.M. McEneany et al. (Birkhäuser, Boston, MA, 1998) pp. 547–566.

    Google Scholar 

  21. Z.J. Haas et al., eds., IEEE Journal on Selected Areas in Communications 17(8) (1999). Special Issue on Wireless Ad Hoc Networks.

    Google Scholar 

  22. W.K. Hale, Frequency assignment: theory and applications, Proceedings of the IEEE 68(12) (1980) 1497–1514.

    Google Scholar 

  23. Y. Hamadi, C. Bessière and J. Quinqueton, Backtracking in distributed constraint networks, in: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 1998, pp. 219–223.

  24. D. Hochbaum, Approximation Algorithms for NP-Hard Problems (Brooks/Cole, 1996).

  25. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264(5163) (1994) 1297–1301.

    Google Scholar 

  26. B. Krishnamachari, Phase transitions, structure, and complexity in wireless networks, Ph.D. Thesis, Cornell University (2002).

  27. B. Krishnamachari, R. Bejar and S.B.Wicker, Distributed problem solving and the boundaries of selfconfiguration in multi-hop wireless networks, in: Proc. of 35th Hawaii International Conference on System Sciences, 2002.

  28. B. Krishnamachari et al., Critical density thresholds in distributed wireless networks, a chapter for book in honor of Ian Blake (to appear). Available online at http://www.krishnamachari.net/papers/densityChapter.pdf.

  29. B. Krishnamachari, S.B. Wicker and R. Bejar, Phase transitions in wireless ad-hoc networks, in: Proc. of IEEE GlobeCom 2001, 2001.

  30. E.L. Lloyd, Broadcast scheduling for tdma in wireless multi-hop networks, in: Wireless Networks and Mobile Computing Handbook, ed. I. Stojmenovic (Wiley, New York, 2001).

    Google Scholar 

  31. N.A. Lynch, Distributed Algorithms (Morgan Kauffman, San Mateo, CA, 1996).

    Google Scholar 

  32. R. Meester and R. Roy, Continuum Percolation (Cambridge Univ. Press, 1996).

  33. Z. Michalewicz and D.B. Fogel, How to Solve It: Modern Heuristics (Springer, Berlin, 1999).

    Google Scholar 

  34. D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, 1992, pp. 459–465.

  35. C. Perkins, Ad Hoc Networking (Addison-Wesley, Reading, MA, 2002).

    Google Scholar 

  36. L.C. Pond and V.O.K. Li, A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks, in: Proc of MILCOM, 1989, pp. 70–74.

  37. R. Ramaswami and K.K. Parhi, Distributed scheduling of broadcasts in a radio network, in: Proc. of INFOCOM, 1989, pp. 497–504.

  38. M. Sanchez, P. Manzoni and Z.J. Haas, Determination of critical transmission range in ad-hoc networks, in: Multiaccess Mobility and Teletraffic for Wireless Communications Workshop (MMT'99), 1999.

  39. M. Seddigh, J.S. Gonzales and I. Stojmenovic, RNG and internal node based broadcasting algorithms for wireless one-to-one networks, ACM Mobile Computing and Communications Review 5(2) (2001).

  40. B. Selman, H.A. Kautz and B. Cohen, Noise strategies for improving local search, in: Proc. of the National Conference for Artificial Intelligence (AAAI'94), 1994.

  41. K. Sohrabi et al., Protocols for self-organization of a wireless sensor network, IEEE Personal Communications 7(5) (2000) 16–27.

    Google Scholar 

  42. C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems (Prentice-Hall, Englewood Cliffs, NJ, 2001).

    Google Scholar 

  43. B. Vandegriend, Finding Hamiltonian cycles: algorithms, graphs and performance, Masters Thesis, Department of Computer Science, University of Alberta, Canada. Available online with source code for algorithms at http://www.cs.ualberta.ca/?basil/research.html.

  44. C.P. Williams and T. Hogg, Exploiting the deep structure of constraint problems, Artificial Intelligence 70 (1994) 73–117.

    Google Scholar 

  45. Y. Xu, J. Heidemann and D. Estrin, Geography-informed energy conservation for ad hoc routing, in: Proc. of the Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM MobiCom), 2001.

  46. [Xue and Kumar] F. Xue and P.R. Kumar, The number of neighbors needed for connectivity of wireless networks (2002, submitted).

  47. M. Yokoo et al., The distributed constraint satisfaction problem: formalization and algorithms, IEEE Transactions on Knowledge and Data Engineering 10(5) (1998) 673–685.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering – Systems, University of Southern California, Los Angeles, CA, 90089, USA

    Bhaskar Krishnamachari

  2. School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, 14853, USA

    Stephen Wicker

  3. Department d'Informàtica i Enginyeria Industrial, Universitat de Lleida, Jaume II, 69, E-25001, Lleida, Spain

    Ramón Béjar & Cèsar Fernàndez

Authors
  1. Bhaskar Krishnamachari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen Wicker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramón Béjar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cèsar Fernàndez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bhaskar Krishnamachari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krishnamachari, B., Wicker, S., Béjar, R. et al. On the Complexity of Distributed Self-Configuration in Wireless Networks. Telecommunication Systems 22, 33–59 (2003). https://doi.org/10.1023/A:1023426501170

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023426501170

Search

Navigation