# IEEE Transactions on Network Science and Engineering

## Issue 99

Early Access articles are new content made available in advance of the final electronic or print versions and result from IEEE's Preprint or Rapid Post processes. Preprint articles are peer-reviewed but not fully edited. Rapid Post articles are peer-reviewed and edited but not paginated. Both these types of Early Access articles are fully citable from the moment they appear in IEEE Xplore.

## Filter Results

Displaying Results 1 - 25 of 115
• ### Passivity-Based Leader-following Consensus Control for Nonlinear Multi-Agent Systems with Fixed and Switching Topologies

Publication Year: 2018, Page(s): 1
| | PDF (587 KB)

This paper studies consensus control issue for nonlinear multi-agent systems (MASs) under switching and fixed topologies by employing the passivity of every agent. Firstly, we analyze the output-strict passivity of the agent by selecting appropriate storage function, and presented an adaptive state feedback controller for ensuring the output-strict passivity of the single agent. Based these obtain... View full abstract»

• ### SPread: Exploiting Fractal Social Community For Efficient Multi-copy Routing in Taxi VDTNs

Publication Year: 2018, Page(s): 1
| | PDF (2420 KB)

In this paper, we focus on the multi-copy routing in Vehicle Delay Tolerant Networks (VDTNs) consisted of taxis. Multi-copy routing can balance the network congestion caused by broadcasting and the efficiency limitation in single-copy routing. However, current multi-copy routing algorithms often let different copies of each packet search the destination node independently, which leads to a low uti... View full abstract»

• ### Coalitions in Routing Games: A Worst-Case Perspective

Publication Year: 2018, Page(s): 1
| | PDF (1038 KB)

We investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the coalition can guarantee itself, under any (including worst) conditions. We then investigate fundamental solution concepts of the considered cooperative game, nam... View full abstract»

• ### Generating Graphs with Symmetry

Publication Year: 2018, Page(s): 1
| | PDF (2015 KB)

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erdos-Renyi model or the Barabasi-Albert model. Unfortunately, most graph generating algorithms do not typically create graphs with symmetries, which have been shown to have an important role on the network dynamics. Here, we present an algorithm to generat... View full abstract»

• ### Consistency, Feasibility, and Optimality of Network Update in SDNs

Publication Year: 2018, Page(s): 1
| | PDF (3441 KB)

In software defined networking, to maximize the network utilization, its control plane needs to frequently update the data plane via flow migration as the network conditions change dynamically. Since each switch updates its flow table independently and asynchronously, the network state transition may result in serious link congestion and packet loss if it is done directly from the initial to the f... View full abstract»

• ### Repeated Network Games with Dominant Actions and Individual Rationality

Publication Year: 2018, Page(s): 1
| | PDF (1204 KB)

Three kinds of activities happen in a network: agents link or unlink; agents act; agents observe and learn. The existing literature on network formation, on network games and on monitoring in networks studies each of these in isolation. We propose a framework in which these happen together. In our model, agents repeatedly choose to whom they link and the actions they take with their neighbors. Age... View full abstract»

• ### Uncovering spatial invasion on metapopulation networks with SIR epidemics

Publication Year: 2018, Page(s): 1
| | PDF (4746 KB) |  Media

Understanding how infectious diseases spatially diffuse is critical to predict and control the epidemic prevalence. However, uncovering epidemic spatial invasion is challenging due to stochastic travel of hosts and insufficient data availability. In this study, we develop a methodology for inferring global invasion pathways on metapopulation networks with the susceptible-infected-recovered (SIR) e... View full abstract»

• ### Social Influence Maximization in Hypergraph in Social Networks

Publication Year: 2018, Page(s): 1
| | PDF (2111 KB)

Crowd psychology plays an important role in determining the kind of activities that a person performs. In reality in a social network, crowd influence has been observed and it cannot be ignored when considering information diffusion problems. In this paper, we model crowd influence as a hyperedge$e=(H_e,\;v)$with weight$0\leq P_e\leq 1$, ... View full abstract»

Publication Year: 2018, Page(s): 1
| | PDF (5448 KB) |  Media

