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

International Workshop on Mobile Opportunistic Networks最新文献

筛选
英文 中文
Secure descriptive message dissemination in DTNs ddn中安全的描述性消息分发
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755758
M. Chuah, Sankardas Roy, I. Stoev
{"title":"Secure descriptive message dissemination in DTNs","authors":"M. Chuah, Sankardas Roy, I. Stoev","doi":"10.1145/1755743.1755758","DOIUrl":"https://doi.org/10.1145/1755743.1755758","url":null,"abstract":"Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption Tolerant Network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. A key feature of DTN technology is the late-binding capability that allows messages destined to a descriptive name to be resolved progressively until the messages are delivered to one or several recipients. In this paper, we describe a flexible security solution that allows messages destined to descriptive names to be sent securely such that unauthorized personnel is not allowed to eavesdrop on them. Our solution builds on the attributed based cryptography system. In addition, we describe our implementation of a late-binding router that supports our security solution. We also present our prototyping experience.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"27 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":"126664816","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}
引用次数: 18
Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation 基于位置外推的无线机会网络中高效可靠的传播
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755762
A. Agbaria, R. Friedman
{"title":"Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation","authors":"A. Agbaria, R. Friedman","doi":"10.1145/1755743.1755762","DOIUrl":"https://doi.org/10.1145/1755743.1755762","url":null,"abstract":"Data dissemination is an important service in ad-hoc networks. This work presents a novel approach that utilizes the positioning information and the velocity vector of the immediate neighbors at every node to extrapolate the geographic location of the surrounding nodes at any time in order to obtain efficient dissemination trees with low control overhead. The paper includes an extensive simulation study that compares our approach to other representative overlay and probabilistic forwarding approaches. It is shown that our approach behaves similar or better than the other approaches, and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile. Therefore, we believe that this protocol is appropriate for opportunistic networks.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"40 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":"131563324","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
DTIPN: delay tolerant IP networking for opportunistic network applications DTIPN:用于机会网络应用的延迟容忍IP网络
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755755
H. Ochiai, Kenichi Shimotada, H. Esaki
{"title":"DTIPN: delay tolerant IP networking for opportunistic network applications","authors":"H. Ochiai, Kenichi Shimotada, H. Esaki","doi":"10.1145/1755743.1755755","DOIUrl":"https://doi.org/10.1145/1755743.1755755","url":null,"abstract":"This paper proposes delay tolerant IP networking (DTIPN), an alternative architecture for delay and disruption tolerant networks. This architecture directly fits into the Internet protocol architecture, still providing delay and disruption tolerant support for application message delivery without relying on the well-known Bundling. DTIPN takes IP packets as asynchronous data delivery units, identifying the location of hosts by IP addresses. We have implemented the architecture and carried out several experiments with 10 intermittently-connected or mobile nodes in the campus of the University of Tokyo. The result, on our prototype implementation, indicates that DTIPN architecture has well-adaptive nature to the Internet with providing practically useful performance.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"81 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":"123830310","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}
引用次数: 8
Hide-and-Lie: enhancing application-level privacy in opportunistic networks 隐藏与谎言:在机会主义网络中增强应用级隐私
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755767
László Dóra, T. Holczer
{"title":"Hide-and-Lie: enhancing application-level privacy in opportunistic networks","authors":"László Dóra, T. Holczer","doi":"10.1145/1755743.1755767","DOIUrl":"https://doi.org/10.1145/1755743.1755767","url":null,"abstract":"A delay-tolerant network is a mobile ad hoc network where the message dissemination is based on the store-carry-and-forward principle. This principle raises new aspects of the privacy problem. In particular, an attacker can build a user profile and trace the nodes based on this profile even if the message exchange protocol provides anonymity. In this paper, an attacker model is presented and some proposed attackers are implemented. We analyze the efficiency of both the attacks and the proposed defense mechanism, called Hide-and-Lie Strategy. We show that without any defense mechanism, the nodes are traceable, but with the Hide-and-Lie Strategy, the success probability of an attacker can be made equal to the success probability of the simple guessing. Furthermore, in some scenarios, the Hide-and-Lie Strategy increases the message delivery ratio. The number of downloaded messages and the maximal memory size required to apply the proposed privacy defense mechanism is also investigated.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"41 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":"116089143","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
RADON: reputation-assisted data forwarding in opportunistic networks RADON:机会主义网络中的声誉辅助数据转发
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755746
Na Li, Sajal K. Das
{"title":"RADON: reputation-assisted data forwarding in opportunistic networks","authors":"Na Li, Sajal K. Das","doi":"10.1145/1755743.1755746","DOIUrl":"https://doi.org/10.1145/1755743.1755746","url":null,"abstract":"In opportunistic networks, the probability of encountering a destination node is popularly used to select a qualified forwarder; however, it can not represent the competency of delivering data in a hostile wireless environment, because a malicious node can bloat its such probability to intercept data from others. In this paper, we design a reputation-based framework to more accurately evaluate an encounter's competency of delivering data, which can be integrated with a large family of existing data forwarding protocols in opportunistic networks. In particular, a special message, called Positive Feedback Message (PFM), is proposed to help monitor the forwarding behavior of a node. We also design a Reputation-Assisted Data forwarding protocol for Opportunistic Networks (RADON), which integrates our reputation framework with a bare-bone data forwarding protocol using the number of times of previous encounters as the metric to select the next qualified forwarder. Through simulation experiments, we demonstrate that RADON effectively improves the network performance (e.g., data delivery ratio) against \"black hole\" attacks.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"1 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":"116296668","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}
引用次数: 66
Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks 社会贪婪:一种基于社会的贪婪路由算法，适用于延迟容忍网络
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755773
Kazem Jahanbakhsh, G. Shoja, Valerie King
{"title":"Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks","authors":"Kazem Jahanbakhsh, G. Shoja, Valerie King","doi":"10.1145/1755743.1755773","DOIUrl":"https://doi.org/10.1145/1755743.1755773","url":null,"abstract":"Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming process. In this paper, we propose a simple and cost effective method for bootstrapping wireless devices by employing available social profiles. Moreover, we propose a simple greedy routing algorithm called Social-Greedy which uses a social distance derived from people's social profiles to route messages in DTNs.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"69 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":"131473409","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}
引用次数: 42
A study of information dissemination under multiple random walkers and replication mechanisms 多随机步行者条件下的信息传播及复制机制研究
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755765
K. Oikonomou, Dimitrios G. Kogias, I. Stavrakakis
{"title":"A study of information dissemination under multiple random walkers and replication mechanisms","authors":"K. Oikonomou, Dimitrios G. Kogias, I. Stavrakakis","doi":"10.1145/1755743.1755765","DOIUrl":"https://doi.org/10.1145/1755743.1755765","url":null,"abstract":"Random walk-based approaches are suitable for information dissemination in mobile and opportunistic environments that are inherently dynamic and typically large-scale. Multiple random walkers have been proposed in the recent past as a suitable mechanism to significantly reduce termination time when covering a network topology. In this paper, the multiple random walkers mechanism is studied and analyzed under a different and novel perspective that allows for further understanding of network coverage when employing multiple random walkers in a network. Given that under this mechanism the number of movements is significantly increased (proportional to the number of random walkers) -- and sometimes not as effective as expected due to frequent revisits that do not improve coverage as shown in this paper -- a replication mechanism is introduced that is capable of reducing the number of movements by reducing initial revisits. Simulation results considering geometric random graph topologies -- which are suitable for modeling mobile environments -- are also presented supporting the analytical findings and shedding more light on various aspects of both the aforementioned mechanisms.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"1 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":"128786780","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}
引用次数: 10
Analysis of opportunistic localization algorithms based on the linear matrix inequality method 基于线性矩阵不等式方法的机会定位算法分析
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755777
F. Zorzi, A. Bardella, T. Pérennou, GuoDong Kang, A. Zanella
{"title":"Analysis of opportunistic localization algorithms based on the linear matrix inequality method","authors":"F. Zorzi, A. Bardella, T. Pérennou, GuoDong Kang, A. Zanella","doi":"10.1145/1755743.1755777","DOIUrl":"https://doi.org/10.1145/1755743.1755777","url":null,"abstract":"With the increasing spread of use of mobile devices there is a growing demand for location-aware services in a wide variety of contexts. Yet providing an accurate location estimation is difficult when considering cheap off-the-shelf mobile devices, particularly in indoors or urban environments. In this paper we define and compare different localization algorithms based on an opportunistic paradigm. In particular, we focus on range-free and range-based localization techniques that are based on the solution of a Linear Matrix Inequalities (LMI) problem. The performance achievable with this approach is analyzed in different scenarios, through extensive simulation campaign. Results show that LMI-based schemes, especially the range-based one, are potentially capable of yielding very accurate localization even after a limited number of opportunistic exchange, though performance is rather sensitive to the accuracy of the other nodes' self-localization and to the randomness of the radio channel.","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":"125001452","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
Evaluating the spatial dimension of contacts in opportunistic networks 评估机会主义网络中接触的空间维度
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755786
N. Belblidia
{"title":"Evaluating the spatial dimension of contacts in opportunistic networks","authors":"N. Belblidia","doi":"10.1145/1755743.1755786","DOIUrl":"https://doi.org/10.1145/1755743.1755786","url":null,"abstract":"Is temporal dimension knowledge alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant results concerning the contact and inter-contact duration. Nevertheless, only the temporal dimension does not give a complete overview of contact characterization. We propose the surround indicator as a metric to exhibit the contact connectivity in opportunistic networks. We evaluate the surround indicator on two existing datasets. Our preliminary results reveal that contacts have too heterogeneous surrounds to be considered only in terms of duration.","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":"128564097","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}
引用次数: 0
Human mobility in shopping mall environments 商场环境中人的移动性
International Workshop on Mobile Opportunistic Networks Pub Date : 2010-02-22 DOI: 10.1145/1755743.1755745
Adriano Galati, C. Greenhalgh
{"title":"Human mobility in shopping mall environments","authors":"Adriano Galati, C. Greenhalgh","doi":"10.1145/1755743.1755745","DOIUrl":"https://doi.org/10.1145/1755743.1755745","url":null,"abstract":"The need for a network when there is no infrastructure is no longer limited to military and emergency applications; ad hoc networks can support private and public applications as well. Ad hoc networking has been a dynamically growing research area in recent years. In order to conduct informed and realistic design of forwarding policies and algorithms for mobile ad-hoc delay tolerant networks, it is important to gather appropriate real human mobility data. In this paper we study human mobility in a shopping mall environment. In such an environment, people using network devices such as mobile phones, PDA, etc. could be willing to communicate in a variety of ways, without the mediation of routing across the global Internet. The ultimate goal is to enable a multitude of users at any place in the shopping mall to access/receive appropriate local information at any time. We discuss the implications of our results and make recommendations for the design of opportunistic forwarding algorithms for shopping mall environments.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"13 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":"121511007","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
首页 上一页 下一页 尾页
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学术官方微信