{"title":"监控多跳多信道无线网络:在线嗅探器信道分配","authors":"Jing Xu, Wei Liu, K. Zeng","doi":"10.1109/LCN.2016.97","DOIUrl":null,"url":null,"abstract":"Data capture is important for some critical network applications, such as network diagnosis and criminal investigation. In multi-channel wireless networks, the fundamental challenge for data capture is how to assign operation channels to wireless sniffers. The existing approaches make some impractical assumptions, such as the prior knowledge on network traffic and the perfect conditions of data capture. In this paper, we relax these assumptions and investigate the sniffer-channel assignment problem in multi-hop scenarios. Especially, sniffer redundancy deployment is discussed, which enables multiple sniffers to monitor one traffic. This problem is formulated as a combinatorial multi-arm bandit (MAB) problem, and a cooperative distribute learning policy is proposed. We analyze the regret of our policy in theory, and validate its effectiveness through numerical simulations.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"83 7 1","pages":"579-582"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Monitoring Multi-Hop Multi-Channel Wireless Networks: Online Sniffer Channel Assignment\",\"authors\":\"Jing Xu, Wei Liu, K. Zeng\",\"doi\":\"10.1109/LCN.2016.97\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data capture is important for some critical network applications, such as network diagnosis and criminal investigation. In multi-channel wireless networks, the fundamental challenge for data capture is how to assign operation channels to wireless sniffers. The existing approaches make some impractical assumptions, such as the prior knowledge on network traffic and the perfect conditions of data capture. In this paper, we relax these assumptions and investigate the sniffer-channel assignment problem in multi-hop scenarios. Especially, sniffer redundancy deployment is discussed, which enables multiple sniffers to monitor one traffic. This problem is formulated as a combinatorial multi-arm bandit (MAB) problem, and a cooperative distribute learning policy is proposed. We analyze the regret of our policy in theory, and validate its effectiveness through numerical simulations.\",\"PeriodicalId\":6864,\"journal\":{\"name\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"volume\":\"83 7 1\",\"pages\":\"579-582\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2016.97\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data capture is important for some critical network applications, such as network diagnosis and criminal investigation. In multi-channel wireless networks, the fundamental challenge for data capture is how to assign operation channels to wireless sniffers. The existing approaches make some impractical assumptions, such as the prior knowledge on network traffic and the perfect conditions of data capture. In this paper, we relax these assumptions and investigate the sniffer-channel assignment problem in multi-hop scenarios. Especially, sniffer redundancy deployment is discussed, which enables multiple sniffers to monitor one traffic. This problem is formulated as a combinatorial multi-arm bandit (MAB) problem, and a cooperative distribute learning policy is proposed. We analyze the regret of our policy in theory, and validate its effectiveness through numerical simulations.