Search

In this paper, we revisit the radio network energy performance evaluation methodology, commonly known as E3F, that was developed in the European EARTH project during 2010–2011. We propose updates to the large-scale deployment and long-term traffic models in order to reflect the situation in a 5G time frame, and also an improvement in the sense that the baseline network is dimensioned to exactly meet the traffic and performance requirements. As an example, we apply the methodology in order to dimension and evaluate the energy performance of a state-of-the-art country-wide LTE network. The inter site distances of the resulting network range from 380 m in super dense urban (serving 20,000 citizens/km2) to 4850 m in rural areas (serving 100 citizens/km2). The resulting average power per area unit is 0.14 kW/km2, which is significantly lower than what was found in the EARTH project. This can be explained by two factors: i) The present study assumes more efficient base stations, and ii) the baseline network of the original E3F was over-dimensioned. Nevertheless, the conclusion from the EARTH project, that the absolute majority of energy consumed in a radio network is spent on providing coverage, still remains.

Interference elimination is a key aspect of planning and operating wireless networks. Using frequency duplex links is a common practice, where the communication is done via two channels separated in frequency. An optimization problem is how to allocate the channels in the frequency duplex in order to reduce or completely eliminate the interference might occur between links. In a previous paper we revealed the unexpected difference between this problem and polarization setting if the sharpness of the applied beam widths is relaxed in such microwave networks. In this paper we extend the graph theory based approach of this problem and generalize the special cases of the previous study.

Careful planning of wireless networks is essential to provide reliable communication, especially that microwave links are frequently chosen to interconnect access points within networks. The optimization of such networks belongs to the frequency assignment problems and focuses on setting polarization of the links or allocating the channels in a frequency duplex to reduce or eliminate the interference that might occur between links. In this paper we are aiming to reveal the unexpected difference between these two well-studied problems if the sharpness of the applied beam widths is relaxed. We provide graph theory based analysis and reveal the main differences between frequency duplexing and polarization setting from mathematical point of view. We give numerical bounds for efficiency and show traps of algorithmic solutions working with interference graphs.

The authors conclude that instantaneous cell-load and buffer service-rate measurements can serve as input to various energy saving network algorithms. For example, such algorithms can control intelligent sleep modes in a mobile network, and can turn on and off radio resources according to the temporal and spatial variations of traffic. In particular, the authors demonstrate that underutilized 3-sector base stations can be reconfigured to omnicell base stations without significant service degradation in a network and that can save the power of two out of three radio units on typical 3-sector base stations.

Absliocl - Telecommunications, computer Scimccs and media of today scem to converge to an IP network. Not only IP baekhunc will be used but also IP access networks. At the ramf time there is an increasing need far mehilily. MobilelP can not provide fast handavers in an always-on scenario. Therefore IP micro mobility solutions are needed. IP micro mobility networks have several special requirements. Thry haw to provide fast handavers and Speckdl routing is needed. Most of the IP micro mobility solutions are bawd upon a tree topology network. The most important wcakness of the tree topology nrhvorks is vulnerability. .4ftcr introducing a reliabilily model for micro mobility networks and an algorithm to compute the reliability of tree topology micro

In this paper we propose a heuristic planning algorithm for optimizing tree-topology access networks. Our suggested method is able to plan a multi-constrained and capacitated subnetwork tree with a previously dedicated root node. The algorithm is a combination of an adaptive version of the simulated annealing meta-heuristic and a local improvement strategy. We use the proposed method to solve the optimization problem of UMTS (universal mobile telecommunications system) access networks. Beside the description of the model and the algorithm we present a detailed performance analysis of our proposed method using different network configurations and traffic demands. Tests show that our proposed algorithm provides solutions very close to the global optimum and because of its computational efficiency it is usable for planning practical size networks. It is also important to note that our method can be easily adapted for similar planning tasks in case of many other technological backgrounds.