Search

Touch enabled sensation and actuation is expected to be one of the most promising, straightforward and important uses of the next generation communication networks. In B5G/6G need for low latency, the infrastructure should be reconfigurable and intelligent to be able to work in real time and interoperable with the existing wireless network. It has a drastic impact on the society due to its high precision, accuracy, reliability and efficiency and the ability to connect a user from far away or remote areas. Such a touch-enabled interaction is primarily concerned with the real time transmission of the tactile based haptic information over the internet, in addition to the usual audio, visual and data traffic, thus enabling a paradigm shift towards establishing a real time control and steering communication system. The existing system latency and overhead creates delays and limits the usability of the future applications. This study proposes an intelligent touch-enabled system for B5G/6G and IoT based wireless communication network that incorporates the AR/VR technologies. The tactile internet and network slicing serve as the backbone of the touch technology which incorporates intelligence from techniques such as AI/ML/DL. The survey introduces a layered and interfacing architecture complete with its E2E solution for the intelligent touch based wireless communication system. It is anticipated for the next generation system to provide numerous opportunities for various sectors utilizing AR/VR technology in robotics and healthcare facilities, all with the intention of helping in addressing severe problems faced by the society. Conclusively the article presents a few use cases concerning the deployment of touch infrastructure in automation and robotics as well as in intelligent healthcare systems, assisting in the diagnosis and treatment of the prevailing COVID-19 cases., 54 pages, 22 figures, in IEEE Access (2022)

This paper demonstrates the use of deep learning and time series data generated from user equipment (UE) beam measurements and positions collected by the base station (BS) to enable handoffs between beams that belong to the same or different BSs. We propose the use of long short-term memory (LSTM) recurrent neural networks with three different approaches and vary the number of lookbacks of the beam measurements to study the performance of the prediction used for the proactive beam handoff. Simulations show that while UE positions can improve the prediction performance, it is only up to a certain point. At a sufficiently large number of lookbacks, the UE positions become irrelevant to the prediction accuracy since the LSTMs are able to learn the optimal beam based on implicitly defined positions from the time-defined trajectories., (c) 2023 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

This work was partially funded by the H2020 SoBigData++ (Grant No 871042), H2020 HumaneAI-Net (Grant No 952026), and CHIST-ERA SAI (Grant No not yet available) projects, Contacts between people are the absolute drivers of contagious respiratory infections. For this reason, limiting and tracking contacts is a key strategy for the control of the COVID-19 epidemic. Digital contact tracing has been proposed as an automated solution to scale up traditional contact tracing. However, the required penetration of contact tracing apps within a population to achieve a desired target in the control of the epidemic is currently under discussion within the research community. In order to understand the effects of digital contact tracing, several mathematical models have been proposed. In this article, we survey the main ones and we propose a compartmental SEIR model with which it is possible, differently from the models in the related literature, to derive closed-form conditions regarding the control of the epidemic as a function of the contact tracing apps penetration and the testing efficiency. Closed-form conditions are crucial for the understandability of models, and thus for decision makers (including digital contact tracing designers) to correctly assess the dependencies within the epidemic. With our model, we find that digital contact tracing alone can rarely tame an epidemic: for unrestrained COVID-19, this would require a testing turnaround of around 1 day and app uptake above 80% of the population, which are very difficult to achieve in practice. However, digital contact tracing can still be effective if complemented with other mitigation strategies, such as social distancing and mask-wearing.

5G communication brings substantial improvements in the quality of service provided to various applications by achieving higher throughput and lower latency. However, interactive multimedia applications (e.g., ultra high definition video conferencing, 3D and multiview video streaming, crowd-sourced video streaming, cloud gaming, virtual and augmented reality) are becoming more ambitious with high volume and low latency video streams putting strict demands on the already congested networks. Mobile Edge Computing (MEC) is an emerging paradigm that extends cloud computing capabilities to the edge of the network i.e., at the base station level. To meet the latency requirements and avoid the end-to-end communication with remote cloud data centers, MEC allows to store and process video content (e.g., caching, transcoding, pre-processing) at the base stations. Both video on demand and live video streaming can utilize MEC to improve existing services and develop novel use cases, such as video analytics, and targeted advertisements. MEC is expected to reshape the future of video streaming by providing ultra-reliable and low latency streaming (e.g., in augmented reality, virtual reality, and autonomous vehicles), pervasive computing (e.g., in real-time video analytics), and blockchain-enabled architecture for secure live streaming. This paper presents a comprehensive survey of recent developments in MEC-enabled video streaming bringing unprecedented improvement to enable novel use cases. A detailed review of the state-of-the-art is presented covering novel caching schemes, optimal computation offloading, cooperative caching and offloading and the use of artificial intelligence (i.e., machine learning, deep learning, and reinforcement learning) in MEC-assisted video streaming services., 36 pages

It is becoming common practice to push interactive and location-based services from remote datacenters to resource-constrained edge domains. This trend creates new management challenges at the network edge, not least to ensure resilience. These challenges now need to be investigated and overcome. In this paper, we explore the use of open-source programmable asset orchestration at edge cloud systems to guarantee operational resilience and a satisfactory performance level despite system incidents such as faults, congestion, or cyber-attacks. We discuss the design and deployment of a new cross-level configurable solution, Resilient Edge Cloud Systems (RECS). Results from appropriate tests made on RECS highlight the positive effects of deploying novel service and resource management algorithms at both data and control planes of the programmable edge system to mitigate against disruptive events such as control channel issues, service overload, or link congestion. RECS offers the following benefits: i) the switch automatically selects the standalone operation mode after its disconnection from the upper-level controllers; ii) deployment of edge virtualized services is made, according to client requests; iii) the client requests are served by edge services and the related traffic is balanced among the alternative on-demand routing paths to the edge location where each service is available for its clients; iv) the TCP traffic quality is protected from unfair competitiveness of UDP flows; and v) a set of redundant controllers is orchestrated by a top-level multi-thread cluster manager, using a novel management protocol with low overhead., Comment: Accepted for publication in IEEE Access; Please watch an associated video in https://ieeexplore.ieee.org/document/9751692

Survivability is mission-critical for elastic optical networks (EONs) as they are expected to carry an enormous amount of data. In this paper, we consider the problem of designing shared backup path protection (SBPP) based EON that facilitates the minimum quality-of-transmission (QoT) assured allocation against physical layer impairments (PLIs) under any single link/shared risk link group (SRLG) failure for static and dynamic traffic scenarios. In general, the effect of PLIs on lightpath varies based on the location of failure of a link as it introduces different active working and backup paths. To address these issues in the design of SBPP EON, we formulate a mixed integer linear programming (MILP) based robust optimization framework for static traffic with the objective of minimizing overall fragmentation. In this process, we use the efficient bitloading technique for spectrum allocation for the first time in survivable EONs. In addition, we propose a novel SBPP-impairment aware (SBPP-IA) algorithm considering the limitations of MILP for larger networks. For this purpose, we introduce a novel sorting technique named most congested working-least congested backup first (MCW-LCBF) to sort the given set of static requests. Next, we employ our SBPP-IA algorithm for dynamic traffic scenario and compare it with existing algorithms in terms of different QoT parameters. We demonstrated through simulations that our study provides around 40% more QoT guaranteed requests compared to existing ones.

