Search

Faced with the threat of climate change, the world is rapidly adopting Electric Vehicles (EVs). The EV ecosystem, however, is vulnerable to cyber-attacks putting it and the power grid at risk. In this article, we present a security-oriented real-time Co-simulation Testbed for the EV ecosystem and the power grid., Comment: "\c{opyright} 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works."

In this work, we investigate that the abundance of Electric Vehicles (EVs) can be exploited to target the stability of the power grid. Through a cyber attack that compromises a lot of available EVs and their charging infrastructure, we present a realistic coordinated switching attack that initiates inter-area oscillations between different areas of the power grid. The threat model as well as linearized state-space representation of the grid are formulated to illustrate possible consequences of the attack. Two variations of switching attack are considered, namely, switching of EV charging and discharging power into the grid. Moreover, two possible attack strategies are also considered (i) using an insider to reveal the accurate system parameters and (ii) using reconnaissance activities in the absence of the grid parameters. In the former strategy, the system equations are used to compute the required knowledge to launch the attack. However, a stealthy system identification technique, which is tailored based on Eigenvalue Realization Algorithm (ERA), is proposed in latter strategy to calculate the required data for attack execution. The two-area Kundur, 39-Bus New England, and the Australian 5-area power grids are used to demonstrate the attack strategies and their consequences. The collected results demonstrate that by manipulation of EV charging stations and launching a coordinated switching attack to those portions of load, inter-area oscillations can be initiated. Finally, to protect the grid from this anticipated attack, a Support Vector Machine (SVM) based framework is proposed to detect and eliminate this attack even before being executed.

This special section features the latest research contributions regarding the design and management of reliable networks. Reliability of communication infrastructure is a top priority for network operators. To ensure reliable network operation, new design and management techniques for reliable communications must be constantly devised to respond to the rapid network and service evolution. As a recent and relevant example, deployments of 5G communication networks will soon enter their second phase, during which the network infrastructure will require upgrades to support new Ultra-Reliable Low-Latency Communication (URLLC) services with availabilities of up to 6 nines to be guaranteed jointly with extremely low latencies. Even in the still preliminary vision of 6G communication networks, reliability is posed as one of the most critical requirements, as 6G networks will represent the communication platform of our future hyper-connected society, supporting essential services as smart mobility, e-health, and immersive environments with application in remote education and working, just to name a few. Similarly, disaster resiliency in communication networks is now attracting the attention of media, government and industry as never before (consider, e.g., the worldwide network traffic deluge to support remote working during the current Coronavirus pandemic). Luckily, several new technical directions can be leveraged to provide new solutions for network reliability as: increased network reconfigurability enabled by Software Defined Networking (SDN); integration/convergence of multiple technologies (optical, wireless satellite, datacenter networks); enhanced forms of data/service replication, supported by, e.g., edge computing; network slicing, used to carve highly-reliable logical partitions of network, computing and storage resources. These, and many others, technological transformations can be leveraged to enable next-generation high-reliability networks.

The work presented in this article aims at improving the ground vehicle connectivity in the context of an intermittent vehicle-to-UAV (V2U) communication scenario where vehicles opportunistically establish time-limited connectivity with passing by unmanned aerial vehicles (UAVs) serving as flying base stations responsible for routing incoming vehicle data over backbone networks and/or the Internet. As opposed to existing work in the literature where vehicles are only allowed to establish direct connectivity with in-range UAVs, this work aims at also exploiting the possible formation of vehicular clusters and, hence, the feasibility of intervehicular communications to establish multihop paths connecting source vehicles to destination UAVs. A mathematical model is presented for the purpose of capturing the nodal (i.e., vehicles and UAVs) mobility dynamics and derive an expression for the overall V2U connectivity probability as well as the overall average vehicle connection time. Extensive simulations are conducted in order to adduce the validity and accuracy of the proposed model and provide further insights into the connectivity sensibility to fundamental system parameters.

The fifth generation (5G) networks are expected to support diverse business verticals (i.e., manufacturing, health care, etc.) with varying quality of service requirements. While today’s mobile networks are a one size fits all architecture, tomorrow’s 5G mobile networks are envisioned to encourage agility, programmability and elasticity through enabling a software-based architecture promoted by network slicing. Network slicing is a new paradigm consisting of partitioning the underlying network infrastructure into different logical network slices, each dedicated to address the requirements (i.e., ultra-low latency, ultra-reliability, etc.) of a group of services. Network Function Virtualization (NFV) and Software Defined Networking (SDN) technologies have been identified as main enablers of network slicing, facilitating the fulfillment of the aforementioned services’ requirements. In this paper, we study the Latency-Aware service scheduling (LASS) problem to solve the network function mapping, the traffic routing and the network service scheduling in the context of an ultra-low latency network slice to consider services with stringent deadlines. We propose the LASS-Game, a novel game-theoretic approach presenting a scalable solution for the LASS problem that accounts for the centralized aspect of the problem while leveraging a decentralized mapping, routing and scheduling decisions.

The emergence of Internet of Things malware, which leverages exploited IoT devices to perform large-scale cyber attacks (e.g., Mirai botnet), is considered as a major threat to the Internet ecosystem. To mitigate such threat, there is an utmost need for effective IoT malware classification and family attribution, which provide essential steps towards initiating attack mitigation/prevention countermeasures. In this paper, motivated by the lack of sophisticated malware obfuscation in the implementation of IoT malware, we utilize features extracted from strings- and image-based representations of the executable binaries to propose a novel multi-dimensional classification approach using Deep Learning (DL) architectures. To this end, we analyze more than 70,000 recently detected IoT malware samples. Our in-depth experiments with four prominent IoT malware families highlight the significant accuracy of the approach (99.78%), which outperforms conventional single-level classifiers. Additionally, we utilize our IoT-tailored approach for labeling newly detected “unknown” malware samples, which were mainly attributed to a few predominant families. Finally, this work contributes to the security of future networks (e.g., 5G) through the implementation of effective tools/techniques for timely IoT malware classification, and attack mitigation.

