ACM/IEEE International Conference on Mobile Computing and Networking最新文献_第7页

Optimal beam scheduling for multicasting in wireless networks 无线网络中多播的最优波束调度

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614343

K. Sundaresan, Kishore Ramachandran, S. Rangarajan

{"title":"Optimal beam scheduling for multicasting in wireless networks","authors":"K. Sundaresan, Kishore Ramachandran, S. Rangarajan","doi":"10.1145/1614320.1614343","DOIUrl":"https://doi.org/10.1145/1614320.1614343","url":null,"abstract":"We consider the problem of efficient link-layer multicasting in wireless networks with switched beamforming antennas. The inherent tradeoff between multicasting and beamforming -- the broadcast advantage of low-gain omni-directional transmissions versus the high-gain but spatially restricted transmissions of beamforming antennas -- makes this problem especially challenging.\u0000 In this paper, we design and evaluate optimal algorithms, and easy-to-implement greedy algorithms with performance guarantees, that generate and schedule efficient beam patterns for multicast transmissions. These algorithms are built upon the novel usage of composite beams that provide a knob to control the operating point of the tradeoff curve. This is in contrast to the sub-optimal usage of either purely directional or omni-directional beams by existing schemes. We further consider two models for composite beam pattern generation: one in which transmit power is (a) equally split, and (b) asymmetrically split between the constituent main lobes. A systematic evaluation, using real world traces obtained from measurements using an eight element switched beamforming antenna in an indoor office environment, indicates significant gains of about four folds over omni and two folds over prior art schemes.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129488511","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}

引用次数: 62

Lifetime and coverage guarantees through distributed coordinate-free sensor activation 通过分布式无坐标传感器激活保证使用寿命和覆盖范围

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614339

G. Kasbekar, Y. Bejerano, S. Sarkar

{"title":"Lifetime and coverage guarantees through distributed coordinate-free sensor activation","authors":"G. Kasbekar, Y. Bejerano, S. Sarkar","doi":"10.1145/1614320.1614339","DOIUrl":"https://doi.org/10.1145/1614320.1614339","url":null,"abstract":"Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distributed sensing of a target field. Each sensor is a small battery-operated device that can sense events of interest in its sensing range and can communicate with neighboring sensors. A sensor cover is a subset of the set of all sensors such that every point in the target field is in the interior of the sensing ranges of at least $k$ different sensors in the subset, where k is a given positive integer. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with non-zero remaining energy does not constitute a sensor cover. An important goal in sensor networks is to design a schedule, that is, a sequence of sensor covers to activate in every time slot, so as to maximize the lifetime of the network. In this paper, we design a polynomial-time, distributed algorithm for maximizing the lifetime of the network and prove that its lifetime is at most a factor O(log n * log nB) lower than the maximum possible lifetime, where n is the number of sensors and B is an upper bound on the initial energy of each sensor. Our algorithm does not require knowledge of the locations of nodes or directional information, which is difficult to obtain in sensor networks. Each sensor only needs to know the distances between adjacent nodes in its transmission range and their sensing radii. In every slot, the algorithm first assigns a weight to each node that is exponential in the fraction of its initial energy that has been used up so far. Then, in a distributed manner, it finds a O(log n) approximate minimum weight sensor cover which it activates in the slot. Our simulations reveal that our algorithm substantially outperforms several existing lifetime maximization algorithms.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806578","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}

引用次数: 110

Esense: communication through energy sensing 感知:通过能量感知进行交流

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614330

Kameswari Chebrolu, Ashutosh Dhekne

{"title":"Esense: communication through energy sensing","authors":"Kameswari Chebrolu, Ashutosh Dhekne","doi":"10.1145/1614320.1614330","DOIUrl":"https://doi.org/10.1145/1614320.1614330","url":null,"abstract":"In this paper, we present Esense: a new paradigm of communication between devices that have fundamentally different physical layers. The same communication framework also works between devices that have the same physical layer, which are out of communication range but within carrier-sense range. Esense is based on sensing and interpreting energy profiles. While our ideas are generic enough to be applicable in a variety of contexts, we illustrate the usefulness of our ideas by presenting novel solutions to existing problems in three distinct research domains. As part of these solutions, we demonstrate the ability to communicate between devices that follow two different standards: IEEE 802.11 and 802.15.4. We build an ``alphabet set'': a set of signature packet sizes which can be used for Esense. For this, we take a measurement based approach by considering WiFi traces from actual deployments. We then analyze the channel activity resulting from these traces and build an appropriate alphabet set for Esense communication. Our results show that we could potentially construct an alphabet of size as high as 100; such a large alphabet size promises efficient Esense communication. We also validate this alphabet set via a prototype implementation, and show that effective communication is indeed feasible even when both sides use different physical layers.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133952422","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}

引用次数: 194

A quorum-based framework for establishing control channels in dynamic spectrum access networks 一种基于群体的动态频谱接入网控制信道建立框架

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614324

Kaigui Bian, J. Park, Ruiliang Chen

{"title":"A quorum-based framework for establishing control channels in dynamic spectrum access networks","authors":"Kaigui Bian, J. Park, Ruiliang Chen","doi":"10.1145/1614320.1614324","DOIUrl":"https://doi.org/10.1145/1614320.1614324","url":null,"abstract":"Establishing a control channel for medium access control is a challenging problem in multi-channel and dynamic spectrum access (DSA) networks. In the design of multi-channel MAC protocols, the use of channel (or frequency) hopping techniques (a.k.a. parallel rendezvous) have been proposed to avoid the bottleneck of a single control channel. In DSA networks, the dynamic and opportunistic use of the available spectrum requires that the radios are able to \"rendezvous\" -- i.e., find each other to establish a link. The use of a dedicated global control channel simplifies the rendezvous process but may not be feasible in many opportunistic spectrum sharing scenarios due to the dynamically changing availability of all the channels, including the control channel. To address this problem, researchers have proposed the use of channel hopping protocols for enabling rendezvous in DSA networks.\u0000 This paper presents a systematic approach, based on quorum systems, for designing and analyzing channel hopping protocols for the purpose of control channel establishment. The proposed approach, called Quorum-based Channel Hopping (QCH) system, can be used for implementing rendezvous protocols in DSA networks that are robust against link breakage caused by the appearance of incumbent user signals. We describe two optimal QCH systems under the assumption of global clock synchronization: the first system is optimal in the sense that it minimizes the time-to-rendezvous between any two channel hopping sequences; the second system is optimal in the sense that it guarantees the even distribution of the rendezvous points in terms of both time and channel, thus solving the emph{rendezvous convergence} problem. We also propose an asynchronous QCH system that does not require global clock synchronization. Our analytical and simulation results show that the channel hopping schemes designed using our framework outperform existing schemes under various network conditions.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117159284","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}

引用次数: 212

Challenge: ultra-low-power energy-harvesting active networked tags (EnHANTs) 挑战:超低功耗能量收集主动网络标签(EnHANTs)

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614348

M. Gorlatova, P. Kinget, I. Kymissis, D. Rubenstein, Xiaodong Wang, G. Zussman

{"title":"Challenge: ultra-low-power energy-harvesting active networked tags (EnHANTs)","authors":"M. Gorlatova, P. Kinget, I. Kymissis, D. Rubenstein, Xiaodong Wang, G. Zussman","doi":"10.1145/1614320.1614348","DOIUrl":"https://doi.org/10.1145/1614320.1614348","url":null,"abstract":"This paper presents the design challenges posed by a new class of ultra-low-power devices referred to as Energy-Harvesting Active Networked Tags (EnHANTs). EnHANTs are small, flexible, and self-reliant (in terms of energy devices that can be attached to objects that are traditionally not networked (e.g., books, clothing, and produce), thereby providing the infrastructure for various novel tracking applications. Examples of these applications include locating misplaced items, continuous monitoring of objects (items in a store, boxes in transit), and determining locations of disaster survivors. Recent advances in ultra-low-power wireless communications, ultra-wideband (UWB) circuit design, and organic electronic harvesting techniques will enable the realization of EnHANTs in the near future. In order for EnHANTs to rely on harvested energy, they have to spend significantly less energy than Bluetooth, Zigbee, and IEEE 802.15.4a devices. Moreover, the harvesting components and the ultra-low-power physical layer have special characteristics whose implications on the higher layers have yet to be studied (e.g., when using ultra-low-power circuits, the energy required to receive a bit is an order of magnitude higher than the energy required to transmit a bit). These special characteristics pose several new cross-layer research problems. In this paper, we describe the design challenges at the layers above the physical layer, point out relevant research directions, and outline possible starting points for solutions.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129373827","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}

引用次数: 86

SAM: enabling practical spatial multiple access in wireless LAN SAM:在无线局域网中实现实用的空间多址接入

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614327

Kun Tan, He Liu, Ji Fang, Wen Wang, Jiansong Zhang, Mi Chen, G. Voelker

{"title":"SAM: enabling practical spatial multiple access in wireless LAN","authors":"Kun Tan, He Liu, Ji Fang, Wen Wang, Jiansong Zhang, Mi Chen, G. Voelker","doi":"10.1145/1614320.1614327","DOIUrl":"https://doi.org/10.1145/1614320.1614327","url":null,"abstract":"Spatial multiple access holds the promise to boost the capacity of wireless networks when an access point has multiple antennas. Due to the asynchronous and uncontrolled nature of wireless LANs, conventional MIMO technology does not work efficiently when concurrent transmissions from multiple stations are uncoordinated. In this paper, we present the design and implementation of a crosslayer system, called SAM, that addresses the challenges of enabling spatial multiple access for multiple devices in a random access network like WLAN. SAM uses a chain-decoding technique to reliably recover the channel parameters for each device, and iteratively decode concurrent frames with misaligned symbol timings and frequency offsets. We propose a new MAC protocol, called CCMA, to enable concurrent transmissions by different mobile stations while remaining backward compatible with 802.11. Finally, we implement the PHY and MAC layer of SAM using the Sora high-performance software radio platform. Our evaluation results under real wireless conditions show that SAM can improve network uplink throughput by 70% with two antennas over 802.11.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130250581","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}

引用次数: 202

Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement 用诱发形变残差(SISR)定位:处理测量误差

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614357

H. T. Kung, Chit-Kwan Lin, Tsung-Han Lin, D. Vlah

{"title":"Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement","authors":"H. T. Kung, Chit-Kwan Lin, Tsung-Han Lin, D. Vlah","doi":"10.1145/1614320.1614357","DOIUrl":"https://doi.org/10.1145/1614320.1614357","url":null,"abstract":"We consider the problem of localizing wireless nodes in an outdoor, open-space environment, using ad-hoc radio ranging measurements, e.g., 802.11. We cast these ranging measurements as a set of distance constraints, thus forming an over-determined system of equations suitable for non-linear least squares optimization. However, ranging measurements are often subject to errors, induced by multipath signals and variations in path loss, unreliable hardware or antenna connectors, or imperfection in measurement models. Such potentially large, non-Gaussian errors in the measurement data ultimately produce inaccurate localization solutions. We propose a new error-tolerant localization method, called snap-inducing shaped residuals (SISR), to identify automatically \"bad nodes\" and \"bad links\" arising from these errors, so that they receive less weight in the localization process. In particular, SISR snaps \"good nodes\" to their accurate locations and gives less emphasis to other nodes. While the mathematical techniques used by SISR are similar to robust statistics, SISR's exploitation of the snap-in effect in localization appears to be novel. We provide analysis on the principle of SISR, illustrate errors in real-world measurements, and demonstrate a working SISR implementation in field experiments on a testbed of 37 wireless nodes, as well as show the superior performance of SISR in simulation with a larger number of nodes.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546744","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}

引用次数: 71

A scalable micro wireless interconnect structure for CMPs 一种用于cmp的可扩展微型无线互连结构

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614345

Suk-Bok Lee, Lixia Zhang, J. Cong, S. Tam, Ioannis Pefkianakis, Songwu Lu, M. F. Chang, Chuanxiong Guo, Glenn D. Reinman, Chunyi Peng, Mishali Naik

{"title":"A scalable micro wireless interconnect structure for CMPs","authors":"Suk-Bok Lee, Lixia Zhang, J. Cong, S. Tam, Ioannis Pefkianakis, Songwu Lu, M. F. Chang, Chuanxiong Guo, Glenn D. Reinman, Chunyi Peng, Mishali Naik","doi":"10.1145/1614320.1614345","DOIUrl":"https://doi.org/10.1145/1614320.1614345","url":null,"abstract":"This paper describes an unconventional way to apply wireless networking in emerging technologies. It makes the case for using a two-tier hybrid wireless/wired architecture to interconnect hundreds to thousands of cores in chip multiprocessors (CMPs), where current interconnect technologies face severe scaling limitations in excessive latency, long wiring, and complex layout. We propose a recursive wireless interconnect structure called the WCube that features a single transmit antenna and multiple receive antennas at each micro wireless router and offers scalable performance in terms of latency and connectivity. We show the feasibility to build miniature on-chip antennas, and simple transmitters and receivers that operate at 100-500 GHz sub-terahertz frequency bands. We also devise new two-tier wormhole based routing algorithms that are deadlock free and ensure a minimum-latency route on a 1000-core on-chip interconnect network. Our simulations show that our protocol suite can reduce the observed latency by 20% to 45%, and consumes power that is comparable to or less than current 2-D wired mesh designs.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131295744","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}

引用次数: 224

OpenLIDS: a lightweight intrusion detection system for wireless mesh networks OpenLIDS:用于无线网状网络的轻量级入侵检测系统

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614355

Fabian Hugelshofer, Paul Smith, D. Hutchison, N. Race

引用次数: 58

Design, implementation and evaluation of an efficient opportunistic retransmission protocol 设计、实现和评估一个有效的机会重传协议

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2009-09-20 DOI: 10.1145/1614320.1614329

Mei-Hsuan Lu, P. Steenkiste, Tsuhan Chen

{"title":"Design, implementation and evaluation of an efficient opportunistic retransmission protocol","authors":"Mei-Hsuan Lu, P. Steenkiste, Tsuhan Chen","doi":"10.1145/1614320.1614329","DOIUrl":"https://doi.org/10.1145/1614320.1614329","url":null,"abstract":"This paper presents an efficient opportunistic retransmission protocol (PRO, Protocol for Retransmitting Opportunistically) to improve the performance of IEEE 802.11 WLANs. PRO is a link-layer protocol that allows overhearing nodes to function as relays that retransmit on behalf of the source after they learn about a failed transmission. Relays with stronger connectivity to the destination have a higher chance of delivering the packet than the source does, thereby resulting in a more efficient use of the channel. PRO has four main features. First, channel reciprocity coupled with a run-time calibration process is used to estimate the instantaneous link quality to the destination. Second, a local qualification process filters out poor relays early. Third, a distributed relay selection algorithm chooses the best set of eligible relays among all qualified relays and prioritizes them. Finally, 802.11e Enhanced Distributed Channel Access (EDCA) is leveraged to make sure high priority relays transmit with high probability. PRO is designed to coexist with legacy 802.11 stations. We have implemented PRO in the driver of a commodity wireless card. Our extensive evaluation on both a controlled testbed and in the real world shows that PRO boosts throughput in diverse wireless environments, and especially in when there is significant contention for the channels, under fading, and with user mobility.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122765867","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}

引用次数: 101