2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop最新文献

筛选
英文 中文
CORP: Cooperative rateless code protocol for vehicular content dissemination 车载内容传播的合作无速率代码协议
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205197
Pasquale Cataldi, A. Tomatis, G. Grilli, M. Gerla
{"title":"CORP: Cooperative rateless code protocol for vehicular content dissemination","authors":"Pasquale Cataldi, A. Tomatis, G. Grilli, M. Gerla","doi":"10.1109/MEDHOCNET.2009.5205197","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205197","url":null,"abstract":"Data dissemination in vehicular networks has been a challenge due to unpredictable network dynamics and channel unreliability. In fact, conventional approaches that rely on TCP or UDP do not perform well and cannot consistently guarantee reliable communications. A potential solution to these problems involves using erasure-correcting codes to make UDP transmissions reliable. However, it is also important to note that, due to vehicular mobility and road obstacles, connections among nodes can be as short as a few seconds. Therefore, in a communication between two nodes, the delay between node discovery and data exchange must be minimized. In this paper we present CORP, a Cooperative Rateless Protocol that exploits the reliability of the rateless coding approach while performing fast and efficient dissemination through cooperating nodes within the network. The use of rateless codes and unicast connections places minimal constraints on the delay between node discovery and data transmission, thus simplifying and rendering feasible the content reliable download even in a highly dynamic scenario. Results from simulations reveal that performance improves as more and more nodes cooperate. In sum, CORP yields important improvements in terms of speed of dissemination when compared to traditional approaches such as TCP.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132001011","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
A novel routing algorithm based on chord for hybrid wireless ad-hoc networks 一种基于chord的混合无线自组网路由算法
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205203
Jing Cao, Wei Wu
{"title":"A novel routing algorithm based on chord for hybrid wireless ad-hoc networks","authors":"Jing Cao, Wei Wu","doi":"10.1109/MEDHOCNET.2009.5205203","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205203","url":null,"abstract":"The scale of network and bandwidth of link have been limited by current routing technologies in hybrid wireless Ad-hoc networks, so we present a new routing algorithm. In the routing algorithm, the routing information is treated as a resource, and it can be stored and searched in a distributed way with Chord. The routing of data packet prefers to forward by infrastructure. In comparison with OLSR, the algorithm can not only improve the network throughput by average 25%, but also save the delay of End-to-End by average 30%. And with the increasing of network scale, the benefit will be more significant.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117277904","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
Scalable communication cost reduction: The Chord case 可伸缩的通信成本降低:Chord案例
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205198
K. Oikonomou, S. Sioutas, I. Stavrakakis
{"title":"Scalable communication cost reduction: The Chord case","authors":"K. Oikonomou, S. Sioutas, I. Stavrakakis","doi":"10.1109/MEDHOCNET.2009.5205198","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205198","url":null,"abstract":"In peer-to-peer (P2P) network system design a main focus is on efficient service discovery schemes, most frequently assuming permanent (or long-term stationary) positions for service facilities, neglecting communication costs due to the actual locations of the facilities. Since the problem of communication cost minimization is a large optimization problem (NP-hard) and requires global information (i.e., not scalable), in this paper the service migration philosophy is adopted which permits service facility movements and yields smaller communication cost in a scalable manner (i.e., based on local information). Service migration is incorporated in the Chord P2P system, imposing certain changes (e.g., the extension of the service discovery scheme of Chord) and introducing an extra system overhead (i.e., update messages) for the efficient operation of the (enhanced) system. As it is demonstrated here using simulation results, the communication cost corresponding to the extra system overhead is significantly small and more than enough compensated for by the communication cost reduction due to the introduction of service migration. As long as the network remains unchanged, the former communication cost is paid only once while the latter communication cost reduction is permanent.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656913","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
Extrapolation-based and QoS-aware real-time communication in wireless mobile ad hoc networks 无线移动自组网中基于外推和qos感知的实时通信
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205201
A. Agbaria, G. Gershinsky, Nir Naaman, K. Shagin
{"title":"Extrapolation-based and QoS-aware real-time communication in wireless mobile ad hoc networks","authors":"A. Agbaria, G. Gershinsky, Nir Naaman, K. Shagin","doi":"10.1109/MEDHOCNET.2009.5205201","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205201","url":null,"abstract":"In mobile ad hoc networks (MANETs), it is increasingly important to devote attention to real-time and quality of service (QoS) issues. We present here a novel extrapolation-based and QoS-aware technology for providing soft real-time services in MANETs. The proposed technology combines elements of proactive and location-based techniques. Each node maintains a global view, which is periodically updated through state exchange among all the nodes. At any time, a node is able to extrapolate the location of a given node based on its velocity vector. Resource management, dynamic scheduling, velocity-based extrapolation, and multipath search techniques are employed to meet the realtime and QoS requirements despite network contention and frequent topology changes. We demonstrate this technology by presenting a real-time and QoS routing protocol. We evaluate the performance of the protocol and compare it to the performance of other well-known routing protocols.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128402580","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}
引用次数: 9
Content-based routing using subpart orthogonal codes 使用子部分正交码的基于内容的路由
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205202
Christine Jardak, J. Riihijarvi, P. Mahonen
{"title":"Content-based routing using subpart orthogonal codes","authors":"Christine Jardak, J. Riihijarvi, P. Mahonen","doi":"10.1109/MEDHOCNET.2009.5205202","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205202","url":null,"abstract":"We study the use of orthogonal codes as alternative to Bloom filters in content-based routing. In particular we explore the trade-off between centralized solutions using regular orthogonal codes and generating codes locally by hashing. We demonstrate that introduction of subpart orthogonal codes allows distributed operation while leading to shorter key lengths than Bloom filters with the same probability of data localization. We study the performance of sub-part orthogonal codes by both analytical means and in a simulation environment. Results show that the use of sub-part orthogonal codes reduces overhead without sacrificing performance in both tree and grid topologies.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126943186","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
Throughput-capacity and bit-per-joule performance of IEEE 802.11 based wireless mesh networks 基于IEEE 802.11的无线网状网络的吞吐量容量和每焦耳位性能
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205200
Rima Khalaf-Bitar, I. Rubin
{"title":"Throughput-capacity and bit-per-joule performance of IEEE 802.11 based wireless mesh networks","authors":"Rima Khalaf-Bitar, I. Rubin","doi":"10.1109/MEDHOCNET.2009.5205200","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205200","url":null,"abstract":"Energy consumption is of utmost importance in wireless mesh networks where nodes are battery operated and have limited power resources. In this paper, we develop an analytical model to estimate the throughput-capacity of a wireless mesh network and use this model to study the network's bit-per-joule performance. We assume that each node uses an IEEE 802.11 based software controlled radio whose modulation/coding scheme and rate can be dynamically selected. A topology synthesis algorithm is used to elect nodes to act as access points as well as backbone nodes (BNs). The latter form a mesh backbone network infrastructure. We present an algorithm that is used to analytically calculate an approximation of the throughput capacity performance of the network. We use this algorithm to examine the performance efficiency of the network, expressed in terms of the throughput rate per unit energy consumed under the joint setting of nodal transmit power and data rate levels. Our results show that when traffic is uniformly distributed across the area of operations, increasing the nodal transmit power levels, as well as the data rates, tend often to enhance the bit-per-joule performance of the system. We also examine the impact of the selection of the transmit data rate and power levels used in conducting the topology synthesis of the backbone network.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097399","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
Preventing Layer-3 wormhole attacks in ad-hoc networks with multipath DSR 利用多路径DSR防止ad-hoc网络中的三层虫洞攻击
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-18 DOI: 10.1109/MEDHOCNET.2009.5205196
Luis Fernando Garcia, J. Robert
{"title":"Preventing Layer-3 wormhole attacks in ad-hoc networks with multipath DSR","authors":"Luis Fernando Garcia, J. Robert","doi":"10.1109/MEDHOCNET.2009.5205196","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205196","url":null,"abstract":"Wormhole attacks in ad-hoc networks have been attracting much attention over the years. They consist in two malicious nodes tunneling traffic from one end of the network to the other. Several approaches are proposed to detect these attacks but only few solutions exploit the information provided by multipath routing schemes. A new approach detecting wormhole attacks is presented in this paper. The Witness Integration Multipath protocol is based on the multipath DSR routing protocol and finds suspicious behaviour related to wormhole attacks. It does not require any major protocol modification nor as much cryptographic processing as the previous solutions.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122310765","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
Random access wireless networks with controlled mobility 随机存取无线网络与控制移动
2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop Pub Date : 2009-08-01 DOI: 10.1109/MEDHOCNET.2009.5205194
G. Çelik, E. Modiano
{"title":"Random access wireless networks with controlled mobility","authors":"G. Çelik, E. Modiano","doi":"10.1109/MEDHOCNET.2009.5205194","DOIUrl":"https://doi.org/10.1109/MEDHOCNET.2009.5205194","url":null,"abstract":"This paper considers wireless networks where messages arriving randomly (in time and space) are collected by a mobile receiver. The messages are transmitted to the mobile receiver according to a random access scheme and the receiver dynamically adjusts its position in order to receive these messages in minimum time. We investigate the use of wireless transmission and controlled mobility to improve the delay performance in such systems. In particular, we characterize the tradeoff between wireless transmission and physical movement of the mobile receiver. We derive a lower bound for the delay in the system and show how it is affected by different communication parameters. We show that the combination of mobility and wireless transmission results in a significant improvement in delay as compared to a system where wireless transmission is not used.","PeriodicalId":301316,"journal":{"name":"2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116562843","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}
引用次数: 9
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学术官方微信