Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds

Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols. A number of testbeds are currently available for this purpose and a growing number of users are requesting access to those testbeds. This motivates the need for better utilization of the testbeds by allowing concurrent experimentations. In this work, we introduce a novel mapping algorithm that aims to maximize wireless testbed utilization using frequency slicing of the spectrum resources. The mapper employs genetic algorithm to find the best combination of requests that can be served concurrently, after getting all possible mappings of each request via an induced sub-graph isomorphism stage. The proposed mapper is tested on grid testbeds and randomly generated topologies. The solution of our mapper is compared to the optimal one, obtained through a brute-force search, and was able to serve the same number of requests in 82.96% of testing scenarios. Furthermore, we show the effect of the careful design of testbed topology on enhancing the testbed utilization by applying our mapper on a carefully positioned 8-nodes testbed. In addition, our proposed approach for testbed slicing and requests mapping has shown an improved performance in terms of total served requests, about five folds, compared to the simple allocation policy with no slicing.Comment: IEEE Wireless Communications and Networking Conference (WCNC) 201

Joint User-Association and Resource-Allocation in Virtualized Wireless Networks

In this paper, we consider a down-link transmission of multicell virtualized wireless networks (VWNs) where users of different service providers (slices) within a specific region are served by a set of base stations (BSs) through orthogonal frequency division multiple access (OFDMA). In particular, we develop a joint BS assignment, sub-carrier and power allocation algorithm to maximize the network throughput, while satisfying the minimum required rate of each slice. Under the assumption that each user at each transmission instance can connect to no more than one BS, we introduce the user-association factor (UAF) to represent the joint sub-carrier and BS assignment as the optimization variable vector in the mathematical problem formulation. Sub-carrier reuse is allowed in different cells, but not within one cell. As the proposed optimization problem is inherently non-convex and NP-hard, by applying the successive convex approximation (SCA) and complementary geometric programming (CGP), we develop an efficient two-step iterative approach with low computational complexity to solve the proposed problem. For a given power-allocation, Step 1 derives the optimum userassociation and subsequently, for an obtained user-association, Step 2 find the optimum power-allocation. Simulation results demonstrate that the proposed iterative algorithm outperforms the traditional approach in which each user is assigned to the BS with the largest average value of signal strength, and then, joint sub-carrier and power allocation is obtained for the assigned users of each cell. Especially, for the cell-edge users, simulation results reveal a coverage improvement up to 57% and 71% for uniform and non-uniform users distribution, respectively leading to more reliable transmission and higher spectrum efficiency for VWN

A survey on OFDM-based elastic core optical networking

Orthogonal frequency-division multiplexing (OFDM) is a modulation technology that has been widely adopted in many new and emerging broadband wireless and wireline communication systems. Due to its capability to transmit a high-speed data stream using multiple spectral-overlapped lower-speed subcarriers, OFDM technology offers superior advantages of high spectrum efficiency, robustness against inter-carrier and inter-symbol interference, adaptability to server channel conditions, etc. In recent years, there have been intensive studies on optical OFDM (O-OFDM) transmission technologies, and it is considered a promising technology for future ultra-high-speed optical transmission. Based on O-OFDM technology, a novel elastic optical network architecture with immense flexibility and scalability in spectrum allocation and data rate accommodation could be built to support diverse services and the rapid growth of Internet traffic in the future. In this paper, we present a comprehensive survey on OFDM-based elastic optical network technologies, including basic principles of OFDM, O-OFDM technologies, the architectures of OFDM-based elastic core optical networks, and related key enabling technologies. The main advantages and issues of OFDM-based elastic core optical networks that are under research are also discussed

Energy-Efficient NOMA Enabled Heterogeneous Cloud Radio Access Networks

Heterogeneous cloud radio access networks (H-CRANs) are envisioned to be promising in the fifth generation (5G) wireless networks. H-CRANs enable users to enjoy diverse services with high energy efficiency, high spectral efficiency, and low-cost operation, which are achieved by using cloud computing and virtualization techniques. However, H-CRANs face many technical challenges due to massive user connectivity, increasingly severe spectrum scarcity and energy-constrained devices. These challenges may significantly decrease the quality of service of users if not properly tackled. Non-orthogonal multiple access (NOMA) schemes exploit non-orthogonal resources to provide services for multiple users and are receiving increasing attention for their potential of improving spectral and energy efficiency in 5G networks. In this article a framework for energy-efficient NOMA H-CRANs is presented. The enabling technologies for NOMA H-CRANs are surveyed. Challenges to implement these technologies and open issues are discussed. This article also presents the performance evaluation on energy efficiency of H-CRANs with NOMA.Comment: This work has been accepted by IEEE Network. Pages 18, Figure