Search

Massive MIMO is expected to play an important role in the development of 5G networks. This paper addresses the issue of pilot contamination and scalability in massive MIMO systems. The current practice of reusing orthogonal pilot sequences in adjacent cells leads to difficulty in differentiating incoming inter- and intra-cell pilot sequences. One possible solution is to increase the number of orthogonal pilot sequences, which results in dedicating more space of coherence block to pilot transmission than data transmission. This, in turn, also hinders the scalability of massive MIMO systems, particularly in accommodating a large number of IoT devices within a cell. To overcome these challenges, this paper devises an innovative pilot allocation scheme based on the data transfer patterns of IoT devices. The scheme assigns orthogonal pilot sequences to clusters of devices instead of individual devices, allowing multiple devices to utilize the same pilot for periodically transmitting data. Moreover, we formulate the pilot assignment problem as a graph coloring problem and use the max k-cut graph partitioning approach to overcome the pilot contamination in a multicell massive MIMO system. The proposed scheme significantly improves the spectral efficiency and enables the scalability of massive MIMO systems; for instance, by using ten orthogonal pilot sequences, we are able to accommodate 200 devices with only a 12.5% omission rate., Comment: Accepted At GLOBECOM 2023

Due to significant blockage conditions in wireless networks, transmitted signals may considerably degrade before reaching the receiver. The reliability of the transmitted signals, therefore, may be critically problematic due to blockages between the communicating nodes. Thanks to the ability of Reconfigurable Intelligent Surfaces (RISs) to reflect the incident signals with different reflection angles, this may counter the blockage effect by optimally reflecting the transmit signals to receiving nodes, hence, improving the wireless network's performance. With this motivation, this paper formulates a RIS-aided wireless communication problem from a base station (BS) to a mobile user equipment (UE). The BS is equipped with an RGB camera. We use the RGB camera at the BS and the RIS panel to improve the system's performance while considering signal propagating through multiple paths and the Doppler spread for the mobile UE. First, the RGB camera is used to detect the presence of the UE with no blockage. When unsuccessful, the RIS-assisted gain takes over and is then used to detect if the UE is either "present but blocked" or "absent". The problem is determined as a ternary classification problem with the goal of maximizing the probability of UE communication blockage detection. We find the optimal solution for the probability of predicting the blockage status for a given RGB image and RIS-assisted data rate using a deep neural learning model. We employ the residual network 18-layer neural network model to find this optimal probability of blockage prediction. Extensive simulation results reveal that our proposed RIS panel-assisted model enhances the accuracy of maximization of the blockage prediction probability problem by over 38\% compared to the baseline scheme.

Recent research on reconfigurable intelligent surfaces (RIS) suggests that the RIS panel, containing passive elements, enhances channel performance for the internet of things (IoT) systems by reflecting transmitted signals to the receiving nodes. This paper investigates RIS panel assisted-wireless network to instigate minimal base station (BS) transmit power in the form of energy harvesting for batteryless IoT sensors to maximize bits transmission in the significant multi-path environment, such as urban areas. Batteryless IoT sensors harvest energy through the RIS panel from external sources, such as from nearby BS radio frequency (RF) signal in the first optimal time frame, for a given time frame. The bits transmission among IoT sensors, followed by a device-to-device (D2D) communications protocol, is maximized using harvested energy in the final optimal time frame. The bits transmission is at least equal to the number of bits sampled by the IoT sensor. We formulate a non-convex mixed-integer non-linear problem to maximize the number of communicating bits subject to energy harvesting from BS RF signals, RIS panel energy consumption, and required time. We propose a robust solution by presenting an iterative algorithm. We perform extensive simulation results based on the 3GPP Urban Micro channel model to validate our model.