As a response to the global COVID-19 surge in 2020, many countries have implemented lockdown or stay-at-home policies. If, however, the contact persons of every infected patient could be identified, the number of virus transmissions could be reduced, while the more incisive measures could be softened. For this purpose, contact tracing using smartphones is being considered as a promising technique. Here, smartphones emit and scan for Bluetooth Low Energy (BLE) signals for detecting devices in range. When a device is detected, its distance is estimated by evaluating its received signal strength. The main insight that is exploited for distance estimation is that the attenuation of a signal increases with the distance along which it has traveled. However, besides distance, there are multiple additional factors that impact the attenuation and hence disturb distance estimation. Among them, frequency-selective hardware and signal propagation belong to the most significant ones. For example, a BLE device transmits beacons on three different frequencies (channels), while the transmit power and the receiver sensitivity depend on the frequency. As a result, the received signal strength varies for each channel, even when the distance remains constant. However, the information on which wireless channel a beacon has been received is not made available to a smartphone. Hence, this error cannot be compensated, e.g., by calibration. In this paper, we for the first time provide a solution to detect the wireless channel on which a packet has been received on a smartphone. We experimentally evaluate our proposed technique on multiple different smartphone models. Our results help to make contact tracing more robust by improving the accuracy of distance estimation.

The emergence of the Internet as a ubiquitous technology has facilitated the rapid evolution of social media as the leading virtual platform for communication, content sharing, and information dissemination. In spite of revolutionizing the way news is delivered to people, this technology has also brought along with itself inevitable demerits. One such drawback is the spread of rumors expedited by social media platforms, which may provoke doubt and fear. Therefore, it is essential to debunk rumors before their widespread use. Over the years, many studies have been conducted to develop effective rumor verification systems. One aspect of such studies focuses on rumor stance classification, which involves the task of utilizing user viewpoints regarding a rumorous post to better predict the veracity of a rumor. Relying on user stances in rumor verification has gained significant importance, for it has resulted in significant improvements in the model performance. In this paper, we conduct a comprehensive literature review of rumor stance classification in complex online social networks (OSNs). In particular, we present a thorough description of these approaches and compare their performances. Moreover, we introduce multiple datasets available for this purpose and highlight their limitations. Finally, challenges and future directions are discussed to stimulate further relevant research efforts., Comment: 16 pages, 3 figures, journal

In the field of WiFi sensing, as an alternative sensing source of the channel state information (CSI) matrix, the use of a beamforming feedback matrix (BFM)that is a right singular matrix of the CSI matrix has attracted significant interest owing to its wide availability regarding the underlying WiFi systems. In the IEEE 802.11ac/ax standard, the station (STA) transmits a BFM to an access point (AP), which uses the BFM for precoded multiple-input and multiple-output communications. In addition, in the same way, the AP transmits a BFM to the STA, and the STA uses the received BFM. Regarding BFM-based sensing, extensive real-world experiments were conducted as part of this study, and two key insights were reported: Firstly, this report identified a potential issue related to accuracy in existing uni-directional BFM-based sensing frameworks that leverage only BFMs transmitted for the AP or STA. Such uni-directionality introduces accuracy concerns when there is a sensing capability gap between the uni-directional BFMs for the AP and STA. Thus, this report experimentally evaluates the sensing ability disparity between the uni-directional BFMs, and shows that the BFMs transmitted for an AP achieve higher sensing accuracy compared to the BFMs transmitted from the STA when the sensing target values are estimated depending on the angle of departure of the AP. Secondly, to complement the sensing gap, this paper proposes a bi-directional sensing framework, which simultaneously leverages the BFMs transmitted from the AP and STA. The experimental evaluations reveal that bi-directional sensing achieves higher accuracy than uni-directional sensing in terms of the human localization task., Comment: 10 pages, 7 figures

Mobility modeling in 5G and beyond 5G must address typical features such as time-varying correlation between mobility patterns of different nodes, and their variation ranging from macro-mobility (kilometer range) to micro-mobility (sub-meter range). Current models have strong limitations in doing so: the widely used reference-based models, such as the Reference Point Group Mobility (RPGM), lack flexibility and accuracy, while the more sophisticated rule-based (i.e. behavioral) models are complex to set-up and tune. This paper introduces a new rule-based Modular Mobility Model, named Mo3, that provides accuracy and flexibility on par with behavioral models, while preserving the intuitiveness of the reference-based approach, and is based on five rules: 1) Individual Mobility, 2) Correlated Mobility, 3) Collision Avoidance, 4) Obstacle Avoidance and 5) Upper Bounds Enforcement. Mo3 avoids introducing acceleration vectors to define rules, as behavioral models do, and this significantly reduces complexity. Rules are mapped one-to-one onto five modules, that can be independently enabled or replaced. Comparison of time-correlation features obtained with Mo3 vs. reference-based models, and in particular RPGM, in pure micro-mobility and mixed macro-mobility / micro-mobility scenarios, shows that Mo3 and RPGM generate mobility patterns with similar topological properties (intra-group and inter-group distances), but that Mo3 preserves a spatial correlation that is lost in RPGM - at no price in terms of complexity - making it suitable for adoption in 5G and beyond 5G., Comment: 33 pages, 32 figures. Accepted for publication on IEEE Access

Mobile edge computing (MEC) is considered a novel paradigm for computation-intensive and delay-sensitive tasks in fifth generation (5G) networks and beyond. However, its uncertainty, referred to as dynamic and randomness, from the mobile device, wireless channel, and edge network sides, results in high-dimensional, nonconvex, nonlinear, and NP-hard optimization problems. Thanks to the evolved reinforcement learning (RL), upon iteratively interacting with the dynamic and random environment, its trained agent can intelligently obtain the optimal policy in MEC. Furthermore, its evolved versions, such as deep RL (DRL), can achieve higher convergence speed efficiency and learning accuracy based on the parametric approximation for the large-scale state-action space. This paper provides a comprehensive research review on RL-enabled MEC and offers insight for development in this area. More importantly, associated with free mobility, dynamic channels, and distributed services, the MEC challenges that can be solved by different kinds of RL algorithms are identified, followed by how they can be solved by RL solutions in diverse mobile applications. Finally, the open challenges are discussed to provide helpful guidance for future research in RL training and learning MEC., Comment: 33 pages, 5 figures, 11 tables

Unmanned Aerial Vehicles (UAVs) are poised to play a central role in revolutionizing future services offered by the envisioned smart cities, thanks to their agility, flexibility, and cost-efficiency. UAVs are being widely deployed in different verticals including surveillance, search and rescue missions, delivery of items, and as an infrastructure for aerial communications in future wireless networks. UAVs can be used to survey target locations, collect raw data from the ground (i.e., video streams), generate computing task(s) and offload it to the available servers for processing. In this work, we formulate a multi-objective optimization framework for both the network resource allocation and the UAV trajectory planning problem using Mixed Integer Linear Programming (MILP) optimization model. In consideration of the different stake holders that may exist in a Cloud-Fog environment, we minimize the sum of a weighted objective function, which allows network operators to tune the weights to emphasize/de-emphasize different cost functions such as the end-to-end network power consumption (EENPC), processing power consumption (PPC), UAVs total flight distance (UAVTFD), and UAVs total power consumption (UAVTPC). Our optimization models and results enable the optimum offloading decisions to be made under different constraints relating to EENPC, PPC, UAVTFD and UAVTPC which we explore in detail. For example, when the UAVs propulsion efficiency (UPE) is at its worst (10% considered), offloading via the macro base station is the best choice and a maximum power saving of 34% can be achieved. Extensive studies on the UAVs coverage path planning (CPP) and computation offloading have been conducted, but none has tackled the issue in a practical Cloud-Fog architecture in which access, metro and core layers are considered in the service offloading in a distributed architecture like the Cloud-Fog.

