CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348622

R. Crepaldi, Ryan Beavers, Braden Ehrat, M. Jaeger, S. Biersteker, R. Kravets

{"title":"LoadingZones: leveraging street parking to enable vehicular internet access","authors":"R. Crepaldi, Ryan Beavers, Braden Ehrat, M. Jaeger, S. Biersteker, R. Kravets","doi":"10.1145/2348616.2348622","DOIUrl":"https://doi.org/10.1145/2348616.2348622","url":null,"abstract":"Internet connectivity is nowadays an ubiquitous service. However, on the road we obtain access using costly and limited data cellular network subscriptions. This, along with significant network congestion, severely limits network use. Opportunistic access to indoor APs is limited by three factors. First, establishing a link to an AP requires a significant amount of time, and, second, links on the street usually have poor quality. Third, the lifetime of this link is very short in a moving car, due to indoor APs generally covering small areas of the street. Combined, these factors thwart opportunistic use of APs for Internet access. In this paper, we propose a novel approach that leverages the large number of parked cars to separate these three factors and tackle them independently: a parked car can connect to an AP with a link that, despite its poor quality, has a long lifetime. A moving vehicle can instead benefit from the better link with a parked car and use it as a relay. As our experiments show, our approach enables the use of this free, high throughput channel for a number of non time-sensitive applications, thus reducing cost and the load on the cellular network.","PeriodicalId":211112,"journal":{"name":"CHANTS '12","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126756378","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}

引用次数: 3

Adaptive usage of cellular and WiFi bandwidth: an optimal scheduling formulation 蜂窝和WiFi带宽的自适应使用:最优调度公式

CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348631

Ozlem Bilgir, M. Martonosi

引用次数: 24

Adaptive user anonymity for mobile opportunistic networks 移动机会网络的自适应用户匿名

CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348635

M. Radenkovic, I. Vaghi

{"title":"Adaptive user anonymity for mobile opportunistic networks","authors":"M. Radenkovic, I. Vaghi","doi":"10.1145/2348616.2348635","DOIUrl":"https://doi.org/10.1145/2348616.2348635","url":null,"abstract":"Current mobile opportunistic networks often use social routing protocols to transfer messages among users and to the services. In the face of changing underlying topology, mobility patterns and density of users and their queries, fixed algorithms for user anonymisation cannot provide sufficient level of user anonymity, and adaptive mechanisms for achieving user anonymity are needed. This paper describes a novel flexible and adaptive approach, AdaptAnon that is suitable for dynamic and heterogeneous mobile opportunistic networks. Our approach is multidimensional and combines multiple heuristics based on user profiles, analysis of user connectivity and history of anonymisation in order to predict and decide on the best set of nodes that can help anonymise the sending node. In our demonstration, we show that AdaptAnon achieves high quality of anonymisation in terms of both the number of nodes and the diversity of nodes in the anonymisation layer for varying query intensity and over live San Francisco cab mobility traces while neither decreasing success ratios nor increasing latency. We also compare AdaptAnon to other state of the art single dimensional anonymisation approaches and do real time visualization of performance parameters.","PeriodicalId":211112,"journal":{"name":"CHANTS '12","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131158810","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

Time-reference distribution in delay tolerant networks 时延容忍网络中的时间参考分布

CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348618

J. Morgenroth, L. Wolf

引用次数: 1

SCAMPI application platform SCAMPI应用平台

CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348636

Teemu Kärkkäinen, M. Pitkänen, P. Houghton, J. Ott

引用次数: 21

Flow control mechanisms for the bundle protocol in IEEE 802.15.4 low-power networks IEEE 802.15.4低功耗网络中束协议的流量控制机制

CHANTS '12 Pub Date : 2012-08-22 DOI: 10.1145/2348616.2348630

Wolf-Bastian Pöttner, L. Wolf