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

Fully-digital beamforming demonstration with Pi-Radio mmWave SDR platform 使用Pi-Radio毫米波SDR平台的全数字波束形成演示

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

Aditya Dhananjay, Kai Zheng, M. Mezzavilla, D. Shasha, S. Rangan

引用次数: 2

How to deal with data hungry V2X applications? 如何处理数据饥渴的V2X应用程序?

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

A. Bazzi, C. Campolo, B. Masini, A. Molinaro

引用次数: 2

Predictive caching at the wireless edge using near-zero caches 在无线边缘使用接近零的缓存进行预测缓存

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

Sherif ElAzzouni, Fei Wu, N. Shroff, E. Ekici

引用次数: 5

Optimizing ad allocation in mobile advertising 优化移动广告的广告分配

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

Shaojie Tang, Jing Yuan, V. Mookerjee

{"title":"Optimizing ad allocation in mobile advertising","authors":"Shaojie Tang, Jing Yuan, V. Mookerjee","doi":"10.1145/3397166.3409139","DOIUrl":"https://doi.org/10.1145/3397166.3409139","url":null,"abstract":"As Internet advertisements (also called \"ads\") revenue growth is being driven further than ever before, one challenge facing publishers, such as Google and Amazon, is to quickly select and place a group of ads in an ad space for each online user with the objective of maximizing the expected revenue. This is especially challenging in the context of mobile advertising due to the smaller screen size of mobile devices and longer user session. We notice that most existing models do not allow the publisher to place the same ad in multiple positions. However, it has been reported that people must see an advertisement at least several times before they will acquire enough interest to consider buying the product or service advertised. To capture this repetition effect we largely generalize the previous model by allowing the publisher to repeat the same ads multiple times. We also notice that many existing models assume that a user will leave the ad session permanently after clicking an ad. Our framework allows a more realistic but complicated user behavior by allowing a user to return to the previous ad session. Our model is able to capture many factors that may affect the click probability of an ad such as the intrinsic quality of the ad, the position of the ad, and all ads that have been previously displayed. We also extend our work to adaptive setting where publishers can dynamically adjust their ad display according to user's feedback. We develop effective algorithms with guarantees of finding either optimal or approximate solutions.","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":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114723781","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}

引用次数: 3

Approximation algorithms for data-intensive service chain embedding 数据密集型服务链嵌入的近似算法

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

Konstantinos Poularakis, J. Llorca, A. Tulino, L. Tassiulas

{"title":"Approximation algorithms for data-intensive service chain embedding","authors":"Konstantinos Poularakis, J. Llorca, A. Tulino, L. Tassiulas","doi":"10.1145/3397166.3409149","DOIUrl":"https://doi.org/10.1145/3397166.3409149","url":null,"abstract":"Recent advances in network virtualization and programmability enable innovative service models such as Service Chaining (SC), where flows can be steered through a pre-defined sequence of service functions deployed at different cloud locations. A key aspect dictating the performance and efficiency of a SC is its instantiation onto the physical infrastructure. While existing SC Embedding (SCE) algorithms can effectively address the instantiation of SCs consuming computation and communication resources, they lack efficient mechanisms to handle the increasing data-intensive nature of next-generation services. Differently from computation and communication resources, which are allocated in a dedicated per request manner, storage resources can be shared to satisfy multiple requests for the same data. To fill this gap, in this paper, we formulate the data-intensive SCE problem with the goal of minimizing storage, computation, and communication resource costs subject to resource capacity, service chaining, and data sharing constraints. Using a randomized rounding technique that exploits a novel data-aware linear programming decomposition procedure, we develop a multi-criteria approximation algorithm with provable performance guarantees. Evaluation results show that the proposed algorithm achieves near-optimal resource costs with up to 27.8% of the cost savings owed to the sharing of the data.","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":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082190","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}

引用次数: 11

Robust resource provisioning in time-varying edge 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-11 DOI: 10.1145/3397166.3409146

Ruozhou Yu, G. Xue, Yinxin Wan, Jian Tang, Dejun Yang, Yusheng Ji

