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

(Re)Configuring Bike Station Network via Crowdsourced Information Fusion and Joint Optimization (二)众包信息融合与联合优化配置自行车站网络

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209583

Suining He, K. Shin

{"title":"(Re)Configuring Bike Station Network via Crowdsourced Information Fusion and Joint Optimization","authors":"Suining He, K. Shin","doi":"10.1145/3209582.3209583","DOIUrl":"https://doi.org/10.1145/3209582.3209583","url":null,"abstract":"Thanks to their great success as a green urban transportation means of first/last-mile connectivity, bike sharing service (BSS) networks has been proliferating all over the globe. Their station (re)placement and dock resizing has thus become an increasingly important problem for bike sharing service providers. In contrast to the use of conventional labor-intensive user surveys, we propose a novel optimization framework called CBikes, (re)configuring the BSS network with crowdsourced station suggestions from online websites. Based on comprehensive real data analyses, we identify and utilize important global trip patterns to (re)configure the BSS network while balancing the local biases of individual feedbacks. Specifically, crowdsourced feedbacks, station usage history, cost and other constraints are fused into a joint optimization of BSS network configuration. We further design a semidefinite programming transformation to solve the bike station (re)placement problem efficiently and effectively. Our evaluation has demonstrated the effectiveness and accuracy of CBikes in (re)placing stations and resizing docks based on 3 large BSS systems (with more than 900 stations) in Chicago, Twin Cities, and Los Angeles, as well as related crowdsourced feedbacks.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115605998","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}

引用次数: 12

High Bandwidth and Low Delay over Wireless Multihop Networks 无线多跳网络的高带宽和低延迟

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3225200

C. Palazzi

引用次数: 1

Incentivizing Truthful Data Quality for Quality-Aware Mobile Data Crowdsourcing 激励具有质量意识的移动数据众包的真实数据质量

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209599

Xiaowen Gong, N. Shroff

{"title":"Incentivizing Truthful Data Quality for Quality-Aware Mobile Data Crowdsourcing","authors":"Xiaowen Gong, N. Shroff","doi":"10.1145/3209582.3209599","DOIUrl":"https://doi.org/10.1145/3209582.3209599","url":null,"abstract":"Mobile data crowdsourcing has found a broad range of applications (e.g., spectrum sensing, environmental monitoring) by leveraging the \"wisdom\" of a potentially large crowd of \"workers\" (i.e., mobile users). A key metric of crowdsourcing is data accuracy, which relies on the quality of the participating workers' data (e.g., the probability that the data is equal to the ground truth). However, the data quality of a worker can be its own private information (which the worker learns, e.g., based on its location) that it may have incentive to misreport, which can in turn mislead the crowdsourcing requester about the accuracy of the data. This issue is further complicated by the fact that the worker can also manipulate its effort made in the crowdsourcing task and the data reported to the requester, which can also mislead the requester. In this paper, we devise truthful crowdsourcing mechanisms for Quality, Effort, and Data Elicitation (QEDE), which incentivize strategic workers to truthfully report their private worker quality and data to the requester, and make truthful effort as desired by the requester. The truthful design of the QEDE mechanisms overcomes the lack of ground truth and the coupling in the joint elicitation of worker quality, effort, and data. Under the QEDE mechanisms, we characterize the socially optimal and the requester's optimal task assignments, and analyze their performance. We show that the requester's optimal assignment is determined by the largest \"virtual valuation\" rather than the highest quality among workers, which depends on the worker's quality and the quality's distribution. We evaluate the QEDE mechanisms using simulations which demonstrate the truthfulness of the mechanisms and the performance of the optimal task assignments.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"210 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114317531","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}

引用次数: 48

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World 朋友的朋友太社交了吗?:社交世界中位置隐私的局限性

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209611

B. Aronov, A. Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, V. Polishchuk, Boyang Wang, Hanyu Quan, J. Ding

{"title":"Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World","authors":"B. Aronov, A. Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, V. Polishchuk, Boyang Wang, Hanyu Quan, J. Ding","doi":"10.1145/3209582.3209611","DOIUrl":"https://doi.org/10.1145/3209582.3209611","url":null,"abstract":"With the ubiquitous adoption of smartphones and mobile devices, it is now common practice for one's location to be sensed, collected and likely shared through social platforms. While such data can be helpful for many applications, users start to be aware of the privacy issue in handling location and trajectory data. While some users may voluntarily share their location information (e.g., for receiving location-based services, or for crowdsourcing systems), their location information may lead to information leaks about the whereabouts of other users, through the co-location of events when two users are at the same location at the same time and other side information, such as upper bounds of movement speed. It is therefore crucial to understand how much information one can derive about other's positions through the co-location of events and occasional GPS location leaks of some of the users. In this paper we formulate the problem of inferring locations of mobile agents, present theoretically-proven bounds on the amount of information that could be leaked in this manner, study their geometric nature, and present algorithms matching these bounds. We will show that even if a very weak set of assumptions is made on trajectories' patterns, and users are not obliged to follow any 'reasonable' patterns, one could infer very accurate estimation of users' locations even if they opt not to share them. Furthermore, this information could be obtained using almost linear-time algorithms, suggesting the practicality of the method even for huge volumes of data.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"59 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133678414","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}

引用次数: 5

User Mobility Analysis in Disjoint-Clustered Cooperative Wireless Networks 非联合集群协作无线网络中的用户移动性分析

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3209604

Wei Bao, Yonghui Li, B. Vucetic

引用次数: 2

Comparing Routing Protocols over a 3D IoT 比较3D物联网上的路由协议

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-06-26 DOI: 10.1145/3209582.3225199

Armir Bujari, C. Palazzi, D. Ronzani

引用次数: 2

Wireless coverage prediction via parametric shortest paths 基于参数最短路径的无线覆盖预测

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-05-16 DOI: 10.1145/3209582.3209605

David Applegate, Aaron Archer, David S. Johnson, E. Nikolova, M. Thorup, Ger Yang

{"title":"Wireless coverage prediction via parametric shortest paths","authors":"David Applegate, Aaron Archer, David S. Johnson, E. Nikolova, M. Thorup, Ger Yang","doi":"10.1145/3209582.3209605","DOIUrl":"https://doi.org/10.1145/3209582.3209605","url":null,"abstract":"When deciding where to place access points in a wireless network, it is useful to model the signal propagation loss between a proposed antenna location and the areas it may cover. The indoor dominant path (IDP) model, introduced by Wölfle et al., is shown in the literature to have good validation and generalization error, is faster to compute than competing methods, and is used in commercial software such as WinProp, iBwave Design, and CellTrace. The previous algorithms known for computing it involved a worst-case exponential-time tree search, with pruning heuristics for speed. We prove that the IDP model can be reduced to a parametric shortest path computation on a graph derived from the walls in the floorplan. It therefore admits a quasipolynomial-time (i.e., nO(log n)) algorithm. Moreover, we give a practical approximation algorithm based on running a small constant number of shortest path computations. Its provable worst-case additive error (in dB) can be made arbitrarily small, and is well below 1dB for reasonable choices of parameters. We evaluate this algorithm empirically against the exact IDP model, showing that it consistently beats its theoretical worst-case bounds, solving the model exactly (i.e., no error) in the vast majority of cases.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698630","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

Loyalty Programs in the Sharing Economy: Optimality and Competition 共享经济中的忠诚计划:最优性与竞争

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-05-09 DOI: 10.1145/3209582.3209596

Zhixuan Fang, Longbo Huang, A. Wierman

引用次数: 24

Optimal Load-Balancing for High-Density Wireless Networks with Flow-Level Dynamics 基于流级动态的高密度无线网络最优负载均衡

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-05-01 DOI: 10.1145/3209582.3225205

Bin Li, Xiangqi Kong, Lei Wang

{"title":"Optimal Load-Balancing for High-Density Wireless Networks with Flow-Level Dynamics","authors":"Bin Li, Xiangqi Kong, Lei Wang","doi":"10.1145/3209582.3225205","DOIUrl":"https://doi.org/10.1145/3209582.3225205","url":null,"abstract":"We consider the load-balancing design for forwarding incoming flows to access points (APs) in high-density wireless networks with both channel fading and flow-level dynamics, where each incoming flow has a certain amount of service demand and leaves the system once its service request is complete. The efficient load-balancing design is strongly needed for supporting high-quality wireless connections in high-density areas. In this work, we propose a Joint Load-Balancing and Scheduling (JLBS) Algorithm that always forwards the incoming flows to the AP with the smallest workload in the presence of flow-level dynamics and each AP always serves the flow with the best channel quality. Our analysis reveals that our proposed JLBS Algorithm not only achieves maximum system throughput, but also minimizes the total system workload in the heavy-traffic regime. Moreover, we observe from both our theoretical and simulation results that the mean total workload performance under the proposed JLBS Algorithm does not degrade as the number of APs increases, which is strongly desirable in high-density wireless networks.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124044582","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}

引用次数: 5

Learning Data Dependency with Communication Cost 基于通信成本的数据依赖学习

Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2018-04-29 DOI: 10.1145/3209582.3209600

Hyeryung Jang, Hyungseok Song, Yung Yi

{"title":"Learning Data Dependency with Communication Cost","authors":"Hyeryung Jang, Hyungseok Song, Yung Yi","doi":"10.1145/3209582.3209600","DOIUrl":"https://doi.org/10.1145/3209582.3209600","url":null,"abstract":"In this paper, we consider the problem of recovering a graph that represents the statistical data dependency among nodes for a set of data samples generated by nodes, which provides the basic structure to perform an inference task, such as MAP (maximum a posteriori). This problem is referred to as structure learning. When nodes are spatially separated in different locations, running an inference algorithm requires a non-negligible amount of message passing, incurring some communication cost. We inevitably have the trade-off between the accuracy of structure learning and the cost we need to pay to perform a given message-passing based inference task because the learnt edge structures of data dependency and physical connectivity graph are often highly different. In this paper, we formalize this trade-off in an optimization problem which outputs the data dependency graph that jointly considers learning accuracy and message-passing cost. We focus on a distributed MAP as the target inference task due to its popularity, and consider two different implementations, ASYNC-MAP and SYNC-MAP that have different message-passing mechanisms and thus different cost structures. In ASYNC-MAP, we propose a polynomial time learning algorithm that is optimal, motivated by the problem of finding a maximum weight spanning tree. In SYNC-MAP, we first prove that it is NP-hard and propose a greedy heuristic. For both implementations, we then quantify how the probability that the resulting data graphs from those learning algorithms differ from the ideal data graph decays as the number of data samples grows, using the large deviation principle, where the decaying rate is characterized by some topological structures of both original data dependency and physical connectivity graphs as well as the degree of the trade-off, which provides some guideline on how many samples are necessary to obtain a certain learning accuracy. We validate our theoretical findings through extensive simulations, which confirm that it has a good match.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658071","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