ACM Interational Symposium on Mobile Ad Hoc Networking and Computing最新文献_第10页

The hare and the tortoise: taming wireless losses by exploiting wired reliability 兔子和乌龟:利用有线的可靠性来控制无线损耗

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107511

Anirudh Badam, M. Kaminsky, Dongsu Han, K. Papagiannaki, D. Andersen, S. Seshan

引用次数: 8

Local connectivity tests to identify wormholes in wireless networks 本地连接测试，以识别无线网络中的虫洞

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107519

Xiaomeng Ban, Rik Sarkar, Jie Gao

{"title":"Local connectivity tests to identify wormholes in wireless networks","authors":"Xiaomeng Ban, Rik Sarkar, Jie Gao","doi":"10.1145/2107502.2107519","DOIUrl":"https://doi.org/10.1145/2107502.2107519","url":null,"abstract":"A wormhole attack places two radio transceivers connected by a high capacity link and retransmits wireless signals from one antenna at the other. This creates a set of shortcut paths in the network, and may attract a lot of traffic to the wormhole link. The link thus gains control of a large fraction of network traffic which opens the door for more dangerous attacks afterwards. In this paper we introduce a wormhole detection and removal algorithm based on local connectivity tests.\u0000 The basic idea is that the neighborhood of a wormhole contains two sets of nodes corresponding to two sides of the wormhole. The distance between these two sets is small when using paths that pass through the wormhole link, but is large when only regular network paths are considered. Thus we remove a small neighborhood that will contain potential wormhole links and check if a slightly larger neighborhood falls apart to multiple connected components. To accommodate spatial and temporal unpredictability of wireless communication links we abstract the network connectivity as an arbitrary graph so that the method does not assume any idealistic models (such as unit disk graph model). The algorithm uses purely local connectivity information, handles multiple wormhole attacks and generalizes to wireless networks deployed in 3D. It does not suffer from typical limitations in previous work such as the requirements of special hardware, communication models, synchronization, node density etc. In simulations, our method is seen to beat the state of the art solutions, in particular for cases where previous solutions experience poor performance.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129323531","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}

引用次数: 37

Turning off radios to save power in multi-radio wireless mesh networks 在多无线电无线网状网络中关闭无线电以节省电力

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107532

S. Avallone

{"title":"Turning off radios to save power in multi-radio wireless mesh networks","authors":"S. Avallone","doi":"10.1145/2107502.2107532","DOIUrl":"https://doi.org/10.1145/2107502.2107532","url":null,"abstract":"Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks (WMNs). The problem how to route flows and assign channels to radios in multi-radio WMNs has attracted a lot of attention in the recent years. However, the approaches proposed so far have mainly focused on reducing interference or maximizing the throughput. Little attention has been paid to the energy consumption of wireless mesh networks. However, with the rising concerns about the energy consumed by communication infrastructures, it makes sense to consider the minimization of the energy consumption as an objective of the channel assignment and routing problem. Our work stems from the observation that an idle radio simply overhearing a frame consumes nearly the same power as the radio actually receiving the frame. Hence, energy may be saved by turning off a number of radios, if the performance of the network is not impaired. In this paper, we define the energy-efficient channel assignment and routing problem, which is NP-complete, and propose a heuristic algorithm. We also present a Mixed Integer Linear Programs (MILP) to find an optimal solution to the energy-efficient channel assignment and routing problem. Finally, we show the results of extensive simulation studies we conducted to assess the effectiveness of the proposed algorithm. Such results show that our heuristic outperforms a previous proposal and that, on the average, it keeps 10% more radios turned on than the optimal solution.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922838","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

Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks 三维无线传感器网络中具有保证投递的确定性贪婪路由

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107504

S. Xia, Xiaotian Yin, Hongyi Wu, Miao Jin, X. Gu

{"title":"Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks","authors":"S. Xia, Xiaotian Yin, Hongyi Wu, Miao Jin, X. Gu","doi":"10.1145/2107502.2107504","DOIUrl":"https://doi.org/10.1145/2107502.2107504","url":null,"abstract":"With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC) mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm, and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. As far as we know, this is the first work that realizes truly deterministic greedy routing with constant-bounded storage and computation in 3D wireless sensor networks.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126481829","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}

引用次数: 34

EM-MAC: a dynamic multichannel energy-efficient MAC protocol for wireless sensor networks EM-MAC:用于无线传感器网络的动态多通道节能MAC协议

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107533

Lei Tang, Yanjun Sun, Omer Gurewitz, David B. Johnson

{"title":"EM-MAC: a dynamic multichannel energy-efficient MAC protocol for wireless sensor networks","authors":"Lei Tang, Yanjun Sun, Omer Gurewitz, David B. Johnson","doi":"10.1145/2107502.2107533","DOIUrl":"https://doi.org/10.1145/2107502.2107533","url":null,"abstract":"Medium access control (MAC) protocols for wireless sensor networks face many challenges, including energy-efficient operation and robust support for varying traffic loads, in spite of effects such as wireless interference or even possible wireless jamming attacks. This paper presents the design and evaluation of the EM-MAC (Efficient Multichannel MAC) protocol, which addresses these challenges through the introduction of novel mechanisms for adaptive receiver-initiated multichannel rendezvous and predictive wake-up scheduling. EM-MAC substantially enhances wireless channel utilization and transmission efficiency while resisting wireless interference and jamming by enabling every node to dynamically optimize the selection of wireless channels it utilizes based on the channel conditions it senses, without use of any reserved control channel. EM-MAC achieves high energy efficiency by enabling a sender to predict the receiver's wake-up channel and wake-up time Implemented in TinyOS on MICAz motes, EM-MAC substantially outperformed other MAC protocols studied. EM-MAC maintained the lowest sender and receiver duty cycles, the lowest packet delivery latency, and 100% packet delivery ratio across all experiments. Our evaluation includes single-hop and multihop flows, as well as experiments with heavy ZigBee interference, constant ZigBee jamming, and Wi-Fi interference.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128911657","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}

引用次数: 215

Truthful auction for cooperative communications 诚实拍卖，合作沟通

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107514

Dejun Yang, Xi Fang, G. Xue

引用次数: 149

UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks 展开:动态三维无线传感器网络的统一快速在线边界检测

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107520

Feng Li, Jun Luo, Chi Zhang, Shiqing Xin, Ying He

{"title":"UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks","authors":"Feng Li, Jun Luo, Chi Zhang, Shiqing Xin, Ying He","doi":"10.1145/2107502.2107520","DOIUrl":"https://doi.org/10.1145/2107502.2107520","url":null,"abstract":"A wireless sensor network becomes dynamic if it is monitoring a time-variant event (e.g., expansion of oil spill in ocean). In such applications, on-line boundary detection is a crucial function, as it allows us to track the event variation in a timely fashion. However, the problem becomes very challenging as it demands a highly efficient algorithm to cope with the dynamics introduced by the evolving event. Moreover, as many physical events occupy volumes rather than surfaces (e.g., oil spill again), the algorithm has to work for 3D cases. To this end, we propose UNiform Fast On-Line boundary Detection (UNFOLD) to tackle the challenge. The essence of UNFOLD is to inverse node coordinates such that a \"notched\" surface is \"unfolded\" into a convex one, which in turn reduces boundary detection to simple convexity test. UNFOLD is uniform as every node behaves the same (performing coordinate inversion and convexity test), and it is super fast as both computation and communication involve only one-hop neighbors. We prove the correctness and efficiency of UNFOLD; we also use simulations and implementations to evaluate its performance, which demonstrates that UNFOLD is 100 times more time and energy efficient than the most up-to-date proposal.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591344","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}

引用次数: 22

Wireless coverage with disparate ranges 不同范围的无线覆盖

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107517

P. Wan, Xiaohua Xu, Zhu Wang

引用次数: 33

Energy-efficient polling protocols in RFID systems RFID系统中的节能轮询协议

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107535

Yan Qiao, Shigang Chen, Tao Li, Shiping Chen

{"title":"Energy-efficient polling protocols in RFID systems","authors":"Yan Qiao, Shigang Chen, Tao Li, Shiping Chen","doi":"10.1145/2107502.2107535","DOIUrl":"https://doi.org/10.1145/2107502.2107535","url":null,"abstract":"Future RFID technologies will go far beyond today's widely-used passive tags. Battery-powered active tags are likely to gain more popularity due to their long operational ranges and richer on-tag resources. With integrated sensors, these tags can provide not only static identification numbers but also dynamic, real-time information such as sensor readings. This paper studies a general problem of how to design efficient polling protocols to collect such real-time information from a subset M of tags in a large RFID system. We show that the standard, straightforward polling design is not energy-efficient because each tag has to continuously monitor the wireless channel and receive O(|M|) tag IDs, which is energy-consuming. Existing work is able to cut the amount of data each tag has to receive by half through a coding design. In this paper, we propose a tag-ordering polling protocol (TOP) that can reduce per-tag energy consumption by more than an order of magnitude. We also reveal an energy-time tradeoff in the protocol design: per-tag energy consumption can be reduced to O(1) at the expense of longer execution time of the protocol. Finally, we apply partitioned Bloom filters to enhance the performance of TOP, such that it can achieve much better energy efficiency without degradation in protocol execution time.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124447011","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}

引用次数: 89

Dispatch-and-search: dynamic multi-ferry control in partitioned mobile networks 调度与搜索:分区移动网络中的动态多轮渡控制

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107525

T. He, A. Swami, Kang-Won Lee

{"title":"Dispatch-and-search: dynamic multi-ferry control in partitioned mobile networks","authors":"T. He, A. Swami, Kang-Won Lee","doi":"10.1145/2107502.2107525","DOIUrl":"https://doi.org/10.1145/2107502.2107525","url":null,"abstract":"We consider the problem of disseminating data from a base station to a sparse, partitioned mobile network by controllable data ferries with limited ferry-node and ferry-ferry communication ranges. Existing solutions to data ferry control mostly assume the nodes to be stationary, which reduces the problem to designing fixed ferry routes. In the more challenging scenario of mobile networks, existing solutions have focused on single-ferry control and left out an important issue of ferry cooperation in the presence of multiple ferries. In this paper, we jointly address the issues of ferry navigation and cooperation using the approach of stochastic control. Under the assumption that ferries can communicate within each partition, we propose a hierarchical control system called Dispatch-and-Search (DAS), consisting of a global controller that dispatches ferries to individual partitions and local controllers that coordinate the search for nodes within each partition. Formulating the global and the local control as Partially Observable Markov Decision Processes (POMDPs), we develop efficient control policies to optimize the (discounted) total throughput, which significantly improve the performance of their predetermined counterparts in cases of limited prior knowledge.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124615486","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