5G network operators consider the dense deployment of small base-stations (SBSs) to increase network coverage and capacity. Hence, operators face the challenge of X-hauling, i.e., backhauling or fronthauling, their traffic to the core network. Also, SBSs densification will increase the possibility of failure of these X-haul links. To cope with this problem, an X-haul outage compensation scheme with the assistance of Reconfigurable Intelligent Surfaces (RIS) is proposed to mitigate or at least alleviate the effect of X-haul failure. The RIS is a newly adopted technology that is able to improve the performance of wireless networks. In this paper, we present and evaluate an X-haul outage compensation scheme based on placing a number of RIS panels in pre-planned locations to mitigate the effect of X-haul failure. This evaluation is done using frequencies below and beyond 6 GHz. Based on our analytical results, the proposed RIS scheme shows that placing a sufficient number of RIS elements in proximity to the failed SBS under certain conditions can help acquire the same X-haul rate before the occurrence of the failure. Also, we show that for high X-haul spectral density, the RIS-assisted transmission with a certain number of elements can be more energy-efficient than line-of-sight and non-line-of-sight transmissions. Finally, the system's energy efficiency is addressed with and without RIS, and the optimal number of RIS reflecting elements is derived., Comment: This paper was submitted to a conference May 2022

Recently, there has been a flurry of research on the use of Reconfigurable Intelligent Surfaces (RIS) in wireless networks to create dynamic radio environments. In this paper, we investigate the use of an RIS panel to improve bi-directional communications. Assuming that the RIS will be located on the facade of a building, we propose to connect it to a solar panel that harvests energy to be used to power the RIS panel's smart controller and reflecting elements. Therefore, we present a novel framework to optimally decide the transmit power of each user and the number of elements that will be used to reflect the signal of any two communicating pair in the system (user-user or base station-user). An optimization problem is formulated to jointly minimize a scalarized function of the energy of the communicating pair and the RIS panel and to find the optimal number of reflecting elements used by each user. Although the formulated problem is a mixed-integer non-linear problem, the optimal solution is found by linearizing the non-linear constraints. Besides, a more efficient close to the optimal solution is found using Bender decomposition. Simulation results show that the proposed model is capable of delivering the minimum rate of each user even if line-of-sight communication is not achievable., Comment: The 30th International Conference on Computer Communications and Networks (ICCCN 2021), 8 pages, 6 figures

Radio access network (RAN) virtualization is gaining more and more ground and expected to re-architect the next-generation cellular networks. Existing RAN virtualization studies and solutions have mostly focused on sharing communication capacity and tend to require the use of the same PHY and MAC layers across network slices. This approach has not considered the scenarios where different slices require different PHY and MAC layers, for instance, for radically different services and for whole-stack research in wireless living labs where novel PHY and MAC layers need to be deployed concurrently with existing ones on the same physical infrastructure. To enable whole-stack slicing where different PHY and MAC layers may be deployed in different slices, we develop PV-RAN, the first open-source virtual RAN platform that enables the sharing of the same SDR physical resources across multiple slices. Through API Remoting, PV-RAN enables running paravirtualized instances of OpenAirInterface (OAI) at different slices without requiring modifying OAI source code. PV-RAN effectively leverages the inter-domain communication mechanisms of Xen to transport time-sensitive I/Q samples via shared memory, making the virtualization overhead in communication almost negligible. We conduct detailed performance benchmarking of PV-RAN and demonstrate its low overhead and high efficiency. We also integrate PV-RAN with the CyNet wireless living lab for smart agriculture and transportation.

