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

Harnessing HyDRO: Harvesting-aware Data ROuting for Underwater Wireless Sensor Networks 利用水力:水下无线传感器网络的采集感知数据路由

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

S. Basagni, Valerio Di Valerio, Petrika Gjanci, C. Petrioli

引用次数: 25

Demand-driven Cache Allocation Based on Context-aware Collaborative Filtering 基于上下文感知协同过滤的需求驱动缓存分配

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

Muhao Chen, Qi Zhao, Pengyuan Du, C. Zaniolo, M. Gerla

{"title":"Demand-driven Cache Allocation Based on Context-aware Collaborative Filtering","authors":"Muhao Chen, Qi Zhao, Pengyuan Du, C. Zaniolo, M. Gerla","doi":"10.1145/3209582.3225198","DOIUrl":"https://doi.org/10.1145/3209582.3225198","url":null,"abstract":"Many recent advances of network caching focus on i) more effectively modeling the preferences of a regional user group to different web contents, and ii) reducing the cost of content delivery by storing the most popular contents in regional caches. However, the context under which the users interact with the network system usually causes tremendous variations in a user group's preferences on the contents. To effectively leverage such contextual information for more efficient network caching, we propose a novel mechanism to incorporate context-aware collaborative filtering into demand-driven caching. By differentiating the characterization of user interests based on a priori contexts, our approach seeks to enhance the cache performance with a more dynamic and fine-grained cache allocation process. In particular, our approach is general and adapts to various types of context information. Our evaluation shows that this new approach significantly outperforms previous non-demand-driven caching strategies by offering much higher cached content rate, especially when utilizing the contextual information.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"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":"129431717","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

PULS: Processor-Supported Ultra-Low Latency Scheduling PULS:处理器支持的超低延迟调度

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

Simon Yau, Ping-Chun Hsieh, Rajarshi Bhattacharyya, K. Bhargav, S. Shakkottai, I.-Hong Hou, P. Kumar

引用次数: 0

A Low-Cost Wireless System Implementation for Interactive and Immersive Teaching 交互式沉浸式教学的低成本无线系统实现

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

Minghui Weng, Xiangqi Kong, Lianfeng Huang, Bin Li

引用次数: 1

Towards Opportunistic Resource Sharing in Mobile Social Networks: an Evolutionary Game Theoretic Approach 移动社交网络中的机会主义资源共享:一种进化博弈论方法

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

Pengyuan Du, Seunghyun Yoo, Qi Zhao, Muhao Chen, M. Gerla

引用次数: 2

Incentivizing Hosts via Multilateral Cooperation in User-Provided Networks: A Fluid Shapley Value Approach 在用户提供的网络中通过多边合作激励主机:一种流动的Shapley价值方法

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

Hyojung Lee, Jihwan Bang, Yung Yi

{"title":"Incentivizing Hosts via Multilateral Cooperation in User-Provided Networks: A Fluid Shapley Value Approach","authors":"Hyojung Lee, Jihwan Bang, Yung Yi","doi":"10.1145/3209582.3209597","DOIUrl":"https://doi.org/10.1145/3209582.3209597","url":null,"abstract":"Successful operation of User-Provided Networks (UPN) requires that both of Internet Service Provider (ISP) and self network-operating users (hosts) cooperate appropriately in terms of resource sharing and pricing strategy since ISP and hosts have a multilateral reliance on each other with respect to virtual infrastructure expansion and Internet connectivity. However, it has been underexplored whether such cooperation provides sufficient incentive to ISP and hosts under a setup where ISP and hosts are fully included, having a high dependence on how to cooperate and how to distribute the resulting cooperation worth. In this paper, we model a market of UPN, consisting of ISP, hosts, and clients via game theory, where we model various heterogeneities in terms of (i) willingness to pay and mobility pattern of clients, (ii) hosts' QoS, and (iii) type of cooperation among ISP and hosts. The key technical challenges lie in the natural mixture of cooperative and non-cooperative game theoretic angles, where the worth function---one of the crucial components in coalitional game theory---comes from the equilibrium of an embedded, non-cooperative two-stage dynamic game. We consider the Shapley value as a mechanism of revenue sharing and overcome its hardness in characterization by taking the fluid limit when the number of hosts and clients is large. Our analytical studies reveal useful implications that in UPN when and how much economic benefits can be given to the players and when they maintain their grand coalition under what conditions, referred to as stability.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"26 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":"129070576","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

Ins and Outs: Optimal Caching and Re-Caching Policies in Mobile Networks 来龙去脉:移动网络中的最佳缓存和再缓存策略

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

Wei Bao, Dong Yuan, Keqi Shi, Weiyu Ju, Albert Y. Zomaya

{"title":"Ins and Outs: Optimal Caching and Re-Caching Policies in Mobile Networks","authors":"Wei Bao, Dong Yuan, Keqi Shi, Weiyu Ju, Albert Y. Zomaya","doi":"10.1145/3209582.3209587","DOIUrl":"https://doi.org/10.1145/3209582.3209587","url":null,"abstract":"Caching is essential for data-intensive mobile applications to reduce duplicated data transmission. In this paper, we study the optimal probabilistic caching and re-caching policies in mobile networks as the file popularity may change over time. We propose a Probabilistic File Re-caching (PFR) policy to match the updated popularity. Through PFR, files cached (resp. not cached) are probabilistically opted out (resp. opted in). PFR is with substantial advantages: (1) PFR can handle a huge combinatorial number of all possible situations. (2) The expected number of replaced files is minimized. (3) The computational complexity of PFR is low. Second, we study a utility optimization problem in the mobile network, in order to optimally decide the probability that each file is cached and whether a file should be downloaded from a peer device or directly from the server. Even though the optimization problem is non-convex programming in nature, we devise a computationally efficient Optimal Probabilistic Caching and Requesting (OPCR) policy, through decoupling the decision variables, to derive a globally optimal solution. Finally, we develop a real-world prototype and conduct trace-driven simulations to validate and evaluate our proposed PFR and OPCR policies.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"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":"130288215","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

WiVo: Enhancing the Security of Voice Control System via Wireless Signal in IoT Environment WiVo:通过无线信号增强物联网环境下语音控制系统的安全性

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

Yan Meng, Zichang Wang, Wei Zhang, Peilin Wu, Haojin Zhu, Xiaohui Liang, Yao Liu

{"title":"WiVo: Enhancing the Security of Voice Control System via Wireless Signal in IoT Environment","authors":"Yan Meng, Zichang Wang, Wei Zhang, Peilin Wu, Haojin Zhu, Xiaohui Liang, Yao Liu","doi":"10.1145/3209582.3209591","DOIUrl":"https://doi.org/10.1145/3209582.3209591","url":null,"abstract":"With the prevalent of smart devices and home automations, voice command has become a popular User Interface (UI) channel in the IoT environment. Although Voice Control System (VCS) has the advantages of great convenience, it is extremely vulnerable to the spoofing attack (e.g., replay attack, hidden/inaudible command attack) due to its broadcast nature. In this study, we present WiVo, a device-free voice liveness detection system based on the prevalent wireless signals generated by IoT devices without any additional devices or sensors carried by the users. The basic motivation of WiVo is to distinguish the authentic voice command from a spoofed one via its corresponding mouth motions, which can be captured and recognized by wireless signals. To achieve this goal, WiVo builds a theoretical model to characterize the correlation between wireless signal dynamics and the user's voice syllables. WiVo extracts the unique features from both voice and wireless signals, and then calculates the consistency between these different types of signals in order to determine whether the voice command is generated by the authentic user of VCS or an adversary. To evaluate the effectiveness of WiVo, we build a testbed based on Samsung SmartThings framework and include WiVo as a new application, which is expected to significantly enhance the security of the existing VCS. We have evaluated WiVo with 6 participants and different voice commands. Experimental evaluation results demonstrate that WiVo achieves the overall 99% detection rate with 1% false accept rate and has a low latency.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"44 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":"123419612","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}

引用次数: 59

Towards Data Poisoning Attacks in Crowd Sensing Systems 人群传感系统中的数据中毒攻击

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

Chenglin Miao, Qi Li, Houping Xiao, Wenjun Jiang, Mengdi Huai, Lu Su

{"title":"Towards Data Poisoning Attacks in Crowd Sensing Systems","authors":"Chenglin Miao, Qi Li, Houping Xiao, Wenjun Jiang, Mengdi Huai, Lu Su","doi":"10.1145/3209582.3209594","DOIUrl":"https://doi.org/10.1145/3209582.3209594","url":null,"abstract":"With the proliferation of sensor-rich mobile devices, crowd sensing has emerged as a new paradigm of collecting information from the physical world. However, the sensory data provided by the participating workers are usually not reliable. In order to identify truthful values from the crowd sensing data, the topic of truth discovery, whose goal is to estimate each worker's reliability and infer the underlying truths through weighted data aggregation, is widely studied. Since truth discovery incorporates workers' reliability into the aggregation procedure, it shows robustness to the data poisoning attacks, which are usually conducted by the malicious workers who aim to degrade the effectiveness of the crowd sensing systems through providing malicious sensory data. However, truth discovery is not perfect in all cases. In this paper, we study how to effectively conduct two types of data poisoning attacks, i.e., the availability attack and the target attack, against a crowd sensing system empowered with the truth discovery mechanism. We develop an optimal attack framework in which the attacker can not only maximize his attack utility but also disguise the introduced malicious workers as normal ones such that they cannot be detected easily. The desirable performance of the proposed framework is verified through extensive experiments conducted on a real-world crowd sensing system.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"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":"128852879","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}

引用次数: 56

Dynamic Pricing in the Presence of Participation-Dependent Social Learning 参与型社会学习下的动态定价

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

Qian Ma, Biying Shou, Jianwei Huang, T. Başar

{"title":"Dynamic Pricing in the Presence of Participation-Dependent Social Learning","authors":"Qian Ma, Biying Shou, Jianwei Huang, T. Başar","doi":"10.1145/3209582.3209593","DOIUrl":"https://doi.org/10.1145/3209582.3209593","url":null,"abstract":"For Internet-based services, users' quality of service (QoS) depends on not only the available resource (capacity) but also the number of users who use the resource simultaneously (e.g., congestion effect). When a new Internet-based service provider first enters the market, there can be uncertainties regarding both the capacity and congestion, and hence the uncertainty of QoS. In this paper, we consider a participation-dependent social learning over the QoS through users' online reviews, where the QoS changes with the number of review participants. We study how such a learning process affects the provider's dynamic pricing strategy. With a simple two-period model, we analyze the strategic interactions between the provider and the users, and characterize the provider's optimal two-period dynamic pricing policy. Our results show that when the capacity is small or the users' prior QoS belief is high, the provider will choose a higher introductory price in the first period (than the price in the second period). This is in sharp contrast with the common practice of setting a lower introductory price to attract users (when congestion is not an issue). Furthermore, the learning process is beneficial to the provider with a large capacity.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"38 5 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":"125738141","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