Klaus Moessner

Interference Management in Femtocells

Increase in system capacity and data rates can be achieved efficiently in a wireless system by getting the transmitter and receiver closer to each other. Femtocells deployed in the macrocell significantly improve the indoor coverage and provide better user experience. The femtocell base station called as Femtocell Access Point (FAP) is fully user deployed and hence reduces the infrastructure, maintenance and operational cost of the operator while at the same time providing good Quality of Service (QoS) to the end user and high network capacity gains. However, the mass deployment of femtocell faces a number of challenges, among which interference management is of much importance, as the fundamental limits of capacity and achievable data rates mainly depends on the interference faced by the femtocell network. To cope with the technical challenges including interference management faced by the femtocells, researchers have suggested a variety of solutions. These solutions vary depending on the physical layer technology and the specific scenarios considered. Furthermore, the cognitive capabilities, as a functionality of femtocell have also been discussed in this survey. This article summarises the main concepts of femtocells that are covered in literature and the major challenges faced in its large scale deployment. The main challenge of interference management is discussed in detail with its types in femtocells and the solutions proposed over the years to manage interference have been summarised. In addition an overview of the current femtocell standardisation and the future research direction of femtocells have also been provided.

An Energy-Efficient Clustering Solution for Wireless Sensor Networks

Hot spots in a wireless sensor network emerge as locations under heavy traffic load. Nodes in such areas quickly deplete energy resources, leading to disruption in network services. This problem is common for data collection scenarios in which Cluster Heads (CH) have a heavy burden of gathering and relaying information. The relay load on CHs especially intensifies as the distance to the sink decreases. To balance the traffic load and the energy consumption in the network, the CH role should be rotated among all nodes and the cluster sizes should be carefully determined at different parts of the network. This paper proposes a distributed clustering algorithm, Energy-efficient Clustering (EC), that determines suitable cluster sizes depending on the hop distance to the data sink, while achieving approximate equalization of node lifetimes and reduced energy consumption levels. We additionally propose a simple energy-efficient multihop data collection protocol to evaluate the effectiveness of EC and calculate the end-to-end energy consumption of this protocol; yet EC is suitable for any data collection protocol that focuses on energy conservation. Performance results demonstrate that EC extends network lifetime and achieves energy equalization more effectively than two well-known clustering algorithms, HEED and UCR.

Enabling smart cities through a cognitive management framework for the internet of things

The Internet of Things (IoT) is expected to substantially support sustainable development of future smart cities. This article identifies the main issues that may prevent IoT from playing this crucial role, such as the heterogeneity among connected objects and the unreliable nature of associated services. To solve these issues, a cognitive management framework for IoT is proposed, in which dynamically changing real-world objects are represented in a virtualized environment, and where cognition and proximity are used to select the most relevant objects for the purpose of an application in an intelligent and autonomic way. Part of the framework is instantiated in terms of building blocks and demonstrated through a smart city scenario that horizontally spans several application domains. This preliminary proof of concept reveals the high potential that self-reconfigurable IoT can achieve in the context of smart cities.

Dynamic spectrum allocation in composite reconfigurable wireless networks

Future wireless systems are expected to be characterized by increasing convergence between networks and further development of reconfigurable radio systems. In parallel with this, demand for radio spectrum from these systems will increase, as users take advantage of high quality multimedia services. This article aims to investigate and review the possibilities for the dynamic allocation of spectrum to different radio networks operating in a composite reconfigurable wireless system. The article first looks into the current interest of regulators in this area, before describing some possible schemes to implement dynamic spectrum allocation and showing some example performance results. Following this, the technical requirements that a DSA system would have, in terms of reconfigurable system implementation, are discussed.

A Survey of Radio Resource Management for Spectrum Aggregation in LTE-Advanced

In order to satisfy the requirements of future IMT-Advanced mobile systems, the concept of spectrum aggregation is introduced by 3GPP in its new LTE-Advanced (LTE Rel. 10) standards. While spectrum aggregation allows aggregation of carrier components (CCs) dispersed within and across different bands (intra/inter-band) as well as combination of CCs having different bandwidths, spectrum aggregation is expected to provide a powerful boost to the user throughput in LTE-Advanced (LTE-A). However, introduction of spectrum aggregation or carrier aggregation (CA) as referred to in LTE Rel. 10, has required some changes from the baseline LTE Rel. 8 although each CC in LTE-A remains backward compatible with LTE Rel. 8. This article provides a review of spectrum aggregation techniques, followed by requirements on radio resource management (RRM) functionality in support of CA. On-going research on the different RRM aspects and algorithms to support CA in LTE-Advanced are surveyed. Technical challenges for future research on aggregation in LTE-Advanced systems are also outlined.

