Pradeep Chathuranga Weeraddana

Pradeep Chathuranga Weeraddana

Auto-generated profile, based on publicly available information

Pradeep Chathuranga Weeraddana

KTH Royal Institute of Technology Automatic Control Lab

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2012 in Foundations and Trends® in Networking
Verified
Journal Article
Closed access
PDF file
PWPradeep Chathuranga Weeraddana
Pradeep Chathuranga Weeraddana
MCMarian Codreanu
Marian Codreanu
MLMatti Latva-Aho
Matti Latva-Aho
AEAnthony Ephremides
Anthony Ephremides
CFCarlo Fischione
Carlo Fischione
A wide variety of resource management problems of recent interest, including power/rate control, link scheduling, cross-layer control, network utility maximization, beamformer design of multiple-input multiple-output networks, and many others are directly or indirectly reliant on the weighted sum-rate maximization (WSRMax) problem. In general, this problem is very difficult to solve and is NP-hard. In this review, we provide a cohesive discussion of the existing solution methods associated with the WSRMax problem, including global, fast local, as well as decentralized methods. We also discuss in depth the applications of general optimization techniques, such as branch and bound methods, homotopy methods, complementary geometric programming, primal decomposition methods, subgradient methods, and sequential approximation strategies, in order to develop algorithms for the WSRMax problem. We show, through a number of numerical examples, the applicability of these algorithms in various application domains.

24 January 2014 in arXiv
Verified
Preprint
Open access
PDF file
EAElisabetta Alfonsetti
Elisabetta Alfonsetti
PWPradeep Chathuranga Weeraddana
Pradeep Chathuranga Weeraddana
CFCarlo Fischione
Carlo Fischione
Designing efficient car parking mechanisms that can be potentially integrated into future intelligent transportation systems is of crucial importance. Usually, the related design problems are combinatorial and the worst-case complexity of optimal solution approaches grows exponentially with the problem sizes. Therefore, such optimal approaches are not scalable and practically undesirable. As a result, almost all existing methods for parking slot assignment are simple and greedy approaches, where each car is assigned a free parking slot, which is closer to its destination. Moreover, no emphasis is placed to optimize the social benefit of the users during the parking slot assignment. In this paper, the fairness as a metric for modeling the aggregate social benefit of the users is considered and a distributed algorithm based on Lagrange duality theory is developed. The proposed algorithm is gracefully scalable compared to the optimal methods. In addition, it is shown that the proposed car parking mechanism preserves privacy in the sense that any car involved in the algorithm will not be able to discover the destination of any other car during the algorithm iterations. Numerical results illustrate the performance of the proposed algorithm compared to the optimal assignment and a greedy method. They show that our algorithm yields a good tradeoff between the implementation-level simplicity and the performance. Even though the main emphasis in this paper resides in the car parking slot assignment problem, our formulation and the algorithms, in general, can also be applied or adopted in fair agent-target assignment problems in other application domains.