International Workshop on Mobile Opportunistic Networks最新文献

Twitter in disaster mode: smart probing for opportunistic peers 处于灾难模式的Twitter:聪明地寻找机会主义的同行

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159601

T. Hossmann, Dominik Schatzmann, Paolo Carta, F. Legendre

{"title":"Twitter in disaster mode: smart probing for opportunistic peers","authors":"T. Hossmann, Dominik Schatzmann, Paolo Carta, F. Legendre","doi":"10.1145/2159576.2159601","DOIUrl":"https://doi.org/10.1145/2159576.2159601","url":null,"abstract":"Recent natural disasters (earthquakes, floods, etc.) have shown that people heavily rely on platforms like Twitter to communicate and organize in emergencies. To mitigate communication outages due to broken infrastructure during such events, it was proposed to make mobile Apps \"disaster ready\": In normal operation mode, they use cellular infrastructure to communicate, whereas in disaster mode, they rely on opportunistic communication and disseminate messages in a peer-to-peer manner, using Bluetooth, WiFi ad hoc or WiFi Direct. Such hybrid applications can use the infrastructure to prepare for a network outage.\u0000 In this poster, we present preliminary work towards such a hybrid solution to solve the ad hoc connectivity problem. For security reasons, discoverability of devices (e.g., in Bluetooth) is often restricted to short time periods - a limitation which prevents us from building usable opportunistic networks for disaster relief. However, if we are able to predict which peers are within transmission range, we can circumvent this limitation: Instead of scanning for discoverable devices, we can probe for potential peers and simply connect if we find them in range. In our approach, the disaster ready App obtains a list of predicted potential peers from a central server during normal operation mode, which is then used for probing in disaster mode. We discuss the challenges and limitations of such an approach and sketch how to predict contacts based on location and/or social information.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129272964","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

Sensing multi-dimensional human behavior in opportunistic networks 在机会主义网络中感知多维度人类行为

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159599

S. Gaito, E. Pagani, G. P. Rossi, Matteo Zignani

引用次数: 3

Mobile video broadcasting system with multiple mobile devices for improving availability 具有多个移动设备的移动视频广播系统，以提高可用性

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159595

Takeshi Horiuchi, Takuya Omizo, K. Iida

引用次数: 0

Information dissemination dynamics in delay tolerant network: a bipartite network approach 延迟容忍网络中的信息传播动力学:二部网络方法

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159583

Sudipta Saha, Niloy Ganguly, Animesh Mukherjee

{"title":"Information dissemination dynamics in delay tolerant network: a bipartite network approach","authors":"Sudipta Saha, Niloy Ganguly, Animesh Mukherjee","doi":"10.1145/2159576.2159583","DOIUrl":"https://doi.org/10.1145/2159576.2159583","url":null,"abstract":"In this paper, we present a model of a delay tolerant network(DTN) and identify that this model can be suitably reformulated as a bipartite network and that the major predictions from the former are equivalent to that of the latter. In particular, we show that the coverage of the information dissemination process in the DTN matches accurately with the size of the largest component in the suitably thresholded one-mode projection of the corresponding bipartite network. In the process of this analysis, some of the important insights gained are that (a) arbitrarily increasing the number of agents participating in the dissemination process cannot increase the coverage once the system has reached the stationary state for a given buffer time (i.e., the time for which a message resides in the buffer of the places visited by the agents), (b) the coverage varies inversely with the square of the number of places in the system and directly with the square of the average social participation of the agents and (c) it is possible to design an optimal buffer time for a desired cost of coverage. To the best of our knowledge, this is the first such work that employs the rich theoretical backbone of bipartite networks as a \"proxy\" for the analysis of the otherwise intractable DTN dynamics thus allowing for various novel analytical estimates.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123509092","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}

引用次数: 5

Less is more: long paths do not help the convergence of social-oblivious forwarding in opportunistic networks 少即是多:在机会主义网络中，长路径无助于社交无关转发的趋同

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159582

C. Boldrini, M. Conti, A. Passarella

{"title":"Less is more: long paths do not help the convergence of social-oblivious forwarding in opportunistic networks","authors":"C. Boldrini, M. Conti, A. Passarella","doi":"10.1145/2159576.2159582","DOIUrl":"https://doi.org/10.1145/2159576.2159582","url":null,"abstract":"Message delivery in opportunistic networks is substantially affected by the way nodes move. Given that messages are handed over from node to node upon encounter, the intermeeting time, i.e., the time between two consecutive contacts between the same pair of nodes, plays a fundamental role in the overall delay of messages. A desirable property of message delay is that its expectation is finite, so that the performance of the system can be predicted. Unfortunately, when intermeeting times feature a Pareto distribution, this property does not always hold. In this paper, assuming heterogeneous mobility and Pareto intermeeting times, we provide a detailed study of the conditions for the expectation of message delay to converge when social-oblivious forwarding schemes are used. More specifically, we consider different classes of social-oblivious schemes, based on the number of hops allowed, the number of copies generated, and whether the source and relay nodes keep track of the evolution of the forwarding process or not. Our main finding is that, as long as the convergence of the expected delay is concerned, allowing more than two hops does not provide any advantage. At the same time, we show that using a multi-copy scheme can, in some cases, improve the convergence of the expected delay.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126476977","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}

引用次数: 14

Gossipmule: scanning and disseminating information between stations in cooperative WLANs 八卦骡子:在协作无线局域网中扫描和传播站点之间的信息

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159598

M. A. Girón, A. Paulus, J. Link, Klaus Wehrle

引用次数: 2

A disruption-tolerant transmission protocol for practical mobile data offloading 一种用于实际移动数据卸载的容错传输协议

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159590

Younghwan Go, YoungGyoun Moon, Giyoung Nam, KyoungSoo Park

{"title":"A disruption-tolerant transmission protocol for practical mobile data offloading","authors":"Younghwan Go, YoungGyoun Moon, Giyoung Nam, KyoungSoo Park","doi":"10.1145/2159576.2159590","DOIUrl":"https://doi.org/10.1145/2159576.2159590","url":null,"abstract":"The explosive popularity of smartphones and mobile devices drives massive growth in the wide-area mobile data communication. Unfortunately, the current or near-future 3G/4G networks are deemed insufficient to meet the increasing data transfer demand. While opportunistic offloading of mobile data through Wi-Fi is an attractive option, the existing transport layer would experience frequent disconnections due to mobility, making it hard to support seamlessly reliable data delivery. As a result, many mobile applications either depend on ad-hoc downloading resumption mechanisms or redundantly re-transfer the same content when disruptions happen.\u0000 In this paper, we present DTP, a disruption-tolerant, reliable transport layer protocol that masks the failures of the preferred network. Unlike previous disruption/delay-tolerant protocols, DTP provides the same semantics as TCP on an IP packet level when the mobile device is connected to a network while providing the illusion of continued connection even if the underlying physical network becomes unavailable. This would help the mobile application developers to focus on the application core rather than addressing the frequent network disruptions. It would also greatly reduce the phone network costs both to ISPs and end users. Our current implementation in UDP shows a comparable performance to that of TCP in network, and it greatly reduces the delay and power consumption when the mobile devices frequently switch from one network to another.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122158703","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}

引用次数: 35

Opportunistic networks and cognitive management systems in the service of the future internet: indicative scenarios of coverage and capacity extension 未来互联网服务中的机会网络和认知管理系统:覆盖和容量扩展的指示性情景

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159596

P. Demestichas, N. Koutsouris, V. Stavroulaki

引用次数: 2

Performance of collaborative GPS localization in pedestrian ad hoc networks 行人自组织网络中协同GPS定位性能研究

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159587

V. Vukadinovic, S. Mangold

引用次数: 13

PePiT: opportunistic dissemination of large contents on android mobile devices PePiT:在android移动设备上机会性地传播大量内容

International Workshop on Mobile Opportunistic Networks Pub Date : 2012-03-15 DOI: 10.1145/2159576.2159594

Matteo Sammarco, N. Belblidia, Y. Lopez, M. Amorim, L. Costa, Jérémie Leguay

引用次数: 5