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

{"title":"Side-information-aided Noncoherent Beam Alignment Design for Millimeter Wave Systems","authors":"Yi Zhang, Kartik Patel, S. Shakkottai, R. Heath","doi":"10.1145/3323679.3326532","DOIUrl":"https://doi.org/10.1145/3323679.3326532","url":null,"abstract":"Designing efficient and robust beam alignment strategies for millimeter wave (mmWave) systems is important for overcoming training overheads and practical hardware impairments. In this work, we leverage side information in the form of prior knowledge of the angular support of the propagation channel (direction information) to design a compressive sensing (CS) based beam alignment algorithm. Existing CS based channel estimation approaches assume perfect phase information of the measurements, which is not the case with the low-cost off-the-shelf mmWave phased arrays. Instead, we develop a two-stage algorithm where we use the magnitude of measurements (aka non-coherent measurements); using phase retrieval (PR) followed by sparse recovery, we estimate the channel gain across various (quantized) spatial angles. To validate the proposed algorithm, we develop a fully reconfigurable mmWave testbed with custom-made 2-bit phased arrays. We perform a careful calibration to the phased arrays, thus enabling generations of precise desired beam patterns. Our implementation and real experiments validate both the proposed algorithm and calibration process by demonstrating consistency between the experimental results and the theoretical analysis.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"179 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":"122593452","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}

{"title":"Cooperative Analytics for the Internet of Things","authors":"Apostolos Galanopoulos, G. Iosifidis, T. Salonidis","doi":"10.1145/3323679.3326631","DOIUrl":"https://doi.org/10.1145/3323679.3326631","url":null,"abstract":"We study the problem of cooperative execution of IoT data analytics at the edge nodes. We propose an auction mechanism that allows the nodes to trade their tasks in a way that optimizes execution accuracy and delay, without requiring information about the nodes' accuracy/delay priorities, and yields the optimal task outsourcing policy. Testbed-driven evaluation shows gains in both accuracy and delay compared to heuristic/greedy policies.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"18 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":"120956877","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}

{"title":"DeepFusion: A Deep Learning Framework for the Fusion of Heterogeneous Sensory Data","authors":"Hongfei Xue, Wenjun Jiang, Chenglin Miao, Ye Yuan, Fenglong Ma, Xin Ma, Yijiang Wang, Shuochao Yao, Wenyao Xu, Aidong Zhang, Lu Su","doi":"10.1145/3323679.3326513","DOIUrl":"https://doi.org/10.1145/3323679.3326513","url":null,"abstract":"In recent years, significant research efforts have been spent towards building intelligent and user-friendly IoT systems to enable a new generation of applications capable of performing complex sensing and recognition tasks. In many of such applications, there are usually multiple different sensors monitoring the same object. Each of these sensors can be regarded as an information source and provides us a unique \"view\" of the observed object. Intuitively, if we can combine the complementary information carried by multiple sensors, we will be able to improve the sensing performance. Towards this end, we propose DeepFusion, a unified multi-sensor deep learning framework, to learn informative representations of heterogeneous sensory data. DeepFusion can combine different sensors' information weighted by the quality of their data and incorporate cross-sensor correlations, and thus can benefit a wide spectrum of IoT applications. To evaluate the proposed DeepFusion model, we set up two real-world human activity recognition testbeds using commercialized wearable and wireless sensing devices. Experiment results show that DeepFusion can outperform the state-of-the-art human activity recognition methods.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"27 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":"133874775","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}

{"title":"MWSR over an Uplink Gaussian Channel with Box Constraints: A Polymatroidal Approach","authors":"P. Wan, Zhu Wang, Huaqiang Yuan, Jiliang Wang, Jinling Zhang","doi":"10.1145/3323679.3326519","DOIUrl":"https://doi.org/10.1145/3323679.3326519","url":null,"abstract":"The rate capacity region of an uplink Gaussian channel is a generalized symmetric polymatroid. Practical applications impose additional lower and upper bounds on the rate allocations, which are represented by box constraints. A fundamental scheduling problem over an uplink Gaussian channel is to seek a rate allocation maximizing the weighted sum-rate (MWSR) subject to the box constraints. The best-known algorithm for this problem has time complexity O (n5 lnO(1) n). In this paper, we take a polymatroidal approach to developing a quadratic-time greedy algorithm and a linearithmic-time divide-and-conquer algorithm. A key ingredient of these two algorithms is a linear-time algorithm for minimizing the difference between a generalized symmetric rank function and a modular function after a linearithmic-time ordering.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"6 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":"127739432","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}