Disaster management, search and rescue missions, and health monitoring are examples of critical applications that require object localization with high precision and sometimes in a timely manner. In the absence of the global positioning system (GPS), the radio received signal strength index (RSSI) can be used for localization purposes due to its simplicity and cost-effectiveness. However, due to the low accuracy of RSSI, unmanned aerial vehicles (UAVs) or drones may be used as an efficient solution for improved localization accuracy due to their agility and higher probability of line-of-sight (LoS). Hence, in this context, we propose a novel framework based on reinforcement learning (RL) to enable a UAV (agent) to autonomously find its trajectory that results in improving the localization accuracy of multiple objects in shortest time and path length, fewer signal-strength measurements (waypoints), and/or lower UAV energy consumption. In particular, we first control the agent through initial scan trajectory on the whole region to 1) know the number of nodes and estimate their initial locations, and 2) train the agent online during operation. Then, the agent forms its trajectory by using RL to choose the next waypoints in order to minimize the average location errors of all objects. Our framework includes detailed UAV to ground channel characteristics with an empirical path loss and log-normal shadowing model, and also with an elaborate energy consumption model. We investigate and compare the localization precision of our approach with existing methods from the literature by varying the UAV's trajectory length, energy, number of waypoints, and time. Furthermore, we study the impact of the UAV's velocity, altitude, hovering time, communication range, number of maximum RSSI measurements, and number of objects. The results show the superiority of our method over the state-of-art and demonstrates its fast reduction of the localization error.

We investigate the benefits of integrating unmanned aerial vehicles (UAVs) with reconfigurable intelligent surface (RIS) elements to passively relay information sampled by Internet of Things devices (IoTDs) to the base station (BS). In order to maintain the freshness of relayed information, an optimization problem with the objective of minimizing the expected sum Age-of-Information (AoI) is formulated to optimize the altitude of the UAV, the communication schedule, and phases-shift of RIS elements. In the absence of prior knowledge of the activation pattern of the IoTDs, proximal policy optimization algorithm is developed to solve this mixed-integer non-convex optimization problem. Numerical results show that our proposed algorithm outperforms all others in terms of AoI.

With the growing market of Electric Vehicles (EV), the procurement of their charging infrastructure plays a crucial role in their adoption. Within the revolution of Internet of Things, the EV charging infrastructure is getting on board with the introduction of smart Electric Vehicle Charging Stations (EVCS), a myriad set of communication protocols, and different entities. We provide in this article an overview of this infrastructure detailing the participating entities and the communication protocols. Further, we contextualize the current deployment of EVCSs through the use of available public data. In the light of such a survey, we identify two key concerns, the lack of standardization and multiple points of failures, which renders the current deployment of EV charging infrastructure vulnerable to an array of different attacks. Moreover, we propose a novel attack scenario that exploits the unique characteristics of the EVCSs and their protocol (such as high power wattage and support for reverse power flow) to cause disturbances to the power grid. We investigate three different attack variations; sudden surge in power demand, sudden surge in power supply, and a switching attack. To support our claims, we showcase using a real-world example how an adversary can compromise an EVCS and create a traffic bottleneck by tampering with the charging schedules of EVs. Further, we perform a simulation-based study of the impact of our proposed attack variations on the WSCC 9 bus system. Our simulations show that an adversary can cause devastating effects on the power grid, which might result in blackout and cascading failure by comprising a small number of EVCSs.

Telecommunication networks are currently realizing more-huge-than-ever data demands from subscribers all over the world. Due to the ongoing pandemic, nearly all businesses have adapted working models with remote operations. People engaged with major industries, e.g., academia, health and municipalities are utilizing online platforms to carryout their routine tasks. This indeed shifts the attention from one-to-one (unicast) communication to one-to-many (multicast) and many-to-many (multi-source multi-destination) communications. Network operators are facing increased pressure to provide quick responses in order to satisfy the bandwidth hungry and time sensitive user demands. This can only be done by enhancing deployability as well as manageability of the services. Network Function Virtualization (NFV) provides a transformation of traditional proprietary network designs to a more agile and software based environment in order to achieve flexible deployments, reduced setup costs and less-time-to-market for the new services which is very much needed in the current scenarios. Previous studies on NFV-enabled multicast problem either proposed Integer Linear Program (ILP) models, that are pretty unscalable, or heuristic-based techniques that do not guarantee good quality of the solutions obtained. In this article, we propose an NFV multicast resource optimization model exploiting the use of multiple sources and considering the end-to-end delay and bandwidth requirements. Herein, we propose a novel Dantzig-Wolfe (DW) decomposition model that tackles the complexity of the problem by breaking it down into a master problem and several pricing problems. We compare the DW approach with the ILP and heuristic methods and demonstrate that our approach achieves near to optimal solution (in comparison to heuristic based methods) much faster than ILP. We also study the dynamic admission of NFV-enabled multicast requests by solving the problem in an online manner using the batch processing of requests. We then evaluate the performance of the proposed algorithms through extensive simulations and demonstrate that proposed algorithms are promising and outperform existing solutions.

Unmanned aerial vehicles (UAVs) are envisioned to play a key role in intelligent transportation systems to complement the communication infrastructure in future smart cities. UAV-assisted vehicular networking research typically adopts throughput and latency as the main performance metrics. These conventional metrics, however, are not adequate to reflect the freshness of the information, an attribute that has been recently identified as a critical requirement to enable services such as autonomous driving and accident prevention. In this paper, we consider a UAV-assisted single-hop vehicular network, wherein sensors (e.g., LiDARs and cameras) on vehicles generate time sensitive data streams, and UAVs are used to collect and process this data while maintaining a minimum age of information (AoI). We aim to jointly optimize the trajectories of UAVs and find scheduling policies to keep the information fresh under minimum throughput constraints. The formulated optimization problem is shown to be mixed integer non-linear program (MINLP) and generally hard to be solved. Motivated by the success of machine learning (ML) techniques particularly deep learning in solving complex problems with low complexity, we reformulate the trajectories and scheduling policies problem as a Markov decision process (MDP) where the system state space considers the vehicular network dynamics. Then, we develop deep reinforcement learning (DRL) to learn the vehicular environment and its dynamics in order to handle UAVs’ trajectory and scheduling policy. In particular, we leverage Deep Deterministic Policy Gradient (DDPG) for learning the trajectories of the deployed UAVs to efficiently minimize the Expected Weighted Sum AoI (EWSA). Simulations results demonstrate the effectiveness of the proposed design and show the deployed UAVs adapt their velocities during the data collection mission in order to minimize the AoI.

The transition to electric vehicles (EVs) has prodigious plausibility in reducing green house gas (GHG). But EVs acceptance is, however, hindered by several challenges; among them is their avidity for quicker charging at lower price. This article considers a photovoltaic (PV)-powered station equipped with an energy storage system (ESS), which is assumed to be capable of assigning variable charging rates to different EVs to fulfill their demands inside their declared deadlines at minimum price. To ensure fairness, a charging rate-dependent pricing mechanism is proposed to assure a higher price for enjoying a higher charging rate. The PV generation profile and future load request are forecasted at each time slot, to handle the respective uncertainty. An integer linear programming (ILP)-based centralized system is first proposed to minimize the charging price per EV. Due to the larger computational time, we subsequently present two game theoretic algorithms, i.e., game 1 and game 2. In game 1, players are oblivious of upcoming charging requests, whereas in game 2, players consider the future anticipated load to select their charging strategies. The games are shown to converge to a Nash equilibrium. The average unit price of game 2 is shown to be the same as the one of the optimal solution and takes considerably less computation time than the centralized method.

