The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Empirical studies show that cruising for car parking accounts for a non-negligible amount of the daily traffic, especially in central areas of large cities. Therefore, mechanisms for minimizing traffic from cruising directly affect the dynamics of traffic congestions. One way to minimizing cruising traffic is efficient car-parking-slot assignment. Usually, the related design problems are combinatorial...
This paper investigates convergence properties of scalable algorithms for nonconvex and structured optimization. We consider a method that is adapted from the classic quadratic penalty function method, the Alternating Direction Penalty Method (ADPM). Unlike the original quadratic penalty function method, in which single-step optimizations are adopted, ADPM uses alternating optimization, which in turn...
The problem of weighted sum-rate maximization (WSRMax) in multicell downlink multi-input single-output (MISO) systems is considered. The problem is known to be NP-hard. We propose a solution method, based on branch and bound technique, which solves globally the nonconvex WSRMax problem with an optimality certificate. Specifically, the algorithm computes a sequence of asymptotically tight upper and...
We consider the problem of weighted sum-rate maximization in a multicell downlink system. The problem is NP-hard and therefore difficult to solve, even in a centralized manner. We derive a distributed algorithm based on primal decomposition and subgradient methods. The key idea is to solve a sequence of successive convex approximations of the original problem in a distributed manner. By fixing the...
We consider the problem of weighted sum-rate maximization (WSRMax) in wireless networks. This problem is known to be NP-hard and it plays a central role in resource allocation, link scheduling or in finding achievable rate regions for both singlecast and multicast networks. We propose a solution method, based on the branch and bound technique, which solves globally the WSRMax problem with an optimality...
We consider the problem of MaxWeight scheduling in wireless multihop networks. This problem is known to be NP-hard. We propose a solution method, based on the branch and bound technique, which solves globally the MaxWeight scheduling problem with an optimality certificate. Efficient analytic bounding techniques are introduced as well.
We consider the problem of weighted sum-rate maximization (WSRMax) for an arbitrary set of interfering links. This problem is known to be NP-hard; therefore, it is extremely difficult to solve even for a relative small number of links. The main contribution of this paper is to provide a solution method, based on the branch and bound technique, which solves WSRMax problem with an optimality certificate...
In a wireless network, the problem of self interference arises whenever a node transmits and receives simultaneously in the same frequency band. So far only two extreme approaches to circumvent this problem were thoroughly investigated in the literature. The first one prevents any node to transmit and receive simultaneously which may lead to a too conservative design. The second one assumes perfect...
We consider the problem of cross-layer utility maximization subject to stability constraints for a multi-commodity wireless network where all links are sharing a number of orthogonal channels. We assume a time slotted network, where the channel gains are changing randomly from slot to slot. The optimal cross-layer network control policy can be decomposed into three subproblems: 1) flow control at...
We consider the cross-layer utility maximization problem for wireless networks. It is well known that the optimal network control policy can be decomposed in three separate subproblems: 1) flow control at the network layer, 2) routing and scheduling at the network layer, and 3) resource allocation (RA) at the medium access control and physical layers. The main contribution of this paper is a power...
We consider the problem of cross-layer utility maximization subject to stability constraints for a multicommodity wireless network where all links are sharing a single channel. We assume a time slotted network and only one node is allowed to transmit at any given slot. The optimal cross-layer network control policy can be decomposed into three subproblems: (1) flow control at the transport and network...
We consider the weighted sum rate maximization problem in downlink orthogonal frequency division multiple access (OFDMA) systems. A low complexity suboptimal resource allocation algorithm is proposed for joint optimization of multiuser subcarrier assignment and power allocation. This algorithm is based on an approximated primal decomposition based method, which is inspired from exact primal decomposition...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.