An adjacency matrix approach to delay analysis in temporal networks
An adjacency matrix approach to delay analysis in temporal networks
复制标题
DOI:
10.1109/milcom.2017.8170866
复制
发表时间:
2017-10
期刊:
影响因子:
--
通讯作者:
J. Shea;J. Macker
中科院分区:
文献类型:
--
作者:
J. Shea;J. Macker
Wireless communications networks are often modeled as graphs in which the vertices represent wireless devices and the edges represent the communication links between them. However, graphs fail to capture the time-varying nature of wireless networks. Temporal networks are graphs in which the sets of nodes or edges are time-varying. We consider the most common case, in which the set of nodes is fixed but the presence of edges changes over time. Most previous work on analyzing temporal networks has focused on summary measures that combine the contributions of different paths by using different weights for paths with different delays. Such summary measures are efficient to compute but may lose valuable information about the temporal behavior of the network. We propose techniques that characterize the delays of all paths between nodes in temporal networks. We then apply these techniques to identify dominant patterns in the temporal paths connecting nodes. Example temporal networks are used to illustrate these phenomena, and we consider implications to wireless networks.