On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
How good are branching rules in DPLL?
Discrete Applied Mathematics
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Wireless Communications
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Linear Upper Bounds for Random Walk on Small Density Random $3$-CNFs
SIAM Journal on Computing
Complexity analysis of a decentralised graph colouring algorithm
Information Processing Letters
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Network coding-aware routing in wireless networks
IEEE/ACM Transactions on Networking (TON)
Distributed Channel Assignment and Routing in Multiradio Multichannel Multihop Wireless Networks
IEEE Journal on Selected Areas in Communications
Decentralised learning MACs for collision-free access in WLANs
Wireless Networks
| Hi-index | 0.00 |
We show that several important resource allocation problems in wireless networks fit within the common framework of constraint satisfaction problems (CSPs). Inspired by the requirements of these applications, where variables are located at distinct network devices that may not be able to communicate but may interfere, we define natural criteria that a CSP solver must possess in order to be practical. We term these algorithms decentralized CSP solvers. The best known CSP solvers were designed for centralized problems and do not meet these criteria. We introduce a stochastic decentralized CSP solver, proving that it will find a solution in almost surely finite time, should one exist, and also showing it has many practically desirable properties. We benchmark the algorithm's performance on a well-studied class of CSPs, random k-SAT, illustrating that the time the algorithm takes to find a satisfying assignment is competitive with stochastic centralized solvers on problems with order a thousand variables despite its decentralized nature. We demonstrate the solver's practical utility for the problems that motivated its introduction by using it to find a noninterfering channel allocation for a network formed from data from downtown Manhattan.