The concept of smart city strives for greener technology to reduce carbon emission to ameliorate the global warming. Following this footprint, the transportation sector is experiencing a paradigm shift and the transition to electric vehicles (EVs) has prodigious plausibility in reducing carbon emission. However, the anticipated EV penetration is hindered by several challenges, among them are their shorter driving range, slower charging rate and the lack of ubiquitous availability of charging locations, which collectively contribute to range anxieties for EVs' drivers. Meanwhile, the expected immense EV load onto the power distribution network may degrade the voltage stability. To reduce the range anxiety, we present a two-stage solution to provision and dimension a DC fast charging station (CS) network for the anticipated energy demand and that minimizes the deployment cost while ensuring a certain quality of experience for charging e.g., acceptable waiting time and shorter travel distance to charge. This solution also maintains the voltage stability by considering the distribution grid capacity, determining transformers’ rating to support peak demand of EV charging and adding a minimum number of voltage regulators based on the impact over the power distribution network. We propose, evaluate and compare two CS network expansion models to determine a cost-effective and adaptive CSs provisioning solution that can efficiently expand the CS network to accommodate future EV charging and conventional load demands. We also propose two heuristic methods and compare our solution with them. Finally, a custom built Python-based discrete event simulator is developed to test our outcomes.

The Vehicle-as-a-Resource is an emerging concept that allows the exploitation of the vehicles’ computational resources for the purpose of executing tasks offloaded by passengers, vehicles, or even an Internet-of-Things devices. This article revolves around a scenario where a roadside unit located at the edge of a hierarchical multitier edge computing subnetwork resorts to the utilization of idle vehicles computational resources through a fog-enabled substructure yielding a cost-effective computational task offloading solution. In this context, scheduling the offload of these tasks to the appropriate vehicles is a challenging problem that is subject to the interaction of major role-playing parameters. Among these parameters are the variability of vehicles availability and their computational power, the individual tasks’ weighted priorities and their deadlines, the tasks required computational power as well as the required data to upload/download. This article proposes an infrastructure-assisted task scheduling scheme where the roadside unit receives computational tasks from different sources and schedules these tasks over a computationally capable vehicle residing within the roadside unit’s range. The aim is to maximize the weighted number of admitted tasks while considering the constraints mentioned above. Compared to other works, this article broaches a more realistic scenario by considering a more accurate computational task and system model. Our system considers both the latency and throughput of task accomplishments by maximizing the weighted number of admitted tasks while at the same time respecting the tasks accompanied deadlines. Both radio and computational resources are part of the optimization problem. After proving the NP-hardness of the scheduling problem, we formulated the problem as a mixed-integer linear program. A Dantzig–Wolfe decomposition algorithm is proposed which yields to a master program solvable by the Barrier algorithm and subproblems solved optimally with a polynomial-time dynamic programming approach. Thorough numerical analysis and simulations are conducted in order to verify and assert the validity, correctness, and effectiveness of our approach compared to branch and bound and greedy algorithms.

The drive for efficient, reliable, green, and connected smart cities has promoted the use of electric vehicles (EVs) as the main future means of transportation. This resulted in a breakthrough in the anticipated number of adopted EVs by the year 2020, and consequently an urge for an available and trustworthy EV charging infrastructure. The diversity of the involved players, the used technologies, the bulk data exchange, and the widespread nature of the charging network give rise to security concerns in the form of message tampering, spoofing, or delaying among others to disconcert the charging service along with the underlying power layer. Furthermore, confidentiality and privacy of user information (i.e. identity, location, payment information, etc.) is another major concern associated with the deployment and use of the charging infrastructure. Thus, there is a need to identify and classify such concerns, and devise suitable solutions for a secure charging infrastructure. In this paper, we present a security assessment of the EV charging infrastructure. We highlight and categorize cyber threats targeting different players in a charging system, along with the security solutions presented in the literature. Finally, we present a gap analysis and insights into future research directions for EV charging system security.

Heterogeneous networks have allowed network operators to enhance the spectral efficiency and support large number of devices by deploying close small-cells. Recently, Multi-access Edge Computing (MEC) has become an enabler for modern latency-sensitive 5G services by pushing tasks computation to the network edge. In this paper, we study the problem of task offloading in a MEC-enabled heterogeneous network with low-cost wireless backhaul, where we minimize the total devices’ energy consumption while respecting their latency deadline. We explore the benefit of leveraging the macro-cell cloudlet for computing small-cell users’ tasks, where the allocation of backhaul radio resources is optimized. We also jointly optimize the partial offloading decision, transmit power, and the allocation of access radio and computational resources. We mathematically formulate our problem as a non-convex mixed-integer program, and due to its complexity, we propose an iterative algorithm based on the Successive Convex Approximation (SCA) method that provides an approximate solution. Through numerical analysis, we perform simulations based on varying configurations, and demonstrate the performance and efficiency of our proposed solution.

Along with the dramatic increase in the number of IoT devices, different IoT services with heterogeneous QoS requirements are evolving with the aim of making the current society smarter and more connected. In order to deliver such services to the end users, the network infrastructure has to accommodate the tremendous workload generated by the smart devices and their heterogeneous and stringent latency and reliability requirements. This would only be possible with the emergence of ultra reliable low latency communications (uRLLC) promised by 5G. Mobile Edge Computing (MEC) has emerged as an enabling technology to help with the realization of such services by bringing the remote computing and storage capabilities of the cloud closer to the users. However, integrating uRLLC with MEC would require the network operator to efficiently map the generated workloads to MEC nodes along with resolving the trade-off between the latency and reliability requirements. Thus, we study in this paper the problem of Workload Assignment (WA) and formulate it as a Mixed Integer Program (MIP) to decide on the assignment of the workloads to the available MEC nodes. Due to the complexity of the WA problem, we decompose the problem into two subproblems; Reliability Aware Candidate Selection (RACS) and Latency Aware Workload Assignment (LAWA-MIP). We evaluate the performance of the decomposition approach and propose a more scalable approach; Tabu meta-heuristic (WA-Tabu). Through extensive numerical evaluation, we analyze the performance and show the efficiency of our proposed approach under different system parameters.