While the performance of mmWave links has been thoroughly investigated by simulations or testbeds, the behavior of this technology in real-world commercial setups has not yet been thoroughly documented. In this paper, we address this gap and present the results of an empirical study to determine the actual performance of a commercial 5G mmWave cell through on-field measurements. We evaluate the signal and beam coverage map of an operational network as well as the end-to-end communication performance of a 5G mmWave connection, considering various scenarios, including human body blockage effects, foliage-caused and rain-induced attenuation, and water surface effects. To the best of our knowledge, this paper is the first to report on a commercial deployment while not treating the radio as a black box. Measurement results are compared with 3GPP's statistical channel models for mmWave to check the possible gaps between simulated and actual performance. This measurement analysis provides valuable information for researchers and 5G verticals to fully understand how a 5G mmWave commercial access network operates in real-world, under various operational conditions, with buildings, humans, trees, water surfaces, etc., 12 pages, 11 figures, 7 tables

Technological changes (NFV, Osmotic Computing, Cyber-physical Systems) are making very important devising techniques to efficiently run a flow of jobs formed by dependent tasks in a set of servers. These problem can be seen as generalizations of the dynamic job-shop scheduling problem, with very rich dependency patterns and arrival assumptions. In this work, we consider a computational model of a distributed system formed by a set of servers in which jobs, that are continuously arriving, have to be executed. Every job is formed by a set of dependent tasks (i. e., each task may have to wait for others to be completed before it can be started), each of which has to be executed in one of the servers. The arrival of jobs and their properties is assumed to be controlled by a bounded adversary, whose only restriction is that it cannot overload any server. This model is a non-trivial generalization of the Adversarial Queuing Theory model of Borodin et al., and, like that model, focuses on the stability of the system: whether the number of jobs pending to be completed is bounded at all times. We show multiple results of stability and instability for this adversarial model under different combinations of the scheduling policy used at the servers, the arrival rate, and the dependence between tasks in the jobs. Spanish State Research Agency - Spanish Ministry of Science and Innovation Department of Education and Research of the Regional Government of Madrid TRUE pub

Work has now begun on the sixth generation of cellular technologies (‘6G‘) and cost-efficient global broadband coverage is already becoming a key pillar. Indeed, we are still far from providing universal and affordable broadband connectivity, despite this being a key part of the Sustainable Development Goals (Target 9.c). Currently, both Mobile Network Operators and governments still lack independent analysis of the strategies that can help achieve this target with the cellular technologies available (4G and 5G). Therefore, this paper undertakes a quantitative assessment demonstrating how current 5G policies affect universal broadband, drawing conclusions over how decisions made now affect future evolution to 6G. Using a method based on an open-source techno-economic codebase, combining remote sensing with least-cost network algorithms, performance analytics are provided for different 4G and 5G universal broadband strategies. As an example, the assessment approach is applied to India, the world‘s second-largest mobile market and a country with very high spectrum prices. The results demonstrate the trade-offs between technological decisions. This includes demonstrating how important current infrastructure policy is, particularly given fiber backhaul will be essential for delivering 6G quality of service. We find that by eliminating the spectrum licensing costs, 100% 5G population coverage can viably be achieved using fiber backhaul. Therefore, supportive infrastructure policies are essential in providing a superior foundation for evolution to future cellular generation, such as 6G.

Advances in synthetic biology and nanotechnology have contributed to the design of tools that can be used to control, reuse, modify, and re-engineer cells' structure, as well as enabling engineers to effectively use biological cells as programmable substrates to realize Bio-Nano Things (biological embedded computing devices). Bio-NanoThings are generally tiny, non-intrusive, and concealable devices that can be used for in-vivo applications such as intra-body sensing and actuation networks, where the use of artificial devices can be detrimental. Such (nano-scale) devices can be used in various healthcare settings such as continuous health monitoring, targeted drug delivery, and nano-surgeries. These services can also be grouped to form a collaborative network (i.e., nanonetwork), whose performance can potentially be improved when connected to higher bandwidth external networks such as the Internet, say via 5G. However, to realize the IoBNT paradigm, it is also important to seamlessly connect the biological environment with the technological landscape by having a dynamic interface design to convert biochemical signals from the human body into an equivalent electromagnetic signal (and vice versa). This, unfortunately, risks the exposure of internal biological mechanisms to cyber-based sensing and medical actuation, with potential security and privacy implications. This paper comprehensively reviews bio-cyber interface for IoBNT architecture, focusing on bio-cyber interfacing options for IoBNT like biologically inspired bio-electronic devices, RFID enabled implantable chips, and electronic tattoos. This study also identifies known and potential security and privacy vulnerabilities and mitigation strategies for consideration in future IoBNT designs and implementations., 41 pages, 9 tables, 6 figures

In typical sensor networks, data collection and processing are separated. A sink collects data from all nodes sequentially, which is very time consuming. Over-the-air computation, as a new diagram of sensor networks, integrates data collection and processing in one slot: all nodes transmit their signals simultaneously in the analog wave and the processing is done in the air. This method, although efficient, requires that signals from all nodes arrive at the sink, aligned in signal magnitude so as to enable an unbiased estimation. For nodes far away from the sink with a low channel gain, misalignment in signal magnitude is unavoidable. To solve this problem, in this paper, we investigate the amplify-and-forward based relay, in which a relay node amplifies signals from many nodes at the same time. We first discuss the general relay model and a simple relay policy. Then, a coherent relay policy is proposed to reduce relay transmission power. Directly minimizing the computation error tends to over-increase node transmission power. Therefore, the two relay policies are further refined with a new metric, and the transmission power is reduced while the computation error is kept low. In addition, the coherent relay policy helps to reduce the relay transmission power by half, to below the limit, which makes it one step ahead towards practical applications.

In this paper, we propose an approach for constructing a multi-layer multi-orbit space information network (SIN) to provide high-speed continuous broadband connectivity for space missions (nanosatellite terminals) from the emerging space-based Internet providers. This notion has been motivated by the rapid developments in satellite technologies in terms of satellite miniaturization and reusable rocket launch, as well as the increased number of nanosatellite constellations in lower orbits for space downstream applications, such as earth observation, remote sensing, and Internet of Things (IoT) data collection. Specifically, space-based Internet providers, such as Starlink, OneWeb, and SES O3b, can be utilized for broadband connectivity directly to/from the nanosatellites, which allows a larger degree of connectivity in space network topologies. Besides, this kind of establishment is more economically efficient and eliminates the need for an excessive number of ground stations while achieving real-time and reliable space communications. This objective necessitates developing suitable radio access schemes and efficient scalable space backhauling using inter-satellite links (ISLs) and inter-orbit links (IOLs). Particularly, service-oriented radio access methods in addition to software-defined networking (SDN)-based architecture employing optimal routing mechanisms over multiple ISLs and IOLs are the most essential enablers for this novel concept. Thus, developing this symbiotic interaction between versatile satellite nodes across different orbits will lead to a breakthrough in the way that future downstream space missions and satellite networks are designed and operated., Comment: arXiv admin note: text overlap with arXiv:2107.05312