{"title":"Barracuda: The Power of ℓ-polling in Proof-of-Stake Blockchains","authors":"G. Fanti, Jiantao Jiao, Ashok Vardhan Makkuva, Sewoong Oh, Ranvir Rana, P. Viswanath","doi":"10.1145/3323679.3326533","DOIUrl":"https://doi.org/10.1145/3323679.3326533","url":null,"abstract":"A blockchain is a database of sequential events that is maintained by a distributed group of nodes. A key consensus problem in blockchains is that of determining the next block (data element) in the sequence. Many blockchains address this by electing a new node to propose each new block. The new block is (typically) appended to the tip of the proposer's local blockchain, and subsequently broadcast to the rest of the network. Without network delay (or adversarial behavior), this procedure would give a perfect chain, since each proposer would have the same view of the blockchain. A major challenge in practice is forking. Due to network delays, a proposer may not yet have the most recent block, and may therefore create a side chain that branches from the middle of the main chain. Forking reduces throughput, since only one a single main chain can survive, and all other blocks are discarded. We propose a new P2P protocol for blockchains called Barracuda, in which each proposer, prior to proposing a block, polls ℓ other nodes for their local blocktree information. Under a stochastic network model, we prove that this lightweight primitive improves throughput as if the entire network were a factor of ℓ faster. We provide guidelines on how to implement Barracuda in practice, guaranteeing robustness against several real-world factors.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"35 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":"125724673","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}

{"title":"Infrastructure and service provider games in crowdsourced networks","authors":"M. Karaliopoulos, I. Koutsopoulos","doi":"10.1145/3323679.3326629","DOIUrl":"https://doi.org/10.1145/3323679.3326629","url":null,"abstract":"Our paper analyzes the role that crowdsourced community network (CN) infrastructures could undertake in coping with the financing needs of ambitious broadband connectivity visions. Key to this role are open business models fostering synergies of CNs with commercial Internet Service Providers (SPs). In such synergies, the SPs make their pricing policies commensurate with the investment of the community in order to fuel the CN growth and generate a market for their services. At the same time, they compete with each other for customer shares in this market. We formulate the leader-follower game that emerges out of the strategic interactions of the actors and compute numerically its equilibrium states under a broad range of scenarios drawing on real data. In all cases, our results point to mutual profits for all actors, rendering such synergies win-win strategies.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"405 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":"131896995","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}

{"title":"Tile-based Caching Optimization for 360° Videos","authors":"Georgios Papaioannou, I. Koutsopoulos","doi":"10.1145/3323679.3326515","DOIUrl":"https://doi.org/10.1145/3323679.3326515","url":null,"abstract":"Panoramic, or 360° video streaming and playback are prime components of mixed-reality and panoramic movie-viewing experiences, they offer an immersive viewing experience, and they are becoming increasingly popular, albeit very resource-demanding. Caching of 360° video content at caches close to the user reduces content delivery delay and bandwidth consumption. In 360° video streaming, the recently proposed tiling approach allows the streaming of different parts (tiles) of the 360° content at different resolutions as opposed to monolithic single-stream transmission. We study the problem of optimal caching of 360° video streams. The difference from conventional video is that each tile may need to be cached simultaneously at multiple resolutions, since it may appear in different positions at different viewports, and the time proportions of these positions are dictated by users' viewing statistics. For example, a tile close to the center of a viewport must have high resolution, while the same tile close to the edge of another viewport can have low resolution. This leads us to a novel caching objective. Cached resolutions for each tile should be as close as possible to the required ones for each tile, according to tile viewing statistics. We study the cases of caching tile streams at different resolutions or in a layered encoding fashion. We seek to optimize an objective that combines (i) an error metric between requested and cached tile resolutions across viewports, and (ii) coverage of the tile set. For the case of multiple resolutions, we show that the problem of selecting the tile resolutions to cache so as to minimize the error metric above is equivalent to the K-Medoids problem. For layered encoding, the problem is to find the maximum-resolution layer to cache for each tile stream, and this is equivalent to a Multiple-Choice Knapsack problem. We present an implementation of the cache optimization scheme, we evaluate our model on a tiled 360° video distribution simulator and demonstrate a significant increase in cache hit ratio over conventional caching strategies.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"88 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":"134569089","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}

