TY - JOUR A1 - Giovanidis, Anastasios A1 - Stanczak, Slawomir T1 - Stability and Distributed Power Control in MANETs with per Hop Retransmissions JF - IEEE Trans. on Communications Y1 - 2011 ER - TY - GEN A1 - Giovanidis, Anastasios A1 - Liao, Qi A1 - Stanczak, Slawomir T1 - Measurement Based Self-Optimization in Random Access Communications N2 - The current work considers random access communications within a single cell and provides an algorithmic suggestion for the almost optimal coordination of user actions. In the scenario considered, an access effort is successful if (a) the signal is detected at the receiver and (b) no collision occurs. The first event is controlled by the user transmission power and the second by the choice of access (back-off) probability. These constitute the user action pair. The algorithm aims at exploiting information from measurements and user reports, in order to estimate current values of the system situation. Based on these, two optimization problems can be formulated and solved for the so called contention level and transmission power level at the base station side. The methodology to find the optimal values is based on minimization of a drift function. The two values are broadcast in order to help the users update their actions ``almost optimally``. In this way the wireless cell can achieve self-optimization, without outside coordination, by relying on such intelligent information exchange and parameter estimation. Numerical results illustrate the great benefits of the suggested algorithm, compared to scenarios where the actions remain fixed, at a very low or even zero cost in power expenditure and delay. T3 - ZIB-Report - 11-18 KW - Random Access Channel KW - Self Organizing Networks (SONs) KW - Dynamic Programming KW - Drift Minimization KW - ALOHA Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-12764 ER - TY - GEN A1 - Giovanidis, Anastasios A1 - Brueck, Stefan A1 - D'Andreagiovanni, Fabio A1 - Krolikowski, Jonatan A1 - Hartanto Tanzil, Vicky T1 - A 0-1 Program for Minimum Clustering in Downlink Base Station Cooperation N2 - 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. T3 - ZIB-Report - 11-19 KW - Wireless Communications KW - Base Station Cooperation KW - 0-1 Program Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-12776 ER - TY - GEN A1 - Giovanidis, Anastasios A1 - Pulaj, Jonad T1 - The Multiperiod Network Design Problem: Lagrangian-based Solution Approaches N2 - 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. T3 - ZIB-Report - 11-31 KW - Network Design KW - Lagrangian Relaxation Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-13367 ER -