ACM Interational Symposium on Mobile Ad Hoc Networking and Computing最新文献

Demo: recommendation system for dynamic spectrum access through spectrum mining and prediction 演示:通过频谱挖掘和预测实现动态频谱接入的推荐系统

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2636059

Ying Dai, Andrew Daniels, Jie Wu

引用次数: 0

Compressive sensing meets unreliable link: sparsest random scheduling for compressive data gathering in lossy WSNs 压缩感知满足不可靠链路:损耗无线传感器网络中压缩数据采集的最稀疏随机调度

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632969

Xuangou Wu, Panlong Yang, Taeho Jung, Yan Xiong, Xiao Zheng

{"title":"Compressive sensing meets unreliable link: sparsest random scheduling for compressive data gathering in lossy WSNs","authors":"Xuangou Wu, Panlong Yang, Taeho Jung, Yan Xiong, Xiao Zheng","doi":"10.1145/2632951.2632969","DOIUrl":"https://doi.org/10.1145/2632951.2632969","url":null,"abstract":"Compressive Sensing (CS) has been recognized as a promising technique to reduce and balance the transmission cost in wireless sensor networks (WSNs). Existing efforts mainly focus on applying CS to reliable WSNs, namely, each wireless link is 100% reliable. However, our experimental results show that traditional compressive data gathering (CDG) could result in arbitrarily bad recovery performance, when the wireless links are lossy. In this paper, we study the impact of packet loss on compressive data gathering and ways to improve its robustness using sparsest random scheduling (SRS). The key idea of our scheme is to treat each sampling value as one CS measurement, which helps us to reduce the impact of packet loss on the recovery accuracy. Our scheme also outperforms the tradition CDG in reliable WSNs in that our scheme has significantly lowered transmission cost. To achieve this, we present a sparsest measurement matrix where each row has only one nonzero element. More importantly, we propose a representation basis to sparsify the gathering data, and prove that our measurement matrix satisfies the restricted isometric property (RIP) with high probability. Extensive experimental results show our scheme can recover the data accurately with packet loss ratio up to $15%$, while traditional CDG can hardly recover the data under similar or even better conditions.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130275570","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}

引用次数: 19

Heterogeneous multi-channel neighbor discovery formobile sensing applications: theoretical foundationand protocol design 移动传感应用的异构多通道邻居发现:理论基础和协议设计

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632972

Lin Chen, Kaigui Bian, M. Zheng

{"title":"Heterogeneous multi-channel neighbor discovery formobile sensing applications: theoretical foundationand protocol design","authors":"Lin Chen, Kaigui Bian, M. Zheng","doi":"10.1145/2632951.2632972","DOIUrl":"https://doi.org/10.1145/2632951.2632972","url":null,"abstract":"Neighbor discovery is of paramount importance in mobile sensing applications that rely heavily on data timely collected and shared among nearby users. Guaranteed discovery with bounded latency and supporting heterogenous duty cycles to provide fine-grained control of energy conservation levels are among the most crucial requirements in the design of efficient neighbor discovery protocols. While simultaneously satisfying these two requirements is non-trivial, the situation is exacerbated if the operating frequencies of mobile devices span multiple channels and discovery occurs only if nodes switch to the same channel. In this paper, we formulate this problem as heterogeneous multi-channel neighbor discovery problem and establish a theoretical framework of the problem, under which we derive the performance bound of any neighbor discovery protocol. Based on the theoretical results, we then develop Mc-Dis (Multi-channel Discovery), a novel multi-channel discovery protocol that (1) achieves guaranteed discovery with order-minimal worst-case discovery delay and (2) supports almost all duty cycles to provide fine-grained control of energy conservation levels.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920349","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

Poster: bacteria inspired mitigation of selfish users in ad-hoc social networks 海报:细菌激发了自组织社交网络中自私用户的减少

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2635933

A. M. Ahmed, Feng Xia, Qiuyuan Yang, Hannan Bin Liaqat, Zhikui Chen, Tie Qiu

引用次数: 4

Poster: modeling the performance of routing in heterogeneous delay-tolerant networks 海报:异构容忍延迟网络中路由性能的建模

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2635937

Dongyang Wang, Muqing Wu, Bo Lv

引用次数: 0

Secrecy capacity scaling of large-scale cognitive networks 大规模认知网络的保密能力扩展

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632961

Yitao Chen, Jinbei Zhang, Xinbing Wang, Xiaohua Tian, Weijie Wu, Fan Wu, C. Tan

{"title":"Secrecy capacity scaling of large-scale cognitive networks","authors":"Yitao Chen, Jinbei Zhang, Xinbing Wang, Xiaohua Tian, Weijie Wu, Fan Wu, C. Tan","doi":"10.1145/2632951.2632961","DOIUrl":"https://doi.org/10.1145/2632951.2632961","url":null,"abstract":"Increasingly, more spectrum bands are utilized for unlicensed use in wireless cognitive networks. It is important to study how information-theoretic secrecy capacity is affected in large-scale cognitive networks. We consider two scenarios: (1) non-colluding case, where eavesdroppers decode messages individually. In this case, we propose a new secure protocol model to analyze the transmission opportunities of secondary nodes. We show that the secrecy capacity of the primary network is not affected, while the secondary network can achieve the same performance as a standalone network in the order sense. Since our analysis is general as we only make a few relaxed assumptions on both networks, the conclusions hold when both networks are classic static networks, networks with i.i.d mobility, multicast networks etc. (2) colluding case where eavesdroppers can collude to decode a message. In that case, we show that the lower bound of per-node secrecy capacity of the primary network is Ω(1/√n φe-2/α-1(n)) when the eavesdropper density is φe(n)=Ω(log2n). Interestingly the existence of secondary nodes increases the secrecy capacity of the primary network.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"25 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125741561","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

Trace-routing in 3D wireless sensor networks: a deterministic approach with constant overhead 三维无线传感器网络中的跟踪路由:具有恒定开销的确定性方法

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632977

S. Xia, Hongyi Wu, Miao Jin

引用次数: 9

Truthful prioritization for dynamic bandwidth sharing 动态带宽共享的真实优先级

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632956

V. Shnayder, D. Parkes, Vikas Kawadia, Jeremy Hoon

引用次数: 1

COSMOS: computation offloading as a service for mobile devices COSMOS:作为移动设备服务的计算卸载

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632958

Cong Shi, Karim Habak, Pranesh Pandurangan, M. Ammar, M. Naik, E. Zegura

{"title":"COSMOS: computation offloading as a service for mobile devices","authors":"Cong Shi, Karim Habak, Pranesh Pandurangan, M. Ammar, M. Naik, E. Zegura","doi":"10.1145/2632951.2632958","DOIUrl":"https://doi.org/10.1145/2632951.2632958","url":null,"abstract":"There is great potential for boosting the performance of mobile devices by offloading computation-intensive parts of mobile applications to the cloud. The full realization of this potential is hindered by a mismatch between how individual mobile devices demand computing resources and how cloud providers offer them: offloading requests from a mobile device usually require quick response, may be infrequent, and are subject to variable network connectivity, whereas cloud resources incur relatively long setup times, are leased for long time quanta, and are indifferent to network connectivity. In this paper, we present the design and implementation of the COSMOS system, which bridges this gap by providing computation offloading as a service to mobile devices. COSMOS efficiently manages cloud resources for offloading requests to both improve offloading performance seen by mobile devices and reduce the monetary cost per request to the provider. COSMOS also effectively allocates and schedules offloading requests to resolve the contention for cloud resources. Moreover, COSMOS makes offloading decisions in a risk-controlled manner to overcome the uncertainties caused by variable network connectivity and program execution. We have implemented COSMOS for Android and explored its design space through computation offloading experiments to Amazon EC2 across different applications and in various settings. We find that COSMOS, configured with the right design choices, has significant potential in reducing the cost of providing cloud resources to mobile devices while at the same time enabling mobile computation speedup.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115572063","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}

引用次数: 184

Latency-optimized broadcast in mobile ad hoc networks without node coordination 无节点协调移动自组网中的延迟优化广播

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2014-08-11 DOI: 10.1145/2632951.2632982

Bin Tang, Baoliu Ye, Sanglu Lu, Song Guo, I. Stojmenovic

{"title":"Latency-optimized broadcast in mobile ad hoc networks without node coordination","authors":"Bin Tang, Baoliu Ye, Sanglu Lu, Song Guo, I. Stojmenovic","doi":"10.1145/2632951.2632982","DOIUrl":"https://doi.org/10.1145/2632951.2632982","url":null,"abstract":"We consider the problem of broadcasting a message in a mobile ad hoc network (MANET) with the objective of minimizing the broadcast latency. Due to the mobility of network nodes, the coordination among nodes is hard and expensive. Thus it is much desired to design efficient, one-sided broadcast protocols where each node acts according to its own state solely. Although random scheduling is a popular and effective one-sided approach for leveraging the broadcast nature of wireless medium while coping with transmission collisions, both critical for reducing the broadcast latency, in this paper, we show that when nodes move very fast, the performance of pure random scheduling must be sub-optimal, no matter how the forwarding probabilities are specified. Furthermore, we propose a novel one-sided broadcast protocol named R2, which first splits the message into a certain number of mini-messages and then couples a fine-grained random scheduling with random linear network coding for broadcasting the mini-messages. Theoretical analyses demonstrate that R$^2$ performs optimally in order sense, no matter how fast network nodes move around, although different mobility has distinct effect on the speed of message broadcast.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130182387","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}

引用次数: 2