Middleboxes have gained popularity due to the significant value-added services these network elements provide to traffic flows, in terms of enhanced performance and security. Policy-aware traffic flows usually need to traverse multiple middleboxes in a predefined order to satisfy their associated policy, also known as Service Function Chaining . Typically, Middleboxes run on specialized hardware, which make them highly inflexible to handle the unpredictable and fluctuating-nature of traffic, and contribute to significant capital and operational expenditures (Cap-ex and Op-ex) to provision, accommodate, and maintain them. Network Function Virtualization is a promising technology with the potential to tackle the aforementioned limitations of hardware middleboxes. Yet, NFV is still in its infancy, and there exists several technical challenges that need to be addressed, among which, the Virtual Network Function assignment problem tops the list. The VNF assignment problem stems from the newly gained flexibility in instantiating VNFs (on-demand) anywhere in the network. Subsequently, network providers must decide on the optimal placement of VNF instances which maximizes the number of admitted policy-aware traffic flows across their network. Existing work consists of Integer Linear Program (ILP) models, which are fairly unscalable, or heuristic-based approaches with no guarantee on the quality of the obtained solutions. This work proposes a novel Logic-Based Benders Decomposition (LBBD) based approach to solve the VNF assignment problem. It consists of decomposing the problem into two subproblems: a master and a subproblem; and at every iteration constructive Benders cuts are introduced to the master to tighten its search space. We compared the LBBD approach against the ILP and a heuristic method, and we show that our approach achieves the optimal solution (as opposed to heuristic-based methods) 700 times faster than the ILP.

Vehicular networks’ connectivity and data delivery delay performance is highly affected by the vehicular traffic's spatio-temporal dynamics whose variations are subject to a multitude of random factors. Under the stringent and inevitable limitations imposed by free-flow vehicular traffic conditions (i.e., low-to-medium vehicular densities, elevated degree of mobility, high speeds, etc), these networks suffer from considerably rapid topology variations leading to severe connectivity intermittence and, hence, delayed data delivery. This motivates the study presented in this paper, which aims at investigating the capability of external elements that are independent of the vehicular traffic flow and its inherent limitations (e.g., airborne unmanned aerial vehicles (UAVs), a.k.a., drones) to serve as possible adjuvant relays; thus, contributing to strengthening/healing weak/broken communication links among ground-bound vehicular entities (i.e., RoadSide Units (RSUs) and vehicles) and uplifting the vehicular connectivity and delay performance. Particularly, in the context of a vehicular sub-networking scenario, a UAV mobility model is proposed as a first step in analytically capturing macroscopic dynamics for UAVs exhibiting waypoint mobility patterns and plying over a considered roadway segment. Then, a stochastic analytical model is formulated for the purpose of mathematically characterizing the path availability and achieved data delivery delays in the presence of these UAVs. A simulation framework is established to verify the validity and accuracy of the proposed models and gauge the merit of UAV assistance in improving the vehicular connectivity and data delivery delay performance.

In order to support the development of 5G technologies, researchers are actively engaged in addressing the challenges accompanying the emerging 5G applications. Unquestionably, an eminent technology gaining significant research attention is edge computing. Vehicular edge computing brings data storage and computing capabilities as well as hosting support applications that comprise emerging vehicular services and applications which demand low-delay processing, to the edge closer to the vehicles, reducing response time and increasing reliability, therefore achieving the holistic vision of the tactile Internet. In this context, this paper considers a vehicular network with edge computing capabilities deployed at road side units, and addresses the problem of workload offloading as well as scheduling of computation tasks on the computing resources available at the edge. The challenge here is the high mobility of the vehicles and hence their short residence time within the coverage range of the road side units hosting the edge computing resources. A joint problem considering the communication and computation resources, as well as the latency requirements of the workload is formulated and the scheduling is shown to be NP-Hard. Subsequently, efficient solutions based on Lagrangian relaxation are derived and presented. We evaluate numerically the proposed methods and show their closeness to the optimal solutions.

Service restoration (SR) through network configuration in power systems is a highly investigated problem. In SR, utilities reconfigure the transmission and distribution networks to supply the consumer load demands. However, the advancements in distributed energy storage (DES) systems at the consumer side define a new dimension for SR. In this paper, we approach the network reconfiguration for SR in the presence of DES through mathematical modeling. We present a mathematical model that captures the properties of the power system, and reconfigures the network to supply consumer demand over available lines. This model considers power supply from DES, and proposes the least cost SR plan. We evaluate the proposed approach on the IEEE 14-, 30-, and 57-Bus systems, and report on the collected results. The collected results demonstrate the importance of the available DES in power SR.

The proliferation of smart connected Internet of Things (IoT) devices is bringing tremendous challenges in meeting the performance requirement of their supported real-time applications due to their limited resources in terms of computing, storage, and battery life. In addition, the considerable amount of data they generate brings extra burden to the existing wireless network infrastructure. By enabling distributed computing and storage capabilities at the edge of the network, multi-access edge computing (MEC) serves delay sensitive, computationally intensive applications. Managing the heterogeneity of the workload generated by IoT devices, especially in terms of computing and delay requirements, while being cognizant of the cost to network operators, requires an efficient dimensioning of the MEC-enabled network infrastructure. Hence, in this paper, we study and formulate the problem of MEC resource provisioning and workload assignment for IoT services (RPWA) as a mixed integer program to jointly decide on the number and the location of edge servers and applications to deploy, in addition to the workload assignment. Given its complexity, we propose a decomposition approach to solve it which consists of decomposing RPWA into the delay aware load assignment sub-problem and the mobile edge servers dimensioning sub-problem. We analyze the effectiveness of the proposed algorithm through extensive simulations and highlight valuable performance trends and trade-offs as a function of various system parameters.

Fifth generation wireless networks are expected to provide advanced capabilities and create new markets. Among the emerging markets, Internet of Things (IoT) use cases are standing out with the proliferation of a wide range of sensors that can be configured to continuously monitor and transmit data for intelligent processing and decision making. Devices in such scenarios are normally extremely energy-constrained and often exist in large numbers and can be located in hard-to-reach areas; the fact that necessitates the design and implementation of effective energy-aware data collection mechanisms. To this end, we propose the utilization of unmanned aerial vehicles (UAVs) to collect data in dense wireless sensor networks using projection-based compressive data gathering (CDG) as a novel solution methodology. CDG is utilized to aggregate data en-route from a large set of sensor nodes to selected projection nodes acting as cluster heads (CHs) in order to reduce the number of needed transmissions leading to notable energy savings and extended network lifetime. The UAV transfers the gathered data from the CHs to a remote sink node, e.g., a 5G cellular base station, which avoids the need for long range transmissions or multihop communications among the sensors. Our problem definition aims at clustering the sensors, constructing an optimized forwarding tree per cluster, and gathering the data from selected CH nodes based on projection-based CDG with minimized UAV trajectory distance. We formulate a joint optimization problem and divide it into four complementary subproblems to generate close-to-optimal results with lower complexity. Moreover, we propose a set of effective algorithms to generate solutions for relatively large-scale network scenarios. We demonstrate the superiority of the proposed approach and the designed algorithms via detailed performance results with analysis, comparisons, and insights.

