International Workshop on Mobile Opportunistic Networks最新文献

筛选
英文 中文
Evaluating contacts for routing in highly partitioned mobile networks 在高度分割的移动网络中评估路由的接触
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247698
Chao-Yu Chen, Zesheng Chen
{"title":"Evaluating contacts for routing in highly partitioned mobile networks","authors":"Chao-Yu Chen, Zesheng Chen","doi":"10.1145/1247694.1247698","DOIUrl":"https://doi.org/10.1145/1247694.1247698","url":null,"abstract":"The movement of real users often follows some patterns that can be characterized by certain statistical metrics of the contacts. Such metrics are useful for nodes to make routing decisions, especially in sparse mobile ad hoc networks where instantaneous network connectivity is rare and messages are delivered using store-carry-forward routing. None of the statistical metrics used in existing routing algorithms considers the dependency between neighboring contacts, thus resulting in an inaccurate estimation of message delays over paths. In this paper, a new metric called the expected dependent delay that characterizes the expected delay of a contact dependent on the previous hop is proposed. With this new metric, the closed-form expression for the expected delay of a path is given and can be further simplified in highly partitioned mobile networks. Simulation results show that the proposed algorithm has a significant improvement in terms of the message delay than those that consider only the delivery probability or the expected delay.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115040157","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
Contention-aware analysis of routing schemes for mobile opportunistic networks 移动机会网络路由方案的竞争感知分析
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247696
A. Jindal, K. Psounis
{"title":"Contention-aware analysis of routing schemes for mobile opportunistic networks","authors":"A. Jindal, K. Psounis","doi":"10.1145/1247694.1247696","DOIUrl":"https://doi.org/10.1145/1247694.1247696","url":null,"abstract":"A large body of work has theoretically analyzed the performance of routing schemes for mobile opportunistic networks. But a vast majority of these prior studies have ignored wireless contention. Recent papers have shown through simulations that ignoring contention leads to inaccurate and misleading results, even when studying sparse networks. In this paper, we analyze the performance of routing schemes under contention. To model contention we use our recently-proposed analytical framework which is applicable to any multi-hop wireless network. Then, we take into consideration the special characteristics of mobile opportunistic networks and compute the delays for four representative routing schemes for these networks. Finally, we use these delay expressions to answer practical questions in the context of designing more efficient routing schemes for mobile opportunistic networks.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127422556","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}
引用次数: 22
Hybrid routing in clustered DTNs with message ferrying 具有消息传送的集群ddn中的混合路由
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247710
Yang-Jie Chen, Wenrui Zhao, M. Ammar, E. Zegura
{"title":"Hybrid routing in clustered DTNs with message ferrying","authors":"Yang-Jie Chen, Wenrui Zhao, M. Ammar, E. Zegura","doi":"10.1145/1247694.1247710","DOIUrl":"https://doi.org/10.1145/1247694.1247710","url":null,"abstract":"The mobile wireless research community has invested in the development of routing algorithms and protocols for two distinct environments. The mobile ad-hoc network (MANET) environment is generally assumed to contain relatively dense nodes connected by multi-hop paths, where disconnection is rare. The disruption tolerant network (DTN) environment is generally assumed to contain relatively sparse nodes that are frequently disconnected. We are interested in a different environment in which clusters of nodes have MANET-like dense connectivity, while there is DTN-like sparse connectivity between clusters. We focus in this paper on the case of stationary clusters, where message ferrying provides inter-cluster connectivity. Our routing approach combines message ferry routing with MANET routing through the use of gateway nodes. To best utilize gateway nodes, we develop various algorithms for data aggregation at gateways and transmission scheduling between gateways and the ferry. To further improve performance, we design algorithms to customize ferry routes according to node location and traffic condition. Our hybrid routing schemes are evaluated via extensive simulations.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125289296","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}
引用次数: 28
A comparison of opportunistic and deterministic forwarding in mobile multihop wireless networks 移动多跳无线网络中机会性和确定性转发的比较
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247697
Jonghyune Kim, S. Bohacek
{"title":"A comparison of opportunistic and deterministic forwarding in mobile multihop wireless networks","authors":"Jonghyune Kim, S. Bohacek","doi":"10.1145/1247694.1247697","DOIUrl":"https://doi.org/10.1145/1247694.1247697","url":null,"abstract":"While opportunistic packet forwarding has been extensively studied in the case of single hop communication, only recently has opportunistic forwarding for multihop networks been explored. One key aspect of opportunistic forwarding is that the node that forwards a packet is determined on-the-fly and depends on which nodes receive the packet. On the other hand, in deterministic forwarding, the node that will forward the packet is predetermined. There are several key differences between these approaches. Opportunistic forwarding is able to make use of links where packet delivery is possible with a low probability and can easily accommodate channel fluctuations. But in order to reduce collisions, overhead is required to determine which node will forward the packet. The deterministic scheme considered is able to adaptively react to changes in the route quality, but requires overhead to update the route. In this paper, we examine which approach provides the best performance. It is found that the relative performance depends on mobility and the physical layer. However, in most cases, deterministic forwarding, along with route quality monitoring and high frequency route updates, outperforms opportunistic forwarding.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164546","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}
引用次数: 19
Applicability of identity-based cryptography for disruption-tolerant networking 基于身份的加密技术在容错网络中的适用性
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247705
N. Asokan, Kari Kostiainen, Philip Ginzboorg, J. Ott, Cheng Luo
{"title":"Applicability of identity-based cryptography for disruption-tolerant networking","authors":"N. Asokan, Kari Kostiainen, Philip Ginzboorg, J. Ott, Cheng Luo","doi":"10.1145/1247694.1247705","DOIUrl":"https://doi.org/10.1145/1247694.1247705","url":null,"abstract":"Traditional approaches for communication security do not work well in disruption- and delay-tolerant networks (DTNs). Recently, the use of identity-based cryptography (IBC) has been proposed as one way to help solve some of the DTN security issues. We analyze the applicability of IBC in this context and conclude that for authentication and integrity, IBC has no significant advantage over traditional cryptography, but it can indeed enable better ways of providing confidentiality. Additionally, we show a way of bootstrapping the needed security associations for IBC use from an existing authentication infrastructure.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130343142","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}
引用次数: 88
Incentive-based cooperative and secure inter-personal networking 基于激励的合作和安全的人际网络
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247706
Karim M. El Defrawy, M. Zarki, G. Tsudik
{"title":"Incentive-based cooperative and secure inter-personal networking","authors":"Karim M. El Defrawy, M. Zarki, G. Tsudik","doi":"10.1145/1247694.1247706","DOIUrl":"https://doi.org/10.1145/1247694.1247706","url":null,"abstract":"In this paper we describe a framework for enabling a \"stranded\" mobile user to negotiate connectivity and networking resources through another user's devices. (A \"stranded\" user is one who has no direct means to access a network for communication purposes or other computing services.) The entity under consideration in this paper is the Wireless Personal-Area Network (WPAN). We regard the user's WPAN as an entity that negotiates short-term contracts on behalf of the user for access services through WPANs of other users that act as bridges to locally available resources. This collaborative approach allows on-the-go users to be always connected, even in locations where their service providers offer no coverage.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"585 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121975347","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}
引用次数: 6
Reliable and efficient message delivery in delay tolerant networks using rateless codes 使用无速率码的可容忍延迟网络中可靠和高效的消息传递
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247712
B. Vellambi, R. Subramanian, F. Fekri, M. Ammar
{"title":"Reliable and efficient message delivery in delay tolerant networks using rateless codes","authors":"B. Vellambi, R. Subramanian, F. Fekri, M. Ammar","doi":"10.1145/1247694.1247712","DOIUrl":"https://doi.org/10.1145/1247694.1247712","url":null,"abstract":"In this paper, we consider the problem of multiple unicast message delivery in Delay Tolerant Networks (DTNs). Long delays, mobility of nodes, and lack of connectivity that are characteristics of such network make this problem very challenging. Additionally, expiry of packets in a network, considered a useful means of regulating resource consumption, reduces reliability and increases the latency of message delivery. Traditional approaches to message delivery in such networks was based on transmitting multiple copies of entire message blocks. Recently, the application of simple erasure-based codes to messages were considered. This option opened up an interesting area of research. In this paper, we effect reliable message delivery with improved latency even in the presence of packet expiry and intermittent connectivity by applying rateless codes at the source where a message is generated. We perform extensive simulations on a variety of trace data from mobility models such as the UMassDieselNet testbed, an area-based random waypoint model, and a simple campus bus model. Results reveal the superiority of our scheme in comparison to other present schemes.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117335071","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}
引用次数: 45
Opportunistic spatio-temporal dissemination system for vehicular networks 车载网络的机会时空传播系统
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247702
Ilias Leontiadis, C. Mascolo
{"title":"Opportunistic spatio-temporal dissemination system for vehicular networks","authors":"Ilias Leontiadis, C. Mascolo","doi":"10.1145/1247694.1247702","DOIUrl":"https://doi.org/10.1145/1247694.1247702","url":null,"abstract":"Opportunistic dissemination protocols have potentially applications in the domain of vehicular networking, ranging from advertising to emergency/traffic/parking information spreading: one of the characteristics of vehicular networks is that they are often partitioned due to lack of continuity in connectivity among cars or limited coverage of infostations in remote areas. Most available opportunistic, or delay tolerant, networking protocols, however, fail to take into account the peculiarities of vehicular networks.\u0000 This paper introduces a novel opportunistic event dissemination protocol for vehicular networks. The protocol takes into account the characteristics of these networks in order to dispatch the publications to the subscribers. Furthermore, it uses opportunistic cache and replay mechanisms to deliver the notifications to new subscribers in the area throughout the publication interval. We evaluate our approach through simulation using realistic vehicular traces. We compare our algorithm with a standard epidemic protocol, which offer the best alternative in terms of message delivery, by measuring overhead and delivery over a number of scenarios.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125055768","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}
引用次数: 126
Evaluating vehicle network strategies for downtown Portland: opportunistic infrastructure and the importance of realistic mobility models 评估波特兰市中心的车辆网络策略:机会基础设施和现实移动模型的重要性
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247704
G. Marfia, G. Pau, E. D. Sena, E. Giordano, M. Gerla
{"title":"Evaluating vehicle network strategies for downtown Portland: opportunistic infrastructure and the importance of realistic mobility models","authors":"G. Marfia, G. Pau, E. D. Sena, E. Giordano, M. Gerla","doi":"10.1145/1247694.1247704","DOIUrl":"https://doi.org/10.1145/1247694.1247704","url":null,"abstract":"In an urban environment, vehicles can opportunistically exploit infrastructure through open Access Points (APs) to efficiently communicate with other vehicles. This is to avoid long wireless ad hoc paths, and to alleviate congestion in the wireless grid. Analytic and simulation models are used to optimize the communications and networking strategies. For realistic results, one important challenge is the accurate representation of traffic mobility patterns.\u0000 In this paper we introduce realistic vehicular mobility traces of downtown Portland, Oregon, obtained fromextremely detailed large scale traffic simulations performed at the Los Alamos National Laboratories (LANL). To the best of our knowledge, these are among the most accurate synthetic motion traces available for study, with the exception of actual car trace measurements. The new mobility model is used to evaluate AODV [1] in flat and opportunistic infrastructure routing. To assess the importance of a realistic mobility model for this evaluation, we compare these results with those obtained with CORSIM [2] traces.\u0000 The paper makes the following contributions: (a) introduction of efficient, opportunistic strategies for extending the AP infrastructure to use vehicle to vehicle paths, and (b) assessment of different mobility models - CORSIM traces and LANL's realistic vehicular traces - in the modeling of different routing strategies.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690767","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}
引用次数: 97
Reactive sink mobility in wireless sensor networks 无线传感器网络中的响应汇迁移
International Workshop on Mobile Opportunistic Networks Pub Date : 2007-06-11 DOI: 10.1145/1247694.1247700
D. Puccinelli, Matthew Brennan, M. Haenggi
{"title":"Reactive sink mobility in wireless sensor networks","authors":"D. Puccinelli, Matthew Brennan, M. Haenggi","doi":"10.1145/1247694.1247700","DOIUrl":"https://doi.org/10.1145/1247694.1247700","url":null,"abstract":"The ability of a sink node to move can greatly improve the fault tolerance and load balancing properties of a sensor network. Rather than assuming extensive mobility and trying to minimize the large-scale path loss between the mobile sink and the nodes, we focus on limited-scope, arbitrary mobility triggered in response to a form of network feedback. Due to multipath fading effects, limited mobility dynamically modifies the set of sink neighbors and distributes network traffic over a larger number of nodes. We illustrate the impact of this reactive sink mobility concept on data collection by implementing it on top of a novel gradient-based routing protocol. We use Berkeley motes to present a proof of concept as well as a performance evaluation of our approach, with a particular emphasis on the advantages in terms of robustness and lifetime.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132992513","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
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学术官方微信