Results analysis and validation - D5.3

Deliverable D5.3 del projecte OneFITPostprint (author’s final draft

Intelligent optimization of Circuit placement on FPGA

Field programmable gate arrays (FPGAs) have revolutionized the way digital systems are designed and built over the past decade. With architectures capable of holding tens of millions of logic gates on the horizon and planned integration of configurable logic into system-on-chip platforms, the versatility of programmable devices expected to increase dramatically. Placement is one of the vital steps in mapping a design into FPGA in order to take best advantage of the resources and flexibility provided by it. Here, we propose to test techniques of Placement Optimization on MCNC Benchmark circuits. PSO (Particle Swarm Optimization) has been implemented on circuit netlist with bounding box as cost function. Alternate cost functions were also employed to verify efficiency of optimization. Furthermore, lazy descent was introduced into the algorithm to impede premature convergence. Different values of acceleration and weighing factors were used in the implementation and corresponding convergence results were analyzed. Keywords- FPGA Placement; Particle Swarm Optimization; MCNC Benchmarks Circuits; Bounding Box driven Placement

Optimal Spectrum Utilization and Flow Controlling In Heterogeneous Network with Reconfigurable Devices

Fairness provisioning in heterogeneous networks is a prime issue for high-rate data flow, wherein the inter-connectivity property among different communication devices provides higher throughput. In Hetnet, optimal resource utilization is required for efficient resource usage. Proper resource allocation in such a network led to higher data flow performance for real-time applications. In view of optimal resource allocation, a resource utilization approach for a reconfigurable cognitive device with spectrum sensing capability is proposed in this paper.  The allocation of the data flow rate at device level is proposed for optimization of network fairness in a heterogeneous network.  A dynamic approach of rate-inference optimization is proposed to provide fairness in dynamic data traffic conditions. The simulation results validate the improvement in offered quality in comparison to multi-attribute optimization

Deploying an NFV-Based Experimentation Scenario for 5G Solutions in Underserved Areas

Presently, a significant part of the world population does not have Internet access. The fifth-generation cellular network technology evolution (5G) is focused on reducing latency, increasing the available bandwidth, and enhancing network performance. However, researchers and companies have not invested enough effort into the deployment of the Internet in remote/rural/undeveloped areas for different techno-economic reasons. This article presents the result of a collaboration between Brazil and the European Union, introducing the steps designed to create a fully operational experimentation scenario with the main purpose of integrating the different achievements of the H2020 5G-RANGE project so that they can be trialed together into a 5G networking use case. The scenario encompasses (i) a novel radio access network that targets a bandwidth of 100 Mb/s in a cell radius of 50 km, and (ii) a network of Small Unmanned Aerial Vehicles (SUAV). This set of SUAVs is NFV-enabled, on top of which Virtual Network Functions (VNF) can be automatically deployed to support occasional network communications beyond the boundaries of the 5G-RANGE radio cells. The whole deployment implies the use of a virtual private overlay network enabling the preliminary validation of the scenario components from their respective remote locations, and simplifying their subsequent integration into a single local demonstrator, the configuration of the required GRE/IPSec tunnels, the integration of the new 5G-RANGE physical, MAC and network layer components and the overall validation with voice and data services

Formulation, implementation considerations, and first performance evaluation of algorithmic solutions - D4.1

Deliverable D4.1 del projecte Europeu OneFIT (ICT-2009-257385)This deliverable contains a first version of the algorithmic solutions for enabling opportunistic networks. The presented algorithms cover the full range of identified management tasks: suitability, creation, QoS control, reconfiguration and forced terminations. Preliminary evaluations complement the proposed algorithms. Implementation considerations towards the practicality of the considered algorithms are also included.Preprin

Opportunities and Challenges in OFDMA-Based Cellular Relay Networks: A Radio Resource Management Perspective

The opportunities and flexibility in relay networks and orthogonal frequency-division multiple access (OFDMA) make the combination a suitable candidate network and air-interface technology for providing reliable and ubiquitous high-data-r

Integration of unidirectional technologies into wireless back-haul architecture

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.Back-haul infrastructures of today's wireless operators must support the triple-play services demanded by the market or regulatory bodies. To cope with increasing capacity demand, the EU FP7 project CARMEN has developed a cost-effective heterogeneous multi-radio wireless back-haul architecture, which may also leverage the native multicast capabilities of broadcast technologies such as DVB-T to off-load high-bandwidth broadcast content delivery. However, the integration of such unidirectional technologies into a packet-switched architecture requires careful considerations. The contribution of this thesis is the investigation, design and evaluation of protocols and mechanisms facilitating the integration of such unidirectional technologies into the wireless back-haul architecture so that they can be configured and utilized by the spectrum and capacity optimization modules. This integration mainly concerns the control plane and, in particular, the aspects related to resource and capability descriptions, neighborhood, link and Multi Protocol Label Switching (MPLS) Label-Switched Path (LSP) monitoring, unicast and multicast LSP signalling as well as topology forming and maintenance. During the course of this study we have analyzed the problem space, proposed solutions to the resulting research questions and evaluated our approach. Our results show that the now Unidirectional Technology (UDT)-aware architecture can readily consider Unidirectional Technologies (UDTs) to distribute, for example, broadcast content

Resource allocation in networks via coalitional games

The main goal of this dissertation is to manage resource allocation in network engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces new approaches for resource allocation in Orthogonal Frequency Division Multiple Access (OFDMA) wireless networks and in smart power grids by casting the problems to the coalitional game framework and by providing a constructive iterative algorithm based on dynamic learning theory.  Software Engineering (Software)Algorithms and the Foundations of Software technolog