Networking protocols are designed through long-time and hard-work human efforts. Machine Learning (ML)-based solutions have been developed for communication protocol design to avoid manual efforts to tune individual protocol parameters. While other proposed ML-based methods mainly focus on tuning individual protocol parameters (e.g., adjusting contention window), our main contribution is to propose a novel Deep Reinforcement Learning (DRL)-based framework to systematically design and evaluate networking protocols. We decouple a protocol into a set of parametric modules, each representing a main protocol functionality that is used as DRL input to better understand the generated protocols design optimization and analyze them in a systematic fashion. As a case study, we introduce and evaluate DeepMAC a framework in which a MAC protocol is decoupled into a set of blocks across popular flavors of 802.11 WLANs (e.g., 802.11 b/a/g/n/ac). We are interested to see what blocks are selected by DeepMAC across different networking scenarios and whether DeepMAC is able to adapt to network dynamics., Comment: 18 Pages, Under Review. arXiv admin note: text overlap with arXiv:2002.02075, arXiv:2002.03795

In Federated Learning (FL), a global statistical model is developed by encouraging mobile users to perform the model training on their local data and aggregating the output local model parameters in an iterative manner. However, due to limited energy and computation capability at the mobile devices, the performance of the model training is always at stake to meet the objective of local energy minimization. In this regard, Multi-access Edge Computing (MEC)-enabled FL addresses the tradeoff between the model performance and the energy consumption of the mobile devices by allowing users to offload a portion of their local dataset to an edge server for the model training. Since the edge server has high computation capability, the time consumption of the model training at the edge server is insignificant. However, the time consumption for dataset offloading from mobile users to the edge server has a significant impact on the total time consumed to complete a single round of FL process. Thus, resource management in MEC-enabled FL is challenging, where the objective is to reduce the total time consumption while saving the energy consumption of the mobile devices. In this article, we formulate an energy-aware resource management for MEC-enabled FL in which the model training loss and the total time consumption are jointly minimized, while considering the energy limitation of mobile devices. In addition, we recast the formulated problem as a Generalized Nash Equilibrium Problem (GNEP) to capture the coupling constraints between the radio resource management and dataset offloading. To that end, we analyze the impact of the dataset offloading and computing resource allocation on the model training loss, time, and the energy consumption. Finally, we present the convergence analysis of the proposed solution, and evaluate its performance against the traditional FL approach. Simulation results demonstrate the efficacy of our proposed solution approach.

The significant increase in the number of individuals with chronic ailments (including the elderly and disabled) has dictated an urgent need for an innovative model for healthcare systems. The evolved model will be more personalized and less reliant on traditional brick-and-mortar healthcare institutions such as hospitals, nursing homes, and long-term healthcare centers. The smart healthcare system is a topic of recently growing interest and has become increasingly required due to major developments in modern technologies, especially in artificial intelligence (AI) and machine learning (ML). This paper is aimed to discuss the current state-of-the-art smart healthcare systems highlighting major areas like wearable and smartphone devices for health monitoring, machine learning for disease diagnosis, and the assistive frameworks, including social robots developed for the ambient assisted living environment. Additionally, the paper demonstrates software integration architectures that are very significant to create smart healthcare systems, integrating seamlessly the benefit of data analytics and other tools of AI. The explained developed systems focus on several facets: the contribution of each developed framework, the detailed working procedure, the performance as outcomes, and the comparative merits and limitations. The current research challenges with potential future directions are addressed to highlight the drawbacks of existing systems and the possible methods to introduce novel frameworks, respectively. This review aims at providing comprehensive insights into the recent developments of smart healthcare systems to equip experts to contribute to the field.

For densely deployed wireless local area networks (WLANs), this paper proposes a deep reinforcement learning-based channel allocation scheme that enables the efficient use of experience. The central idea is that an objective function is modeled relative to communication quality as a parametric function of a pair of observed topologies and channels. This is because communication quality in WLANs is significantly influenced by the carrier sensing relationship between access points. The features of the proposed scheme can be summarized by two points. First, we adopt graph convolutional layers in the model to extract the features of the channel vectors with topology information, which is the adjacency matrix of the graph dependent on the carrier sensing relationships. Second, we filter experiences to reduce the duplication of data for learning, which can often adversely influence the generalization performance. Because fixed experiences tend to be repeatedly observed in WLAN channel allocation problems, the duplication of experiences must be avoided. The simulation results demonstrate that the proposed method enables the allocation of channels in densely deployed WLANs such that the system throughput increases. Moreover, improved channel allocation, compared to other existing methods, is achieved in terms of the system throughput. Furthermore, compared to the immediate reward maximization method, the proposed method successfully achieves greater reward channel allocation or realizes the optimal channel allocation while reducing the number of changes.

Massive machine-type communication (mMTC) and ultra-reliable and low-latency communication (URLLC) are two key service types in the fifth-generation (5G) communication systems, pursuing scalability and reliability with low-latency, respectively. These two extreme services are envisaged to agglomerate together into \emph{critical mMTC} shortly with emerging use cases (e.g., wide-area disaster monitoring, wireless factory automation), creating new challenges to designing wireless systems beyond 5G. While conventional network slicing is effective in supporting a simple mixture of mMTC and URLLC, it is difficult to simultaneously guarantee the reliability, latency, and scalability requirements of critical mMTC (e.g., < 4ms latency, $10^6$ devices/km$^2$ for factory automation) with limited radio resources. Furthermore, recently proposed solutions to scalable URLLC (e.g., machine learning aided URLLC for driverless vehicles) are ill-suited to critical mMTC whose machine type users have minimal energy budget and computing capability that should be (tightly) optimized for given tasks. To this end, our paper aims to characterize promising use cases of critical mMTC and search for their possible solutions. To this end, we first review the state-of-the-art (SOTA) technologies for separate mMTC and URLLC services and then identify key challenges from conflicting SOTA requirements, followed by potential approaches to prospective critical mMTC solutions at different layers., 15 pages, To appear in IEEE Access, 2020

This article presents an overview of future truly personal communications, ranging from networking inside the human body to the exchange of data with external wireless devices in the surrounding environment. At the nano- and micro-scales, communications can be realized with the aid of molecular mechanisms, Förster resonance energy transfer phenomenon, electromagnetic or ultrasound waves. At a larger scale, in the domain of Body Area Networks, a wide range of communication mechanisms is available, including smart-textiles, inductive- and body-couplings, ultrasounds, optical and wireless radio transmissions, a number of mature technologies existing already. The main goal of this article is to identify the potential mechanisms that can be exploited to provide interfaces in between nano- and micro-scale systems and Body Area Networks. These interfaces have to bridge the existing gap between the two worlds, in order to allow for truly personal communication systems to become a reality. The extraordinary applications of such systems are also discussed, as they are strong drivers of the research in this area.

Machine-to-Machine (M2M) communications have been introduced to improve the communication capacity in dense wireless networks. One of the most important concerns for network designers is maintaining the high performance of the network when the quality of connections between sources and their destinations is poor. Thus the careful selection of relays between data sources and their destinations is a very important issue. The possibility of simultaneous use of different Radio Frequency (RF) interfaces for transmitting data, which communication devices are equipped with them, can increase the capacity of data transmission over the network. In this paper, two novel M2M relay selection algorithms are proposed, named as Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA). ORSA is a centralized algorithm for the optimal selection of relays by transforming the main problem to a k-cardinality assignment problem that can be solved using the Hungarian algorithm. MRSA is a distributed algorithm that leverages concepts from matching theory to provide a stable solution for the relay selection problem. In both proposed algorithms static RF interfaces usage is applied to enable simultaneous use of different interfaces for data transmission. The simulations show that ORSA is optimally solving the relay selection problem. MRSA has an optimal stable result, that when there is no restriction on the number of channels, is only about 1% lower than ORSA. Besides, MRSA provides better results than direct transmission Without any Relay Selection Algorithm (WRSA) and Random Relay Selection Algorithm (RRSA), about 15% and 98%, respectively., 51 pages, 17 figures