We analyze optimal strategies for the allocation of a finite budget that can be invested in different advertising channels over time with the objective of influencing social opinions in a network of individuals. In our analysis, we consider both exogenous influence mechanisms, such as advertising campaigns, as well as endogenous mechanisms of social influence, such as word-of-mouth, which are mode... View full abstract»

• ### When Crowd Meets Big Video Data: Cloud-Edge Collaborative Transcoding for Personal Livecast

Publication Year: 2018, Page(s): 1
| | PDF (1373 KB)

Deep penetration of personal computing devices and high-speed Internet has enabled everyone to be a broadcaster. In this crowdsourced live streaming service, numerous amateur broadcasters lively stream their video contents to viewers around the world. Consequently, these broadcasters generate a massive amount of video data. The set of video sources and recipients are big as well, so for demand for... View full abstract»

• ### A novel class of distributed fixed-time consensus protocols for second-order nonlinear and disturbed multi-agent systems

Publication Year: 2018, Page(s): 1
| | PDF (1990 KB)

The fixed-time consensus problem is considered in this paper for second-order multi-agent systems (MASs) with inherent nonlinear dynamics and disturbances under a detail-balanced network in both leaderless and leader-following cases. The fixed-time consensus means that MASs reach consensus in finite time and the settling time is uniformly bounded with respect to initial states. Based on the bi-lim... View full abstract»

• ### Optimization of Cascading Processes in Arbitrary Networks with Stochastic Interactions

Publication Year: 2018, Page(s): 1
| | PDF (487 KB)

We consider the problem of optimal propagation of cascades in a network, where the propagation process depends on the values that a decision-maker assigns to the network and independent influence rates. Assuming that there are costs associated with changing the values of these rates, we investigate the question of resource allocation that minimizes the time by which the cascading process reaches a... View full abstract»

• ### Exact Network Reconstruction from Complete SIS Nodal State Infection Information Seems Infeasible

Publication Year: 2018, Page(s): 1
| | PDF (1049 KB) |  Media

The SIS dynamics of the spread of a virus crucially depend on both the network topology and the spread parameters. Since neither the topology nor the spread parameters are known for the majority of applications, they have to be inferred from observations of the virus spread. We propose an inference method for both topology and spread parameters based on a maximum-a-posteriori estimation approach f... View full abstract»

• ### Multilayer flows in molecular networks identify biological modules in the human proteome

Publication Year: 2018, Page(s): 1
| | PDF (5614 KB)

A variety of complex systems exhibits different types of relationships simultaneously that can be modeled by multiplex networks. A typical problem is to determine the community structure of such systems that, in general, depend on one or more parameters to be tuned. In this study we propose one measure, grounded on information theory, to find the optimal value of the relax rate characterizing Mult... View full abstract»

• ### Large-scale network reduction towards scale-free structure

Publication Year: 2018, Page(s): 1
| | PDF (7927 KB)

This paper deals with a particular problem of graph reduction. Here, the reduced graph is aimed to have a particular structure, called scale-free, while preserving consistency with the initial graph. First, the problem is formulated as a general minimization problem, then some specifications are given to treat a particular case. To this end, we define a metric to measure the scale-freeness of a gr... View full abstract»

• ### Location Order Recovery in Trails with Low Temporal Resolution

Publication Year: 2018, Page(s): 1
| | PDF (965 KB)

Researchers who study object movement problems related to topics like traffic flow analysis, patient monitoring, and software operation, need to know the correct order in which objects move. Here, we use the term trail to refer to a series of movements by an object. This paper introduces a new missing data problem that occurs when analyzing trails where there is inadequate temporal resolution on t... View full abstract»

• ### Wide-scale Internet Disconnection: Impact and Recovery on Social-based P2P Overlays

Publication Year: 2018, Page(s): 1
| | PDF (1742 KB)

In the recent years, there have been situations where wide-scale network fraction of Internet users have been disconnected from the rest of the network, due to natural hazards or national censorships (e.g., a government cuts connectivity to the outside world as a mechanism for suppression of uprisings). Peer-to-peer systems are known to be resilient in the presence of churn and uncorrelated failur... View full abstract»

• ### DCAuth: Data-Centric Authentication for Secure In-Network Big-Data Retrieval

