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

{"title":"Using SOS message propagation to estimate the location of immobilized persons","authors":"Noriyuki Suzuki, J. L. Zamora, S. Kashihara, S. Yamaguchi","doi":"10.1145/2348543.2348609","DOIUrl":"https://doi.org/10.1145/2348543.2348609","url":null,"abstract":"This demonstration presents SOSCast, an application that will assist the search for immobilized persons in a disaster area. When a catastrophic disaster such as an earthquake or tsunami occurs, people may be immobilized because of an injury or become trapped in buildings and debris. However, in such a situation, since conventional communication services are likely to be severely damaged, it would be difficult for immobilized persons to ask for rescue using their mobile phones. As a solution, we present SOSCast, which propagates SOS messages through direct communication between smartphones most especially inside the disaster area. By collecting these SOS messages, rescuers can estimate the locations of people who need help using the application. In this demonstration, we will show our prototype implementation of the SOSCast for SOS message processing and its map function to estimate the location of immobilized persons.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"28 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":"130340826","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":"Physarum optimization: a new heuristic algorithm to minimal exposure problem","authors":"Yuning Song, Liang Liu, Huadong Ma, A. Vasilakos","doi":"10.1145/2348543.2348599","DOIUrl":"https://doi.org/10.1145/2348543.2348599","url":null,"abstract":"Nature is an invaluable source of inspiration for long-standing computational problems. Genetic algorithms and ant colony optimization are the well-known successes. Drawing the inspirations from these successful experience, we exploit the computing model in a single-celled organism -- physarum polycephalum, and further design a new heuristic algorithm, Physarum Optimization, to the minimal exposure problem of wireless sensor networks. More importantly, our proposed physarum optimization algorithm can be also applied to the general Steiner tree problem.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"2 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":"125306753","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":"Every bit counts: fast and scalable RFID estimation","authors":"Muhammad Shahzad, A. Liu","doi":"10.1145/2348543.2348588","DOIUrl":"https://doi.org/10.1145/2348543.2348588","url":null,"abstract":"Radio Frequency Identification (RFID) systems have been widely deployed for various applications such as object tracking, 3D positioning, supply chain management, inventory control, and access control. This paper concerns the fundamental problem of estimating RFID tag population size, which is needed in many applications such as tag identification, warehouse monitoring, and privacy sensitive RFID systems. In this paper, we propose a new scheme for estimating tag population size called Average Run based Tag estimation (ART). The technique is based on the average run-length of ones in the bit string received using the standardized framed slotted Aloha protocol. ART is significantly faster than prior schemes because its estimator has smaller variance compared to the variances of estimators of prior schemes. For example, given a required confidence interval of 0.1% and a required reliability of 99.9%, ART is consistently 7 times faster than the fastest existing schemes (UPE and EZB) for any tag population size. Furthermore, ART's estimation time is observably independent of the tag population sizes. ART is easy to deploy because it neither requires modification to tags nor to the communication protocol between tags and readers. ART only needs to be implemented on readers as a software module. ART works with multiple readers with overlapping regions.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"17 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":"126550902","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":"ProfileDroid: multi-layer profiling of android applications","authors":"Xuetao Wei, L. Gomez, Iulian Neamtiu, M. Faloutsos","doi":"10.1145/2348543.2348563","DOIUrl":"https://doi.org/10.1145/2348543.2348563","url":null,"abstract":"The Android platform lacks tools for assessing and monitoring apps in a systematic way. This lack of tools is particularly problematic when combined with the open nature of Google Play, the main app distribution channel. As our key contribution, we design and implement ProfileDroid, a comprehensive, multi-layer system for monitoring and profiling apps. Our approach is arguably the first to profile apps at four layers: (a) static, or app specification, (b) user interaction, (c) operating system, and (d) network. We evaluate 27 free and paid Android apps and make several observations: (a) we identify discrepancies between the app specification and app execution, (b) free versions of apps could end up costing more than their paid counterparts, due to an order of magnitude increase in traffic, (c) most network traffic is not encrypted, (d) apps communicate with many more sources than users might expect---as many as 13, and (e) we find that 22 out of 27 apps communicate with Google during execution. ProfileDroid is the first step towards a systematic approach for (a) generating cost-effective but comprehensive app profiles, and (b) identifying inconsistencies and surprising behaviors.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"12 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":"125320356","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":"Achieving high data rates in a distributed MIMO system","authors":"Horia Vlad Balan, R. Rogalin, Antonios Michaloliakos, K. Psounis, G. Caire","doi":"10.1145/2348543.2348552","DOIUrl":"https://doi.org/10.1145/2348543.2348552","url":null,"abstract":"A distributed MIMO system consists of several access points connected to a central server and operating as a large distributed multi-antenna access point. In theory, such a system enjoys all the significant performance gains of a traditional MIMO system, and it may be deployed in an enterprise WiFi like setup. In this paper, we investigate the efficiency of such a system in practice. Specifically, we build upon our prior work on developing a distributed MIMO testbed, and study the performance of such a system when both full channel state information is available to the transmitters and when no channel state information is available. In the full channel state information scenario, we implement Zero-Forcing Beamforming (ZFBF) and Tomlinson-Harashima Precoding (THP) which is provably near-optimal in high SNR conditions. In the scenario where no channel information is available, we implement Blind Interference Alignment (BIA), which achieves a higher multiplexing gain (degrees of freedom) than conventional TDMA. Our experimental results show that the performance of our implementation is very close to the theoretically predicted performance and offers significant gains over optimal TDMA. We also discuss medium access layer issues in detail for both scenarios. To the best of our knowledge, this is the first time that the theoretical high data rates of multiuser MIMO systems have been showcased in a real world distributed MIMO testbed.","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":"129052778","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":"CloudIQ: a framework for processing base stations in a data center","authors":"Sourjya Bhaumik, Shoban Preeth Chandrabose, Manjunath Kashyap Jataprolu, G.Manoj kumar, A. Muralidhar, P. Polakos, V. Srinivasan, Thomas Y. C. Woo","doi":"10.1145/2348543.2348561","DOIUrl":"https://doi.org/10.1145/2348543.2348561","url":null,"abstract":"The cellular industry is evaluating architectures to distribute the signal processing in radio access networks. One of the options is to process the signals of all base stations on a shared pool of compute resources in a central location. In this centralized architecture, the existing base stations will be replaced with just the antennas and a few other active RF components, and the remainder of the digital processing including the physical layer will be carried out in a central location. This model has potential benefits that include a reduction in the cost of operating the network due to fewer site visits, easy upgrades, and lower site lease costs, and an improvement in the network performance with joint signal processing techniques that span multiple base stations. Further there is a potential to exploit variations in the processing load across base stations, to pool the base stations into fewer compute resources, thereby allowing the operator to either reduce energy consumption by turning the remaining processors off or reducing costs by provisioning fewer compute resources. We focus on this aspect in this paper.\u0000 Specifically, we make the following contributions in the paper. Based on real-world data, we characterise the potential savings if shared homogeneous compute resources are used to process the signals from multiple base stations in the centralized architecture. We show that the centralized architecture can potentially result in savings of at least 22 % in compute resources by exploiting the variations in the processing load across base stations. These savings are achievable with statistical guarantees on successfully processing the base station's signals. We also design a framework that has two objectives: (i) partitioning the set of base stations into groups that are simultaneously processed on a shared homogeneous compute platform for a given statistical guarantee, and (ii) scheduling the set of base stations allocated to a platform in order to meet their real-time processing requirements. This partitioning and scheduling framework saves up to 19 % of the compute resources for a probability of failure of one in 100 million. We refer to this solution as CloudIQ. Finally we implement and extensively evaluate the CloudIQ framework with a 3GPP compliant implementation of 5 MHz LTE.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"398 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":"132687033","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":"Frame retransmissions considered harmful: improving spectrum efficiency using Micro-ACKs","authors":"Jiansong Zhang, Haichen Shen, Kun Tan, Ranveer Chandra, Yongguang Zhang, Qian Zhang","doi":"10.1145/2348543.2348557","DOIUrl":"https://doi.org/10.1145/2348543.2348557","url":null,"abstract":"Retransmissions reduce the efficiency of data communication in wireless networks because of: (i) per-retransmission packet headers, (ii) contention overhead on every retransmission, and (iii) redundant bits in every retransmission. In fact, every retransmission nearly doubles the time to successfully deliver the packet. To improve spectrum efficiency in a lossy environment, we propose a new in-frame retransmission scheme using uACKs. Instead of waiting for the entire transmission to end before sending the ACK, the receiver sends smaller uACKs for every few symbols, on a separate narrow feedback channel. Based on these uACKs, the sender only retransmits the lost symbols after the last data symbol in the frame, thereby adaptively changing the frame size to ensure it is successfully delivered. We have implemented uACK on the Sora platform. Experiments with our prototype validate the feasibility of symbol-level uACK . By significantly reducing the retransmistion overhead, the sender is able to aggressively use higher data rate for a lossy link. Both improve the overall network efficiency. Our experimental results from a controlled environment and an 9-node software radio testbed show that uACK can have up to 140% throughput gain over 802.11g and up to 60% gain over the best known retransmission scheme.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"21 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":"116872295","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":"Locating in fingerprint space: wireless indoor localization with little human intervention","authors":"Zheng Yang, Chenshu Wu, Yunhao Liu","doi":"10.1145/2348543.2348578","DOIUrl":"https://doi.org/10.1145/2348543.2348578","url":null,"abstract":"Indoor localization is of great importance for a range of pervasive applications, attracting many research efforts in the past decades. Most radio-based solutions require a process of site survey, in which radio signatures of an interested area are annotated with their real recorded locations. Site survey involves intensive costs on manpower and time, limiting the applicable buildings of wireless localization worldwide. In this study, we investigate novel sensors integrated in modern mobile phones and leverage user motions to construct the radio map of a floor plan, which is previously obtained only by site survey. On this basis, we design LiFS, an indoor localization system based on off-the-shelf WiFi infrastructure and mobile phones. LiFS is deployed in an office building covering over 1600m2, and its deployment is easy and rapid since little human intervention is needed. In LiFS, the calibration of fingerprints is crowdsourced and automatic. Experiment results show that LiFS achieves comparable location accuracy to previous approaches even without site survey.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"14 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":"114734954","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":"Argos: practical many-antenna base stations","authors":"Clayton W. Shepard, Hang Yu, Narendra Anand, Erran L. Li, T. Marzetta, Y. Yang, Lin Zhong","doi":"10.1145/2348543.2348553","DOIUrl":"https://doi.org/10.1145/2348543.2348553","url":null,"abstract":"Multi-user multiple-input multiple-output theory predicts manyfold capacity gains by leveraging many antennas on wireless base stations to serve multiple clients simultaneously through multi-user beamforming (MUBF). However, realizing a base station with a large number antennas is non-trivial, and has yet to be achieved in the real-world. We present the design, realization, and evaluation of Argos, the first reported base station architecture that is capable of serving many terminals simultaneously through MUBF with a large number of antennas (M >> 10). Designed for extreme flexibility and scalability, Argos exploits hierarchical and modular design principles, properly partitions baseband processing, and holistically considers real-time requirements of MUBF. Argos employs a novel, completely distributed, beamforming technique, as well as an internal calibration procedure to enable implicit beamforming with channel estimation cost independent of the number of base station antennas. We report an Argos prototype with 64 antennas and capable of serving 15 clients simultaneously. We experimentally demonstrate that by scaling from 1 to 64 antennas the prototype can achieve up to 6.7 fold capacity gains while using a mere 1/64th of the transmission power.","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":"122628865","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":"An efficient way to track peers in mobile P2P network","authors":"Saumay Pushp, Tae Hun Cho, J. Han, Dongman Lee, Junehwa Song, Sunghee Choi","doi":"10.1145/2348543.2348602","DOIUrl":"https://doi.org/10.1145/2348543.2348602","url":null,"abstract":"In this paper, we propose a new class of message routing scheme for a distributed network which can scale up to the needs of a very large number of mobile users. We leverage the work in the GeoKad paper which uses the Distributed Geographic Table, allowing node retrieval from resources that are close to any given region. The paper addresses the problem regarding efficient message passing and peer misses. We propose a new routing scheme that addresses this kind of limitation. In fact, the problem can be solved in two ways, either by preserving the state of peer and further use a prediction algorithm or by better message routing. The proposed scheme is based on swarm intelligence (SI) and its attribute of exploit and explore. We leverage the statistical properties of time-varying network connectivity for opportunistic message forwarding. Considering the present 3G or Wi-Fi environment this approach can also help in optimizing energy as it can prevent query over flooding which is mostly encountered in such network scenarios.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"52 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":"132281007","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}