The smooth operation of largely deployed Internet of Things (IoT) applications will depend on, among other things, effective infrastructure failure detection. Access failures in wireless network Base Stations (BSs) produce a phenomenon called "sleeping cells", which can render a cell catatonic without triggering any alarms or provoking immediate effects on cell performance, making them difficult to discover. To detect this kind of failure, we propose a Machine Learning (ML) framework based on the use of Key Performance Indicator (KPI) statistics from the BS under study, as well as those of the neighboring BSs with propensity to have their performance affected by the failure. A simple way to define neighbors is to use adjacency in Voronoi diagrams. In this paper, we propose a much more realistic approach based on the nature of radio-propagation and the way devices choose the BS to which they send access requests. We gather data from large-scale simulators that use real location data for BSs and IoT devices and pose the detection problem as a supervised binary classification problem. We measure the effects on the detection performance by the size of time aggregations of the data, the level of traffic and the parameters of the neighborhood definition. The Extra Trees and Naive Bayes classifiers achieve Receiver Operating Characteristic (ROC) Area Under the Curve (AUC) scores of 0.996 and 0.993, respectively, with False Positive Rate (FPR) under 5 %. The proposed framework holds potential for other pattern recognition tasks in smart-city wireless infrastructures, that would enable the monitoring, prediction and improvement of the Quality of Service (QoS) experienced by IoT applications., Submitted to the IEEE Access Journal

Recent advances in mobile technologies and cloud computing services have inspired the development of cloud-based real-time health monitoring systems. However, the transfer of health-related data to the cloud contributes to the burden on the networking infrastructures, leading to high latency and increased power consumption. Fog computing is introduced to relieve this burden by bringing services to the users' proximity. This study proposes a new fog computing architecture for health monitoring applications based on a Gigabit Passive Optical Network (GPON) access network. An Energy-Efficient Fog Computing (EEFC) model is developed using Mixed Integer Linear Programming (MILP) to optimize the number and location of fog devices at the network edge to process and analyze the health data for energy-efficient fog computing. The performance of the EEFC model at low data rates and high data rates health applications is studied. The outcome of the study reveals that a total energy saving of 36% and 52% are attained via processing and analysis the health data at the fog in comparison to conventional processing and analysis at the central cloud for low data rate application and high data rate application, respectively. We also developed a real-time heuristic; Energy Optimized Fog Computing (EOFC) heuristic, with energy consumption performance approaching the EEFC model. Furthermore, we examined the energy efficiency improvements under different scenarios of devices idle power consumption and traffic volume.

Fog computing is an emerging paradigm that aims to improve the efficiency and QoS of cloud computing by extending the cloud to the edge of the network. This paper develops a comprehensive energy efficiency analysis framework based on mathematical modeling and heuristics to study the offloading of virtual machine (VM) services from the cloud to the fog. The analysis addresses the impact of different factors including the traffic between the VM and its users, the VM workload, the workload versus number of users profile and the proximity of fog nodes to users. Overall, the power consumption can be reduced if the VM users' traffic is high and/or the VMs have a linear power profile. In such a linear profile case, the creation of multiple VM replicas does not increase the computing power consumption significantly (there may be a slight increase due to idle / baseline power consumption) if the number of users remains constant, however the VM replicas can be brought closer to the end users, thus reducing the transport network power consumption. In our scenario, the optimum placement of VMs over a cloud-fog architecture significantly decreased the total power consumption by 56% and 64% under high user data rates compared to optimized distributed clouds placement and placement in the existing AT&T network cloud locations, respectively.

In this work, we present P4-IPsec, a concept for IPsec in software-defined networks (SDN) using P4 programmable data planes. The prototype implementation features ESP in tunnel mode and supports different cipher suites. P4-capable switches are programmed to serve as IPsec tunnel endpoints. We also provide a client agent to configure tunnel endpoints on Linux hosts so that site-to-site and host-to-site application scenarios can be supported which are the base for virtual private networks (VPNs). While traditional VPNs require complex key exchange protocols like IKE to set up and renew tunnel endpoints, P4-IPsec benefits from an SDN controller to accomplish these tasks. One goal of this experimental work is to investigate how well P4-IPsec can be implemented on existing P4 switches. We present a prototype for the BMv2 P4 software switch, evaluate its performance, and publish its source code on GitHub [1] . We explain why we could not provide a useful implementation with the NetFPGA SUME board. For the Edgecore Wedge 100BF-32X Tofino-based switch, we presented two prototype implementations to cope with a missing crypto unit. As another contribution of this paper, we provide technological background of P4 and IPsec and give a comprehensive review of security applications in P4, IPsec in SDN, and IPsec data plane implementations. According to our knowledge, P4-IPsec is the first implementation of IPsec for P4-based SDN.

The exponential rise in mobile traffic originating from mobile devices highlights the need for making mobility management in future networks even more efficient and seamless than ever before. Ultra-Dense Cellular Network vision consisting of cells of varying sizes with conventional and mmWave bands is being perceived as the panacea for the eminent capacity crunch. However, mobility challenges in an ultra-dense heterogeneous network with motley of high frequency and mmWave band cells will be unprecedented due to plurality of handover instances, and the resulting signaling overhead and data interruptions for miscellany of devices. Similarly, issues like user tracking and cell discovery for mmWave with narrow beams need to be addressed before the ambitious gains of emerging mobile networks can be realized. Mobility challenges are further highlighted when considering the 5G deliverables of multi-Gbps wireless connectivity, in IEEE Access

While millimeter wave (mmWave) communications promise high data rates, their sensitivity to blockage and severe signal attenuation present challenges in their deployment in urban settings. One effective way to mitigate those effects and increase communication range is relaying in combination with beamforming. However, relay-assisted beamforming also requires relay selection, a process that not only is resource demanding due to the need for explicit Channel State Information (CSI), but also introduces network latency. In this paper, we introduce a relay beamforming approach for mmWave communications in an urban scenario, which exploits the shadowing-induced correlation structure of the channel to reduce both latency and CSI estimation overhead. Our system model consists of static relays deployed in clusters across streets. Under that setting, we propose a novel, resource efficient scheme for joint optimal relay selection and distributed cooperative beamforming that maximizes the expected Signal-to-Interference plus Noise Ratio (SINR) at the destination, under power constraints. In particular, assuming a time-slotted system operation, one relay from each cluster is optimally selected at each time slot to participate in optimal beamforming at the next time slot. The key novelty of the proposed scheme is that relay selection is implemented in a predictive and distributed manner, by exploiting channel correlations and by using past and present measurements of magnitude CSI. As a result, at each time slot, optimal beamforming based on relays selected in the previous slot and optimal predictive relay selection for the next time slot are implemented completely in parallel. This parallelization eliminates delays induced by sequential execution of relay selection and beamforming, and substantially reduces CSI estimation overhead. Simulations confirm that the proposed relay selection scheme outperforms any randomized selection policy, while, at the same time, achieves comparable performance to an ideal selection scheme that relies on perfect CSI estimates for all candidate relays.

