发布求助
文献互助 智能选刊 最新文献

International Workshop on Mobile Opportunistic Networks最新文献

筛选
英文 中文
Using triggers for emulation of opportunistic networking 使用触发器模拟机会主义网络
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755772
Per Hurtig, T. Pérennou, Johan Garcia, A. Brunström
{"title":"Using triggers for emulation of opportunistic networking","authors":"Per Hurtig, T. Pérennou, Johan Garcia, A. Brunström","doi":"10.1145/1755743.1755772","DOIUrl":"https://doi.org/10.1145/1755743.1755772","url":null,"abstract":"Opportunistic networks do not require the availability of an end-to-end path, but may instead take advantage of temporary connectivity opportunities. Opportunistic networks pose a challenge for network emulation as the traditional emulation setup where application/transport endpoints send/receive packets from the network following a black box approach is no longer applicable. Instead opportunistic networking protocols and applications need to react to the dynamics of the underlying network beyond what is conveyed through the exchange of packets. In order to support emulation evaluations for such challenging applications we in this paper introduce the concept of emulation triggers that can emulate arbitrary cross-layer feedback and that are synchronized with the emulated scenario. The design and implementation of triggers in the KauNet emulator are described. The use of triggers in the context of opportunistic networking is briefly sketched.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123140354","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
Social roles for opportunistic forwarding 机会主义转发的社会角色
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755787
Greg Bigwood
{"title":"Social roles for opportunistic forwarding","authors":"Greg Bigwood","doi":"10.1145/1755743.1755787","DOIUrl":"https://doi.org/10.1145/1755743.1755787","url":null,"abstract":"Opportunistic networks exploit human encounters to enable new mobile networked applications. Efficient routing for these types of networks relies on utilising encounters between nodes so that messages are moved closer to their destination. Previous work has looked at using encounter-based social network data for routing. It is unclear how fairly these schemes distribute the forwarding of messages. In this work we investigate this and look at the potential of classifying nodes using \"social roles\" to find nodes with equivalent connections that can be used for forwarding.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121806091","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}
引用次数: 1
Design and analysis of context-aware forwarding protocols for opportunistic networks 机会网络中上下文感知转发协议的设计与分析
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755788
C. Boldrini
{"title":"Design and analysis of context-aware forwarding protocols for opportunistic networks","authors":"C. Boldrini","doi":"10.1145/1755743.1755788","DOIUrl":"https://doi.org/10.1145/1755743.1755788","url":null,"abstract":"The new challenges presented by opportunistic networks call for advanced networking solutions, especially for what concerns message forwarding. Very promising are those approaches that exploit information on the context the users are surrounded by, like the other users they met, the places they visit, etc. In this work we describe HiBOp, a context-aware forwarding protocol that includes a mechanism for collecting and managing context information. We also present an analytical model that can be used as a framework for evaluating the delay under context-aware forwarding protocols in which context is built from <tag, value> pairs that characterize each user.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856680","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
Evaluation of a DTN convergence layer for the AX.25 network protocol 用于AX.25网络协议的DTN汇聚层的评估
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755757
J. Ronan, K. Walsh, D. Long
{"title":"Evaluation of a DTN convergence layer for the AX.25 network protocol","authors":"J. Ronan, K. Walsh, D. Long","doi":"10.1145/1755743.1755757","DOIUrl":"https://doi.org/10.1145/1755743.1755757","url":null,"abstract":"The AX.25 Link Access Protocol for Amateur Packet Radio is a data link layer protocol derived from the ITU-T X.25 data link protocol with modifications for use by amateur radio operators. One of the authors has produced a prototype AX.25 connected mode DTN Convergence Layer (CL) based on the existing DTN2 reference implementation. Initial testing of this implementation was undertaken on Linux in order to compare the performance of the implementation with the performance of native AX.25 links. Initial results appear to indicate that the current prototype can be up to 25 percent more efficient than using the Linux TCP/IP over AX.25 implementation in certain circumstances. The experimental results also reveal situations where obvious improvements can still be made to the implementation.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389353","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
Token based algorithm for supporting mutual exclusion in opportunistic networks 机会网络中支持互斥的Token算法
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755766
Sagar A. Tamhane, Mohan J. Kumar
{"title":"Token based algorithm for supporting mutual exclusion in opportunistic networks","authors":"Sagar A. Tamhane, Mohan J. Kumar","doi":"10.1145/1755743.1755766","DOIUrl":"https://doi.org/10.1145/1755743.1755766","url":null,"abstract":"Opportunistic networks are essentially distributed networks with transient connectivity among nodes. Nodes in opportunistic networks are resource constrained, mobile and infrequently come in contact with each other. In such a distributed network, nodes may require exclusive access to a shared object or resource. Ensuring freedom from starvation is a challenging problem in opportunistic networks due to the infrequent contacts and node failures. In this paper, we review mutual exclusion algorithms proposed for generic mobile ad hoc networks (MANETs) and discuss their applicability to opportunistic networks. Further, we propose a novel token based algorithm and prove it is free from starvation and deadlock, and satisfies the safety property. Unlike existing algorithms for MANETs, the proposed algorithm does not require continuous monitoring of the network topology. Simulation results show that our algorithm is communication efficient as compared to other algorithms proposed for generic mobile ad hoc networks. We also propose a timeout based fault detection algorithm that exploits the inter contact time distributions. To the best knowledge of the authors, the proposed algorithm is the first to support mutual exclusion in opportunistic networks.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121535815","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
On the performance modeling of opportunistic routing 机会路由的性能建模
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755747
Llorenç Cerdà-Alabern, V. Pla, A. Darehshoorzadeh
{"title":"On the performance modeling of opportunistic routing","authors":"Llorenç Cerdà-Alabern, V. Pla, A. Darehshoorzadeh","doi":"10.1145/1755743.1755747","DOIUrl":"https://doi.org/10.1145/1755743.1755747","url":null,"abstract":"In this paper we propose a discrete time Markov model to assess the improvement that may be achieved using opportunistic routing. We show that our model can be used to compute the probability distribution and moments of the number of transmissions needed to send a packet from the source to the destination in a variety of scenarios. We use our model to compute some opportunistic routing performance measures in a network with a shadowing radio propagation model with different network topologies, and varying the maximum number of candidates used by the opportunistic routing algorithm. Our model can be easily extended to evaluate other aspects of opportunistic routing not covered in this paper. Therefore, we believe that our model yields a simple, yet flexible and powerful tool to evaluate opportunistic routing protocols.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342969","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
Opportunistic communication for multiplayer mobile gaming: lessons learned from PhotoShoot 多人手机游戏中的机会主义交流:从《拍照》中学到的经验教训
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755780
R. Kemp, N. Palmer, T. Kielmann, H. Bal
{"title":"Opportunistic communication for multiplayer mobile gaming: lessons learned from PhotoShoot","authors":"R. Kemp, N. Palmer, T. Kielmann, H. Bal","doi":"10.1145/1755743.1755780","DOIUrl":"https://doi.org/10.1145/1755743.1755780","url":null,"abstract":"In this paper we describe how a mobile multiplayer game benefits from opportunistic communication.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133611111","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
Using Haggle to create an electronic triage tag 使用讨价还价创建一个电子分类标签
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755775
Abraham Martín-Campillo, J. Crowcroft, Eiko Yoneki, Ramon Martí, C. Martínez-García
{"title":"Using Haggle to create an electronic triage tag","authors":"Abraham Martín-Campillo, J. Crowcroft, Eiko Yoneki, Ramon Martí, C. Martínez-García","doi":"10.1145/1755743.1755775","DOIUrl":"https://doi.org/10.1145/1755743.1755775","url":null,"abstract":"Forwarding data in scenarios without connectivity, Pocket Switched or Opportunistic networking can be difficult without a mobility model, or a history of node contacts. One of these scenarios is a disaster, where forwarding victim's medical information to a coordination point is critical for the good and fast intervention. \"Time To Return\" (TTR) forwarding was used in combination with mobile agents in MAETTS to provide early resource allocation during such emergencies. In this paper, we propose to apply TTR forwarding in Haggle to create an Electronic Triage Tag. This approach allows us to take advantage of short connectivity opportunities between nodes.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131821591","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}
引用次数: 29
Random walks in time-graphs 时间图中的随机游走
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755761
Utku Günay Acer, P. Drineas, A. Abouzeid
{"title":"Random walks in time-graphs","authors":"Utku Günay Acer, P. Drineas, A. Abouzeid","doi":"10.1145/1755743.1755761","DOIUrl":"https://doi.org/10.1145/1755743.1755761","url":null,"abstract":"Dynamic networks are characterized by topologies that vary with time and are represented by time-graphs. The notion of connectivity in time-graphs is fundamentally different than that in static graphs. End-to-end connectivity is achieved opportunistically by store-forward-carry paradigm if the network is so sparse that source-destination pairs are usually not connected by complete paths. In static graphs, it is well known that the network connectivity is tied to the spectral gap of the underlying adjacency matrix of the topology: if the gap is large, the network is well connected and a random walk on this graph has a small hitting time. In this paper, we investigate a similar metric for time-graphs, which indicates how quickly opportunistic methods deliver packets to destinations, speed of convergence in estimating an entity and quickness in the online optimization of protocol parameters, etc. To this end, a time-graph is represented by a 3-mode reachability tensor which yields whether a vertex is reachable from another node within t steps. Our observations from an extensive set of simulations show that the correlation between the expected hitting time of a random walk in the time-graph (following a non-homogenous Markov Chain) and the second singular value of the matrix obtained by unfolding the reachability tensor is significantly large, above 90%.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115419032","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}
引用次数: 17
Distributed location-aware hovering information systems 分布式位置感知悬停信息系统
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755792
Ossi Karkulahti
{"title":"Distributed location-aware hovering information systems","authors":"Ossi Karkulahti","doi":"10.1145/1755743.1755792","DOIUrl":"https://doi.org/10.1145/1755743.1755792","url":null,"abstract":"The rapid developments in the amount of mobile devices and in the mobile technology, as well as the surge of positioning technology in the mobile devices, have created a user base and demand for location-aware mobile applications.\u0000 The authors of Hovering information, AD LOC, and Abiding geocast have presented systems, which main idea is to bind information to geographical locations in ad hoc mobile networks. We will call these kind of systems as Distributed Location-Aware Hovering Information (DLAHI) systems.\u0000 DLAHI systems are decentralised, distributed, scalable, and generally lightweight. They are also human-driven meaning, that by default anyone should be able to create, share, and access information.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126379084","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信