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

Joint sensor duty cycle scheduling with coverage guarantee 具有覆盖保证的联合传感器占空比调度

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942379

Kin Sum Liu, Jie Gao, Shan Lin, Hua Huang, B. Schiller

{"title":"Joint sensor duty cycle scheduling with coverage guarantee","authors":"Kin Sum Liu, Jie Gao, Shan Lin, Hua Huang, B. Schiller","doi":"10.1145/2942358.2942379","DOIUrl":"https://doi.org/10.1145/2942358.2942379","url":null,"abstract":"Using optical sensors for indoor monitoring has been widely adopted in many smart building applications. An important design problem in this space is to explore the tradeoff between energy consumption and coverage quality. While it is important that the sensors achieve full coverage (i.e., every interesting target point can be monitored by at least one sensors), it is often a waste of energy to keep sensors on all the time as events are typically stochastic and rare and most of the time the sensors are on idle monitoring. In this paper we design efficient sensor duty cycles to ensure that any target point of interest is still covered sufficiently frequently while only a subset of sensors are kept on at any time slot. We denote by the maximum dark length for each target point p as the maximum duration in which p is covered at least once. We formulate two optimization problems: the min max dark length scheduling and the min average dark length scheduling. For both versions we provide efficient, practical algorithms with provable approximation guarantee. The two algorithms have been tested on two real testbed scenarios to evaluate its efficiency and coverage quality.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039765","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

How can I guard my AP?: non-intrusive user identification for mobile devices using WiFi signals 我如何保护我的AP?:针对使用WiFi信号的移动设备的非侵入式用户识别

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942373

Linsong Cheng, Jiliang Wang

{"title":"How can I guard my AP?: non-intrusive user identification for mobile devices using WiFi signals","authors":"Linsong Cheng, Jiliang Wang","doi":"10.1145/2942358.2942373","DOIUrl":"https://doi.org/10.1145/2942358.2942373","url":null,"abstract":"With the development and popularization of WiFi, surfing on the Internet with mobile devices has become an indispensable part of people's daily life. However, as an infrastructure, WiFi APs are easily connected by some undesired users nearby. In this paper, we propose NiFi, a non-intrusive WiFi user identification system based on WiFi signals that enables AP to automatically identify legitimate users in indoor environment such as home, office and hotel. The core idea is that legitimate and undesired users may have different physical constraints, e.g., moving area, walking path, etc, leading to different signal sequences. NiFi analyzes and exploits the characteristics of signal sequences generated by mobile devices. NiFi proposes a practical and effective method to extract useful features and measure similarity for signal sequences, while not relying on precise user location information. We implement NiFi on Commercial Off-The-Shelf (COTS) APs, and the implementation does not require any modification to user devices. The experiment results demonstrate that NiFi is able to achieve an average identification accuracy at 90.83% with true positive rate at 98.89%.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117323593","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}

引用次数: 28

Towards distributed ensemble clustering for networked sensing systems: a novel geometric approach 面向网络传感系统的分布式集成聚类:一种新的几何方法

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942391

Hu Ding, Lu Su, Jinhui Xu

{"title":"Towards distributed ensemble clustering for networked sensing systems: a novel geometric approach","authors":"Hu Ding, Lu Su, Jinhui Xu","doi":"10.1145/2942358.2942391","DOIUrl":"https://doi.org/10.1145/2942358.2942391","url":null,"abstract":"Given a set of different clustering solutions to a unified dataset, ensemble clustering is to aggregate them to yield a more accurate and robust solution. In recent years, ensemble clustering has been extensively studied and successfully applied to many areas. In this paper, we study a new variant of ensemble clustering, distributed ensemble clustering, motivated by the proliferation of networked sensing systems where communication is enabled between only connected nodes. Our goal is to aggregate the clustering solutions produced by the sensor nodes that observe the same set of objects. Different from traditional ensemble clustering problems, distributed ensemble clustering aims to achieve not only accurate clustering results, but also low communication cost among the nodes. To this end, we build a novel geometric optimization model that can be efficiently solved with theoretical quality guarantee. The proposed approach, bearing nice geometric properties, can be easily adapted to distributed settings without any sacrifice of clustering quality, and facilitates a dimension reduction procedure which can significantly reduce the communication complexity. We validate our approach on two benchmark datasets. Experimental results suggest that our approach can efficiently solve the distributed ensemble clustering problem, and outperform the baselines on both clustering accuracy and communication cost.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124686881","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

An efficient approximation algorithm for online multi-tier multi-cell user association 一种有效的多层多单元在线用户关联近似算法

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942360

Weng-Chon Ao, K. Psounis

{"title":"An efficient approximation algorithm for online multi-tier multi-cell user association","authors":"Weng-Chon Ao, K. Psounis","doi":"10.1145/2942358.2942360","DOIUrl":"https://doi.org/10.1145/2942358.2942360","url":null,"abstract":"The ever growing wireless bandwidth demand is pushing WiFi and cellular networks to dense multi-cell deployments, as well as to multi-tier architectures consisting of macrocells and small cells. In such a multi-tier multi-cell environment, the classic problem of associating users to base stations becomes both more challenging and more critical to the overall network performance. Most previous analytical work is focused on offline/static user-cell association, where the users' arrivals and their rates are assumed to be known in advance and thus has little practical relevance. On the other hand, practical online algorithms based on heuristics are often suboptimal and may not provide any performance guarantees. In this paper, we propose an online algorithm for the multi-tier multi-cell user association problem that has a provable performance guarantee which improves previously known bounds by a sizable amount. The proposed algorithm is motivated by online combinatorial auctions, while capturing and leveraging the relative sparsity of choices in wireless networks as compared to auction setups. Specifically, it is a 1/2−a−1 approximation algorithm, where a is the maximum number of feasible associations for a user and is, in general, small due to path loss. In addition to establishing formal performance bounds, we also conduct simulations under realistic assumptions which establish the superiority of the proposed algorithm over existing approaches under real-world scenarios.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114255189","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

Analog man-in-the-middle attack against link-based packet source identification 针对基于链路的数据包源识别的模拟中间人攻击

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942361

Yu-Chih Tung, K. Shin, Kyu-Han Kim

{"title":"Analog man-in-the-middle attack against link-based packet source identification","authors":"Yu-Chih Tung, K. Shin, Kyu-Han Kim","doi":"10.1145/2942358.2942361","DOIUrl":"https://doi.org/10.1145/2942358.2942361","url":null,"abstract":"A novel attack model is proposed against the existing wireless link-based source identification, which classifies packet sources according to the physical-layer link signatures. A link signature is believed to be a more reliable indicator than an IP or MAC address for identifying packet source, as it is generally harder to modify/forge. It is therefore expected to be a future authentication against impersonation and DoS attacks. However, if an attacker is equipped with the same capability/hardware as the authenticator to process physical-layer signals, a link signature can be easily manipulated by any nearby wireless device during the training phase. Based on this finding, we propose an attack model, called the analog man-in-the-middle (AMITM) attack, which utilizes the latest full-duplex relay technology to inject semi-controlled link signatures into authorized packets and reproduce the injected signature in the fabricated packets. Our experimental evaluation shows that with a proper parameter setting, 90% of fabricated packets are classified as those sent from an authorized transmitter. A countermeasure against this new attack is also proposed for the authenticator to inject link-signature noise by the same attack methodology.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127018739","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

Context aware dynamic log chunking for mobile healthcare applications: poster 移动医疗保健应用的上下文感知动态日志分块:海报

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942406

Rahul Krishnan Pathinarupothi, Bithin Alangot, P. Rangan

引用次数: 1

Coexistence features of LTE-U for spectrum sharing with collocated Wi-Fi: demo LTE-U频谱共享与并置Wi-Fi共存特性:演示

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942394

J. Ansari

引用次数: 1

PotatoMesh: a solar powered WSN testbed: poster PotatoMesh:太阳能无线传感器网络测试平台:海报

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942411

Björn Gernert, S. Rottmann, L. Wolf

引用次数: 3

A node-based CSMA algorithm for improved delay performance in wireless networks 一种改进无线网络延迟性能的基于节点的CSMA算法

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942359

Sherif ElAzzouni, E. Ekici

{"title":"A node-based CSMA algorithm for improved delay performance in wireless networks","authors":"Sherif ElAzzouni, E. Ekici","doi":"10.1145/2942358.2942359","DOIUrl":"https://doi.org/10.1145/2942358.2942359","url":null,"abstract":"Recent studies in wireless scheduling have shown that CSMA can be made throughput optimal by optimizing over activation rates. However, those throughput optimal CSMA algorithms were found to suffer from poor delay performance, especially at high throughputs where the delay can potentially grow exponentially in the size of the network. Motivated by these shortcomings, in this paper we propose a node-based version of the throughput optimal CSMA (NB-CSMA) as opposed to previous link-based CSMA algorithms, where links were treated as separate entities. Our algorithm is fully distributed and corresponds to Glauber dynamics with \"Block updates\". We show analytically and via simulations that NB-CSMA outperforms conventional link-based CSMA in terms of delay for any fixed-size network. We also characterize the fraction of the capacity region for which the average queue lengths (and the average delay) grow polynomially in the size of the network, for networks with bounded-degree conflict graphs. This fraction is no smaller than the fraction known for link-based CSMA, and is significantly larger for a special class of wireless ad-hoc networks.","PeriodicalId":445286,"journal":{"name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604821","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

Anonymous-query based rate control for wireless multicast: approaching optimality with constant feedback 基于匿名查询的无线组播速率控制:用恒反馈逼近最优

Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2016-07-05 DOI: 10.1145/2942358.2942362

Fei Wu, Yang Yang, Ouyang Zhang, K. Srinivasan, N. Shroff

引用次数: 7