Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing最新文献_第3页

LLOCUS

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409142

Shamik Sarkar, Aniqua Z. Baset, Harsimran Singh, Phillip Smith, Neal Patwari, S. Kasera, K. Derr, Samuel Ramirez

引用次数: 5

Performance analysis of indoor localization based on channel state information ranging model 基于信道状态信息测距模型的室内定位性能分析

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409150

Linqing Gui, Fu Xiao, Yang Zhou, F. Shu, Shui Yu

{"title":"Performance analysis of indoor localization based on channel state information ranging model","authors":"Linqing Gui, Fu Xiao, Yang Zhou, F. Shu, Shui Yu","doi":"10.1145/3397166.3409150","DOIUrl":"https://doi.org/10.1145/3397166.3409150","url":null,"abstract":"Due to robustness against multi-path effect, channel state information (CSI) of Orthogonal Frequency Division Multiplexing (OFDM) systems is supposed to provide accurate distance measurement for indoor localization. However, we find that the original CSI ranging model is biased, so the model cannot be used to directly derive Cramer-Rao lower bound (CRLB) of positioning error for CSI-ranging based localization scheme. In this paper we first analyze the estimation bias of the original CSI ranging model according to indoor wireless channel model. Then we propose a negative power summation ranging model which can be used as an unbiased ranging model for both Line-Of-Sight (LOS) and Non-LOS scenarios. Subsequently, based on the proposed model, we derive both the CRLB of ranging error and the CRLB of positioning error for CSI-ranging localization scheme. Through simulation we validate the bias of the original ranging model and the approximately zero bias of our proposed ranging model. Through comprehensive experiments in different indoor scenarios, localization errors by different ranging models are compared to the CRLB, meanwhile our proposed ranging model is demonstrated to have better ranging and localization accuracy than the original ranging model.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883569","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

Emulating round-robin for serving dynamic flows over wireless fading channels 模拟在无线衰落信道上服务动态流的轮循

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409131

Bin Li, A. Eryilmaz, R. Srikant

{"title":"Emulating round-robin for serving dynamic flows over wireless fading channels","authors":"Bin Li, A. Eryilmaz, R. Srikant","doi":"10.1145/3397166.3409131","DOIUrl":"https://doi.org/10.1145/3397166.3409131","url":null,"abstract":"Motivated by the Internet of Things (IoT) and Cyber-Physical Systems (CPS), we consider dynamic wireless fading networks, where each incoming flow has a random service demand and leaves the system once its service request is completed. In such networks, one of the primary goals of network algorithm design is to achieve short-term fairness that characterizes how often each flow is served, in addition to the more traditional goals such as throughput-optimality and delay-insensitivity to the flow size distribution. In wireline networks, all of these desired properties can be achieved by the round-robin scheduling algorithm. In the context of wireless networks, a natural extension of round-robin scheduling has been developed in the last few years through the use of a counter called the Time-Since-Last-Service (TSLS) that keeps track of the time that passed since the last service time of each flow. However, the performance of this round-robin-like algorithm has been primarily studied in the context of persistent flows that continuously inject packets into the network and do not ever leave the network. The analysis of dynamic flow arrivals and departures is challenging since each individual flow experiences independent wireless fading and thus, flows cannot be served in a strict round-robin manner. In this paper, we overcome this difficulty by exploring the intricate dynamics of TSLS-based algorithm and show that flows are provided round-robin-like service with a very high probability. Consequently, we then show that our algorithm can achieve throughput-optimality. Moreover, through simulations, we demonstrate that the proposed TSLS-based algorithm also exhibits desired properties such as delay-insensitivity and excellent short-term fairness performance in the presence of dynamic flows over wireless fading channels.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290691","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}

引用次数: 1

Fair multi-resource allocation in mobile edge computing with multiple access points 移动边缘计算中多接入点的公平多资源分配

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409144

Erfan Meskar, B. Liang

{"title":"Fair multi-resource allocation in mobile edge computing with multiple access points","authors":"Erfan Meskar, B. Liang","doi":"10.1145/3397166.3409144","DOIUrl":"https://doi.org/10.1145/3397166.3409144","url":null,"abstract":"We consider the problem of fair multi-resource allocation for mobile edge computing (MEC) with multiple access points. In MEC, user tasks are uploaded over wireless communication channels to the access points, where they are then processed with multiple types of computing resources. What distinguishes fair multi-resource allocation in the MEC environment from more general cloud computing is that a user may experience different levels of wireless channel quality on different access points, so that the user's channel bandwidth demand is not fixed. Existing resource allocation studies for cloud computing generally consider Pareto Optimality (PO), Envy-Freeness (EF), Sharing Incentive (SI), and Strategy-Proofness (SP) as the most desirable fairness properties. In this work, we show these properties are no longer compatible in MEC, since there exists no resource allocation rule that can satisfy PO+EF+SP or PO+SI+SP. Hence, we propose a resource allocation rule, called Maximum Task Product (MTP), that retains PO, EF, and SI. Extensive simulation driven by Google cluster traces further shows that MTP improves resource utilization while achieving these fairness properties.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122121802","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}

引用次数: 7

TCCI

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409138

Adnan Quadri, Hossein Pirayesh, Pedram Kheirkhah Sangdeh, Huacheng Zeng

{"title":"TCCI","authors":"Adnan Quadri, Hossein Pirayesh, Pedram Kheirkhah Sangdeh, Huacheng Zeng","doi":"10.1145/3397166.3409138","DOIUrl":"https://doi.org/10.1145/3397166.3409138","url":null,"abstract":"Co-channel interference is a fundamental issue in wireless local area networks (WLANs). Although many results have been developed to handle co-channel interference for concurrent transmission, most of them require network-wide fine-grained synchronization and data sharing among access points (APs). Such luxuries, however, are not affordable in many WLANs due to their hardware limitation and data privacy concern. In this paper, we present TCCI, a co-channel interference management scheme to enable concurrent transmission in WLANs. TCCI requires neither network-wide fine-grained synchronization nor inter-network data sharing, and therefore is amenable to real-world implementation. The enabler of TCCI is a new detection and beamforming method for an AP, which is capable of taming unknown interference by leveraging its multiple antennas. We have built a prototype of TCCI on a wireless testbed and demonstrated its compatibility with commercial Atheros 802.11 devices. Our experimental results show that TCCI allows co-located APs to serve their users simultaneously and achieves up to 113% throughput gain compared to existing interference-avoidance protocol.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123001612","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}

引用次数: 0

MVStylizer MVStylizer

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409140

Ang Li, Chunpeng Wu, Yiran Chen, Bin Ni

{"title":"MVStylizer","authors":"Ang Li, Chunpeng Wu, Yiran Chen, Bin Ni","doi":"10.1145/3397166.3409140","DOIUrl":"https://doi.org/10.1145/3397166.3409140","url":null,"abstract":"Recent research has made great progress in realizing neural style transfer of images, which denotes transforming an image to a desired style. Many users start to use their mobile phones to record their daily life, and then edit and share the captured images and videos with other users. However, directly applying existing style transfer approaches on videos, i.e., transferring the style of a video frame by frame, requires an extremely large amount of computation resources. It is still technically unaffordable to perform style transfer of videos on mobile phones. To address this challenge, we propose MVStylizer, an efficient edge-assisted photorealistic video style transfer system for mobile phones. Instead of performing stylization frame by frame, only key frames in the original video are processed by a pre-trained deep neural network (DNN) on edge servers, while the rest of stylized intermediate frames are generated by our designed optical-flow-based frame interpolation algorithm on mobile phones. A meta-smoothing module is also proposed to simultaneously upscale a stylized frame to arbitrary resolution and remove style transfer related distortions in these upscaled frames. In addition, for the sake of continuously enhancing the performance of the DNN model on the edge server, we adopt a federated learning scheme to keep retraining each DNN model on the edge server with collected data from mobile clients and syncing with a global DNN model on the cloud server. Such a scheme effectively leverages the diversity of collected data from various mobile clients and efficiently improves the system performance. Our experiments demonstrate that MVStylizer can generate stylized videos with an even better visual quality compared to the state-of-the-art method while achieving 75.5× speedup for 1920×1080 videos.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114994182","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

Online scheduling of heterogeneous distributed machine learning jobs 异构分布式机器学习作业的在线调度

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409128

Qin Zhang, Ruiting Zhou, Chuan Wu, Lei Jiao, Zongpeng Li

{"title":"Online scheduling of heterogeneous distributed machine learning jobs","authors":"Qin Zhang, Ruiting Zhou, Chuan Wu, Lei Jiao, Zongpeng Li","doi":"10.1145/3397166.3409128","DOIUrl":"https://doi.org/10.1145/3397166.3409128","url":null,"abstract":"Distributed machine learning (ML) has played a key role in today's proliferation of AI services. A typical model of distributed ML is to partition training datasets over multiple worker nodes to update model parameters in parallel, adopting a parameter server architecture. ML training jobs are typically resource elastic, completed using various time lengths with different resource configurations. A fundamental problem in a distributed ML cluster is how to explore the demand elasticity of ML jobs and schedule them with different resource configurations, such that the utilization of resources is maximized and average job completion time is minimized. To address it, we propose an online scheduling algorithm to decide the execution time window, the number and the type of concurrent workers and parameter servers for each job upon its arrival, with a goal of minimizing the weighted average completion time. Our online algorithm consists of (i) an online scheduling framework that groups unprocessed ML training jobs into a batch iteratively, and (ii) a batch scheduling algorithm that configures each ML job to maximize the total weight of scheduled jobs in the current iteration. Our online algorithm guarantees a good parameterized competitive ratio with polynomial time complexity. Extensive evaluations using real-world data demonstrate that it outperforms state-of-the-art schedulers in today's AI cloud systems.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116219142","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}

引用次数: 14

Towards compression-resistant privacy-preserving photo sharing on social networks 在社交网络上实现抗压缩保护隐私的照片分享

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409141

Zhibo Wang, Hengchang Guo, Zhifei Zhang, Mengkai Song, Siyan Zheng, Qian Wang, Ben Niu

{"title":"Towards compression-resistant privacy-preserving photo sharing on social networks","authors":"Zhibo Wang, Hengchang Guo, Zhifei Zhang, Mengkai Song, Siyan Zheng, Qian Wang, Ben Niu","doi":"10.1145/3397166.3409141","DOIUrl":"https://doi.org/10.1145/3397166.3409141","url":null,"abstract":"The massive photos shared through the social networks nowadays, e.g., Facebook and Instagram, have aided malicious entities to snoop private information, especially by utilizing deep neural networks (DNNs) to learn from those personal photos. To protect photo privacy against DNNs, recent advances adopting adversarial examples could successfully fool DNNs. However, they are sensitive to those image compression methods that are commonly used on social networks to reduce transmission bandwidth or storage space. A recent work proposed to resist JPEG compression, while the compression methods adopted in social networks are black boxes, and variation of compression methods would significantly degrade the resistance. To the best of our knowledge, this paper gives the first attempt to investigate a generic compression-resistant scheme to protect photo privacy against DNNs in the social network scenario. We propose the Compression-Resistant Adversarial framework (ComReAdv) that can achieve adversarial examples robust to an unknown compression method. To this end, we design an encoding-decoding based compression approximation model (ComModel) to approximate the unknown compression method by learning the transformation from the original-compressed pairs of images queried through the social network. In addition, we involve the pre-trained differentiable ComModel into the optimization process of adversarial example generation and adapt existing attack algorithms to generate compression-resistant adversarial examples. Extensive experimental results on different social networks demonstrate the effectiveness and superior resistance of the proposed ComReAdv to unknown compression as compared to the state-of-the-art methods.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128262138","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}

引用次数: 8

PolymoRF PolymoRF

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409132

Francesco Restuccia, T. Melodia

引用次数: 11

Truthful mobile crowd sensing with interdependent valuations 具有相互依赖估值的真实移动人群感知

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409147

Meng Zhang, Brian Swenson, Jianwei Huang, H. V. Poor

{"title":"Truthful mobile crowd sensing with interdependent valuations","authors":"Meng Zhang, Brian Swenson, Jianwei Huang, H. V. Poor","doi":"10.1145/3397166.3409147","DOIUrl":"https://doi.org/10.1145/3397166.3409147","url":null,"abstract":"Mobile crowd sensing (MCS) has been used to enable a wide range of resource-discovery applications by exploiting the \"wisdom\" of many mobile users. However, in many applications, a user's valuation depends on other users' sensory data, which introduces the problem of interdependent valuations. This feature can encourage sensory data misreport, hence makes economic mechanisms challenging. While some work has been done to address this problem, the issues of private utility information and communication overheads remain unsolved. In this study, we formulate the first interdependent-valuation model for the resource-discovery MCS systems, aiming to elicit truthful sensory reports and utility information and to maximize expected social welfare. We design a Truthful Sense-And-Bid (T-SAB) Mechanism based on surrogate functions, which can reveal marginal utility information by only requiring each user to submit one-dimensional signaling per resource. We show that the surrogate function and a reward function can limit users' willingness to misreport, when users have small informational sizes, a reasonable condition in large-scale MCS systems. Consequently, our T-SAB Mechanism yields a Perfect Bayesian Equilibrium (PBE) with the efficient allocation outcome, approximate truthfulness, individual rationality, and approximate budget balance. To illustrate the effectiveness of the T-SAB Mechanism, we perform a case study of a cognitive radio network. We demonstrate that the social welfare gain of the T-SAB Mechanism can achieve up to 20% social welfare gain comparing with a benchmark.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121613681","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