Refine
Document Type
- Article (7)
- In Proceedings (4)
- ZIB-Report (3)
- Book (1)
Language
- English (15)
Is part of the Bibliography
- no (15)
Keywords
- 0-1 Program (1)
- ALOHA (1)
- Base Station Cooperation (1)
- Drift Minimization (1)
- Dynamic Programming (1)
- Lagrangian Relaxation (1)
- Network Design (1)
- Random Access Channel (1)
- Self Organizing Networks (SONs) (1)
- Wireless Communications (1)
Institute
Base station cooperation in the downlink of cellular systems has been recently suggested as a promising concept towards a
better exploitation of the communication system physical resources. It may offer a high gain in capacity through interference mitigation.
This however,
comes at a cost of high information exchange between cooperating entities and a high computational burden.
Clustering of base stations into subgroups is an alternative to
guarantee such cooperation benefits in a lower scale. The optimal definition of clusters, however, and a systematic way to find a solution to
such problem is not yet available. In this work, we highlight the combinatorial nature of the problem, exploit this to describe the
system of users and base stations as a graph and formulate a pure 0-1 program. Its solution
suggests a cost optimal way to form clusters and assign user subsets to them.
We present and prove a theorem which gives the optimal dual vector for which a Lagrangian dual problem in the Single Period Design Problem (SPDP) is maximized.
Furthermore we give a straightforward generalization to the Multi-Period Design Problem (MPDP). Based on the optimal dual values derived we compute the solution of the Lagrangian relaxation and compare it
with the linear relaxation and optimal IP values.
An Optimal Stopping Approach to ARQ Protocols with Variable Success Probabilities per Retransmission
(2007)