Min-Max Coverage in Multi-interface Networks

International audienceWe consider devices equipped with multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost. In this paper, we consider the problem of establishing the connections defined by a network G = (V,E) while keeping as low as possible the maximum cost set of active interfaces at the single nodes. Nodes V represent the devices, edges E represent the connections that must be established. We study the problem of minimizing the maximum cost set of active interfaces among the nodes of the network in order to cover all the edges. We prove that the problem is NP-hard for any fixed Δ ≥ 5 and k ≥ 16, with Δ being the maximum degree, and k being the number of different interfaces among the network. We also show that the problem cannot be approximated within Ω(ln Δ). We then provide a general approximation algorithm which guarantees a factor of O((1 + b)ln (Δ)), with b being a parameter depending on the topology of the input graph. Interestingly, b can be bounded by a constant for many graph classes. Other approximation and exact algorithms for special cases are presented

To mesh or not to mesh: flexible wireless indoor communication among mobile robots in industrial environments

Mobile robots such as automated guided vehicles become increasingly important in industry as they can greatly increase efficiency. For their operation such robots must rely on wireless communication, typically realized by connecting them to an existing enterprise network. In this paper we motivate that such an approach is not always economically viable or might result in performance issues. Therefore we propose a flexible and configurable mixed architecture that leverages on mesh capabilities whenever appropriate. Through experiments on a wireless testbed for a variety of scenarios, we analyse the impact of roaming, mobility and traffic separation and demonstrate the potential of our approach

Scalable RAN Virtualization in Multi-Tenant LTE-A Heterogeneous Networks (Extended version)

Cellular communications are evolving to facilitate the current and expected increasing needs of Quality of Service (QoS), high data rates and diversity of offered services. Towards this direction, Radio Access Network (RAN) virtualization aims at providing solutions of mapping virtual network elements onto radio resources of the existing physical network. This paper proposes the Resources nEgotiation for NEtwork Virtualization (RENEV) algorithm, suitable for application in Heterogeneous Networks (HetNets) in Long Term Evolution-Advanced (LTE-A) environments, consisting of a macro evolved NodeB (eNB) overlaid with small cells. By exploiting Radio Resource Management (RRM) principles, RENEV achieves slicing and on demand delivery of resources. Leveraging the multi-tenancy approach, radio resources are transferred in terms of physical radio Resource Blocks (RBs) among multiple heterogeneous base stations, interconnected via the X2 interface. The main target is to deal with traffic variations in geographical dimension. All signaling design considerations under the current Third Generation Partnership Project (3GPP) LTE-A architecture are also investigated. Analytical studies and simulation experiments are conducted to evaluate RENEV in terms of network's throughput as well as its additional signaling overhead. Moreover we show that RENEV can be applied independently on top of already proposed schemes for RAN virtualization to improve their performance. The results indicate that significant merits are achieved both from network's and users' perspective as well as that it is a scalable solution for different number of small cells.Comment: 40 pages (including Appendices), Accepted for publication in the IEEE Transactions on Vehicular Technolog

Enhanced Inter-Cell Interference Coordination Challenges in Heterogeneous Networks

3GPP LTE-Advanced has started a new study item to investigate Heterogeneous Network (HetNet) deployments as a cost effective way to deal with the unrelenting traffic demand. HetNets consist of a mix of macrocells, remote radio heads, and low-power nodes such as picocells, femtocells, and relays. Leveraging network topology, increasing the proximity between the access network and the end-users, has the potential to provide the next significant performance leap in wireless networks, improving spatial spectrum reuse and enhancing indoor coverage. Nevertheless, deployment of a large number of small cells overlaying the macrocells is not without new technical challenges. In this article, we present the concept of heterogeneous networks and also describe the major technical challenges associated with such network architecture. We focus in particular on the standardization activities within the 3GPP related to enhanced inter-cell interference coordination.Comment: 12 pages, 4 figures, 2 table

Weighted proportional fairness and pricing based resource allocation for uplink offloading using IP flow mobility

Mobile data offloading has been proposed as a solution for the network congestion problem that is continuously aggravating due to the increase in mobile data demand. However, the majority of the state-of-the-art is focused on the downlink offloading, while the change of mobile user habits, like mobile content creation and uploading, makes uplink offloading a rising issue. In this work we focus on the uplink offloading using IP Flow Mobility (IFOM). IFOM allows a LTE mobile User Equipment (UE) to maintain two concurrent data streams, one through LTE and the other through WiFi access technology, that presents uplink limitations due to the inherent fairness design of IEEE 802.11 DCF by employing the CSMA/CA scheme with a binary exponential backoff algorithm. In this paper, we propose a weighted proportionally fair bandwidth allocation algorithm for the data volume that is being offloaded through WiFi, in conjunction with a pricing-based rate allocation for the rest of the data volume needs of the UEs that are transmitted through the LTE uplink. We aim to improve the energy efficiency of the UEs and to increase the offloaded data volume under the concurrent use of access technologies that IFOM allows. In the weighted proportionally fair WiFi bandwidth allocation, we consider both the different upload data needs of the UEs, along with their LTE spectrum efficiency and propose an access mechanism that improves the use of WiFi access in uplink offloading. In the LTE part, we propose a two-stage pricing-based rate allocation under both linear and exponential pricing approaches, aiming to satisfy all offloading UEs regarding their LTE uplink access. We theoretically analyse the proposed algorithms and evaluate their performance through simulations. We compare their performance with the 802.11 DCF access scheme and with a state-of-the-art access algorithm under different number of offloading UEs and for both linear and exponential pricing-based rate allocation for the LTE uplink. Through the evaluation of energy efficiency, offloading capabilities and throughput performance, we provide an improved uplink access scheme for UEs that operate with IFOM for uplink offloading.Peer ReviewedPreprin

Optimized Design of Survivable MPLS over Optical Transport Networks. Optical Switching and Networking

In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks in terms of network resource usage and configuration cost. We investigate two approaches to the survivability deployment: single layer and multilayer survivability and present various methods for spare capacity allocation (SCA) to reroute disrupted traffic. The comparative analysis shows the influence of the traffic granularity on the survivability cost: for high bandwidth LSPs, close to the optical channel capacity, the multilayer survivability outperforms the single layer one, whereas for low bandwidth LSPs the single layer survivability is more cost-efficient. For the multilayer survivability we demonstrate that by mapping efficiently the spare capacity of the MPLS layer onto the resources of the optical layer one can achieve up to 22% savings in the total configuration cost and up to 37% in the optical layer cost. Further savings (up to 9 %) in the wavelength use can be obtained with the integrated approach to network configuration over the sequential one, however, at the increase in the optimization problem complexity. These results are based on a cost model with actual technology pricing and were obtained for networks targeted to a nationwide coverage