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

The Road Ahead for Wireless Technology: Dreams and Challenges 无线技术的未来之路:梦想与挑战

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746324

A. Goldsmith

引用次数: 4

Demo: xRadio: Development of Next Generation Machine-to-Machine (M2M) Radio Adopting Narrow Band OFDM 演示:xRadio:采用窄带OFDM的下一代机器对机器(M2M)无线电的发展

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2764938

Weidong Xiang, F. Sotiropoulos, Sheng Liu

引用次数: 0

Demo: WiFi Multihop: Implementing Device-to-Device Local Area Networks by Android Smartphones 演示:WiFi多跳:通过Android智能手机实现设备到设备局域网

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2764931

Chao Yao, Hongliang Zhang, Lingyang Song

引用次数: 20

When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services 当网络效应遇到拥塞效应:利用社会服务实现无线服务

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746315

Xiaowen Gong, Lingjie Duan, Xu Chen

{"title":"When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services","authors":"Xiaowen Gong, Lingjie Duan, Xu Chen","doi":"10.1145/2746285.2746315","DOIUrl":"https://doi.org/10.1145/2746285.2746315","url":null,"abstract":"The recent development of social services tightens wireless users' social relationships and encourages them to generate more data traffic under network effect. This boosts the demand for wireless services yet may challenge the limited wireless capacity. To fully exploit this opportunity, we study mobile users' data usage behaviors by jointly considering the network effect based on their social relationships in the social domain and the congestion effect in the physical wireless domain. Accordingly, we develop a Stackelberg game for problem formulation: In Stage I, a wireless provider first decides the data pricing to all users to maximize its revenue, and then in Stage II users observe the price and decide data usage subject to mutual interactions under both network and congestion effects. We analyze the two-stage game using backward induction. For Stage II, we first show the existence and uniqueness of a user demand equilibrium (UDE). Then we propose a distributed update algorithm for users to reach the UDE. Furthermore, we investigate the impacts of different parameters on the UDE. For Stage I, we develop an optimal pricing algorithm to maximize the wireless provider's revenue. We evaluate the performance of our proposed algorithms by numerical studies using real data, and thereby draw useful engineering insights for the operation of wireless providers.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"45 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131736","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}

引用次数: 21

Demo: Software-Defined Device to Device Communication in Multiple Cells 演示:多单元中软件定义的设备到设备通信

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2764929

Huanyu Zhang, Mingxin Zhou, Lingyang Song, Shengli Zhang

引用次数: 4

Secure Communication through Jammers Jointly Optimized in Geography and Time 在地理和时间上共同优化的干扰机安全通信

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746322

Yair Allouche, Yuval Cassuto, A. Efrat, M. Segal, E. Arkin, G. Grebla, Joseph B. M. Mitchell, Swaminathan Sankararaman

{"title":"Secure Communication through Jammers Jointly Optimized in Geography and Time","authors":"Yair Allouche, Yuval Cassuto, A. Efrat, M. Segal, E. Arkin, G. Grebla, Joseph B. M. Mitchell, Swaminathan Sankararaman","doi":"10.1145/2746285.2746322","DOIUrl":"https://doi.org/10.1145/2746285.2746322","url":null,"abstract":"Security-sensitive applications, such as patient health monitoring and credit card transactions, are increasingly utilizing wireless communication systems, RFIDs, wireless sensor networks, and other wireless communication systems. The use of interference-emitting jammers to protect these sensitive communications has been recently explored in the literature, and has shown high potential. In this paper we consider optimization problems relating to the temporal distributions of jammers' activity, and the suitable coding regimes used for communication. Solving the joint problem optimally enables comprehensive security in space, at a low power consumption and low communication overhead. The joint optimization of jamming in space and time is driven by a new framework that uses the bit-error probability as a measure of communication quality. Under this framework, we show how to guarantee information-theoretic security within a geographic region, and with increased flexibility to tailor the coding regime to the problem's geometry. We present efficient algorithms for different settings, and provide simulations for various scenarios using the bit-error probability functions. These simulations demonstrate the efficiency of the scheme. We believe that our scheme can lead to practical, economical and scalable solutions for providing another layer of protection of sensitive data, in cases where encryption schemes are limited or impractical.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123911681","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}

引用次数: 15

Fast Data Retrieval in Cloud Storage Systems 云存储系统中的快速数据检索

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746323

N. Shroff

{"title":"Fast Data Retrieval in Cloud Storage Systems","authors":"N. Shroff","doi":"10.1145/2746285.2746323","DOIUrl":"https://doi.org/10.1145/2746285.2746323","url":null,"abstract":"We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every two days. Driven by a wide range of data-intensive devices and applications, this growth is expected to continue its astonishing march, and fuel the development of new and larger data centers. In order to exploit the low-cost services offered by these resource-rich data centers, application developers are pushing computing and storage away from the end-devices and instead deeper into the data-centers. Hence, the end-users' experience is now dependent on the performance of the algorithms used for data retrieval, and job scheduling within the data-centers. In particular, providing low-latency services are critically important to the end-user experience for a wide variety of applications. Our goal has been to develop the analytical foundations and methodologies to enable cloud storage and computing solutions that result in low-latency services. In this talk, I will overview some of the recent research efforts at fast data retrieval in these large-scale data center systems. Specifically, our focus will be on the new tools and techniques required to address these complex issues, the progress made, and the open challenges that remain.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126658134","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}

引用次数: 0

Device-to-Device Communication Overlaying Two-Hop Multi-Channel Uplink Cellular Networks 覆盖两跳多通道上行蜂窝网络的设备对设备通信

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746311

Jiajia Liu, N. Kato

引用次数: 46

The Value-of-Information in Matching with Queues 与队列匹配中的信息值

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746316

Longbo Huang

{"title":"The Value-of-Information in Matching with Queues","authors":"Longbo Huang","doi":"10.1145/2746285.2746316","DOIUrl":"https://doi.org/10.1145/2746285.2746316","url":null,"abstract":"We consider the problem of optimal matching with queues in dynamic systems and investigate the value-of-information. In such systems, the operators match tasks and resources stored in queues, with the objective of maximizing the system utility of the matching reward profile, minus the average matching cost. This problem appears in many practical systems and the main challenges are the no-underflow constraints, and the lack of matching-reward information and system dynamics statistics. We develop two online matching algorithms: Learning-aided Reward optimAl Matching (LRAM) and Dual-LRAM (DRAM) to effectively resolve both challenges. Both algorithms are equipped with a learning module for estimating the matching-reward information, while DRAM incorporates an additional module for learning the system dynamics. We show that both algorithms achieve an O(ε+δr) close-to-optimal utility performance for any ε>0, while DRAM achieves a faster convergence speed and a better delay compared to LRAM, i.e., O(δz/ε + log(1/ε)2/))delay and O(δz/ε) convergence under DRAM compared to O(1/ε) delay and convergence under LRAM (δr and δz are maximum estimation errors for reward and system dynamics). Our results reveal that information of different system components can play very different roles in algorithm performance and provide a systematic way for designing joint learning-control algorithms for dynamic systems.","PeriodicalId":338337,"journal":{"name":"Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127275976","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}

引用次数: 10

FIWEX: Compressive Sensing Based Cost-Efficient Indoor White Space Exploration FIWEX:基于压缩感知的高效室内白色空间探索

Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2015-06-22 DOI: 10.1145/2746285.2746298

Dongxin Liu, Zhihao Wu, Fan Wu, Yuan Zhang, Guihai Chen

引用次数: 24