Doug Leith on Decentralised Constraint Satisfaction

Wednesday September 18, 13:15 (1:15pm), Wigforssalen, Halmstad University

Click here for a video recording of the lecture.

Several important resource allocation problems in wireless networks fit within the common framework of Constraint Satisfaction Problems (CSPs). These include channel allocation, power control, transmission scheduling and network coding. 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 introduce a stochastic decentralized CSP solver, sketching how it provably finds a solution should one exist and illustrating its other desirable features. Using an implementation on a wireless testbed we demonstrate the decentralized solver's practical utility for one of the fundamental challenges in wireless networks, namely interference management by appropriate channel allocation.

About Prof. Doug Leith

Prof. Doug Leith is Director of the Hamilton Institute ( at the National University of Ireland Maynooth, an applied mathematics research institute focussing on communication networks. Doug's research interests include network congestion control, coding/information theory, oprimisation and resource allocation in wireless networks.

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.