Multi-access edge computing (MEC) has recently emerged as a novel paradigm to facilitate access to advanced computing capabilities at the edge of the network, in close proximity to end devices, thereby enabling a rich variety of latency sensitive services demanded by various emerging industry verticals. Internet-of-Things (IoT) devices, being highly ubiquitous and connected, can offload their computational tasks to be processed by applications hosted on the MEC servers due to their limited battery, computing, and storage capacities. Such IoT applications providing services to offloaded tasks of IoT devices are hosted on edge servers with limited computing capabilities. Given the heterogeneity in the requirements of the offloaded tasks (different computing requirements, latency, and so on) and limited MEC capabilities, we jointly decide on the task offloading (tasks to application assignment) and scheduling (order of executing them), which yields a challenging problem of combinatorial nature. Furthermore, we jointly decide on the computing resource allocation for the hosted applications, and we refer this problem as the Dynamic Task Offloading and Scheduling problem, encompassing the three subproblems mentioned earlier. We mathematically formulate this problem, and owing to its complexity, we design a novel thoughtful decomposition based on the technique of the Logic-Based Benders Decomposition. This technique solves a relaxed master, with fewer constraints, and a subproblem, whose resolution allows the generation of cuts which will, iteratively, guide the master to tighten its search space. Ultimately, both the master and the sub-problem will converge to yield the optimal solution. We show that this technique offers several order of magnitude (more than 140 times) improvements in the run time for the studied instances. One other advantage of this method is its capability of providing solutions with performance guarantees. Finally, we use this method to highlight the insightful performance trends for different vertical industries as a function of multiple system parameters with a focus on the delay-sensitive use cases.

Hardware middleboxes are critical elements in today’s networks. Despite their important roles, they are accompanied by several problems, namely, their lack of flexibility, high capital and operational expenditures, and power consumption. Owing to the recent advances in virtualization, network function virtualization promises to address these problems, through replacing hardware middleboxes by software-based entities which can run on commodity hardware. These virtual network functions (VNFs) promise to alleviate the numerous disadvantages brought by their hardware counterparts. One of these most serious issues is the steadily increasing power consumption. In order to further optimize the power consumption, an efficient framework capable of mapping and scheduling traffic on these VNFs is needed. Such a framework allows to optimally assign and schedule the flows to be serviced, and place the unused servers in energy saving modes. In this paper, we assume VNFs are already placed on physical machines and consider traffic flows with deadlines. We focus on the problem of assigning and scheduling flows to VNFs in the most energy efficient manner. We formulate this problem mathematically and, owing to its complexity, present an efficient algorithmic method for solving it. We compare our heuristic with two other approaches, one of which aims to minimize the makespan and the other to minimize number of servers used. We show that our heuristic combines the advantages of both approaches and generates better results by consuming up to 31.3% and 46.1% less energy than other two approaches.

Intelligent Transportation Systems are thriving thanks to a wide range of technological advances, namely 5G communications, Internet of Things, artificial intelligence and edge computing. Central to this is the wide deployment of smart sensing devices and accordingly the large amount of harvested information to be processed for timely decision making. Robust network access is, hence, essential for offloading the collected data before a set deadline, beyond which the data loses its value. In environments where direct communication can be impaired by, for instance, blockages such as in urban cities, unmanned aerial vehicles (UAVs) can be considered as an alternative for providing and enhancing connectivity, particularly when IoT devices (IoTD) are constrained with their resources. Also, to conserve energy, IoTDs are assumed to alternate between their active and passive modes. This paper, therefore, considers a time-constrained data gathering problem from a network of sensing devices and with assistance from a UAV. A Reconfigurable Intelligent Surface (RIS) is deployed to further improve both the connectivity and energy efficiency of the UAV, particularly when multiple devices are served concurrently and experience different channel impairments. This integrated problem brings challenges related to the configuration of the phase shift elements of the RIS, the scheduling of IoTDs transmissions as well as the trajectory of the UAV. First, the problem is formulated with the objective of maximizing the total number of served devices each during its activation period. Owing to its complexity and the incomplete knowledge about the environment, we leverage deep reinforcement learning in our solution; the UAV trajectory planning is modeled as a Markov Decision Process, and Proximal Policy Optimization is invoked to solve it. Next, the RIS configuration is then handled via Block Coordinate Descent.

Given its ability to control and manipulate wireless environments, reconfigurable intelligent surface (RIS), also known as intelligent reflecting surface (IRS), has emerged as a key enabler technology for the six-generation (6G) cellular networks. In the meantime, vehicular environment radio propagation is negatively influenced by a large set of objects that cause transmission distortion such as high buildings. Therefore, this work is devoted to explore the area of RIS technology integration with vehicular communications while considering the dynamic nature of such communication environment. Specifically, we provide a system model where RoadSide Unit (RSU) leverages RIS to provide indirect wireless transmissions to disconnected areas, known as dark zones. Dark zones are spots within RSU coverage where the communication links are blocked due to the existence of blockages. In details, a discrete RIS is utilized to provide communication links between the RSU and the vehicles passing through out-of-service zones. Therefore, the joint problem of RSU resource scheduling and RIS passive beamforming or phase-shift matrix is formulated as an optimization problem with the objective of maximizing the minimum average bit rate. The formulated problem is mixed integer non-convex program which is difficult to be solved and does not account for the uncertain dynamic environment in vehicular networks. Thereby, we resort to alternative methods based on Deep Reinforcement Learning to determine RSU wireless scheduling and Block Coordinate Descent (BCD) to solve for the phase-shift matrix, \textit{i.e.,} passive beamforming, of the RIS. The Markov Decision Process (MDP) is defined and the complexity of the solution approach is discussed. Our numerical results demonstrate the superiority of our proposed approach over baseline techniques.

In this paper, we investigate the downlink transmissions in wireless backhaul (WB) networks when unmanned aerial vehicles (UAVs) are used as flying small cell base stations. We propose to employ the non-orthogonal multiple access (NOMA) on the WB transmissions and introduce a novel cooperative transmission scheme for the wireless access links. Then, we formulate an optimization problem which jointly determines the radio resource allocation at the macro cell base station (MBS) and UAVs along with the optimization of the decoding order of the NOMA process and the positions of the UAVs in space to maximize the sum achievable rate of all users. The formulated problem is a general mixed integer non-convex program, which is very difficult to solve optimally within a polynomial time. Therefore, we propose a framework based on the method of difference of convex program characterized by the Lipschitz continuity to transform and approximate the original problem into a series of convex approximate ones and develop a low-complexity algorithm to sequentially solve for each approximate problem until convergence. Numerical evaluation and analysis show that our achieved solution, under the proposed framework and developed algorithm, can outperform the other schemes which aim at either optimizing without using cooperative NOMA or do not optimize the UAVs' positions.

