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

Challenges: automated design of networking protocols 挑战:网络协议的自动化设计

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409975

V. Rodoplu, A. A. Gohari

{"title":"Challenges: automated design of networking protocols","authors":"V. Rodoplu, A. A. Gohari","doi":"10.1145/1409944.1409975","DOIUrl":"https://doi.org/10.1145/1409944.1409975","url":null,"abstract":"This paper establishes a framework for the automated generation of networking protocols. The need for the rapid design of networking protocols in application-specific contexts has increased dramatically over the past five years. Each new application requires high performance in its own domain, as well as a rapid design cycle. Further, changes in physical layer technology quickly render previously high-performance protocols poor performance. Currently, there are no tools to automate the design of networking protocols. This paper addresses the challenge of building such tools. It proposes a methodology and a design chain for the automated generation of networking protocols, with the following novel ideas: (1) Formulation of the network protocol problem such that the exchange of protocol control information can be specified as part of the optimization program, (2) Optimal waveform generation, which specifies the optimal exchange of both control information and data, (3) Protocol Extraction: The extraction of the optimal protocol as a minimal description of the optimal waveforms. This methodology has the potential to dramatically change the future of networking protocol design by moving protocol design to a more abstract level, finding high-performance protocols not easily discovered by human intuition, and reducing the currently long protocol design cycles.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129754817","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

Assessment of urban-scale wireless networks with a small number of measurements 用少量测量对城市规模无线网络进行评估

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409967

Joshua Robinson, R. Swaminathan, E. Knightly

{"title":"Assessment of urban-scale wireless networks with a small number of measurements","authors":"Joshua Robinson, R. Swaminathan, E. Knightly","doi":"10.1145/1409944.1409967","DOIUrl":"https://doi.org/10.1145/1409944.1409967","url":null,"abstract":"In order to evaluate, improve, or expand a deployed, city-wide wireless mesh network, it is necessary to assess the network's spatial performance. In this paper, we present a general framework to accurately predict a network's well-served area, termed the metric region, via a small number of measurements. Assessment of deployed networks must address two key issues: non-uniform physical-layer propagation and high spatial variance in performance. Addressing non-uniformity, our framework estimates a mesh node's metric region via a data-driven sectorization of the region. We find each sector's boundary (radius) with a two-stage process of estimation and then measurement-driven \"push-pull\" refinement of the estimated boundary. To address high spatial variation, our coverage estimation couples signal strength measurements with terrain information from publicly available digital maps to estimate propagation characteristics between a wireless node and the client's location. To limit measurements and yield connected metric regions, we consider performance metrics (such as signal strength) to be monotonic with distance from the wireless node within each sector. We show that despite measured violations in coverage monotonicity, we obtain high accuracy with this assumption. We validate our estimation and refinement framework with measurements from 30,000 client locations obtained in each of two currently operational mesh networks, GoogleWiFi and TFA. We study three illustrative metrics: coverage, modulation rate, and redundancy, and find that to achieve a given accuracy, our framework requires two to five times fewer measurements than grid sampling strategies. Finally, we use the framework to evaluate the two deployments and study the average size and location of their coverage holes as well as the impact of client association policies on load-balancing.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131392199","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}

引用次数: 90

Media sharing based on colocation prediction in urban transport 基于位置预测的城市交通媒介共享

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409953

L. McNamara, C. Mascolo, L. Capra

{"title":"Media sharing based on colocation prediction in urban transport","authors":"L. McNamara, C. Mascolo, L. Capra","doi":"10.1145/1409944.1409953","DOIUrl":"https://doi.org/10.1145/1409944.1409953","url":null,"abstract":"People living in urban areas spend a considerable amount of time on public transport, for example, commuting to/from work. During these periods, opportunities for inter-personal networking present themselves, as many members of the public now carry electronic devices equipped with Bluetooth or other wireless technology. Using these devices, individuals can share content (e.g., music, news and video clips) with fellow travellers that are on the same train or bus. Transferring media content takes time; in order to maximise the chances of successful downloads, users should identify neighbours that possess desirable content and who will travel with them for long-enough periods. In this paper, we propose a user-centric prediction scheme that collects historical colocation information to determine the best content sources. The scheme works on the assumption that people have a high degree of regularity in their movements. We first validate this assumption on a real dataset, that consists of traces of people moving in a large city's mass transit system. We then demonstrate experimentally on these traces that our prediction scheme significantly improves communication efficiency, when compared to a memory(history)-less source selection scheme.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683124","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}

引用次数: 191

Understanding congestion control in multi-hop wireless mesh networks 了解多跳无线网状网络中的拥塞控制

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409978

Sumit Rangwala, A. Jindal, Ki-Young Jang, K. Psounis, R. Govindan

{"title":"Understanding congestion control in multi-hop wireless mesh networks","authors":"Sumit Rangwala, A. Jindal, Ki-Young Jang, K. Psounis, R. Govindan","doi":"10.1145/1409944.1409978","DOIUrl":"https://doi.org/10.1145/1409944.1409978","url":null,"abstract":"Complex interference in static multi-hop wireless mesh networks can adversely affect transport protocol performance. Since TCP does not explicitly account for this, starvation and unfairness can result from the use of TCP over such networks. In this paper, we explore mechanisms for achieving fair and efficient congestion control for multi-hop wireless mesh networks. First, we design an AIMD-based rate-control protocol called Wireless Control Protocol (WCP) which recognizes that wireless congestion is a neighborhood phenomenon, not a node-local one, and appropriately reacts to such congestion. Second, we design a distributed rate controller that estimates the available capacity within each neighborhood, and divides this capacity to contending flows, a scheme we call Wireless Control Protocol with Capacity estimation (WCPCap). Using analysis, simulations, and real deployments, we find that our designs yield rates that are both fair and efficient, and achieve near optimal goodputs for all the topologies that we study. WCP achieves this level of performance while being extremely easy to implement. Moreover, WCPCap achieves the max-min rates for our topologies, while still being distributed and amenable to real implementation.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677476","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}

引用次数: 139

Challenges: wide-area wirelesss NETworks (WANETs) 挑战:广域无线网络(wanet)

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409950

Suresh Singh

{"title":"Challenges: wide-area wirelesss NETworks (WANETs)","authors":"Suresh Singh","doi":"10.1145/1409944.1409950","DOIUrl":"https://doi.org/10.1145/1409944.1409950","url":null,"abstract":"A WANET is a wireless network where the wireless nodes can be located anywhere over the globe. However, the underlying design is such that the nodes believe they are part of a single-hop or multi-hop wireless network at the PHY and MAC layers. This is accomplished by using Software Defined Access Points (SoDA) that are based on the idea of Software Defined Radio (SDR). For the uplink, each SoDA samples the down-converted channel using an ADC (analog-to-digital converter). The sampled data is then multicast to the other SoDAs via the Internet. At each end-point, the received digital signals from the other SoDAs are summed and sent through the DAC (digital-to-analog converter) and transmitted on a designated channel after upconversion. In effect what we have done is to mix the RF environment at geographically separate locations (albeit with a time shift). This simple technique leads to a whole new model for designing and using wireless networks. Indeed, we can think of these networks as following the end-to-end model where only the end nodes understand the PHY/MAC layers and the access points and Internet serve simply as dumb relays. This paper describes a series of network models that are enabled and outlines the open research challenges.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541662","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}

引用次数: 7

Enhancing interactive web applications in hybrid networks 增强混合网络中的交互式web应用程序

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409954

A. Balasubramanian, B. Levine, A. Venkataramani

{"title":"Enhancing interactive web applications in hybrid networks","authors":"A. Balasubramanian, B. Levine, A. Venkataramani","doi":"10.1145/1409944.1409954","DOIUrl":"https://doi.org/10.1145/1409944.1409954","url":null,"abstract":"Mobile Internet users have several options today including high bandwidth cellular data services such as 3G, that may be the choice for many. However, the ubiquity and low cost of WiFi suggests an attractive alternative, namely, opportunistic use of open WiFi access points (APs) or planned municipal mesh networks. Unfortunately, for vehicular users, the intermittent nature of WiFi connectivity makes it challenging to support popular interactive applications such as Web search and browsing.\u0000 Our work is driven by two questions. 1) How can we enable system support for interactive web applications to tolerate disruptions in WiFi connectivity from mobile nodes? 2) Can opportunistic mobile-to-mobile (m2m) transfers enhance application performance over only using APs, and if so, under what conditions and by how much?\u0000 We present Thedu, a system that enables access to Web search from moving vehicles. The key idea is to use aggressive prefetching to transform the interactive Web search application into a one-shot request/response process. We deployed a prototype of Thedu on the DieselNet testbed in Amherst, MA, consisting of transit buses averaging 21 on the road at a time. Our deployment results show that Thedu can deliver 4 times as many relevant web pages than not using Thedu. A bus receives relevant web pages with a mean delay of 2.3 minutes and within 0.55 minutes in areas with high AP density. Thedu augments AP connectivity with m2m transfers using a utility-driven DTN routing algorithm and uses caching to exploit query locality. Our analytic model and trace-driven simulations suggest that m2m routing yields little benefit over using APs alone even under moderately dense AP deployment such as in Amherst. With sparsely deployed APs as may be the case in rural areas, our conclusions are more mixed: m2m routing with caching improves the number of relevant responses delivered per bus by up to 58%, but the mean delay is significantly high at 6.7 minutes, calling into question its practicality for interactive applications.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093073","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}

引用次数: 81

Capacity of large scale wireless networks under Gaussian channel model 高斯信道模型下的大规模无线网络容量

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409962

Shi Li, Yunhao Liu, Xiangyang Li

{"title":"Capacity of large scale wireless networks under Gaussian channel model","authors":"Shi Li, Yunhao Liu, Xiangyang Li","doi":"10.1145/1409944.1409962","DOIUrl":"https://doi.org/10.1145/1409944.1409962","url":null,"abstract":"In this paper, we study the multicast capacity of a large scale random wireless network. We simply consider the extended multihop network, where a number of wireless nodes vi(1 ≤ i ≤ n) are randomly located in a square region with side-length a = √n, by use of Poisson distribution with density 1. All nodes transmit at constant power P, and the power decays along path, with attenuation exponent α > 2. The data rate of a transmission is determined by the SINR as B log(1 + SINR). There are ns randomly and independently chosen multicast sessions. Each multicast has k randomly chosen terminals. We show that, when k ≤ θ1 n/(log n)2α+6, and ns ≥ θ2n1/2+β, the capacity that each multicast session can achieve, with high probability, is at least c8√n/ns√k, where θ1, θ2, and c8 are some special constants and β > 0 is any positive real number. Our result generalizes the unicast capacity [3] for random networks using percolation theory.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525076","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}

引用次数: 103

An empirical study of UHF RFID performance 超高频RFID性能的实证研究

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409970

Michael Buettner, D. Wetherall

引用次数: 185

Taking the sting out of carrier sense: interference cancellation for wireless LANs 消除载波感的刺痛:无线局域网的干扰消除

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409983

D. Halperin, T. Anderson, D. Wetherall

引用次数: 321

Radio-telepathy: extracting a secret key from an unauthenticated wireless channel 无线电心灵感应:从未经认证的无线信道中提取密钥

ACM/IEEE International Conference on Mobile Computing and Networking Pub Date : 2008-09-14 DOI: 10.1145/1409944.1409960

Suhas Mathur, W. Trappe, N. Mandayam, Chunxuan Ye, A. Reznik

{"title":"Radio-telepathy: extracting a secret key from an unauthenticated wireless channel","authors":"Suhas Mathur, W. Trappe, N. Mandayam, Chunxuan Ye, A. Reznik","doi":"10.1145/1409944.1409960","DOIUrl":"https://doi.org/10.1145/1409944.1409960","url":null,"abstract":"Securing communications requires the establishment of cryptographic keys, which is challenging in mobile scenarios where a key management infrastructure is not always present. In this paper, we present a protocol that allows two users to establish a common cryptographic key by exploiting special properties of the wireless channel: the underlying channel response between any two parties is unique and decorrelates rapidly in space. The established key can then be used to support security services (such as encryption) between two users. Our algorithm uses level-crossings and quantization to extract bits from correlated stochastic processes. The resulting protocol resists cryptanalysis by an eavesdropping adversary and a spoofing attack by an active adversary without requiring an authenticated channel, as is typically assumed in prior information-theoretic key establishment schemes. We evaluate our algorithm through theoretical and numerical studies, and provide validation through two complementary experimental studies. First, we use an 802.11 development platform with customized logic that extracts raw channel impulse response data from the preamble of a format-compliant 802.11a packet. We show that it is possible to practically achieve key establishment rates of ~ 1 bit/sec in a real, indoor wireless environment. To illustrate the generality of our method, we show that our approach is equally applicable to per-packet coarse signal strength measurements using off-the-shelf 802.11 hardware.","PeriodicalId":378295,"journal":{"name":"ACM/IEEE International Conference on Mobile Computing and Networking","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127797321","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}

引用次数: 714