Base station sharing is currently considered one of the most promising solutions for reducing the energy consumption costs of cellular networks. This paper presents a game theoretic framework for the study of such cooperative solutions where different mobile network operators (MNOs) decide to switch off subsets of their base stations during off-peak hours and roam their traffic to the remaining stations. The solution is based on a detailed optimization framework that determines exactly which base stations should remain active and how much traffic each one of them should serve, so as to maximize the aggregate energy savings. Accordingly, using the axiomatic Shapley value rule, it is determined how the benefits from the cooperation, i.e., the cost savings, should be dispersed among the cooperating MNOs. It is proved that this coalitional game with transferrable utilities has a nonempty core, and thus there exists a cooperation solution that incentivizes the participation of all operators. Moreover, using a thorough numerical analysis, it is shown that the benefits achieved with the implementation of the cooperation strategy depend mainly on the power consumption characteristics of the MNOs, which in turn are related to the number, type, and technology of their base stations. Overall, the energy savings are found to be most sensitive to the technology of the used base stations, and more precisely to the no-load base station energy consumption which defines the energy waste in a network.

A variety of dynamic bandwidth allocation (DBA) algorithms have been proposed to foster the performance of Ethernet passive optical networks (EPONs). These DBA algorithms use packet delay as an important quality of service (QoS) metric. This has led to a significant interest in developing mathematical models for analyzing the delay. These delay models often provide valuable qualitative results and worthwhile insights in understanding the mechanism of the delay and the manner in which it depends upon algorithm characteristics. Up to now, the delay models have been developed under some approximations, e.g., fixed packet sizes, negligible distances between a server and its users, a gated bandwidth assignment method, and Poisson traffic. In this paper, we develop the delay models for more realistic scenarios than the current state-of-the-art, including gated and limited bandwidth assignment methods, Poisson and Pareto traffic, and long-reach PONs in which the distance between the server and the users is significant and hence not negligible. We model different DBA paradigms, such as REPORT after data, REPORT before data, and multi-thread polling. The results from simulation experiments confirm the accuracy of the delay models.

Wireless Sensor Networks (WSNs) are subject to high levels of dynamism arising from changing environmental conditions and application requirements. Reconfiguration allows software functionality to be optimized for current environmental conditions and supports software evolution to meet variable application requirements. Contemporary software modularization approaches for WSNs allow for software evolution at various granularities; from monolithic re-flashing of OS and application functionality, through replacement of complete applications, to the reconfiguration of individual software components. As the nodes that compose a WSN must typically operate for long periods on a single battery charge, estimating the energy cost of software evolution is critical. This paper contributes a generic model for calculating the energy cost of the reconfiguration in WSN. We have embedded this model in the LooCI middleware, resulting in the first energy aware reconfigurable component model for sensor networks. We evaluate our approach using two real-world WSN applications and find that (i.) our model accurately predicts the energy cost of reconfiguration and (ii.) component-based reconfiguration has a high initial cost, but provides energy savings during software evolution.

Hybrid WDM/TDM Passive Optical Network (PON) is a promising candidate for next-generation optical access (NGOA) solutions as it is able to offer a high splitting ratio and consequently achieves a relatively low cost and power consumption on a per-user basis compared with other NGOA architectures. On the other hand, the end users require a certain level of connection availability while the operators need to reduce the failure impact (i.e. to avoid a huge number of end users being affected by any single failure). Therefore, by evaluating the connection availability and failure impact robustness we identify the most efficient parts to provide resilience in a hybrid WDM/TDM PON from an operator and an end-user perspective. Then, we select the appropriate protection schemes to construct some novel reliable architectures and analyze their reliability performance in urban and rural scenarios. In this way, this paper provides a comprehensive insight into the most relevant protection mechanisms for hybrid WDM/TDM PONs.

The paper describes different research concepts of which the combination leads to an improvement of the power consumption per subscriber in a wireline access network by 10× and the energy efficiency per transferred bit by 100×.

In this paper we propose a new random channel access protocol to reduce the channel access delay in a multichannel orthogonal frequency division multiple access (OFDMA) wireless networks. In particular, we propose a two dimensional random walk through time and frequency domain slots simultaneously to reduce the random channel access delay for the IEEE 802.16e-2005 based WiMAX media access control (MAC) protocol. We prove through simulation that our proposed scheme improves upon the existing random channel access mechanism with truncated binary back-off, currently implemented in WiMAX. We demonstrated that with our proposed channel access mechanism, a mobile node with real time traffic requirements will have minimum service disruption due to the reduced delay in the initial ranging and the bandwidth request phase while changing rooms.

For Mobile WiMAX, data rate and throughput figures are often presented in literature. However, the used calculation methods and the influence of the packet size on the data rate are often unclear. Therefore, we develop a new method in order to obtain more precise data rate figures at the MAC (Medium Access Control) layer. In this paper the common physical data rate and MAC data rate calculation method are first examined. Next, the new MAC data rate calculation method is presented. They are applied to the official set of Mobile WiMAX parameters. Our method is able to differentiate for different packet sizes and provides a prediction of the MAC layer throughput.

Nowadays, many telecom operators are reluctant to roll out a new fiber to the home (FTTH) infrastructure, as they are put off by the high investment costs. Inspired by several local FTTH initiatives, especially in Western Europe, this paper considers an FTTH rollout by a local community. We show that clearly different economics play a part in case a community would roll out the FTTH infrastructure, and we give also an indication of some required conditions to obtain a feasible FTTH rollout. To get realistic results, the techno-economic study has been applied on a municipality network in the city of Ghent, located in Belgium. We have performed a cost/benefit analysis, and different rollout schemes are compared to each other. As the introduction of a new technology involves a lot of uncertainties, it is of great importance to determine the most influencing parameters. For that purpose, we have executed a detailed sensitivity analysis, which also provide us with a general forecast of the outcome of the considered case study.

This paper describes extensive research in the field of the Multipoint Control Protocol (MPCP) for the Ethernet Passive Optical Network (EPON). More in particular the dynamic bandwidth allocation (DBA) algorithm IPACT (Interleaved Polling with Adaptive Cycle Time) is analytically modeled. The main focus has been on analyzing cycle times and packet delay in detail. The analysis starts from a simple traffic model with Poisson arrival rates, symmetric load and fixed packet size. Based on the obtained insights, more general cases with asymmetric traffic load, packet size distribution, self-similar traffic and differentiated services are further elaborated.