Optimal Haptic Communications over Nanonetworks for E-Health Systems

A Tactile Internet-based nanonetwork is an emerging field that promises a new range of e-health applications, in which human operators can efficiently operate and control devices at the nanoscale for remote-patient treatment. A haptic feedback is inevitable for establishing a link between the operator and unknown in-body environment. However, haptic communications over the terahertz band may incur significant path loss due to molecular absorption. In this paper, we propose an optimization framework for haptic communications over nanonetworks, in which in-body nanodevices transmit haptic information to an operator via the terahertz band. By considering the properties of the terahertz band, we employ Brownian motion to describe the mobility of the nanodevices and develop a time-variant terahertz channel model. Furthermore, based on the developed channel model, we construct a stochastic optimization problem for improving haptic communications under the constraints of system stability, energy consumption, and latency. To solve the formulated nonconvex stochastic problem, an improved time-varying particle swarm optimization algorithm is presented, which can deal with the constraints of the problem efficiently by reducing the convergence time significantly. The simulation results validate the theoretical analysis of the proposed system

Author classification using transfer learning and predicting stars in co-author networks

© 2020 John Wiley & Sons Ltd The vast amount of data is key challenge to mine a new scholar that is plausible to be star in the upcoming period. The enormous amount of unstructured data raise every year is infeasible for traditional learning; consequently, we need a high quality of preprocessing technique to expand the performance of traditional learning. We have persuaded a novel approach, Authors classification algorithm using Transfer Learning (ACTL) to learn new task on target area to mine the external knowledge from the source domain. Comprehensive experimental outcomes on real-world networks showed that ACTL, Node-based Influence Predicting Stars, Corresponding Authors Mutual Influence based on Predicting Stars, and Specific Topic Domain-based Predicting Stars enhanced the node classification accuracy as well as predicting rising stars to compared with contemporary baseline methods

A Comprehensive Survey of the Tactile Internet: State of the art and Research Directions

The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet goes far beyond data, audio and video delivery over fixed and mobile networks, and even beyond allowing communication and collaboration among things. It is expected to enable haptic communication and allow skill set delivery over networks. Some examples of potential applications are tele-surgery, vehicle fleets, augmented reality and industrial process automation. Several papers already cover many of the Tactile Internet-related concepts and technologies, such as haptic codecs, applications, and supporting technologies. However, none of them offers a comprehensive survey of the Tactile Internet, including its architectures and algorithms. Furthermore, none of them provides a systematic and critical review of the existing solutions. To address these lacunae, we provide a comprehensive survey of the architectures and algorithms proposed to date for the Tactile Internet. In addition, we critically review them using a well-defined set of requirements and discuss some of the lessons learned as well as the most promising research directions

Provisioning Ultra-Low Latency Services in Softwarized Network for the Tactile Internet

The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet is envisioned to deliver real-time control and physical tactile experiences remotely in addition to conventional audiovisual data to enable immersive human-to-machine interaction and allow skill-set delivery over networks. To realize the Tactile Internet, two key performance requirements, namely ultra-low latency and ultra-high reliability need to be achieved. However, currently deployed networks are far from meeting these stringent requirements and cannot efficiently cope with dynamic service arrivals/departures and the significant growth of traffic demands. To fulfill these requirements, a softwarized network enabled by network function virtualization (NFV) and software-defined network (SDN) technologies is introduced as a new promising concept of a future network due to its flexibility, agility, scalability and cost efficiency. Despite these benefits, provisioning Tactile Internet network services (NSs) in an NFV-based infrastructure remains a challenge, as network resources must be allocated for virtual network function (VNF) deployment and traffic routing in such a way that the stringent requirements are met, and network operator’s objectives are optimized. This problem is also well-known, as NFV resource allocation (NFV-RA) and can be further divided into three stages: (i) VNF composition, (ii) VNF embedding/placement and (iii) VNF scheduling. This thesis addresses challenges on NFV-RA for Tactile Internet NSs, especially ultra-low latency NSs. We first conduct a survey on architectural and algorithmic solutions proposed so far for the Tactile Internet. Second, we propose a joint VNF composition and embedding algorithm to efficiently determine the number of VNF instances to form a VNF forward graph (VNF-FG) and their embedding locations to serve ultra-low latency NSs, as in some cases, multiple instances of each VNF type with proper embedding may be needed to guarantee the stringent latency requirements. The proposed algorithm relies on a Tabu search method to solve the problem with a reasonable time. Third, we introduce real-time VNF embedding algorithms to efficiently support ultra-low latency NSs that require fast service provisioning. By assuming that a VNF-FG is given, our proposed algorithms aim to minimize the cost while meeting the stringent latency requirement. Finally, we focus on a joint VNF embedding and scheduling problem, assuming that ultra-low latency NSs can arrive in the network any time and have specific service deadlines. Moreover, VNF instances once deployed can be shared by multiple NSs. With these assumptions, we aim to optimally determine whether to schedule NSs on already deployed VNFs or to deploy new VNFs and schedule them on newly deployed VNFs to maximize profits while guaranteeing the stringent service deadlines. Two efficient heuristics are introduced to solve this problem with a feasible time