Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing最新文献_第4页

RAN Resource Usage Prediction for a 5G Slice Broker 5G切片代理的RAN资源使用预测

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326521

Craig L. Gutterman, E. Grinshpun, Sameerkumar Sharma, G. Zussman

{"title":"RAN Resource Usage Prediction for a 5G Slice Broker","authors":"Craig L. Gutterman, E. Grinshpun, Sameerkumar Sharma, G. Zussman","doi":"10.1145/3323679.3326521","DOIUrl":"https://doi.org/10.1145/3323679.3326521","url":null,"abstract":"Network slicing will allow 5G network operators to offer a diverse set of services over a shared physical infrastructure. We focus on supporting the operation of the Radio Access Network (RAN) slice broker, which maps slice requirements into allocation of Physical Resource Blocks (PRBs). We first develop a new metric, REVA, based on the number of PRBs available to a single Very Active bearer. REVA is independent of channel conditions and allows easy derivation of an individual wireless link's throughput. In order for the slice broker to efficiently utilize the RAN, there is a need for reliable and short term prediction of resource usage by a slice. To support such prediction, we construct an LTE testbed and develop custom additions to the scheduler. Using data collected from the testbed, we compute REVA and develop a realistic time series prediction model for REVA. Specifically, we present the X-LSTM prediction model, based upon Long Short-Term Memory (LSTM) neural networks. Evaluated with data collected in the testbed, X-LSTM outperforms Autoregressive Integrated Moving Average Model (ARIMA) and LSTM neural networks by up to 31%. X-LSTM also achieves over 91% accuracy in predicting REVA. By using X-LSTM to predict future usage, a slice broker is more adept to provision a slice and reduce over-provisioning and SLA violation costs by more than 10% in comparison to LSTM and ARIMA.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126891742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 42

Robot Navigation in Radio Beam Space: Leveraging Robotic Intelligence for Seamless mmWave Network Coverage 无线电波束空间中的机器人导航:利用机器人智能实现无缝毫米波网络覆盖

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326514

Anfu Zhou, Shaoqing Xu, Song Wang, Jingqi Huang, Shaoyuan Yang, Teng Wei, Xinyu Zhang, Huadong Ma

{"title":"Robot Navigation in Radio Beam Space: Leveraging Robotic Intelligence for Seamless mmWave Network Coverage","authors":"Anfu Zhou, Shaoqing Xu, Song Wang, Jingqi Huang, Shaoyuan Yang, Teng Wei, Xinyu Zhang, Huadong Ma","doi":"10.1145/3323679.3326514","DOIUrl":"https://doi.org/10.1145/3323679.3326514","url":null,"abstract":"The emerging millimeter-wave (mmWave) networking technology promises to unleash a new wave of multi-Gbps wireless applications. However, due to high directionality of the mmWave radios, maintaining stable link connection remains an open problem. Users' slight orientation change, coupled with motion and blockage, can easily disconnect the link. In this paper, we propose miDroid, a robotic mmWave relay that optimizes network coverage through wireless sensing and autonomous motion/rotation planning. The robot relay automatically constructs the geometry/reflectivity of the environment, by estimating the geometries of all signal paths. It then navigates itself along an optimal moving trajectory, and ensures continuous connectivity for the client despite environment/human dynamics. We have prototyped miDroid on a programmable robot carrying a commodity 60 GHz radio. Our field trials demonstrate that miDroid can achieve nearly full coverage in dynamic environment, even with constrained speed and mobility region.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128520838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Scaling Deep Learning Models for Spectrum Anomaly Detection 光谱异常检测的扩展深度学习模型

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326527

Zhijing Li, Zhujun Xiao, Bolun Wang, Ben Y. Zhao, Haitao Zheng

{"title":"Scaling Deep Learning Models for Spectrum Anomaly Detection","authors":"Zhijing Li, Zhujun Xiao, Bolun Wang, Ben Y. Zhao, Haitao Zheng","doi":"10.1145/3323679.3326527","DOIUrl":"https://doi.org/10.1145/3323679.3326527","url":null,"abstract":"Spectrum management in cellular networks is a challenging task that will only increase in difficulty as complexity grows in hardware, configurations, and new access technology (e.g. LTE for IoT devices). Wireless providers need robust and flexible tools to monitor and detect faults and misbehavior in physical spectrum usage, and to deploy them at scale. In this paper, we explore the design of such a system by building deep neural network (DNN) models1 to capture spectrum usage patterns and use them as baselines to detect spectrum usage anomalies resulting from faults and misuse. Using detailed LTE spectrum measurements, we show that the key challenge facing this design is model scalability, i.e. how to train and deploy DNN models at a large number of static and mobile observers located throughout the network. We address this challenge by building context-agnostic models for spectrum usage and applying transfer learning to minimize training time and dataset constraints. The end result is a practical DNN model that can be easily deployed on both mobile and static observers, enabling timely detection of spectrum anomalies across LTE networks.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 22

ERSCC ERSCC

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326526

Ouyang Zhang, Zhenzhi Qian, Yifan Mao, K. Srinivasan, N. Shroff

引用次数: 3

DECO 德科

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326509

Khashayar Kamran, E. Yeh, Qian Ma

引用次数: 0

APP: Augmented Proactive Perception for Driving Hazards with Sparse GPS Trace 应用程序:基于稀疏GPS轨迹的驾驶危险增强主动感知

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326500

Siqian Yang, Cheng Wang, Hongzi Zhu, Changjun Jiang

引用次数: 5

Cost-Efficient Scheme for RF-Powered Sensor Networks by Mixing Mobile Charging and Static Charging 混合移动充电和静态充电的射频传感器网络成本效益方案

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326612

Yinan Zhu

引用次数: 0

DeMiLTE

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326501

S. K. Saha, C. Vlachou, Dimitrios Koutsonikolas, Kyu-Han Kim

引用次数: 4

How Bad is Selfish Caching? 自私缓存有多糟糕?

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-07-02 DOI: 10.1145/3323679.3326499

Qian Ma, E. Yeh, Jianwei Huang

{"title":"How Bad is Selfish Caching?","authors":"Qian Ma, E. Yeh, Jianwei Huang","doi":"10.1145/3323679.3326499","DOIUrl":"https://doi.org/10.1145/3323679.3326499","url":null,"abstract":"Caching networks can reduce the routing costs of accessing contents by caching contents closer to users. However, cache nodes may belong to different entities and behave selfishly to maximize their own benefits, which often lead to performance degradation for the overall network. In this paper, we model the selfish behaviors of cache nodes as selfish caching games on arbitrary directed graphs with heterogeneous content popularity. We study the existence of a pure strategy Nash equilibrium (PSNE) in selfish caching games, and analyze its efficiency in terms of social welfare. We show that a PSNE does not always exist in arbitrary-topology caching networks. However, if the network does not have a mixed request loop, i.e., a directed loop in which each edge is traversed by at least one content request, we show that a PSNE always exists and can be found in polynomial time. We then show that the efficiency of Nash equilibria, captured by the price of anarchy (PoA), can be arbitrarily poor if we allow arbitrary content request patterns. However, when cache nodes have homogeneous request patterns, we show that the PoA is bounded even allowing arbitrary topologies. We further analyze the selfish caching games for cache nodes with limited computational capabilities, and show that an approximate PSNE exists with bounded PoA in certain cases of interest.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Information Source Detection with Limited Time Knowledge 有限时间知识下的信息源检测

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2019-05-30 DOI: 10.1145/3323679.3326626

Xuecheng Liu, Luoyi Fu, Bo Jiang, Xiaojun Lin, Xinbing Wang

{"title":"Information Source Detection with Limited Time Knowledge","authors":"Xuecheng Liu, Luoyi Fu, Bo Jiang, Xiaojun Lin, Xinbing Wang","doi":"10.1145/3323679.3326626","DOIUrl":"https://doi.org/10.1145/3323679.3326626","url":null,"abstract":"We study the source detection problem using limited timestamps on a given network. Due to the NP-completeness of the maximum likelihood estimator (MLE), we propose an approximation solution called infection-path-based estimator (INF), the essence of which is to identify the most likely infection path that is consistent with observed timestamps. The source node associated with that infection path is viewed as the estimated source û. For the tree network, we transform the INF into integer linear programming and find a reduced search region using BFS, within which the estimated source is provably always on a path termed as candidate path. This notion enables us to analyze the accuracy of the INF in terms of error distance on arbitrary tree. Specifically, on the infinite g-regular tree with uniform sampled timestamps, we get a refined performance guarantee in the sense of a constant bounded d(u*, û). By virtue of time labeled BFS tree, the estimator still performs fairly well when extended to more general graphs. Simulations on both trees and general networks further demonstrate the superior performance of the INF.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127425511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2