In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time sl…

A {\it semi-proper orientation} of a given graph $G$ is a function $(D,w)$ that assigns an orientation $D(e)$ and a positive integer weight $ w(e)$ t…

Users of cloud computing platforms pose different types of demands for multiple resources on servers (physical or virtual machines). Besides differen…

A graph $G$ is {\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\it weakly semiregul…

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the c…

In this paper, proactive resource allocation based on user location for point-to-point communication over fading channels is introduced, whereby the …

A Not-All-Equal (NAE) decomposition of a graph $G$ is a decomposition of the vertices of $G$ into two parts such that each vertex in $G$ has at least…

A {\it sigma partitioning} of a graph $G$ is a partitioning of the vertices into some disjoint sets $P_1, \ldots, P_k$ such that for every two adjace…

In cellular networks, the locations of the radio access network (RAN) elements are determined mainly based on the long-term traffic behaviour. Howeve…

Using tiny, equal-sized tasks (Homogeneous microTasking, HomT) has long been regarded an effective way of load balancing in parallel computing system…

The recent evolution of ambient backscattering technology has the potential to provide long-range and low-power wireless communications. In this work…

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division mult…

Addressing the Quality-of-Service (QoS) requirements of users is crucial for service providers to improve the network performance. Furthermore, the t…

In this work, a new transmission scheme, signal space cognitive cooperation, is introduced by applying the idea of signal space diversity in an under…

A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree …

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applicat…

A {\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\ell$ of $G$ for every two adjacent ve…

We consider the problem of designing a fast decoder for antipodal uniquely decodable (errorless) code sets for overloaded synchronous code-division m…

We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected server…

The ability of physical layer relay caching to increase the degrees of freedom (DoF) of a single cell was recently illustrated. In this paper, we ext…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account