{"title":"从频谱活动的时间序列推断无线中继、路由和交通模式的非参数学习","authors":"S. Kokalj-Filipovic, P. Spasojevic, A. Poylisher","doi":"10.1109/ACSSC.2017.8335484","DOIUrl":null,"url":null,"abstract":"Non-parametric inference techniques are proposed to understand latent structure behind sequences of spectral activity indicators, i.e. packet start and stop times, of networked wireless transmitters. We aim to infer the latent network structure and characterize information flow between spectrally monitored nodes. The practical aspect of learning is to aid the reasoning of a cognitive network about its unknown and dynamic spectrum environment. We first segment the observed on-off time series into temporal segments of statistically discernible behavioral states. Each state segment has distinct emission statistics and a specific duration, learned by using a Bayesian non-parametric method, referred to as HDP-HSMM [1] in our prior work [2]. The end result is that new times series of state segments are derived from the observations of each nodes activity. We propose test statistics, loosely related to Granger-causality between per-node sequences of state segments, to trace the impact of one nodes traffic to another. We define extendable statistical models of causality in which not only state changes are considered as events, but also the nature of those changes, i.e. whether the new state has similar observation statistics in both nodes. Our approach is non-parametric as it does not require knowledge about underlying network protocols.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Non-parametric learning to infer wireless relays, routes and traffic patterns from time series of spectrum activity\",\"authors\":\"S. Kokalj-Filipovic, P. Spasojevic, A. Poylisher\",\"doi\":\"10.1109/ACSSC.2017.8335484\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-parametric inference techniques are proposed to understand latent structure behind sequences of spectral activity indicators, i.e. packet start and stop times, of networked wireless transmitters. We aim to infer the latent network structure and characterize information flow between spectrally monitored nodes. The practical aspect of learning is to aid the reasoning of a cognitive network about its unknown and dynamic spectrum environment. We first segment the observed on-off time series into temporal segments of statistically discernible behavioral states. Each state segment has distinct emission statistics and a specific duration, learned by using a Bayesian non-parametric method, referred to as HDP-HSMM [1] in our prior work [2]. The end result is that new times series of state segments are derived from the observations of each nodes activity. We propose test statistics, loosely related to Granger-causality between per-node sequences of state segments, to trace the impact of one nodes traffic to another. We define extendable statistical models of causality in which not only state changes are considered as events, but also the nature of those changes, i.e. whether the new state has similar observation statistics in both nodes. Our approach is non-parametric as it does not require knowledge about underlying network protocols.\",\"PeriodicalId\":296208,\"journal\":{\"name\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2017.8335484\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Non-parametric learning to infer wireless relays, routes and traffic patterns from time series of spectrum activity
Non-parametric inference techniques are proposed to understand latent structure behind sequences of spectral activity indicators, i.e. packet start and stop times, of networked wireless transmitters. We aim to infer the latent network structure and characterize information flow between spectrally monitored nodes. The practical aspect of learning is to aid the reasoning of a cognitive network about its unknown and dynamic spectrum environment. We first segment the observed on-off time series into temporal segments of statistically discernible behavioral states. Each state segment has distinct emission statistics and a specific duration, learned by using a Bayesian non-parametric method, referred to as HDP-HSMM [1] in our prior work [2]. The end result is that new times series of state segments are derived from the observations of each nodes activity. We propose test statistics, loosely related to Granger-causality between per-node sequences of state segments, to trace the impact of one nodes traffic to another. We define extendable statistical models of causality in which not only state changes are considered as events, but also the nature of those changes, i.e. whether the new state has similar observation statistics in both nodes. Our approach is non-parametric as it does not require knowledge about underlying network protocols.