The contemporary problem of scheduling the recharge operations of electric vehicles (EVs) has gained a lot of research attention. This is particularly true given the governmental and industrial confidence in a bright future for EVs accompanied with the widespread installation of an enormous number of charging stations across the world. As such, this paper addresses the delay-optimal scheduling of charging EVs at several charging stations (CSs) each with multiple charging outlets. At first, a centralized optimization framework is formulated using an integer linear problem (ILP) that accounts for the delayed arrival of EVs to CSs and the randomness in the requested recharge time interval. Simulation results showed the efficacy of the ILP model when compared to naive as well as sophisticated scheduling heuristics. Next, motivated by the scalability issues of the ILP model, this paper then proposes a distributed game-theoretical approach where each EV communicates with its selected CS and iterates on modifying its strategy until all EVs converge to selecting an appropriate CS that minimizes their waiting times for receiving services. The distributed game-theoretical approach recorded promising results especially when compared to the well-known shortest job first scheduling algorithm. Further, unlike the other approaches, which normally are centralized and suited for offline scheduling, the game-based method is suited for online scheduling since it played at anytime a batch of EVs requests charging services. The running time of the game is remarkably small and outperforms all other heuristics and its convergence to Nash equilibrium is guaranteed after only small number of iterations.

Network Function Virtualization (NFV) has revolutionized service provisioning in cloud datacenter networks. It enables the complete decoupling of Network Functions (NFs) from the physical hardware middle boxes that network operators deploy for implementing service-specific and strictly ordered NF chains. Precisely, NFV allows for dispatching NFs as instances of plain software called virtual network functions (VNFs) running on virtual machines hosted by one or more industry standard physical machines. Nevertheless, NF softwarization introduces processing vulnerability ( e.g. , failures caused by hardware or software, and so on). Since any failure of VNFs could break down an entire service chain, thus interrupting the service, the functionality of an NFV-enabled network will require a higher reliability compared with traditional networks. This paper encloses an in-depth investigation of a reliability-aware joint VNF chain placement and flow routing optimization. In order to guarantee the required reliability, an incremental approach is proposed to determine the number of required VNF backups. Through illustration, it is shown herein that the formulated single path routing model can be easily extended to support resource sharing between adjacent backup VNF instances. This paper advocates the absolute existence of a share-resource-based VNF assignment strategy that is capable of trading off all of the reliability, bandwidth, and computing resources consumption of a given service chain. A heuristic is proposed to work around the complexity of the presently formulated integer linear programming (ILP). Thorough numerical analysis and simulations are conducted in order to verify and assert the validity, correctness, and effectiveness of this proposed heuristic reflecting its ability to achieve very close results to those obtained through the resolution of the complex ILP within a negligible amount of time. Above and beyond, the proposed resource-sharing-based VNF placement scheme outperforms existing resource-sharing agnostic schemes by 15.6% and 14.7% in terms of bandwidth and CPU utilization respectively.

Relay-assisted FSO systems were proposed as a means for remedying the effects of the various atmospheric impairments on the quality of the FSO signal. Conventional relay-assisted FSO systems, however, are designed around two basic assumptions: relays are buffer-free, and relays are stationary. This article proposes to improve the performance of the existing relay-assisted FSO systems by relaxing both of these highly restrictive assumptions through the integration of UAVs as buffer-aided moving relays into the conventional relay-assisted FSO systems. Specifically, two possible simple integration scenarios are proposed and analyzed through simulation. The obtained simulation results demonstrate the great potential associated with the proposed highly promising, innovative, hybrid FSO architecture. Given that high performance gains are observed under small buffer sizes, it becomes conceivable to employ buffer-aided moving relaying UAVs to serve a variety of other purposes. This includes, for instance, having these UAVs oversee the operation of amateur drones for potential misbehavior or wrongdoing within the area of their deployment.

User request (UR) service scheduling is a process that significantly impacts the performance of a cloud data center. This is especially true since essential quality-of-service (QoS) performance metrics such as the UR blocking probability as well as the data center's response time are tightly coupled to such a process. This paper revolves around the proposal of a novel Deadline-Aware UR Scheduling Scheme (DASS) that has the objective of improving the data center's QoS performance in term of the above-mentioned metrics. A minority of existing work in the literature targets the formulation of mathematical models for the purpose of characterizing a cloud data center's performance. As a contribution to covering this gap, this paper presents an analytical model, which is developed for the purpose of capturing the system's dynamics and evaluating its performance when operating under DASS. The model's results’ accuracy are verified through simulations. Also, the performance of the data center achieved under DASS is compared to its counterpart achieved under the more generic First-In-First-Out (FIFO) scheme. The reported results indicate that DASS outperforms FIFO by $11$ to $58$ percent in terms of the blocking probability and by $82$ to $89$ percent in terms of the system's response time.

Middleboxes (i.e., firewall, cache, proxy, etc.) are hardware appliances designed to enforce security and performance policies. Being an integral part of today’s cloud and enterprise networks, these middleboxes are expensive, hard to manage and to maintain. Network function virtualization has emerged as a promising technology that replaces these hardware appliances by software ones known as virtual network functions (VNFs). Unlike hardware middleboxes, VNFs can be instantiated and deployed on virtual machines running on commodity servers which ensures their flexibility, manageability, cost-efficiency, and reduce their time-to-market. However, efficiently processing services through an ordered chain of VNFs, called service function chaining (SFC), is not trivial. It requires solving three inter-related sub-problems; the network functions (NFs) mapping sub-problem, the traffic routing sub-problem and the service scheduling sub-problem. This paper first highlights the existing interplay between the three sub-problems and then presents a formulation of the SFC scheduling (SFCS) which exploits interactions between NFs mapping onto VNFs, service scheduling and traffic routing. Given the complexity of the SFCS problem, we present a novel primal–dual decomposition using column generation that solves exactly a relaxed version of the problem and can serve as a benchmark approach. We enhance our solution methodology with a diversification technique to help improve the quality of the obtained solutions. We evaluate numerically our method and show that it can attain optimal solutions substantially faster. Finally, we present several engineering insights for improving the network performance.

