Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing最新文献_第3页

On traveling path and related problems for a mobile station in a rechargeable sensor network 可充电传感器网络中移动站的行进路径及相关问题研究

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491291

Liguang Xie, Yi Shi, Y. Thomas Hou, W. Lou, H. Sherali

引用次数: 109

Route-switching games in cognitive radio networks 认知无线电网络中的路由交换博弈

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491316

Qingkai Liang, Xinbing Wang, Xiaohua Tian, Qian Zhang

{"title":"Route-switching games in cognitive radio networks","authors":"Qingkai Liang, Xinbing Wang, Xiaohua Tian, Qian Zhang","doi":"10.1145/2491288.2491316","DOIUrl":"https://doi.org/10.1145/2491288.2491316","url":null,"abstract":"In Cognitive Radio Networks (CRNs), Secondary Users (SUs) are provided with the flexibility of accessing Primary Users' (PUs') idle spectrum bands but the availability of spectra is dynamic due to PUs' uncertain activities of channel reclamation. In the multi-hop CRNs consisting of SUs as relays, such spectrum mobility will cause the invalidity of pre-determined routes of data flows since some of the channels pre-assigned to the routes become unavailable. In this paper, we investigate the spectrum-mobility-incurred route-switching problem in both spatial and frequency domains for CRNs, where the spatial switching determines which relays and links should be re-selected and the frequency switching decides which channels ought to be re-assigned to the spatial routes. We further formulate the route-switching problem as the Route-Switching Game which is shown to be a potential game and has a pure Nash Equilibrium (NE). Accordingly, an efficient algorithm for finding the NE is proposed. The proposed route-switching scheme not only avoids conflicts with PUs but also mitigates spectrum congestion. Meanwhile, tradeoffs between routing costs and channel switching costs are achieved.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133398467","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

Model-driven energy-aware rate adaptation 模型驱动的能量感知速率适应

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491300

Muhammad Owais Khan, Vacha Dave, Yi-Chao Chen, Oliver Jensen, L. Qiu, Apurv Bhartia, S. Rallapalli

{"title":"Model-driven energy-aware rate adaptation","authors":"Muhammad Owais Khan, Vacha Dave, Yi-Chao Chen, Oliver Jensen, L. Qiu, Apurv Bhartia, S. Rallapalli","doi":"10.1145/2491288.2491300","DOIUrl":"https://doi.org/10.1145/2491288.2491300","url":null,"abstract":"Rate adaptation in WiFi networks has received significant attention recently. However, most existing work focuses on selecting the rate to maximize throughput. How to select a data rate to minimize energy consumption is an important yet under-explored topic. This problem is becoming increasingly important with the rapidly increasing popularity of MIMO deployment, because MIMO offers diverse rate choices (e.g., the number of antennas, the number of streams, modulation, and FEC coding) and selecting the appropriate rate has significant impact on power consumption. In this paper, we first use extensive measurement to develop a simple yet accurate energy model for 802.11n wireless cards. Then we use the models to drive the design of energy-aware rate adaptation scheme. A major benefit of a model-based rate adaptation is that applying a model allows us to eliminate frequent probes in many existing rate adaptation schemes so that it can quickly converges to the appropriate data rate. We demonstrate the effectiveness of our approach using trace-driven simulation and real implementation in a wireless testbed.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133518995","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}

引用次数: 32

Detecting epidemics using highly noisy data 利用高噪声数据检测流行病

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491294

Chris Milling, C. Caramanis, Shie Mannor, S. Shakkottai

{"title":"Detecting epidemics using highly noisy data","authors":"Chris Milling, C. Caramanis, Shie Mannor, S. Shakkottai","doi":"10.1145/2491288.2491294","DOIUrl":"https://doi.org/10.1145/2491288.2491294","url":null,"abstract":"From Cholera, AIDS/HIV, and Malaria, to rumors and viral video, understanding the causative network behind an epidemic's spread has repeatedly proven critical for managing the spread (controlling or encouraging, as the case may be). Our current approaches to understand and predict epidemics rely on the scarce, but exact/reliable, expert diagnoses. This paper proposes a different way forward: use more readily available but also more noisy data with {em many false negatives and false positives}, to determine the causative network of an epidemic. Specifically, we consider an epidemic that spreads according to one of two networks. At some point in time we see a small random subsample (perhaps a vanishingly small fraction) of those infected, along with an order-wise similar number of false positives. We derive sufficient conditions for this problem to be detectable, and provide an efficient algorithm that solves the hypothesis testing problem. We apply this model to two settings. In the first setting, we simply want to distinguish between random illness (a complete graph) and an epidemic (spread along a structured graph). In the second, we have a superposition of both of these, and we wish to detect which is the strongest component.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673415","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}

引用次数: 20

Barrier coverage in bistatic radar sensor networks: cassini oval sensing and optimal placement 双基地雷达传感器网络中的屏障覆盖:卡西尼椭圆传感和最佳布局

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491305

Xiaowen Gong, Junshan Zhang, D. Cochran, Kai Xing

{"title":"Barrier coverage in bistatic radar sensor networks: cassini oval sensing and optimal placement","authors":"Xiaowen Gong, Junshan Zhang, D. Cochran, Kai Xing","doi":"10.1145/2491288.2491305","DOIUrl":"https://doi.org/10.1145/2491288.2491305","url":null,"abstract":"By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much recent attention has been given to multistatic and MIMO radar concepts, little has been paid to understanding the performance of radar networks (i.e., multiple individual radars working in concert). In this context, we study the optimal placement of a bistatic radar (BR) sensor network for barrier coverage. The coverage problem in a bistatic radar network (BRN) is challenging because: 1) in contrast to the disk sensing model of a traditional passive sensor, the sensing region of a BR depends on the locations of both the BR transmitter and receiver, and is characterized by a Cassini oval; 2) since a BR transmitter (or receiver) can potentially form multiple BRs with different BR transmitters (or receivers, respectively), the sensing regions of different BRs are coupled, making the coverage of a BRN highly non-trivial. This paper considers the problem of deploying a network of BRs in a region for maximizing the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that the shortest barrier-based placement is optimal if the shortest barrier is also the shortest line segment connecting the region's two boundaries. Based on this observation, we study the optimal placement of the BRs on a line segment for minimizing its vulnerability, which is a non-convex optimization problem. By exploiting some specific structural properties pertaining to the problem (particularly an important structure of detectability), we find the optimal placement order and the optimal placement spacing of the BR nodes, both of which exhibit elegant balanced structures. Our findings give valuable insight for the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the coverage of a network of BRs.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109542","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}

引用次数: 32

On bridging the gap between homogeneous and heterogeneous rendezvous schemes for cognitive radios 认知无线电中同质和异质会合方案之间的桥梁

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491295

Ching-Chan Wu, Shan-Hung Wu

{"title":"On bridging the gap between homogeneous and heterogeneous rendezvous schemes for cognitive radios","authors":"Ching-Chan Wu, Shan-Hung Wu","doi":"10.1145/2491288.2491295","DOIUrl":"https://doi.org/10.1145/2491288.2491295","url":null,"abstract":"Cognitive radio allows radio devices to access the idle spectrum opportunistically, thus alleviates the huge demand for spectrum. Rendezvous, where two radios complete handshaking in an idle channel, is a key step for cognitive radios to start communication. Radios may have the same (homogeneous) or different (heterogeneous) spectrum sensing capabilities. Currently, there is a \"gap\" between the rendezvous algorithms for homogeneous and heterogeneous cognitive radios---existing homogeneous algorithms incur high delay when applied to heterogeneous radios; while heterogeneous algorithms incur high congestion when applied to homogeneous radios. Since mixtures of these two types of radios appear commonly in practice, it is crucial to bridge the gap between the respective rendezvous algorithms. In this paper, we propose a new rendezvous algorithm, named the ICH scheme, for arbitrary mixtures of radios with homogeneous or heterogeneous spectrum sensing capabilities. Rigorous analysis and extensive simulations are conducted and show that ICH is the first rendezvous scheme that guarantees rendezvous for arbitrary mixtures of homogeneous and heterogeneous radios without incurring large delay and congestion.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165316","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}

引用次数: 29

LED-to-LED visible light communication networks led到led可见光通信网络

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491293

Stefan Schmid, Giorgio Corbellini, S. Mangold, T. Gross

引用次数: 146

On the instantaneous topology of a large-scale urban vehicular network: the cologne case 大型城市车辆网络的瞬时拓扑:科隆案例

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491312

Diala Naboulsi, M. Fiore

引用次数: 92

ProBeam: a practical multicell beamforming system for OFDMA small-cell networks ProBeam:一个实用的多小区波束形成系统，用于OFDMA小小区网络

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491309

Jongwon Yoon, K. Sundaresan, M. Khojastepour, S. Rangarajan, Suman Banerjee

{"title":"ProBeam: a practical multicell beamforming system for OFDMA small-cell networks","authors":"Jongwon Yoon, K. Sundaresan, M. Khojastepour, S. Rangarajan, Suman Banerjee","doi":"10.1145/2491288.2491309","DOIUrl":"https://doi.org/10.1145/2491288.2491309","url":null,"abstract":"Small cells form a critical component of next generation cellular networks, where spatial reuse is the key to higher spectral efficiencies. Interference management in the spatial domain through beamforming allows for increased reuse without having to sacrifice resources in the time or frequency domain. Existing beamforming techniques for spatial reuse, being coupled with client scheduling, face a key limitation in practical realization, especially with OFDMA small cells. In this context, we argue that for a practical spatial reuse system with beamforming, it is important to decouple beamforming from client scheduling. Further, we show that jointly addressing client association with beamforming is critical to maximizing the reuse potential of beamforming. Towards our goal, we propose ProBeam -- a practical multi-cell beamforming system for reuse in small cell networks. ProBeam incorporates two key components - a low complexity, highly accurate SINR estimation module that helps determine interference dependencies for beamforming between small cells; and an efficient, low complexity joint client association and beam selection algorithm for the small cells that accounts for scheduling at the small cells without being coupled with it. We have prototyped ProBeam on a WiMAX-based network of four small cells. Our evaluations reveal the accuracy of our SINR estimation module to be within 1 dB, and the reuse gains from joint client association and beamforming to be as high as 115% over baseline approaches.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115015836","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}

引用次数: 13

Social trust and social reciprocity based cooperative D2D communications 基于社会信任和社会互惠的合作D2D通信

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491302

Xu Chen, Brian Proulx, Xiaowen Gong, Junshan Zhang

{"title":"Social trust and social reciprocity based cooperative D2D communications","authors":"Xu Chen, Brian Proulx, Xiaowen Gong, Junshan Zhang","doi":"10.1145/2491288.2491302","DOIUrl":"https://doi.org/10.1145/2491288.2491302","url":null,"abstract":"Thanks to the convergence of pervasive mobile communications and fast-growing online social networking, mobile social networking is penetrating into our everyday life. Aiming to develop a systematic understanding of the interplay between social structure and mobile communications, in this paper we exploit social ties in human social networks to enhance cooperative device-to-device communications. Specifically, as hand-held devices are carried by human beings, we leverage two key social phenomena, namely social trust and social reciprocity, to promote efficient cooperation among devices. With this insight, we develop a coalitional game theoretic framework to devise social-tie based cooperation strategies for device-to-device communications. We also develop a network assisted relay selection mechanism to implement the coalitional game solution, and show that the mechanism is immune to group deviations, individually rational, and truthful. We evaluate the performance of the mechanism by using real social data traces. Numerical results show that the proposed mechanism can achieve up-to 122% performance gain over the case without D2D cooperation.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133022328","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}

引用次数: 115