The provision of reliable connectivity is envisioned as a key enabler for future autonomous driving. Anticipatory communication techniques have been proposed for proactively considering the properties of the highly dynamic radio channel within the communication systems themselves. Since real world experiments are highly time-consuming and lack a controllable environment, performance evaluations and parameter studies for novel anticipatory vehicular communication systems are typically carried out based on network simulations. However, due to the required simplifications and the wide range of unknown parameters (e.g., Mobile Network Operator (MNO)-specific configurations of the network infrastructure), the achieved results often differ significantly from the behavior in real world evaluations. In this paper, we present Data-driven Network Simulation (DDNS) as a novel data-driven approach for analyzing and optimizing anticipatory vehicular communication systems. Different machine learning models are combined for achieving a close to reality representation of the analyzed system's behavior. In a proof of concept evaluation focusing on opportunistic vehicular data transfer, the proposed method is validated against field measurements and system-level network simulation. In contrast to the latter, DDNS does not only provide massively faster result generation, it also achieves a significantly better representation of the real world behavior due to implicit consideration of cross-layer dependencies by the machine learning approach.

In this paper, an energy efficient IoT virtualization framework with P2P networking and edge computing is proposed. In this network, the IoT task processing requests are served by peers. The peers in our work are represented by IoT objects and relays that host virtual machines (VMs). We have considered three scenarios to investigate the saving in power consumption and the system capabilities in terms of task processing. The first scenario is the relays only scenario, where the task requests are processed using relays only. The second scenario is the objects only scenario, where the task requests are processed using the IoT objects only. The last scenario is a hybrid scenario, where the task requests are processed using both IoT objects and VMs. We have developed a mixed integer linear programming (MILP) model to maximize the number of processing tasks served by the system and minimize the total power consumed by the IoT network. We investigated our framework under the impact of VMs placement constraints, fairness constraints between the objects, tasks number limitations, uplink and downlink limited capacities, and processing capability limitations. Based on the MILP model principles, we developed an energy efficient virtualized IoT P2P networks heuristic (EEVIPN). The heuristic results were comparable to those of the MILP in terms of energy efficiency and tasks processing. Our results show that the hybrid scenario serves up to 77% (57% on average) processing task requests, but with higher energy consumption compared to the other scenarios. The relays only scenario can serve 74% (57% on average) of the processing task requests with 8% saving in power consumption compared to the hybrid scenario. In contrast, 28% (22% on average) of task requests can be successfully handled by applying the objects only scenario with up to 62% power saving compared to the hybrid scenario.

This paper addresses the four enabling technologies, namely multi-user sparse code multiple access (SCMA), content caching, energy harvesting, and physical layer security for proposing an energy and spectral efficient resource allocation algorithm for the access and backhaul links in heterogeneous cellular networks. Although each of the above mentioned issues could be a topic of research, in a real situation, we would face a complicated scenario where they should be considered jointly, and hence, our target is to consider these technologies jointly in a unified framework. Moreover, we propose two novel content delivery scenarios: 1) single frame content delivery (SFCD), and 2) multiple frames content delivery (MFCD), where the time duration of serving user requests is divided into several frames. In the first scenario, the requested content by each user is served over one frame. However, in the second scenario, the requested content by each user can be delivered over several frames. We formulate the resource allocation for the proposed scenarios as optimization problems where our main aim is to maximize the energy efficiency of access links subject to the transmit power and rate constraints of access and backhaul links, caching and energy harvesting constraints, and SCMA codebook allocation limitations. Due to the practical limitations, we assume that the channel state information values between eavesdroppers and base stations are uncertain and design the network for the worst case scenario. Since the corresponding optimization problems are mixed integer non-linear and nonconvex programming, NP-hard, and intractable, we propose an iterative algorithm based on the well-known alternate and successive convex approximation methods. In addition, the proposed algorithms are studied from the computational complexity, convergence, and performance perspectives. Moreover, the proposed caching scheme outperforms the existing traditional caching schemes like random caching and most popular caching. We also study the effect of joint and disjoint considerations of enabling technologies for the performance of next-generation networks. On the one hand, our proposed caching strategy increases slightly the computational complexity by 3%, 1.1%, and 2% compared to no caching, SFCD, and disjoint solution, respectively. On the other hand, the proposed caching scheme achieves a performance gain of 43%, 9.4%, and 51.3% compared to the three state-of-the-art schemes.

The fifth generation (5G) mobile telecommunication network is expected to support Multi- Access Edge Computing (MEC), which intends to distribute computation tasks and services from the central cloud to the edge clouds. Towards ultra-responsive, ultra-reliable and ultra-low-latency MEC services, the current mobile network security architecture should enable a more decentralized approach for authentication and authorization processes. This paper proposes a novel decentralized authentication architecture that supports flexible and low-cost local authentication with the awareness of context information of network elements such as user equipment and virtual network functions. Based on a Markov model for backhaul link quality, as well as a random walk mobility model with mixed mobility classes and traffic scenarios, numerical simulations have demonstrated that the proposed approach is able to achieve a flexible balance between the network operating cost and the MEC reliability., Comment: Accepted by IEEE Access on Feb. 02, 2019

International audience; Traditional power grids are being transformed into smart grids (SGs) to address the issues in the existing power system due to uni-directional information flow, energy wastage, growing energy demand, reliability, and security. SGs offer bi-directional energy flow between service providers and consumers, involving power generation, transmission, distribution, and utilization systems. SGs employ various devices for the monitoring, analysis, and control of the grid, deployed at power plants, distribution centers, and in consumers' premises in a very large number. Hence, an SG requires connectivity, automation, and the tracking of such devices. This is achieved with the help of the Internet of Things (IoT). The IoT helps SG systems to support various network functions throughout the generation, transmission, distribution, and consumption of energy by incorporating the IoT devices (such as sensors, actuators, and smart meters), as well as by providing the connectivity, automation, and tracking for such devices. In this paper, we provide a comprehensive survey on the IoT-aided SG systems, which includes the existing architectures, applications, and prototypes of the IoT-aided SG systems. This survey also highlights the open issues, challenges, and future research directions for the IoT-aided SG systems.

Device-free Wi-Fi indoor localization has received significant attention as a key enabling technology for many Internet of Things (IoT) applications. Machine learning-based location estimators, such as the deep neural network (DNN), carry proven potential in achieving high-precision localization performance by automatically learning discriminative features from the noisy wireless signal measurements. However, the inner workings of DNNs are not transparent and not adequately understood especially in the indoor localization application. In this paper, we provide quantitative and visual explanations for the DNN learning process as well as the critical features that DNN has learned during the process. Toward this end, we propose to use several visualization techniques, including: 1) dimensionality reduction visualization, to project the high-dimensional feature space to the 2D space to facilitate visualization and interpretation, and 2) visual analytics and information visualization, to quantify relative contributions of each feature with the proposed feature manipulation procedures. The results provide insightful views and plausible explanations of the DNN in device-free Wi-Fi indoor localization using channel state information (CSI) fingerprints., Comment: Accepted for publication in IEEE Access