{"title":"Robust resource provisioning in time-varying edge networks","authors":"Ruozhou Yu, G. Xue, Yinxin Wan, Jian Tang, Dejun Yang, Yusheng Ji","doi":"10.1145/3397166.3409146","DOIUrl":"https://doi.org/10.1145/3397166.3409146","url":null,"abstract":"Edge computing is one of the revolutionary technologies that enable high-performance and low-latency modern applications, such as smart cities, connected vehicles, etc. Yet its adoption has been limited by factors including high cost of edge resources, heterogeneous and fluctuating demands, and lack of reliability. In this paper, we study resource provisioning in edge computing, taking into account these different factors. First, based on observations from real demand traces, we propose a time-varying stochastic model to capture the time-dependent and uncertain demand and network dynamics in an edge network. We then apply a novel robustness model that accounts for both expected and worst-case performance of a service. Based on these models, we formulate edge provisioning as a multi-stage stochastic optimization problem. The problem is NP-hard even in the deterministic case. Leveraging the multi-stage structure, we apply nested Benders decomposition to solve the problem. We also describe several efficiency enhancement techniques, including a novel technique for quickly solving the large number of decomposed subproblems. Finally, we present results from real dataset-based simulations, which demonstrate the advantages of the proposed models, algorithm and techniques.","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":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131122715","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}

引用次数: 3

A game-theoretic approach to storage offloading in PoC-based mobile blockchain mining 基于poc的移动区块链挖掘中存储卸载的博弈论方法

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

Suhan Jiang, Jie Wu

{"title":"A game-theoretic approach to storage offloading in PoC-based mobile blockchain mining","authors":"Suhan Jiang, Jie Wu","doi":"10.1145/3397166.3409136","DOIUrl":"https://doi.org/10.1145/3397166.3409136","url":null,"abstract":"Proof of Capacity (PoC) is an eco-friendly alternative to Proof of Work for consensus in blockchains since it determines mining rights based on miners' storage rather than computation. In PoC, for every block, a miner executes hashing on part of his dedicated storage. The miner that comes up with the smallest hash value among all miners will win the block. PoC has yet to be applied to mobile applications, due to the storage limitation of mobile devices. Storage offloading can be a viable solution that allows miners to offload mining all files to a cloud storage. In each mining round, a miner can decide whether to mine on his local device or by a cloud virtual machine (VM). Self-mining requires no extra cost but it incurs download delay, which will reduce the chance of winning. Cloud-mining experiences no delay but it brings cost on VMs. This delay-cost tradeoff challenges each miner to determine a ratio between self-mining and cloud-mining to maximize his utility. We model interactions among miners as a non-cooperative game and formulate a Nash equilibrium problem to investigate the effects of offloading on miners' utilities. We analyze the existence and uniqueness of equilibrium and propose a distributed algorithm to achieve the equilibrium in a uniform-delay setting. Further, we extend our results to non-uniform delays since miners may choose different network settings, e.g. 5G, 4G, or 3G. Both numerical evaluation and testbed experiments on Burstcoin are conducted to show the feasibility of storage offloading and to validate the proposed models and theoretical results.","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":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116590873","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}

引用次数: 3

Why queue up?: fast parallel search of RFID tags for multiple users 为什么要排队?:为多个用户快速并行搜索RFID标签

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

Shigeng Zhang, Xuan Liu, Song Guo, Albert Y. Zomaya, Jianxin Wang

{"title":"Why queue up?: fast parallel search of RFID tags for multiple users","authors":"Shigeng Zhang, Xuan Liu, Song Guo, Albert Y. Zomaya, Jianxin Wang","doi":"10.1145/3397166.3409143","DOIUrl":"https://doi.org/10.1145/3397166.3409143","url":null,"abstract":"Tag searching is a fundamental problem for a variety of radio frequency identification (RFID) applications. Prior works focus on single group searching, which refers to determining which ones in a given set of tags exist in the system. In this paper, we propose PTS, a protocol that can perform fast Parallel Tag Searching for multiple users simultaneously. Different from prior works that have to execute k times to search k groups separately, PTS obtains searching results for all the k groups with only one-shot execution. PTS achieves high parallelism due to some novel designs. First, we develop a grouping filter that encodes the membership of tags in different groups, with which non-target tags can be efficiently filtered out for all the k groups simultaneously. Second, we design two new codes, grouping code and mapping code, with which the remaining tags can quickly verify and confirm which group they belong to. We theoretically analyze how to set optimal parameters for PTS to minimize the execution time and conduct extensive simulation experiments to evaluate its performance. Compared with the state-of-the-art solutions, PTS significantly improves time efficiency in multiple group searching scenarios (by a factor of up to 7.54X when k = 10) and achieves the same time efficiency in single group searching scenarios.","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":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134145395","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}