The trend is to implement intelligent agents capable of analyzing available information and utilize it efficiently. This work presents a number of reinforcement learning (RL) architectures; one of them is designed for intelligent agents. The proposed architectures are called selector-actor-critic (SAC), tuner-actor-critic (TAC), and estimator-selector-actor-critic (ESAC). These architectures are improved models of a well known architecture in RL called actor-critic (AC). In AC, an actor optimizes the used policy, while a critic estimates a value function and evaluate the optimized policy by the actor. SAC is an architecture equipped with an actor, a critic, and a selector. The selector determines the most promising action at the current state based on the last estimate from the critic. TAC consists of a tuner, a model-learner, an actor, and a critic. After receiving the approximated value of the current state-action pair from the critic and the learned model from the model-learner, the tuner uses the Bellman equation to tune the value of the current state-action pair. ESAC is proposed to implement intelligent agents based on two ideas, which are lookahead and intuition. Lookahead appears in estimating the values of the available actions at the next state, while the intuition appears in maximizing the probability of selecting the most promising action. The newly added elements are an underlying model learner, an estimator, and a selector. The model learner is used to approximate the underlying model. The estimator uses the approximated value function, the learned underlying model, and the Bellman equation to estimate the values of all actions at the next state. The selector is used to determine the most promising action at the next state, which will be used by the actor to optimize the used policy. Finally, the results show the superiority of ESAC compared with the other architectures.

In this paper, we consider the use of UAVs to provide wireless connectivity services, for example after failures of wireless network components or to simply provide additional bandwidth on demand, and introduce the concept of UAVs as a service (UaaS). To facilitate UaaS, we introduce a novel framework, dubbed D3S, which consists of four phases: demand, decision, deployment, and service. The main objective of this framework is to develop efficient and realistic solutions to implement these four phases. The technical problems include determining the type and number of UAVs to be deployed, and also their final locations (e.g., hovering or on-ground), which is important for serving certain applications. These questions will be part of the decision phase. They also include trajectory planning of UAVs when they have to travel between charging stations and deployment locations and may have to do this several times. These questions will be part of the deployment phase. The service phase includes the implementation of the backbone communication and data routing between UAVs and between UAVs and ground control stations.

This paper proposes an energy management framework for cellular heterogeneous networks (HetNets) supported by dynamic solar powered drones. A HetNet composed of a macrocell base station (BS), micro cell BSs, and drone small cell BSs are deployed to serve the networks' subscribers. The drones can land at pre-planned locations defined by the mobile operator and at the macrocell BS site where they can charge their batteries. The objective of the framework is to jointly determine the optimal trips of the drones and the MBSs that can be safely turned off in order to minimize the total energy consumption of the network. This is done while considering the cells' capacities and the minimum receiving power guaranteeing successful communications. To do so, an integer linear programming problem is formulated and optimally solved for three cases based on the knowledge level about future renewable energy statistics of the drones. A low complex relaxed solution is also developed. Its performances are shown to be close to those of the optimal solutions. However, the gap increases as the network becomes more congested. Numerical results investigate the performance of the proposed drone-based approach and show notable improvements in terms of energy saving and network capacity.

Drone-based communications is a novel and attractive area of research in cellular networks. It provides several degrees of freedom in time (available on demand), space (mobile) and it can be used for multiple purposes (self-healing, offloading, coverage extension or disaster recovery). This is why the wide deployment of drone-based communications has the potential to be integrated in the 5G standard. In this paper, we utilize a grid of drones to provide cellular coverage to disaster-struck regions where the terrestrial infrastructure is totally damaged due to earthquake, flood, etc. We propose solutions for the most challenging issues facing drone networks which are limited battery energy and limited backhauling. Our proposed solution based mainly on using three types of drones; tethered backhaul drone (provides high capacity backhauling), untethered powering drone (provides on the fly battery charging) and untethered communication drone (provides cellular connectivity). Hence, an optimization problem is formulated to minimize the energy consumption of drones in addition to determining the placement of these drones and guaranteeing a minimum rate for the users. The simulation results show that we can provide unlimited cellular service to the disaster-affected region under certain conditions with a guaranteed minimum rate for each user., Comment: 2018 IEEE Global Communications Conference: Workshops: 9th International Workshop on Wireless Networking and Control for Unmanned Autonomous Vehicles