Shared Backup Network Provision for Virtual Network Embedding

Network virtualization has been recognized as a promising solution to enable the rapid deployment of customized services by building multiple Virtual Networks (VNs) on a shared substrate network. Whereas various VN embedding schemes have been proposed to allocate the substrate resources to each VN requests, little work has been done to provide backup mechanisms in case of substrate network failures. In a virtualized infrastructure, a single substrate failure will affect all the VNs sharing that resource. Provisioning a dedicated backup network for each VN is not efficient in terms of substrate resource utilization. In this paper, we investigate the problem of shared backup network provision for VN embedding and propose two schemes: shared on-demand and shared pre-allocation backup schemes. Simulation experiments show that both proposed schemes make better utilization of substrate resources than the dedicated backup scheme without sharing, while each of them has its own advantages.

Providing SOAP Web Services and RESTful Web Services from Mobile Hosts

Providing non interrupted Web Services from resource limited mobile devices in a light weight processing manner is a significant need. This paper takes a step towards achieving this goal. An implementation of two frameworks for providing Web Services from resource constraints devices is presented. The first framework is implemented to provide SOAP Web Services and the second one is implemented to provide RESTful Web Services. Each of those two frameworks has its own features and shortcomings. This paper provides a comparison between SOAP-based frameworks and RESTful-based frameworks. This comparison is carried out to allow us to decide on the framework that best suits mobile environment capabilities and fulfils our requirement of providing mobile Web Services continuously with a light weight processing requirement. This comparison is undertaken and analyzed using three different test scenarios. Our preliminary work shows that a RESTful-based MWSF is more suitable for mobile environments.

Collaborative Spectrum Sensing Optimisation Algorithms for Cognitive Radio Networks

The main challenge for a cognitive radio is to detect the existence of primary users reliably in order to minimise the interference to licensed communications. Hence, spectrum sensing is a most important requirement of a cognitive radio. However, due to the channel uncertainties, local observations are not reliable and collaboration among users is required. Selection of fusion rule at a common receiver has a direct impact on the overall spectrum sensing performance. In this paper, optimisation of collaborative spectrum sensing in terms of optimum decision fusion is studied for hard and soft decision combining. It is concluded that for optimum fusion, the fusion centre must incorporate signal-to-noise ratio values of cognitive users and the channel conditions. A genetic algorithm-based weighted optimisation strategy is presented for the case of soft decision combining. Numerical results show that the proposed optimised collaborative spectrum sensing schemes give better spectrum sensing performance.

Survey of Experimental Evaluation Studies for Wireless Mesh Network Deployments in Urban Areas Towards Ubiquitous Internet

Establishing wireless networks in urban areas that can provide ubiquitous Internet access to end-users is a central part of the efforts towards defining the Internet of the future. In recent years, Wireless Mesh Network (WMN) backbone infrastructures are proposed as a cost effective technology to provide city-wide Internet access. Studies that evaluate the performance of city-wide mesh network deployments via experiments provide essential information on various challenges of building them. In this survey, we particularly focus on such studies and provide brief conclusions on the problems, benefits, and future research directions of city-wide WMNs.

An Intelligent Task Allocation Scheme for Multihop Wireless Networks

Emerging applications in Multihop Wireless Networks (MHWNs) require considerable processing power which often may be beyond the capability of individual nodes. Parallel processing provides a promising solution, which partitions a program into multiple small tasks and executes each task concurrently on independent nodes. However, multihop wireless communication is inevitable in such networks and it could have an adverse effect on distributed processing. In this paper, an adaptive intelligent task mapping together with a scheduling scheme based on a genetic algorithm is proposed to provide real-time guarantees. This solution enables efficient parallel processing in a way that only possible node collaborations with cost-effective communications are considered. Furthermore, in order to alleviate the power scarcity of MHWN, a hybrid fitness function is derived and embedded in the algorithm to extend the overall network lifetime via workload balancing among the collaborative nodes, while still ensuring the arbitrary application deadlines. Simulation results show significant performance improvement in various testing environments over existing mechanisms.