Publication Year: 2018, Page(s): 1
| | PDF (4352 KB)

Big data raises a strong demand on a network infrastructure to support the secure and efficient data retrieval with in-network caching. Information-Centric Networking (ICN) is an emerging approach to satisfy this demand, where big data are ubiquitously cached at the intermediate physical entities (IPEs). For the ICN, the unpredictability of users, IPEs, copy holders, and publishers during in-netwo... View full abstract»

• ### A Realistic Model for Failure Propagation in Interdependent Cyber-Physical Systems

Publication Year: 2018, Page(s): 1
| | PDF (3572 KB)

Modern cyber-physical systems are becoming increasingly interdependent. Such interdependencies create new vulnerabilities and make these systems more susceptible to failures. In particular, failures can easily spread across these systems, possibly causing cascade effects with a devastating impact on their functionalities. In this paper we focus on the interdependence between the power grid and the... View full abstract»

• ### Cooperative Inter-Domain Cache Sharing for Information-Centric Networking via a Bargaining Game Approach

Publication Year: 2018, Page(s): 1
| | PDF (704 KB)

Caching popular content locally has been shown to be an efficient way for internet service providers (ISPs) to reduce transit fees and improve the quality of their services. Recently, with the development of information-centric networking, content-peering, which allows peering ISPs to access each other's cache, has attracted interest. However, due to the economic structure and policy routing of th... View full abstract»

• ### Deep Convolutional Neural Networks for Indoor Localization with CSI Images

Publication Year: 2018, Page(s): 1
| | PDF (1091 KB)

With the increasing demand of location-based services, Wi-Fi based localization has attracted great interest because it provides ubiquitous access in indoor environments. In this paper, we propose CiFi, deep convolutional neural networks (DCNN) for indoor localization with commodity 5GHz WiFi. First, by leveraging a modified device driver, we can extract phase data of channel state information (CS... View full abstract»

• ### Incorporating Latent Constraints to Enhance Inference of Network Structure

Publication Year: 2018, Page(s): 1
| | PDF (787 KB)

A complex network is a model representation of interactions within technological, social, information, and biological networks. Oftentimes, we are interested in identifying the underlying network structure from limited and noisy observational data, which is a challenging problem. Here, to address this problem, we propose a novel and effective technique that incorporates latent structural constrain... View full abstract»

• ### Exponentially Twisted Sampling for Centrality Analysis and Community Detection in Attributed Networks

Publication Year: 2018, Page(s): 1
| | PDF (11199 KB)

In this paper, we conduct centrality analysis and community detection for attributed networks. An attributed network, as a generalization of a graph, has node attributes and edge attributes that represent the "features" of nodes and edges. Traditionally, centrality analysis and community detection of a graph are done by providing a sampling method for the graph. To take node attributes and edge at... View full abstract»

• ### Multi-Scale Factor Analysis of High-Dimensional Functional Connectivity in Brain Networks

Publication Year: 2018, Page(s): 1
| | PDF (2576 KB) |  Media

We consider challenges in modeling and estimating high-dimensional functional connectivity in brain networks with a large number of nodes arranged in a hierarchical and modular structure. We develop a multi-scale factor analysis (MSFA) model which partitions the massive neuroimaging time series data defined over the brain networks into a finite set of regional clusters. To achieve further dimensio... View full abstract»

• ### Reliability Analysis of IoT Networks with Community Structures

Publication Year: 2018, Page(s): 1
| | PDF (506 KB)

Network infrastructure and connectivity in the Internet of Things (IoT) applications are becoming increasingly complex and heterogeneous, opening up many challenges including reliability. Many real-world networks exhibit community structure, where the networked devices can be easily grouped into sets with dense internal connections but sparse connections between different sets. Examples of such co... View full abstract»

## Aims & Scope

The IEEE Transactions on Network Science and Engineering is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level.

Full Aims & Scope

## Meet Our Editors

GEditor-in-Chief
Dapeng Oliver Wu

University of Florida

Dept. of Electrical  &  Computer Engineering

P. O. Box 116130

Gainesville, FL 32611

Email: dpwu@ufl.edu