The use of Unmanned Aerial Vehicles (UAVs) has gained interest in wireless networks for its many uses and advantages such as rapid deployment and multi-purpose functionality. This is why wide deployment of UAVs has the potential to be integrated in the upcoming 5G standard. They can be used as flying base-stations, which can be deployed in case of ground Base-Stations (GBSs) failures. Such failures can be short-term or long-term. Based on the type and duration of the failure, we propose a framework that uses drones or helikites to mitigate GBS failures. Our proposed short-term and long-term cell outage compensation framework aims to mitigate the effect of the failure of any GBS in 5G networks. Within our framework, outage compensation is done with the assistance of sky BSs (UAVs). An optimization problem is formulated to jointly minimize communication power of the UAVs and maximize the minimum rates of the Users' Equipment (UEs) affected by the failure. Also, the optimal placement of the UAVs is determined. Simulation results show that the proposed framework guarantees the minimum quality of service for each UE in addition to minimizing the UAVs' consumed energy., Comment: Globecom 2018 (6 pages, 3 figures, 3 tables, conference)

This paper investigates a multi-band harvesting (EH) schemes under cognitive radio interweave framework. All secondary users are considered as EH nodes that are allowed to harvest energy from multiple bands of Radio Frequency (RF) sources. A win-win framework is proposed, where SUs can sense the spectrum to determine whether the spectrum is busy, and hence they may harvest from RF energy, or if it is idle, and hence they can use it for transmission. Only a subset of the SUs can sense in order to reduce sensing energy, and then machine learning is used to characterize areas of harvesting and spectrum usage. We formulate an optimization problem that jointly optimize number of sensing samples and sensing threshold in order to minimize the sensing time and hence maximize the amount of energy harvested. A near optimal solution is proposed using Geometric Programming (GP) to optimally solve the problem in a time-slotted period. Finally, an energy efficient approach based on multi-class Support Vector Machine (SVM) is proposed by involving only training SUs instead of all SUs.

Energy harvesting (EH) combined with cooperative communications constitutes a promising solution for future wireless technologies. They enable additional efficiency and increased lifetime to wireless networks. This paper investigates a multiple-relay selection scheme for an EH-based two-way relaying (TWR) system. All relays are considered as EH nodes that harvest energy from renewable energy and radio frequency (RF) sources. Some of them are selected to forward data to the destinations. The power splitting (PS) protocol, by which the EH node splits the input RF signal into two components for EH and information transmission, is adopted at the relay nodes. The objective is to jointly optimize i) the set of selected relays, ii) their PS ratios, and iii) their transmit power levels in order to maximize data rate-based utilities over multiple coherent time slots. A joint-optimization solution based on geometric programming (GP) and binary particle swarm optimization is proposed to solve non-convex problems for two utility functions reflecting the level of fairness in the TWR transmission. Numerical results illustrate the system's behavior versus various parameters and show that the performance of the proposed scheme is very close to that of the optimal branch-and-bound method and that GP outperforms the dual problem-based method.

Unmanned Aerial Vehicles (UAVs) enabled communications is a novel and attractive area of research in cellular communications. It provides several degrees of freedom in time, space and it can be used for multiple purposes. This is why wide deployment of UAVs has the potential to be integrated in the upcoming 5G standard. In this paper, we present a novel cell outage compensation (COC) framework to mitigate the effect of the failure of any outdoor Base Station (BS) in 5G networks. Within our framework, the outage compensation is done with the assistance of sky BSs (UAVs) and Ground BSs (GBSs). An optimization problem is formulated to jointly minimize the energy of the Drone BSs (DBSs) and GBSs involved in the healing process which accordingly will minimize the number of DBSs and determine their optimal 2D positions. In addition, the DBSs will mainly heal the users that the GBS cannot heal due to capacity issues. Simulation results show that the proposed hybrid approach outperforms the conventional COC approach. Moreover, all users receive the minimum quality of service in addition to minimizing the UAVs' consumed energy., Comment: Conference Paper (ICC'18)