Traditionally, service-specific network functions (NFs) (e.g., Firewall, intrusion detection system, etc.) are executed by installation-and maintenance-costly hardware middleboxes that are deployed within a datacenter network following a strictly ordered chain. NF virtualization (NFV) virtualizes these NFs and transforms them into instances of plain software referred to as virtual NFs (VNFs) and executed by virtual machines, which, in turn, are hosted over one or multiple industry-standard physical machines. The failure (e.g., hardware or software) of any one of a service chain's VNFs leads to breaking down the entire chain and causing significant data losses, delays, and resource wastage. This paper establishes a reliability-aware and delay-constrained (READ) routing optimization framework for NFV-enabled datacenter networks. READ encloses the formulation of a complex mixed integer linear program (MILP) whose resolution yields an optimal network service VNF placement and traffic routing policy that jointly maximizes the achieved respective reliabilities of supported network services and minimizes these services' respective end-to-end delays. A heuristic algorithm dubbed Greedy-k-shortest paths (GSP) is proposed for the purpose of overcoming the MILP's complexity and develop an efficient routing scheme whose results are comparable to those of READ's optimal counterparts. Thorough numerical analyses are conducted to evaluate the network's performance under GSP, and hence, gauge its merit; particularly, when compared to existing schemes, GSP exhibits an improvement of 18.5% in terms of the average end-to-end delay as well as 7.4% to 14.8% in terms of reliability. 1 2004-2012 IEEE. Scopus

In cloud data centers (DCs), where hosted applications share the underlying network resources, network bandwidth guarantees have shown to improve predictability of application performance and cost. However, recent empirical studies have also shown that often DC devices and links are not all that reliable and that failures may cause service outages, rendering significant revenue loss for the affected tenants, as well as the cloud operator. Accordingly, cloud operators are pressed to offer both reliable and predictable performance for the hosted applications. While much work has been done on solving both problems separately, this paper seeks to develop a joint framework by which cloud operators can offer both performance and availability guarantees for the hosted tenants. In particular, this paper considers a simple model to abstract the bandwidth guarantees requirement for the tenant and presents a protection plan design which consists of backup virtual machines (VMs) placement and bandwidth provisioning to optimize the internal DC traffic. We show through solid motivational examples that finding the optimal protection plan design is highly perplexing, and encompasses several constituent challenges. Owing to its complexity, we decompose it into two subproblems, and solve them separately. First, we invoke a placement subproblem of the minimum number of backup VMs and then we explore the most efficient correspondence between backup and primary VMs (i.e., protection plan) which minimizes the bandwidth redundancy. Further, we study the design of various facets of such a plan by exploiting bandwidth sharing opportunities in multi-tenant cloud networks.

In typical wireless networks, multihop communication is a method used to establish connectivity between distant nodes. Adapting this technique to vehicular networks requires bypassing several challenging constraints imposed by the nature of vehicular environments (e.g., high mobility and speeds and repetitive link disruptions). This paper revolves around establishing a multihop connectivity path between an isolated source vehicle $S$ and a faraway gateway roadside unit (RSU) $D$ through cooperative vehicles serving as intermediate relays. A stochastic model is formulated for the purpose of deriving an expression for the probability of the existence of a connectivity path between $S$ and $D$ . Then, the dynamic changes in the network topology are carefully examined to present a tight upper bound for the average end-to-end packet delivery delay. Finally, taking into account the inherent contention-based nature of the employed IEEE 802.11 p medium access control (MAC) protocol, together with several other limiting factors such as relay unavailability and hidden terminals, the per-hop and the end-to-end throughput expressions are presented. Extensive simulations are conducted for the purpose of validating the proposed model and examining the system's performance.

Ultra Reliable and Low Latency Communications (URLLC) is deemed to be an essential service in 5G systems and beyond to accommodate a wide range of emerging applications with stringent latency and reliability requirements. Coexistence of URLLC alongside other service categories calls for developing spectrally efficient multiplexing techniques. Specifically, coupling URLLC and conventional enhanced Mobile BroadBand (eMBB) through superposition/puncturing naturally arises as a promising option due to the tolerance of the latter in terms of latency and reliability. The idea here is to transmit URLLC packets over resources occupied by ongoing eMBB transmissions while minimizing the impact on the eMBB transmissions. In this paper, we propose a novel downlink URLLC-eMBB multiplexing technique that exploits possible similarities among URLLC and eMBB symbols, with the objective of reducing the size of the punctured eMBB symbols. We propose that the base station scans the eMBB traffic' symbol sequences and punctures those that have the highest symbol similarity with that of the URLLC users to be served. As the eMBB and URLLC may use different constellation sizes, we introduce the concept of symbol region similarity to accommodate the different constellations. We assess the performance of the proposed scheme analytically, where we derive closed-form expressions for the symbol error rate (SER) of the eMBB and URLLC services. {We also derive an expression for the eMBB loss function due to puncturing in terms of the eMBB SER}. We demonstrate through numerical and simulation results the efficacy of the proposed scheme where we show that 1) the eMBB spectral efficiency is improved by puncturing fewer symbols, 2) the SER and reliability performance of eMBB are improved, and 3) the URLLC data is accommodated within the specified delay constraint while maintaining its reliability.

Light-fidelity (LiFi) is a fully-networked bidirectional optical wireless communication (OWC) technology that is considered as a promising solution for high-speed indoor connectivity. In this paper, the joint estimation of user 3D position and user equipment (UE) orientation in indoor LiFi systems with unknown emission power is investigated. Existing solutions for this problem assume either ideal LiFi system settings or perfect knowledge of the UE states, rendering them unsuitable for realistic LiFi systems. In addition, these solutions consider the non-line-of-sight (NLOS) links of the LiFi channel gain as a source of deterioration for the estimation performance instead of harnessing these components in improving the position and the orientation estimation performance. This is mainly due to the lack of appropriate estimation techniques that can extract the position and orientation information hidden in these components. In this paper, and against the above limitations, the UE is assumed to be connected with at least one access point (AP), i.e., at least one active LiFi link. Fingerprinting is employed as an estimation technique and the received signal-to-noise ratio (SNR) is used as an estimation metric, where both the line-of-sight (LOS) and NLOS components of the LiFi channel are considered. Motivated by the success of deep learning techniques in solving several complex estimation and prediction problems, we employ two deep artificial neural network (ANN) models, one based on the multilayer perceptron (MLP) and the second on the convolutional neural network (CNN), that can map efficiently the instantaneous received SNR with the user 3D position and the UE orientation. Through numerous examples, we investigate the performance of the proposed schemes in terms of the average estimation error, precision, computational time, and the bit error rate. We also compare this performance to that of the k-nearest neighbours (KNN) scheme, which is widely used in solving wireless localization problems. It is demonstrated that the proposed schemes achieve significant gains and are superior to the KNN scheme.