Massive multiple-input multiple-output (MIMO) with frequency division duplex (FDD) mode is a promising approach to increasing system capacity and link robustness for the fifth generation (5G) wireless cellular systems. The premise of these advantages is the accurate downlink channel state information (CSI) fed back from user equipment. However, conventional feedback methods have difficulties in reducing feedback overhead due to significant amount of base station (BS) antennas in massive MIMO systems. Recently, deep learning (DL)-based CSI feedback conquers many difficulties, yet still shows insufficiency to decrease the occupation of uplink bandwidth resources. In this paper, to solve this issue, we combine DL and superimposed coding (SC) for CSI feedback, in which the downlink CSI is spread and then superimposed on uplink user data sequences (UL-US) toward the BS. Then, a multi-task neural network (NN) architecture is proposed at BS to recover the downlink CSI and UL-US by unfolding two iterations of the minimum mean-squared error (MMSE) criterion-based interference reduction. In addition, for a network training, a subnet-by-subnet approach is exploited to facilitate the parameter tuning and expedite the convergence rate. Compared with standalone SC-based CSI scheme, our multi-task NN, trained in a specific signal-to-noise ratio (SNR) and power proportional coefficient (PPC), consistently improves the estimation of downlink CSI with similar or better UL-US detection under SNR and PPC varying., 12 pages, 10 figures

Information and communication technologies are permeating all aspects of industrial and manufacturing systems, expediting the generation of large volumes of industrial data. This article surveys the recent literature on data management as it applies to networked industrial environments and identifies several open research challenges for the future. As a first step, we extract important data properties (volume, variety, traffic, criticality) and identify the corresponding data enabling technologies of diverse fundamental industrial use cases, based on practical applications. Secondly, we provide a detailed outline of recent industrial architectural designs with respect to their data management philosophy (data presence, data coordination, data computation) and the extent of their distributiveness. Then, we conduct a holistic survey of the recent literature from which we derive a taxonomy of the latest advances on industrial data enabling technologies and data centric services, spanning all the way from the field level deep in the physical deployments, up to the cloud and applications level. Finally, motivated by the rich conclusions of this critical analysis, we identify interesting open challenges for future research. The concepts presented in this article thematically cover the largest part of the industrial automation pyramid layers. Our approach is multidisciplinary, as the selected publications were drawn from two fields; the communications, networking and computation field as well as the industrial, manufacturing and automation field. The article can help the readers to deeply understand how data management is currently applied in networked industrial environments, and select interesting open research opportunities to pursue.

In 2019, around 57\% of the population of the world has broadband access to the Internet. Moreover, there are 5.9 billion mobile broadband subscriptions, i.e., 1.3 subscriptions per user. So there is an enormous interconnected computational power held by users all around the world. Also, it is estimated that Internet users spend more than six and a half hours online every day. But in spite of being a great amount of time, those resources are idle most of the day. Therefore, taking advantage of them presents an interesting opportunity. In this study, we introduce JSDoop, a prototype implementation to profit from this opportunity. In particular, we propose a volunteer web browser-based high-performance computing library. JSdoop divides a problem into tasks and uses different queues to distribute the computation. Then, volunteers access the web page of the problem and start processing the tasks in their web browsers. We conducted a proof-of-concept using our proposal and TensorFlow.js to train a recurrent neural network that predicts text. We tested it in a computer cluster and with up to 32 volunteers. The experimental results show that training a neural network in distributed web browsers is feasible and accurate, has a high scalability, and it is an interesting area for research.

We investigate the physical-layer security of uplink single-carrier frequency-division multiple-access (SC-FDMA) systems. Multiple users, Alices, send confidential messages to a common legitimate base-station, Bob, in the presence of an eavesdropper, Eve. To secure the legitimate transmissions, each user superimposes an artificial noise (AN) signal on the time-domain SC-FDMA data symbol. We reduce the computational and storage requirements at Bob's receiver by assuming simple per-sub-channel detectors. We assume that Eve has global channel knowledge of all links in addition to high computational capabilities, where she adopts high-complexity detectors such as single-user maximum likelihood (ML), multi-user minimum-mean-square-error, and multi-user ML. We analyze the correlation properties of the time-domain AN signal and illustrate how Eve can exploit them to reduce the AN effects. We prove that the number of useful AN streams that can degrade Eve's signal-to-noise ratio is dependent on the channel memories of Alices-Bob and Alices-Eve links. Furthermore, we enhance the system security for the case of partial Alices-Bob channel knowledge at Eve, where Eve only knows the precoding matrices of the data and AN signals instead of knowing the entire Alices-Bob channel matrices, and propose a hybrid security scheme that integrates temporal AN with channel-based secret key extraction. - 2019 IEEE. This work was supported by the Qatar National Research Fund (a member of the Qatar Foundation) through NPRP under Grant 8-627-2-260. The statements made herein are solely the responsibility of the authors. Scopus

Tactile Internet (TI) is envisioned to create a paradigm shift from the content-oriented communications to steer/control-based communications by enabling real-time transmission of haptic information (i.e., touch, actuation, motion, vibration, surface texture) over Internet in addition to the conventional audiovisual and data traffics. This emerging TI technology is expected to create numerous opportunities for technology markets in a wide variety of applications ranging from teleoperation systems and AR/VR to automotive safety and eHealthcare towards addressing the complex problems of human society. However, the realization of TI over wireless media in the upcoming 5G and beyond networks creates various non-conventional communication challenges and stringent requirements. To this end, this paper aims to provide a holistic view on wireless TI along with a thorough review of the existing literature, to identify and analyze the involved technical issues, to highlight potential solutions and to propose future research directions. First, starting with the vision of TI and recent advances and a review of related survey/overview articles, we present a generalized framework for wireless TI in the Beyond 5G Era including a TI architecture, main technical requirements, key application areas and potential enabling technologies. Subsequently, we provide a comprehensive review of the existing TI works by broadly categorizing them into three main paradigms; namely, haptic communications, wireless AR/VR, and autonomous, intelligent and cooperative mobility systems. Next, potential enabling technologies across physical/MAC and network layers are identified and discussed in detail. Also, security and privacy issues of TI applications are discussed along with some promising enablers. Finally, we present some open research challenges and recommend promising future research directions., 40 pages, 4 figures, 8 tables, submitted to IEEE Journal

In recent years, service-oriented-based Internet of Things (IoT) has received massive attention from research and industry. Integrating and composing smart objects functionalities or their services is required to create and promote more complex IoT applications with advanced features. When many smart objects are deployed, selecting the most appropriate set of smart objects to compose a service by considering both energy and quality of service (QoS) is an essential and challenging task. In this paper, we reduced the problem of finding an optimal balance between QoS level and the consumed energy of the IoT service composition to a bi-objective shortest path optimization (BSPO) problem and used an exact algorithm named pulse to solve the problem. The BSPO has two objectives, minimizing the QoS including execution time, network latency, and service price, and minimize the energy consumption of the composite service. Experimental evaluations show that the proposed approach has short execution time in various complex service profiles. Meanwhile, it can obtain good performance in energy consumption and thus network lifetime while maintaining a reasonable QoS level.

Signal occlusion by building blockages is a double-edged sword for the performance of millimeter-wave (mmW) communication networks. Buildings may dominantly attenuate the useful signals, especially when mmW base stations (BSs) are sparsely deployed compared to the building density. In the opposite BS deployment, buildings can block the undesired interference. To enjoy only the benefit, we propose a building-aware association scheme that adjusts the directional BS association bias of the user equipments (UEs), based on a given building density and the concentration of UE locations around the buildings. The association of each BS can thereby be biased: (i) toward the UEs located against buildings for avoiding interference to other UEs; or (ii) toward the UEs providing their maximum reference signal received powers (RSRPs). The proposed association scheme is optimized to maximize the downlink average data rate derived by stochastic geometry. Its effectiveness is validated by simulation using real building statistics., Comment: This work has been submitted to the IEEE for possible publication