Virtual Content Delivery Network (vCDN) migration is necessary to optimize the use of resources and improve the performance of the overall SDN/NFV-based CDN function in terms of network operator cost reduction and high streaming quality. It requires intelligent and enticed joint SDN/NFV migration algorithms due to the evident huge amount of traffic to be delivered to end customers of the network. In this paper, two approaches for finding the optimal and near optimal path placement(s) and vCDN migration(s) are proposed (OPAC and HPAC). Moreover, several scenarios are considered to quantify the OPAC and HPAC behaviors and to compare their efficiency in terms of migration cost, migration time, vCDN replication number, and other cost factors. Then, they are implemented and evaluated under different network scales. Finally, the proposed algorithms are integrated in an SDN/NFV framework. Index Terms: vCDN; SDN/NFV Optimization; Migration Algorithms; Scalability Algorithms., Comment: 9 pages, 11 figures, 4 tableaux, conference Local Computer Networks (LCN), class A

Automatic resource scaling is one advantage of Cloud systems. Cloud systems are able to scale the number of physical machines depending on user requests. Therefore, accurate request prediction brings a great improvement in Cloud systems' performance. If we can make accurate requests prediction, the appropriate number of physical machines that can accommodate predicted amount of requests can be activated and Cloud systems will save more energy by preventing excessive activation of physical machines. Also, Cloud systems can implement advanced load distribution with accurate requests prediction. We propose an algorithm that predicts a probability distribution parameters of requests for each time interval. Maximum Likelihood Estimation (MLE) and Local Linear Regression (LLR) are used to implement this algorithm. An evaluation of the proposed algorithm is performed with the Google cluster-trace data. The prediction is implemented about the number of task arrivals, CPU requests, and memory requests. Then the accuracy of prediction is measured with Mean Absolute Percentage Error (MAPE)., Comment: 7 pages

This paper introduces a network coding-based protection scheme against single and multiple link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one copy on the working circuit, and a second copy that can be extracted from linear combinations of data units transmitted on a shared protection path. This guarantees instantaneous recovery of data units upon the failure of a working circuit. The strategy can be implemented at an overlay layer, which makes its deployment simple and scalable. While the proposed strategy is similar in spirit to the work of Kamal '07 & '10, there are significant differences. In particular, it provides protection against multiple link failures. The new scheme is simpler, less expensive, and does not require the synchronization required by the original scheme. The sharing of the protection circuit by a number of connections is the key to the reduction of the cost of protection. The paper also conducts a comparison of the cost of the proposed scheme to the 1+1 and shared backup path protection (SBPP) strategies, and establishes the benefits of our strategy., Comment: 14 pages, 10 figures, accepted by IEEE/ACM Transactions on Networking

Link and node failures are two common fundamental problems that affect operational networks. Protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection design. We investigate several network graphs where NPC can be deployed using network coding. Furthermore, we construct graphs with minimum number of edges suitable for network protection codes deployment., Comment: ITW2010

In any communication network, the maximum number of link-disjoint paths between any pair of communicating nodes, S and T, is limited by the S-T minimum link-cut. Multipath routing protocols have been proposed in the literature to make use of these S-T paths in enhancing the survivability of the S-T information flow. This is usually accomplished by using a subset of these paths to forward redundant data units or combinations (if network coding is allowed) from S to T. Therefore, this enhancement in survivability reduces the useful S-T information rate. In this paper we present a new way to enhance the survivability of the S-T information flow without compromising the maximum achievable S-T information rate. To do this, bottleneck links (in the min-cut) should only forward useful information, and not redundant data units. We introduce the idea of extra source or destination connectivity with respect to a certain S-T max-flow, and then we study two problems: namely, pre-cut protection and post-cut protection. Although our objective in both problems is the same, where we aim to maximize the number of protected paths, our analysis shows that the nature of these two problems are very different, and that the pre-cut protection problem is much harder. Specifically, we prove the hardness of the pre-cut protection problem, formulate it as an integer linear program, and propose a heuristic approach to solve it. Simulations show that the performance of the heuristic is acceptable even on relatively large networks. In the post-cut problem we show that all the data units, forwarded by the min-cut edges not incident to T, can be post-cut-protected., Comment: 9 pages, submitted to INFOCOM 2010

Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been done to protect against link and node failures, and to provide reliable solutions based on pre-defined provision or dynamic restoration of the domain. In this paper we develop network protection strategies against multiple link failures using network coding and joint capacities. In these strategies, the source nodes apply network coding for their transmitted data to provide backup copies for recovery at the receivers' nodes. Such techniques can be applied to optical, IP, and mesh networks. The encoding operations of protection codes are defined over finite fields. Furthermore, the normalized capacity of the communication network is given by $(n-t)/n$ in case of $t$ link failures. In addition, a bound on the minimum required field size is derived.

