In this paper, we consider the mobility effect with a jointly optimal design of cross-layer congestion control, routing and scheduling for ad-hoc networks. We first formulate the rate constraint and scheduling constraint. In this way, we use multi-commodity flow variables. Then formulate resource allocation in networks with fixed wireless channel and single-rate devices. Because of entrance of ...

We present new results on a constraint satisfaction problem arising from the inference of resource types. Linear constraints were introduced by Hofmann and Jost in the context of type-based amortized resource analysis by the potential method [5] where it was applied to functional programs. The constraint systems appearing in this system and subsequent ones has finitely many variables and can be...

Resource allocation plays a critical role to enhance the performance of cognitive orthogonal frequency division multiplexing (OFDM) network. However, due to lack the cooperation between cognitive network and primary network, the channel state information (CSI) between cognitive radio (CR) user and primary user (PU) could not be estimated precisely. In this work, a resource allocation problem ov...

In the last years, the application of local search techniques for constraint solving started to raise some interest in the Constraint Programming community, We proposed some years ago a domain-independent local search method called Adaptive Search for solving Constraint Satisfaction Problems (CSP) [1]. This method has now been fully re-implemented as a C-based framework library available as fre...

In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general so...

Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of constraint programming, providing the opportunity of having declarative descriptions of CSP instances and also obtaining their solutions in reasona...

Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a continuous constraint solver without ...

We study a Petri net model of a system composed of two processes sharing a resource. Conflicts may occur over the usage of the shared resource, thus making the system nondeterministic. Therefore, in the context of minimax algebra, it cannot be formulated as a linear system in order to compute its performance measures. However, if the sequence by which the resource is allocated to the two proces...

QoS-Driven Adaptive Resource Allocation for Mobile Wireless Communications and Networks. (December 2006) Jia Tang, B.S. Xi’an Jiaotong University, Xi’an, China Chair of Advisory Committee: Dr. Xi Zhang Quality-of-service (QoS) guarantees will play a critically important role in future mobile wireless networks. In this dissertation, we study a set of QoS-driven resource allocation problems for m...

The areas of Artificial Intelligence planning and scheduling have seen important advances thanks to the application of constraint satisfaction models and techniques. Especially, solutions to many real-world problems need to integrate plan synthesis capabilities with resource allocation, which can be efficiently managed by using constraint satisfaction techniques. Constraint satisfaction plays a...