Cellular networks are constantly lagging in terms of the bandwidth needed to support the growing high data rate demands. The system needs to efficiently allocate its frequency spectrum such that the spectrum utilization can be maximized while ensuring the quality of service (QoS) level. Owing to the coexistence of different types of traffic (e.g., real-time (RT) and non-real-time (nRT)) and different types of networks (e.g., small cell and macrocell), ensuring the QoS level for different types of users becomes a challenging issue in wireless networks. Fractional frequency reuse (FFR) is an effective approach for increasing spectrum utilization and reducing interference effects in orthogonal frequency division multiple access networks. In this paper, we propose a new FFR scheme in which bandwidth allocation is based on RT/nRT traffic classification. We consider the coexistence of small cells and macrocells. After applying FFR technique in macrocells, the remaining frequency bands are efficiently allocated among the small cells overlaid by a macrocell. In our proposed scheme, total frequency-band allocations for different macrocells are decided on the basis of the traffic intensity. The transmitted power levels for different frequency bands are controlled based on the level of interference from a nearby frequency band. Frequency bands with a lower level of interference are assigned to the RT traffic to ensure a higher QoS level for the RT traffic. RT traffic calls in macrocell networks are also given a higher priority compared with nRT traffic calls to ensure the low call-blocking rate. Performance analyses show significant improvement under the proposed scheme compared with conventional FFR schemes.

In order to improve future network performance, this paper proposes scalable intelligence-enabled networking (SIEN) with eliminating traffic redundancy for audio-visual-tactile Internet in 5G scenarios, such as enhanced mobile broadband, ultra-reliable and low latency communication, and massive machine-type communication. The SIEN consists of an intelligent management plane (ImP), an intelligence-enabled plane (IeP), a control plane, and a user plane. For the ImP, the containers with decision execution are constructed by a novel graph algorithm to organize objects such as network elements and resource partitions. For the IeP, a novel learning system is designed with decision-making using a congruity function for generalization and personalization in the presence of imbalanced, conflicting, and partial data. For the control plane, a scheme of identifier-locator mapping is designed by referring to information-centric networking and software-defined networking. For the user plane, the user-related traffic, which may include identifiers, registrations, requests and named data objects, is forwarded to implement the SIEN and test its performance. The evaluation shows the SIEN outperforms four state-of-the-art techniques for redundant traffic reduction by up to 46.04% based on a mix of assumption, simulation, and proof-of-concept implementation for audio-visual-tactile Internet multimedia service. To confirm the validity, the best case and the worst case for traffic offloading are tested with the data rate, latency, and density. The evaluation only focused on the scalability issue, while the SIEN would be beneficial to improve more issues such as inter-domain security, ultra-low latency, on-demand mobility, multi-homing routing, and cross-layer feature incongruity.

Data acquisition from multi-hop large-scale outdoor wireless sensor network (WSN) deployments for environmental monitoring is full of challenges. This is because of the severe resource constraints on tiny battery-operated motes (e.g., bandwidth, memory, power, and computing capacity), the data acquisition volume from large-scale WSNs, and the highly dynamic wireless link conditions in outdoor harsh communication environments. We present a novel compressed sensing approach, which can recover the sensing data at the sink with high fidelity when a very few data packets need to be collected, leading to a significant reduction of the network transmissions and thus an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is both efficient and simple to implement on the resource-constrained motes without motes’ storing of any part of the random projection matrix, as opposed to other existing compressed sensing-based schemes. We further propose a systematic method via machine learning to find a suitable representation basis, for any given WSN deployment and data field, which is both sparse and incoherent with the random projection matrix in compressed sensing for data collection. We validate our approach and evaluate its performance using a real-world outdoor multi-hop WSN testbed deployment in situ . The results demonstrate that our approach significantly outperforms existing compressed sensing approaches by reducing data recovery errors by an order of magnitude for the entire WSN observation field while drastically reducing wireless communication costs at the same time.

The incoming era of the Fifth-Generation Fog Computing-supported Radio Access Networks (shortly, 5G FOGRANs) aims at exploiting computing/networking resource virtualization, in order to augment the limited resources of wireless devices through the seamless live migration of Virtual Machines (VMs) towards nearby Fog data centers. For this purpose, the bandwidths of the multiple Wireless Network Interface Cards (WNICs) of the wireless devices may be aggregated under the control of the emerging MultiPathTCP (MPTCP) protocol. However, due to fading and mobility-induced phenomena, the energy consumptions of current state-of-the-art VM migration techniques may still offset their expected benefits. Motivated by these considerations, in this paper, we analytically characterize, implement in software and numerically test the optimal minimum-energy Settable-Complexity Bandwidth Manager (SCBM) for the live migration of VMs over 5G FOGRAN MPTCP connections. The key features of the proposed SCBM are that: (i) its implementation complexity is settable on-line on the basis of the target energy consumption-vs.-implementation complexity tradeoff; (ii) it minimizes the network energy consumed by the wireless device for sustaining the migration process under hard constraints on the tolerated migration times and downtimes; and, (iii) by leveraging a suitably designed adaptive mechanism, it is capable to quickly react to (possibly, unpredicted) fading and/or mobility-induced abrupt changes of the wireless environment without requiring forecasting. The actual effectiveness of the proposed SCBM is supported by extensive energy-vs.-delay performance comparisons, that cover: (i) a number of heterogeneous 3G/4G/WiFi FOGRAN scenarios; (ii) synthetic and real-world workloads; and, (iii) MPTCP and SinglePathTCP (SPTCP) wireless connections., Comment: A shorter version of this paper has been submitted to IEEE Access

In the latest years, 3GPP has added short range cellular-vehicle-to-anything (C-V2X) to the features of LTE and 5G in order to make vehicles, roadside devices, and vulnerable users directly exchange information using the same chipset as for classical long range connections. C-V2X is based on the use of advanced physical layer techniques and orthogonal resources, and one of the main aspects affecting its performance is the way resources are allocated. Allocations can be either managed by the network or in a distributed way, directly by the nodes. The latter case, called Mode 4, is defined to manage those situations where the network cannot be involved in the scheduling process, for example due to a lack of coverage, but could also be adopted in order to reduce the processing burden of eNodeB. An algorithm, defined in the standards, makes nodes sense the medium and identify the best time-frequency combination to allocate their messages. Focusing on C-V2V Mode 4, in this work we analyze the parameters of the algorithm designed by 3GPP and their impact on the system performance. Through simulations in different large scale scenarios, we show that modifying some parameters have negligible effect, that the proper choice of others can indeed improve the quality of service, and that a group of parameters allows to trade-off reliability with update delay. The provided results can also be exploited to guide future work.

Recently, the demand for multimedia applications is dramatically increased, which in turn increases the portion of video traffic on the Internet. The video streams, which require stringent Quality of Service (QoS), are expected to occupy more than two-thirds of web traffic by 2019. IEEE802.11e has introduced HCF Controlled Channel Access (HCCA) to provide QoS for delay-sensitive applications including highly compressed video streams. However, IEEE802.11e performance is hindered by the dynamic nature of Variable Bit Rate (VBR) video streams in which packet size and interval time are rapidly fluctuating during the traffic lifetime. In order to make IEEE802.11e able to accommodate with the irregularity of VBR video traffic, many approaches have been used in the literature. In this article, we highlight and discuss the QoS challenges in IEEE802.11e. Then, we classify the existing QoS approaches in IEEE802.11e and we also discuss the selection of recent promising and interesting enhancements of HCCA. Eventually, a set of open research issues and potential future directions is presented., Comment: 19 pages