Engineering Commons^™

On Path Consistency For Binary Constraint Satisfaction Problems, Christopher G. Reeson

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and solving many decision problems of practical importance. Consistency properties and the algorithms for enforcing them on a problem instance are at the heart of Constraint Processing and best distinguish this area from other areas concerned with the same combinatorial problems. In this thesis, we study path consistency (PC) and investigate several algorithms for enforcing it on binary finite CSPs. We also study algorithms for enforcing consistency properties that are related to PC but are stronger or weaker than PC.

We identify and correct errors in the literature …

Energy-Efficient Rate Adaptation Mac Protocol For Ad Hoc Wireless Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Resource constraints in ad hoc wireless networks require that they are energy efficient during both transmission and rate adaptation. In this paper, we propose a novel energy-efficient rate adaptation protocol that selects modulation schemes online to maximize throughput based on channel state while saving energy. This protocol uses the distributed power control (DPC) algorithm (M. Zawodniok et al., 2004) to accurately determine the necessary transmission power and to reduce the energy consumption. Additionally, the transmission rate is altered using energy efficiency as a constraint to meet the required throughput, which is estimated with queue fill ratio. Moreover, back-off scheme is …