{"title":"Provisioning and automated scaling of network slices for virtual Content Delivery Networks in 5G infrastructures","authors":"G. Landi, P. Giardina, M. Capitani, K. Kondepu, L. Valcarenghi, G. Avino","doi":"10.1145/3323679.3326613","DOIUrl":"https://doi.org/10.1145/3323679.3326613","url":null,"abstract":"The concept of network slicing in 5G infrastructures allows to deliver multiple virtual services over shared environments and fully customized based on vertical-driven requirements and target performance indicators. A key feature of 5G networks is the capability to dynamically re-optimize the allocation of computing and network resources, from the core up to the edge, to instantiate and manage different types of concurrent services over a shared infrastructure. In this demonstration, we present a network slicing and orchestration solution for vertical services in the media sector, where enhanced Mobile Broadband (eMBB) network slices are instantiated interconnecting physical and virtual functions, provisioned and configured on-demand using the concept of NFV Network Services. The eMBB slices are automatically dimensioned to match the requirements of the virtual Content Delivery Network (vCDN) service, e.g. in terms of number of target users, video quality and geographical coverage area. Arbitration and resource allocation schemas optimize the sharing of mobile communication services and virtual resources among concurrent media service instances, in compliance with the Service Level Agreement between network operators and vertical service providers.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"48 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":"131247232","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}

{"title":"DIRECT: Distributed Cross-Domain Resource Orchestration in Cellular Edge Computing","authors":"Qiang Liu, T. Han","doi":"10.1145/3323679.3326516","DOIUrl":"https://doi.org/10.1145/3323679.3326516","url":null,"abstract":"Network slicing and edge computing are key technologies to enable compute-intensive applications for vertical industries in 5G. We define cellular networks with edge computing capabilities as cellular edge computing. In this paper, we study the cross-domain resource orchestration solution for dynamic network slicing in cellular edge computing. The fundamental research challenge is from the difficulty in modeling the relationship between the slice performance and resources from multiple technical domains across the network with many base stations and distributed edge servers. To address this challenge, we develop a distributed cross-domain resource orchestration (DIRECT) protocol which optimizes the cross-domain resource orchestration while providing the performance and functional isolations among network slices. The main component of DIRECT is a distributed cross-domain resource orchestration algorithm which is designed by integrating the ADMM method and a new learning-assisted optimization approach. The proposed resource orchestration algorithm efficiently orchestrates multi-domain resources without requiring the performance model of the network slices. We develop and implement the DIRECT protocol in a small-scale prototype of cellular edge computing which is designed based on OpenAirInterface LTE and CUDA GPU computing platforms. The performance of DIRECT is validated through both experiments and network simulations.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"71 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":"132725473","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}

{"title":"Optimal Network Control with Adversarial Uncontrollable Nodes","authors":"Qingkai Liang","doi":"10.1145/3323679.3326508","DOIUrl":"https://doi.org/10.1145/3323679.3326508","url":null,"abstract":"The effectiveness of many well-known network control algorithms (e.g., MaxWeight) relies on the premise that all of the nodes are fully controllable. However, these algorithms may yield poor performance in a partially-controllable network where a subset of nodes are uncontrollable and may take arbitrary (possibly adversarial) actions. Such a partially-controllable model is of increasing importance in real-world networked systems such as overlay-underlay networks and uncooperative wireless networks. In this paper, we study two fundamental network optimization problems in a network with adversarial uncontrollable nodes. First, we investigate the network stability problem where the objective is to stabilize the network whenever possible. We develop a lower bound on the total queue length that can be achieved by any causal policy, and propose a throughput-optimal algorithm, called Tracking-MaxWeight (TMW), which enhances the original MaxWeight algorithm with an explicit learning of the behavior of uncontrollable nodes. Second, we study the network utility maximization problem where the objective is to maximize cumulative utility subject to stability constraints. We provide a lower bound on the utility-delay tradeoff, and develop the Tracking Drift-plus-Penalty (TDP) algorithm that achieves tunable utility-delay tradeoffs.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"2 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":"128052111","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}