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

Mobile social networking through friend-to-friend opportunistic content dissemination 移动社交网络通过朋友对朋友的机会主义内容传播

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

Kanchana Thilakarathna, A. C. Viana, A. Seneviratne, H. Petander

引用次数: 35

Randomized skip lists-based private authentication for large-scale RFID systems 基于随机跳跃表的大规模RFID系统私有认证

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

Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, T. Lai

引用次数: 8

Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels 带衰落信道调度的最大加权独立集分布贪心逼近

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

Changhee Joo, Xiaojun Lin, Jiho Ryu, N. Shroff

{"title":"Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels","authors":"Changhee Joo, Xiaojun Lin, Jiho Ryu, N. Shroff","doi":"10.1145/2491288.2491297","DOIUrl":"https://doi.org/10.1145/2491288.2491297","url":null,"abstract":"Developing scheduling mechanisms that can simultaneously achieve throughput optimality and good delay performance often require solving the Maximum Independent Weighted Set (MWIS) problem. However, under most realistic network settings, the MWIS problem can be shown to be NP-hard. In non-fading environments, low-complexity scheduling algorithms have been provided that converge either to the MWIS solution in time or to a solution that achieves at least a provable fraction of the achievable throughput. However, in more practical systems the channel conditions can vary at faster time-scales than convergence occurs in these lower-complexity algorithms. Hence, these algorithms cannot take advantage of the opportunistic gain, and may no longer guarantee good performance. In this paper, we propose a low-complexity scheduling scheme that performs provably well under fading channels and is amenable to implement in a distributed manner. To the best of our knowledge, this is the first scheduling scheme under fading environments that requires only local information, has a low complexity that grows logarithmically with the network size, and achieves provable performance guarantees (which is arbitrarily close to that of the well-known centralized Greedy Maximal Scheduler). Through simulations we verify that both the throughput and the delay under our proposed distributed scheduling scheme are close to that of the optimal solution to MWIS. Further, we implement a preliminary version of our algorithm in a testbed by modifying the existing IEEE 802.11 DCF. The preliminary experiment results show that our implementation successfully accounts for wireless fading, and attains the opportunistic gains in practice, and hence substantially outperforms IEEE 802.11 DCF.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"11 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":"133482283","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}

引用次数: 11

Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks 无线网络中具有时空复用的近最优真实频谱拍卖机制

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

He Huang, Yu-e Sun, Xiangyang Li, Zhili Chen, Wei Yang, Hongli Xu

引用次数: 13

A distributed delaunay triangulation algorithm based on centroidal voronoi tessellation for wireless sensor networks 一种基于质心voronoi镶嵌的无线传感器网络分布式延迟三角剖分算法

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

Hongyu Zhou, Miao Jin, Hongyi Wu

