On the Complexity of Distributed Self-Configuration in Wireless Networks

Telecommunication Systems

Volumn 22, Issue 1-4, 2003, Pages 33-59

  Krishnamachari, Bhaskar ^a   Wicker, Stephen ^b   Béjar, Ramón ^c   Fernàndez, Cèsar ^c  

^a University of Southern California   (United States)

^b Department of Molecular Biology and Genetics   (United States)

^c UNIVERSITY OF LLEIDA   (Spain)

Author keywords

Distributed constraint satisfaction; Self configuration; Wireless networks

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; HAMILTONIANS; MATHEMATICAL MODELS; PHASE TRANSITIONS; PROBLEM SOLVING; RESOURCE ALLOCATION; WIRELESS TELECOMMUNICATION SYSTEMS;

CHANNEL ALLOCATION; WIRELESS NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0038703649     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023426501170     Document Type: Article

References (47)

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).
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.
11. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Communications of the ACM 5 (1962) 394-397.
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.
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.
17. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc. 124 (1996) 2993-3002.
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.
19. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
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.
21. Z.J. Haas et al., eds., IEEE Journal on Selected Areas in Communications 17(8) (1999). Special Issue on Wireless Ad Hoc Networks.
22. W.K. Hale, Frequency assignment: theory and applications, Proceedings of the IEEE 68(12) (1980) 1497-1514.
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.
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 self-configuration 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).
31. N.A. Lynch, Distributed Algorithms (Morgan Kauffman, San Mateo, CA, 1996).
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).
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).
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.
42. C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems (Prentice-Hall, Englewood Cliffs, NJ, 2001).
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.
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.