The enormous increase in the usage of communication networks has made protection against node and link failures essential in the deployment of reliable networks. To prevent loss of data due to node failures, a network protection strategy is proposed that aims to withstand such failures. Particularly, a protection strategy against any single node failure is designed for a given network with a set of $n$ disjoint paths between senders and receivers. Network coding and reduced capacity are deployed in this strategy without adding extra working paths to the readily available connection paths. This strategy is based on protection against node failures as protection against multiple link failures. In addition, the encoding and decoding operational aspects of the premeditated protection strategy are demonstrated., Comment: 5 pages, 2 figures, accepted in ICC'09

Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must be done with the least amount of protection resources, while using simple management plane functionality. Recently, network coding has been proposed as a solution to provide agile and cost efficient network self-healing against link failures, in a manner that does not require data rerouting, packet retransmission, or failure localization, hence leading to simple control and management planes. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose. In this paper we introduce autonomic self-healing strategies for autonomic networks in order to protect against link failures. The strategies are based on network coding and reduced capacity, which is a technique that we call network protection codes (NPC). In these strategies, an autonomic network is able to provide self-healing from various network failures affecting network operation. The techniques improve service and enhance reliability of autonomic communication. Network protection codes are extended to provide self-healing from multiple link failures in autonomic networks. We provide implementation aspects of the proposed strategies. We present bounds and network protection code constructions. Finally, we study the construction of such codes over the binary field. The paper also develops an Integer Linear Program formulation to evaluate the cost of provisioning connections using the proposed strategies., Comment: 12 pages, 2 figures, and 3 tables

In this paper we develop network protection schemes against two link failures in optical networks. The motivation behind this work is the fact that the majority of all available links in an optical network suffer from single and double link failures. In the proposed network protection schemes, NPS2-I and NPS2-II, we deploy network coding and reduced capacity on the working paths to provide backup protection paths. In addition, we demonstrate the encoding and decoding aspects of the proposed schemes., Comment: 2 figures, 5 pages, private comments are welcome

In this paper we develop network protection strategies against a single link failure in optical networks. The motivation behind this work is the fact that $%70$ of all available links in an optical network suffers from a single link failure. In the proposed protection strategies, denoted NPS-I and NPS-II, we deploy network coding and reduced capacity on the working paths to provide a backup protection path that will carry encoded data from all sources. In addition, we provide implementation aspects and how to deploy the proposed strategies in case of an optical network with $n$ disjoint working paths., Comment: 6 pages, 3 figures, ICCES '08

Protecting against link failures in communication networks is essential to increase robustness, accessibility, and reliability of data transmission. Recently, network coding has been proposed as a solution to provide agile and cost efficient network protection against link failures, which does not require data rerouting, or packet retransmission. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose. In this paper, we propose network protection codes against a single link failure using network coding, where a separate path using reserved links is not needed. In this case portions of the link capacities are used to carry the encoded packets. The scheme is extended to protect against multiple link failures and can be implemented at an overlay layer. Although this leads to reducing the network capacity, the network capacity reduction is asymptotically small in most cases of practical interest. We demonstrate that such network protection codes are equivalent to error correcting codes for erasure channels. Finally, we study the encoding and decoding operations of such codes over the binary field.