{"title":"Dependable and secure geocast in vehicular networks","authors":"E. Schoch, B. Bako, S. Dietzel, F. Kargl","doi":"10.1145/1860058.1860068","DOIUrl":"https://doi.org/10.1145/1860058.1860068","url":null,"abstract":"Inter-vehicular communication envisions many applications to enhance traffic safety. One fundamental communication paradigm used to realize a wide range of such applications is called Geocast, that is, multi-hop broadcast dissemination of messages within a geographically restricted destination region. Because of the safety-related nature of many VANET applications, it is crucial that Geocast protocols ensure dependable dissemination of information. Here, dependability has two aspects. First, a Geocast protocol needs to scale to varying node densities - reliable delivery should be provided both in sparsely connected networks and also in scenarios with high channel load due to high node density. In addition, Geocast needs to be protected against attacks to achieve dependable dissemination of information even in presence of malicious nodes trying to suppress information delivery. In this work, we focus on the goal of Geocast security. We evaluate the impact of several attacks, and, based on these results, we introduce specific countermeasures against the discovered threats. Particularly, we highlight the intrinsic security properties already present in scalability-enhancing mechanisms. Thus, we show how security and scalability complement each other in Geocast protocols. In summary, our focus are lightweight and efficient measures to secure Geocast for usage in VANETs.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125015656","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}
{"title":"Learning the relevance of parking information in VANETs","authors":"P. Szczurek, Bo Xu, O. Wolfson, Jie Lin, N. Rishe","doi":"10.1145/1860058.1860074","DOIUrl":"https://doi.org/10.1145/1860058.1860074","url":null,"abstract":"The use of Vehicular Ad-Hoc Network (VANET) has been applied to many applications involving information dissemination. Many of such applications are limited by the communication limitations of a VANET, such as limited transmission range and bandwidth. This imposes a necessity for evaluating the relevance of information. This paper proposes the use of machine learning for finding relevance of information for a parking information dissemination system. The proposed method uses the learned relevance for aiding vehicles in decision making by finding the probability that a given parking location will be available at the time of arrival. The method was evaluated through simulations and the results show that the proposed method is successful at learning the relevance of parking reports, which resulted in lower parking discovery times for vehicles.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878042","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}
{"title":"Path loss and delay profile models for its in 700mhz band","authors":"H. Iwai, Ippei Sugae","doi":"10.1145/1860058.1860070","DOIUrl":"https://doi.org/10.1145/1860058.1860070","url":null,"abstract":"Path loss and delay profile models for ITS applications based on the measured data at 700MHz band are presented.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645856","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}
{"title":"Fundamental tradeoffs in vehicular ad hoc networks","authors":"M. Nekoui, H. Pishro-Nik","doi":"10.1145/1860058.1860078","DOIUrl":"https://doi.org/10.1145/1860058.1860078","url":null,"abstract":"Due to their advantages in terms of safety, efficiency and comfort, Vehicular Ad Hoc Networks (VANETs) have recently drawn the attention of researchers from among a wide spectrum of engineering fields. Although transportation and communications engineers have independently delved into issues related with vehicular networks, analyzing them from their own perspectives; the void of a more comprehensive study which blends the theory of the two and seeks to address their mutual dependencies, is evident in the current literature. In this paper we initiate this surge by studying the interactions of traffic flow, safety and communications capacity within a simple transportation system. To that end we first render mathematical realizations for such criteria and study how the new technology can affect them and their mutual interactions. More specifically, the tradeoffs inherent in the capacity-flow and flow-safety relations have been analyzed. Our study helps foresee the effect of the gradual introduction of communications-enabled vehicles on the safety and efficiency of transportation networks before their actual deployment.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583005","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}
Michel Ferreira, Ricardo Fernandes, Hugo Conceição, Wantanee Viriyasitavat, O. Tonguz
{"title":"Self-organized traffic control","authors":"Michel Ferreira, Ricardo Fernandes, Hugo Conceição, Wantanee Viriyasitavat, O. Tonguz","doi":"10.1145/1860058.1860077","DOIUrl":"https://doi.org/10.1145/1860058.1860077","url":null,"abstract":"In this paper we propose and present preliminary results on the migration of traffic lights as roadside-based infrastructures to in-vehicle virtual signs supported only by vehicle- to-vehicle communications. We design a virtual traffic light protocol that can dynamically optimize the flow of traffic in road intersections without requiring any roadside infrastructure. Elected vehicles act as temporary road junction infrastructures and broadcast traffic light messages that are shown to drivers through in-vehicle displays. This approach renders signalized control of intersections truly ubiquitous, which significantly increases the overall traffic flow. We pro- vide compelling evidence that our proposal is a scalable and cost-effective solution to urban traffic control.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122970422","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}
{"title":"Dynamic channel partition and reservation for structured channel access in vehicular networks","authors":"R. K. Lam, P. Kumar","doi":"10.1145/1860058.1860075","DOIUrl":"https://doi.org/10.1145/1860058.1860075","url":null,"abstract":"A large portion of vehicular safety applications require reliable broadcasting. IEEE 802.11p has been shown to have doubtful performance in this aspect [2]. In [1] we have proposed a Dynamic Channel Reservation (DCR) protocol to provide low packet loss probability for vehicular communication by exploiting the unique structure of vehicular networks (VANET), and employing a dynamic TDMA mechanism. In this work, we address the situation when there is asymmetric traffic demands from vehicles on the two sides of a roadway, under which condition the throughput performance of unmodified DCR would be significantly degraded, due to its static partition and allocation of TDMA channels to each side of the road. We therefore augment DCR by designing a protocol to dynamically allocate channels to the two sides of the road according to their time-varying traffic demands. Our design replaces the need for vehicles on the two sides to contend for each TDMA channel with a mechanism for them to contend for the boundary between the contiguous sets of channels allocated to the two sides. Preliminary ns-2 simulations show that our design enhances DCR and delivers low packet loss rate and higher throughput regardless of the level of asymmetry of the traffic demand","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929876","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}
{"title":"Supporting handover in an IEEE 802.11p-based wireless access system","authors":"Jungwook Choi, Hyukjoon Lee","doi":"10.1145/1860058.1860073","DOIUrl":"https://doi.org/10.1145/1860058.1860073","url":null,"abstract":"The IEEE 802.11p-based wireless access networks are about to be deployed by major highways around the world as one of the main information hauling infrastructure for ITS safety applications. As the most applications of the IEEE 802.11p standard require the delivery of short text-based messages, the standard does not support handover between adjacent Road-side Units (RSUs). However, demand for seamless real-time services such as short video clips of CCTVs on a highway gives rise to support for handover in the IEE 802.11p-based wireless access systems. In this paper, we describe a seamless handover scheme for an IEEE 802.11p-based wireless access system that takes advantage of the fixed-order placement of the RSUs and unidirectional movement of the vehicles along the highways. More specifically, this handover scheme utilizes the IEEE 802.11 disassociation message as to signal the old RSU of an On-broad Unit's (OBU) departure from its coverage area. The subsequent downstream data frames can be proactively forwarded to the new RSU for delivery to the OBU after its link establishment with the new RSU. Simulation results show superior performance of the proposed scheme compared to a poll-based scheme.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370682","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}
{"title":"Simulation-based capacity estimates for local broadcast transmissions","authors":"Felix Schmidt-Eisenlohr, H. Hartenstein","doi":"10.1145/1860058.1860063","DOIUrl":"https://doi.org/10.1145/1860058.1860063","url":null,"abstract":"The periodic transmission of status updates by all vehicles in a vehicular network represents a service primitive that forms the basis for a lot of envisioned applications, in particular safety related ones. Due to the limited resources that a wireless communication system like IEEE 802.11p is capable to provide, the question raises how much data each node may provide to the system such that the information can still be delivered with the quality of service required by the applications. In this work, local broadcasts capacity is introduced together with straight-forward upper and lower bounds, and estimated by extensive detailed simulations. We show that the ratio of simulation-based capacity estimates and the upper bound is similar for a wide range of system configurations and that the communication system may only be used up to 22% of its upper capacity bound such that service requirements can still be fulfilled.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116636709","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}
{"title":"Store carry and forward relay aided cellular networks","authors":"P. Kolios, V. Friderikos, K. Papadaki","doi":"10.1145/1860058.1860071","DOIUrl":"https://doi.org/10.1145/1860058.1860071","url":null,"abstract":"To support the ever increasing requirements for data services, some of the current architectural trends for future cellular networks is a reduction on the cell size and support of multi hop relaying. A significant amount of previous research work has looked at efficient multi hop relaying schemes within the cell to increase the overall capacity, while avoiding data rate starvation at the edge of the cell. In this paper we detail the benefits of a generalized multi-hop relaying scheme, where mobile relay nodes (which in this case are assumed to be vehicles) can store information and relay it to other nodes or to the base station at a later time instance when the channel conditions are more favorable.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130660189","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}
{"title":"A probabilistic model for message propagation in two-dimensional vehicular ad-hoc networks","authors":"Yanyan Zhuang, Jianping Pan, Lin X. Cai","doi":"10.1145/1860058.1860064","DOIUrl":"https://doi.org/10.1145/1860058.1860064","url":null,"abstract":"Vehicular ad-hoc networks (VANET) promise to enhance the road safety and travel comfort significantly in both highway and city scenarios. Message propagation, either for emergency or pleasure purposes, constitutes a major category of VANET applications, and is particularly challenging in infrastructure-less vehicle-to-vehicle communication scenarios. In this paper, we study the connectivity property of message propagation in two-dimensional VANET. We first derive the exact expression for the average size of the connected components in the one-dimensional case, i.e., messages propagating along a main street, and give a close approximation to the size distribution. We further derive the connectivity of message propagation in the two-dimensional ladder case, i.e., covering the main and two side streets, and formulate the problem for the two-dimensional lattice case to cover all the blocks in a district. Extensive simulation has been conducted to verify the analytical model and provide further insights in message propagation with and without geographic constraints, respectively. The simulation results show the efficacy of the model and the tradeoff between these two message forwarding strategies, and provide guidelines for future network planning and protocol development.","PeriodicalId":416154,"journal":{"name":"International Workshop on VehiculAr Inter-NETworking","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117215235","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}