Cyberspace continues to host highly sophisticated malicious entities that have demonstrated their ability to launch debilitating, intimidating, and disrupting cyber attacks. Recently, such entities have been adopting orchestrated, often botmaster- coordinated, stealthy attack strategies aimed at maximizing their targets’ coverage while minimizing redundancy and overlap. The latter entities, which are typically dubbed as bots within botnets, are ominously being leveraged to cause drastic Internet-wide and enterprise impacts by means of severe misdemeanors. While a plethora of literature approaches have devised operational cyber security techniques for the detection of such botnets, very few have tackled the problem of how to promptly and effectively takedown such botnets. In the past three years, we have received 12 GB of daily malicious real darknet data (i.e., Internet traffic destined to half a million routable but unallocated IP addresses or sensors) from more than 12 countries. This article exploits such data to propose a novel Internet-scale cyber security capability that fuses big data behavioral analytics in conjunction with formal graph theoretical concepts to infer and attribute Internet-scale infected bots in a prompt manner and identify the niche of the botnet for effective takedowns. We validate the accuracy of the proposed approach by employing 100 GB of the Carna botnet, which is a very recent real malicious Internet-scale botnet. Since performance is also an imperative metric when dealing with big data for network security, this article further provides a comparison between two trending big data processing architectures: the almost standard Apache Hadoop system, and a more traditional and simplistic multi-threaded programming approach, by employing 1 TB of real darknet data. Several recommendations and possible future research work derived from the previous experiments conclude this article.

In a virtualized infrastructure where multiple virtual networks (or tenants) are running atop the same physical network (e.g., a data center network), a single facility node (e.g., a server) failure can bring down multiple virtual machines, disconnecting their corresponding services and leading to millions of dollars in penalty cost. To overcome losses, tenants or virtual networks can be augmented with a dedicated set of backup nodes and links provisioned with enough backup resources to assume any single facility node failure. This approach is commonly referred to as Survivable Virtual Network (SVN) design. The achievable reliability guarantee of the resultant SVN could come at the expense of lowering the substrate network utilization efficiency, and subsequently its admissibility, since the provisioned backup resources are reserved and remain idle until failures occur. Backup-sharing can replace the dedicated survivability scheme to circumvent the inconvenience of idle resources and reduce the footprints of backup resources. Indeed the problem of SVN design with backup-sharing has recurred multiple times in the literature. In most of the existing work, designing an SVN is bounded to a fixed number of backup nodes; further backup-sharing is only explored and optimized during the embedding phase. This renders the existing redesign techniques agnostic to the backup resource sharing in the substrate network, and highly dependent on the efficiency of the adopted mapping approach. In this paper, we diverge from this dogmatic approach, and introduce ProRed, a novel prognostic redesign technique that promotes the backup resource sharing at the virtual network level, prior to the embedding phase. Our numerical results prove that this redesign technique achieves lower-cost mapping solutions and greatly enhances the achievable backup sharing, boosting the overall network's admissibility.

This paper proposes a novel framework for managing the resource provisioning of reliable virtual networks (VN) in the cloud. This includes handling the placement of VN requests while providing availability guarantees, as well as reconfiguring/adapting their placement as their request changes over time. This is particularly interesting for services with periodic resource demands. Given the heterogeneous failure rates of physical network components, the placement and reconfiguration must ensure that the selected hosts for each VN meets its availability requirements. The existing work on availability-aware VN placement has overlooked the case of “availability over-provisioning,” as well as the fact that VN requests are subject to change over time. To this extent, we propose a novel framework that consists of two main modules; JENA: a tabu-based availability-aware resource allocation (embedding) module for VNs that achieves “just-enough” availability guarantees, and ARES: a reliable reconfiguration module to adapt the embedding of hosted services as they scale. Further, we introduce the concept of “protection-domains” and “protection-policies” to equip our proposed modules with the ability to augment services with redundant/backup nodes to enhance their reliability. Our numerical results show that our framework enhances network’s admissibility (with 33% lower blocking compared to existing work), and in return increases the cloud provider’s long term revenue, compared to peer and benchmark algorithms.

Recently, it is widely believed that significant coverage and performance improvement can be achieved through the deployment of small cells in conjunction with the well-established macro cells. However, it is expected that the high density of base stations in such heterogeneous cellular networks will give rise to multiple design problems related to both co-tier (small-to-small) and cross-tier (between small and macro cells) interference. Fortunately, cooperation between base stations will play a major role to cope with these problems and hence to enhance the users’ data rates. In this paper, we consider a two-tier cellular network comprised of a macro cell underlaid with multiple small cells where both co-tier and cross-tier interference are taken into account. We study the scenario where the small cell base stations seek to maximize a common objective by forming multiple clusters through cooperation. These base stations have also to allocate power to their associated users and, at the same time, control the total aggregate interference caused to the macro cell user which has to be kept below a threshold prefixed by the macro cell base station. We consider two utility functions: the overall sum rate of the small cell network and the minimum data rate of the small cell users. We formulate the studied problems as mixed integer nonlinear optimization problems and we discuss their NP hardness. Therefore, due to the complexity of finding the optimal solution, we design heuristic algorithms which resolves efficiently the tradeoff between computational complexity and performance. We show through simulations that the designed heuristics approach the optimal solution (obtained using the complex exhaustive search algorithm) with highly reduced computational complexity.

Among the challenges of realizing the full potential of light-fidelity (LiFi) cellular networks are user mobility, random device orientation and blockage. We study the impact of those challenges on the performance of LiFi in an indoor environment using measurement-based channel models. We adopt spatial modulation (SM), which has been shown to be energy efficient in many applications, including LiFi. We consider two configurations for placing the photodiodes (PDs) on the user equipment (UE). The first one is referred to as the screen receiver (SR) whereby all the PDs are located on one face of the UE, whereas the other one is a multi-directional receiver (MDR), in which the PDs are located on different sides of the UE. The latter configuration was motivated by the fact that SR exhibited poor performance in the presence of random device orientation and blockage. We show that MDR outperforms SR by over $10$ dB at BER of $3.8\times10^{-3}$. Moreover, an adaptive access point (AP) selection scheme for SM is considered where the number of APs are chosen adaptively in an effort to achieve the lowest energy requirement for a target BER and spectral efficiency. The user performance with random orientation and blockage in the whole room is evaluated for sitting and walking activities. For the latter, we invoke the orientation-based random waypoint (ORWP) mobility model. We also study the performance of the underlying system on the uplink channel where the same techniques are used for the downlink channel. Specifically, as the transmitted uplink power is constrained, the energy efficiency of SM is evaluated analytically. It is shown that the multi-directional transmitter (MDT) with adaptive SM is highly energy efficient. As a benchmark, we compare the performance of the proposed framework to that of the conventional spatial multiplexing system, and demonstrate the superiority of the proposed one., 30 pages, 14 figures, Journal paper