引用次数: 6

Online control of random access with splitting 带分裂的随机访问在线控制

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

W. T. Toor, Jun-Bae Seo, Hu Jin

{"title":"Online control of random access with splitting","authors":"W. T. Toor, Jun-Bae Seo, Hu Jin","doi":"10.1145/3397166.3409148","DOIUrl":"https://doi.org/10.1145/3397166.3409148","url":null,"abstract":"For slotted random access systems, the slotted ALOHA protocol provides the maximum throughput of 0.368 (packets/slot) while in the category of splitting (or tree) algorithms, the maximum achievable throughput can reach up to 0.487 with the first-come first-serve (FCFS) algorithm. It has been so far demonstrated that the FCFS algorithm can achieve this maximum throughput only for Poisson traffic. This may limit its application in practical systems, where packet arrivals may not be Poissonian. In this paper, we propose a novel online transmission control framework that introduces random splitting upon collisions and controls the transmission probabilities optimally at each slot by estimating the number of active users in the system. The proposed algorithm is said to be online as it estimates the number of active users slot by slot recursively, and thus can adapt to network dynamics. We first show that the splitting algorithm of our interest can achieve the throughput of 0.532 if the number of users involved in a collision could be known, which serves as a guideline for the upper limit for the random access systems with splitting. Then, when the information on the number of collided users is not available, we show that the proposed algorithm can achieve the maximum throughput of 0.487 for Poisson arrivals while achieving shorter access delay than FCFS. When more bursty traffic than Poisson process is applied, the proposed algorithm shows much better throughput and delay performance than FCFS.","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":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132292093","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}

引用次数: 6

Portal: transparent cross-technology opportunistic forwarding for low-power wireless 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-11 DOI: 10.1145/3397166.3409134

Xiaolong Zheng, Dan Xia, Xiuzhen Guo, Liang Liu, Yuan He, Huadong Ma

{"title":"Portal: transparent cross-technology opportunistic forwarding for low-power wireless networks","authors":"Xiaolong Zheng, Dan Xia, Xiuzhen Guo, Liang Liu, Yuan He, Huadong Ma","doi":"10.1145/3397166.3409134","DOIUrl":"https://doi.org/10.1145/3397166.3409134","url":null,"abstract":"Opportunistic forwarding seizes early forwarding opportunities in duty-cycled networks to reduce delay and energy consumption. But increasingly serious Cross-Technology Interference (CTI) significantly counteracts the benefits of opportunistic forwarding. Existing solutions try to reserve the channel for low-power networks by implicit avoidance or explicit coordination but ignore the potential of high-power CTI's superior capability. In this paper, we propose a new paradigm for low-power opportunistic forwarding in CTI environments. Instead of keeping high-power CTI devices silent, we directly involve them into the forwarding, as cross-technology forwarders. We design Portal to solve the challenges of realizing cross-technology opportunistic forwarding. To be transparent to the low-power networks, Portal adopts cross-technology rebroadcasting to enable the fast overhearing and forwarding of cross-technology data. To maximize the performance gain of using heterogeneous forwarders while minimizing the influence on legacy high-power traffic, we propose a post-forwarding forwarder selection and a traffic scheduling method. We also propose a feature-based ACK recognition method and a jamming-based ACK replying mechanism to forward the unreliable ACKs from asymmetric regions. Extensive experiments demonstrate that Portal not only avoids the CTI but also breaks through the existing performance limit.","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":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132886269","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}

引用次数: 9