{"title":"A distributed delaunay triangulation algorithm based on centroidal voronoi tessellation for wireless sensor networks","authors":"Hongyu Zhou, Miao Jin, Hongyi Wu","doi":"10.1145/2491288.2491296","DOIUrl":"https://doi.org/10.1145/2491288.2491296","url":null,"abstract":"A wireless sensor network can be represented by a graph. While the network graph is extremely useful, it often exhibits undesired irregularity. Therefore, special treatment of the graph is required by a variety of network algorithms and protocols. In particular, many geometry-oriented algorithms depend on a type of subgraph called Delaunay triangulation. However, when location information is unavailable, it is nontrivial to achieve Delaunay triangulation by using connectivity information only. The only connectivity-based algorithm available for Delaunay triangulation is built upon the property that the dual graph for a Voronoi diagram is a Delaunay triangulation. This approach, however, often fails in practical wireless sensor networks because the boundaries of Voronoi cells can be arbitrarily short in discrete sensor network settings. In a sensor network with connectivity information only, it is fundamentally unattainable to correctly judge neighboring cells when a Voronoi cell boundary is less than one hop. Consequently, the Voronoi diagram-based Delaunay triangulation fails. The proposed algorithm employs a distributed approach to perform centroidal Voronoi tessellation, and constructs its dual graph to yield Delaunay triangulation. It exhibits several distinctive properties. First, it eliminates the problem due to short cell boundaries and thus effectively avoids crossing edges. Second, the proposed algorithm is proven to converge and succeed in constructing a Delaunay triangulation, if the CVT cell size is greater than a constant threshold. Third, the established Delaunay triangulation consists of close-to-equilateral triangles, benefiting a range of applications such as geometric routing, localization, coverage, segmentation, and data storage and processing. Extensive simulations are carried out under various 2D network models to evaluate the effectiveness and efficiency of the proposed CVT-based triangulation algorithm.","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":"130584797","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}

引用次数: 16

MINT: maximizing information propagation in predictable delay-tolerant network MINT:在可预测的延迟容忍网络中最大化信息传播

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

Shaojie Tang, Jing Yuan, Xiangyang Li, Yang Wang, Cheng Wang, Xuefeng Liu

引用次数: 3

Scheduling of access points for multiple live video streams 调度多个实时视频流的接入点

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-06-10 DOI: 10.1145/2491288.2491320

I.-Hong Hou, Rahul Singh

引用次数: 17

CSMA over time-varying channels: optimality, uniqueness and limited backoff rate 时变信道上的CSMA:最优性、唯一性和有限的退步率

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-06-09 DOI: 10.1145/2491288.2491303

Seyoung Yun, Jinwoo Shin, Yung Yi

{"title":"CSMA over time-varying channels: optimality, uniqueness and limited backoff rate","authors":"Seyoung Yun, Jinwoo Shin, Yung Yi","doi":"10.1145/2491288.2491303","DOIUrl":"https://doi.org/10.1145/2491288.2491303","url":null,"abstract":"Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) algorithms can be throughput optimal for arbitrary wireless network topology. However, these results are highly sensitive to the underlying assumption on `static' or `fixed' system conditions. For example, if channel conditions are time-varying, it is unclear how each node can adjust its CSMA parameters, so-called backoff and channel holding times, using its local channel information for the desired high performance. In this paper, we study `channel-aware' CSMA (A-CSMA) algorithms in time-varying channels, where they adjust their parameters as some function of the current channel capacity. First, we show that the achievable rate region of A-CSMA equals to the maximum rate region if and only if the function is exponential. Furthermore, given an exponential function in A-CSMA, we design updating rules for their parameters, which achieve throughput optimality for an arbitrary wireless network topology. They are the first CSMA algorithms in the literature which are proved to be throughput optimal under time-varying channels. Moreover, we also consider the case when back-off rates of A-CSMA are highly restricted compared to the speed of channel variations, and characterize the throughput performance of A-CSMA in terms of the underlying wireless network topology. Our results not only guide a high-performance design on MAC scheduling under highly time-varying scenarios, but also provide new insights on the performance of CSMA algorithms in relation to their backoff rates and underlying network topologies.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795816","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

Balancing lifetime and classification accuracy of wireless sensor networks 平衡无线传感器网络的寿命和分类精度

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2012-08-10 DOI: 10.1145/2491288.2491289

Kush R. Varshney, P. Ven

{"title":"Balancing lifetime and classification accuracy of wireless sensor networks","authors":"Kush R. Varshney, P. Ven","doi":"10.1145/2491288.2491289","DOIUrl":"https://doi.org/10.1145/2491288.2491289","url":null,"abstract":"Wireless sensor networks are composed of distributed sensors that can be used for signal detection or classification. The likelihood functions of the hypotheses are often not known in advance, and decision rules have to be learned via supervised learning. A specific learning algorithm is Fisher discriminant analysis (FDA), the classification accuracy of which has been previously studied in the context of wireless sensor networks. Previous work, however, does not take into account the communication protocol or battery lifetime; in this paper we extend existing studies by proposing a model that captures the relationship between battery lifetime and classification accuracy. To do so, we combine the FDA with a model that captures the dynamics of the carrier-sense multiple-access (CSMA) algorithm, the random-access algorithm used to regulate communications in sensor networks. This allows us to study the interaction between the classification accuracy, battery lifetime and effort put towards learning, as well as the impact of the back-off rates of CSMA on the accuracy. We characterize the tradeoff between the length of the training stage and accuracy, and show that accuracy is non-monotone in the back-off rate due to changes in the training sample size and overfitting.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348775","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}

引用次数: 1