ACM/IEEE International Conference on Mobile Computing and Networking最新文献

{"title":"Three theories for delays, clocks and security in wireless networks","authors":"P. Kumar","doi":"10.1145/2348543.2348546","DOIUrl":"https://doi.org/10.1145/2348543.2348546","url":null,"abstract":"We propose three theories, which can be regarded as attempts to characterize and establish guaranteed properties of wireless networks: (i) How and to what extent can we deliver packets with hard delay bounds? (ii) How and to what extent can we synchronize clocks in wireless networks? (iii) Can we develop provably secure protocols for the entire life-cycle of wireless networks that also optimize a utility measure while operating in a hostile environment? For the first problem, consider an access point serving several clients over unreliable wireless links. Suppose packets arrive for/from the clients, with each packet having a hard deadline, after which it is dropped. We characterize precisely the mix of delivery ratios, channel unreliabilities and hard deadline that the access point can guarantee, under some models. For the second problem, consider a wireless network where clocks at the nodes are linear, though with different rates (skews) and offsets. Nodes can exchange packets with their neighbors, with direction dependent delays. We characterize precisely to what extent clocks can and cannot be synchronized and delays determined. Under a random model the end-to-end error can be kept bounded irrespective of network size. Concerning the third problem, traditionally, wireless protocols have been developed to provide performance. As attacks are identified, the protocols are fortified against the identified vulnerabilities. However, holistic guarantees are not provided against other attacks. We seek to reverse this paradigm. We propose a provable approach that guarantees the protocol suite is secure when the nodes are subject to certain assumptions. The protocols take a set of good nodes mingled with unknown malicious nodes from primordial birth to an operating network, while attaining min-max of a utility function. The maximization is over protocols announced and followed by the good nodes, and the minimization is over all behaviors of the malicious nodes. Further, the malicious nodes are reduced to either cooperating or jamming. [Joint work with Vivek Borkar, Nikolaos Freris, Scott Graham, I-Hong Hou, Yih-Chun Hu, Jonathan Ponniah and Roberto Solis].","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121676794","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":"A unified approach to identifying and healing vulnerabilities in x86 machine code","authors":"Kirill Kononenko","doi":"10.1145/2348543.2348593","DOIUrl":"https://doi.org/10.1145/2348543.2348593","url":null,"abstract":"The security of software systems is threatened by a wide range of attack vectors, such as buffer overflows, insecure information flow, and side channels, which can leak private information, e.g., by monitoring a program's execution time. Even if programmers manage to avoid such vulnerabilities in a program's source code or bytecode, new vulnerabilities can arise as compilers generate machine code from those representations.\u0000 We propose a virtual execution environment for x86 machine code that combines information from compositional, static, and dynamic program analysis to identify vulnerabilities and timing channels, and uses code transformations to prevent those from being exploited. To achieve an appropriate level of performance as well as combine analysis results, our approach stores summary information in the form of conditional rules that can be shared among analyses.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126510374","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":"A wideband compressed spectrum sensing platform for dynamic spectrum access networks","authors":"Qiang Liu, Ze Zhao, Li Cui","doi":"10.1145/2348543.2348612","DOIUrl":"https://doi.org/10.1145/2348543.2348612","url":null,"abstract":"Dynamic spectrum access (DSA) networks can significantly improve the networks performance and efficiency of spectrum utilization. To harness this capability, spectrum sensing is a fundamental problem for DSA networks. This demonstration shows our wideband compressed spectrum sensing (WCSS) platform. This platform supports the controllable spectrum environment, high performance and low cost wideband spectrum sensing based USRP2, powerful and flexible compressed sensing computing platform based MATLAB. With this platform, we can research the wideband compressed spectrum sensing algorithm by actual and controllable spectrum environment.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128011862","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":"Zee: zero-effort crowdsourcing for indoor localization","authors":"Anshul Rai, Krishna Chintalapudi, V. Padmanabhan, Rijurekha Sen","doi":"10.1145/2348543.2348580","DOIUrl":"https://doi.org/10.1145/2348543.2348580","url":null,"abstract":"Radio Frequency (RF) fingerprinting, based onWiFi or cellular signals, has been a popular approach to indoor localization. However, its adoption in the real world has been stymied by the need for sitespecific calibration, i.e., the creation of a training data set comprising WiFi measurements at known locations in the space of interest. While efforts have been made to reduce this calibration effort using modeling, the need for measurements from known locations still remains a bottleneck. In this paper, we present Zee -- a system that makes the calibration zero-effort, by enabling training data to be crowdsourced without any explicit effort on the part of users. Zee leverages the inertial sensors (e.g., accelerometer, compass, gyroscope) present in the mobile devices such as smartphones carried by users, to track them as they traverse an indoor environment, while simultaneously performing WiFi scans. Zee is designed to run in the background on a device without requiring any explicit user participation. The only site-specific input that Zee depends on is a map showing the pathways (e.g., hallways) and barriers (e.g., walls). A significant challenge that Zee surmounts is to track users without any a priori, user-specific knowledge such as the user's initial location, stride-length, or phone placement. Zee employs a suite of novel techniques to infer location over time: (a) placement-independent step counting and orientation estimation, (b) augmented particle filtering to simultaneously estimate location and user-specific walk characteristics such as the stride length,(c) back propagation to go back and improve the accuracy of ocalization in the past, and (d) WiFi-based particle initialization to enable faster convergence. We present an evaluation of Zee in a large office building.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116846887","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":"SimpleMAC: a jamming-resilient MAC-layer protocol for wireless channel coordination","authors":"Sang-Yoon Chang, Yih-Chun Hu, N. Laurenti","doi":"10.1145/2348543.2348556","DOIUrl":"https://doi.org/10.1145/2348543.2348556","url":null,"abstract":"In wireless networks, users share a transmission medium. To increase the efficiency of channel usage, wireless systems often use a Medium Access Control (MAC) protocol to perform channel coordination by having each node announce its usage intentions; other nodes avoid making conflicting transmissions minimizing interference both to the node that has announced its intentions and to a node that cooperates by avoiding transmissions during the reserved slot. Traditionally, in a multi-channel environment, such announcements are made on a common control channel. However, this control channel is vulnerable to jamming because its location is pre-assigned and known to attackers. Furthermore, the announcements themselves provide information useful for jamming. In this paper, we focus on a situation where multiple wireless transmitters share spectrum in the presence of intelligent and possibly insider jammers capable of dynamically and adaptively changing their jamming patterns.\u0000 We develop a framework for effectively countering MAC-aware jamming attacks and then propose SimpleMAC, a protocol resilient to these attacks. SimpleMAC consists of two schemes (the Simple Transmitter Strategy and the Simple Signaling Scheme) that are easily analyzed using game theory, and show the optimal adversarial behavior under these protocols. We evaluate our schemes mathematically, through Monte Carlo simulations, and by implementation on the WARP software-defined radio platform. SimpleMAC provides very rapid improvement over the alternative of not using any MAC protocol, and eventually converges to optimal performance (over six-fold improvement in SINR, 50% gains in Shannon capacity in a realistic mobile scenario).","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117174835","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":"Clock calibration using fluorescent lighting","authors":"Zhenjiang Li, Cheng Li, Wenwei Chen, Jingyao Dai, Mo Li, Xiangyang Li, Yunhao Liu","doi":"10.1145/2348543.2348611","DOIUrl":"https://doi.org/10.1145/2348543.2348611","url":null,"abstract":"In this demo, we propose a novel clock calibration approach called FLIGHT, which leverages the fact that the fluorescent light intensity changes with a stable period that equals half of the alternating current's. By tuning to the light emitted from indoor fluorescent lamps, FLIGHT can intelligently extract the light period information and achieve network wide time calibration by referring to such a common time reference. We address a series of practical challenges and implement FLIGHT in TelosB motes. In this demonstration, we will show that by taking advantage of the stability of the AC frequency, the detected light intensity, even from different lamps, exhibits a consistent and stable period. FLIGHT can achieve tightly synchronized time with low energy consumption. In addition, since FLIGHT is independent to the network message exchange, time synchronization can be retained even when the network is temporarily disconnected. Such characteristics particularly suit various mobility-enabled scenarios.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123989213","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":"A marine experiment of a long distance communication sensor network -MAD-SS-","authors":"N. Segawa, J. Sawamoto, Masato Yazawa, H. Tamaki","doi":"10.1145/2348543.2348603","DOIUrl":"https://doi.org/10.1145/2348543.2348603","url":null,"abstract":"We conducted long distance radio propagation experiments at 1-10mW/145MHz, to realize a low-power long-distance communication for wildlife research and disaster prevention telemetry. In this paper, we describe that we succeeded in long distance communications, from a ferryboat to the top of Mt. Asugiyama (elevation: 501m, distance: 15km) in Kure, Hiroshima, Japan, in the verification test of our method using 3W radio power. We found out that our method has sufficient capability to achieve such a long distance communication at 10BPS/10mW in battery cell operation on a marine, if we use SSB mode and the SNR in SSB bandwidth is better than -10dB.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125959326","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":"Energy-based rate adaptation for 802.11n","authors":"Chi-Yu Li, Chunyi Peng, Songwu Lu, Xinbing Wang","doi":"10.1145/2348543.2348585","DOIUrl":"https://doi.org/10.1145/2348543.2348585","url":null,"abstract":"Rate adaptation (RA) has been used to achieve high goodput. In this work, we explore to use RA for energy efficiency in 802.11n NICs. We show that current MIMO RA algorithms are not energy efficient for NICs despite ensuring high throughput. The fundamental problem is that, the high-throughput setting is not equivalent to the energy-efficient one. Marginal throughput gain may be realized at high energy cost. We propose EERA, an energy-based RA solution that trades off goodput for energy savings at NICs. Our experiments have confirmed its energy savings at NICs while keeping the cost at the device level and across clients acceptable.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129416591","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":"Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing","authors":"Dejun Yang, G. Xue, Xi Fang, Jian Tang","doi":"10.1145/2348543.2348567","DOIUrl":"https://doi.org/10.1145/2348543.2348567","url":null,"abstract":"Mobile phone sensing is a new paradigm which takes advantage of the pervasive smartphones to collect and analyze data beyond the scale of what was previously possible. In a mobile phone sensing system, the platform recruits smartphone users to provide sensing service. Existing mobile phone sensing applications and systems lack good incentive mechanisms that can attract more user participation. To address this issue, we design incentive mechanisms for mobile phone sensing. We consider two system models: the platform-centric model where the platform provides a reward shared by participating users, and the user-centric model where users have more control over the payment they will receive. For the platform-centric model, we design an incentive mechanism using a Stackelberg game, where the platform is the leader while the users are the followers. We show how to compute the unique Stackelberg Equilibrium, at which the utility of the platform is maximized, and none of the users can improve its utility by unilaterally deviating from its current strategy. For the user-centric model, we design an auction-based incentive mechanism, which is computationally efficient, individually rational, profitable, and truthful. Through extensive simulations, we evaluate the performance and validate the theoretical properties of our incentive mechanisms.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127272867","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":"AutoMAC: rateless wireless concurrent medium access","authors":"Aditya Gudipati, S. Pereira, S. Katti","doi":"10.1145/2348543.2348548","DOIUrl":"https://doi.org/10.1145/2348543.2348548","url":null,"abstract":"Current wireless network design is built on the ethos of avoiding interference. In this paper we question this long-held design principle. We show that with appropriate design, successful concurrent transmissions can be enabled and exploited on both the uplink and downlink. We show that this counter-intuitive approach of encouraging interference can be exploited to increase network capacity significantly and simplify network design. We design and implement name, a novel MAC and PHY protocol that exploits recently proposed rateless coding techniques to provide such concurrency. We show via a prototype implementation and experimental evaluation that name can provide a 60% increase in network capacity on the uplink compared to traditional Wifi that does omniscient rate adaptation and a $35%$ median throughput gain on the downlink PHY layer as compared to an omniscient scheme that picks the best conventional bitrate.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132266258","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}