A Routing Strategy for Vehicular Ad Hoc Networks in City Environments
- 格式:pdf
- 大小:489.40 KB
- 文档页数:6
signal range and drop out of the network, oth-er vehicles can join in, connecting vehicles to one another to create a mobile Internet. We de-termine that V ANET only covers a very small mobile network that is subject to mobility con-straints and the number of connected vehicles. Several characteristics of large cities, such as traffic jams, tall buildings, bad driver behav-iors, and complex road networks, further hin-der its use. Therefore, for V ANET, the objects involved are temporary, random and unstable, and the range of usage is local and discrete, i.e., VANET cannot provide whole (global) and sustainable services/applications for cus-tomers. Over the past several decades, there has not been any classic or popular implemen-tation of VANET. The desired commercial interests have not emerged either. Therefore, V ANET’s usage has begun to stagnate.In contrast to VANET, IoV has two main technology directions: vehicles’ neworking and vehicles’ intelligentialize. Vehicles’ net-working is consisting of V ANET (also called vehicles’ interconnection), Vehicle Telematics (also called connected vehicles) and Mobile Internet (vehicle is as a wheeled mobile termi-nal). Vehicles’ intelligence is that the integra-tion of driver and vehicle as a unity is more intelligent by using network technologies, which refers to the deep learning, cognitive computing, swarm computing, uncertainty artificial intelligence, etc. So, IoV focuses on the intelligent integration of humans, vehi-cles, things and environments and is a largerAbstract: The new era of the Internet of Things is driving the evolution of conventional Vehicle Ad-hoc Networks into the Internet of Vehicles (IoV). With the rapid development of computation and communication technologies, IoV promises huge commercial interest and research value, thereby attracting a large number of companies and researchers. This paper proposes an abstract network model of the IoV , discusses the technologies required to create the IoV , presents different applications b a s e d o n c e r t a i n c u r r e n t l y e x i s t i n g technologies, provides several open research challenges and describes essential future research in the area of IoV .Keywords: internet of vehicles; VANET; vehicle telematics; network modelI. I NTRODUCTIONAccording to recent predictions 1, 25 billion “things” will be connected to the Internet by 2020, of which vehicles will constitute a significant portion. With increasing numbers of vehicles being connected to the Internet of Things (IoT), the conventional Vehicle Ad-hoc Networks (VANETs) are changing into the Internet of Vehicle (IoV). We explore the reasons for this evolution below.As is well-known, V ANET [1] turns every participating vehicle into a wireless router or mobile node, enabling vehicles to connect to each other and, in turn, create a network with a wide range. Next, as vehicles fall out of theAn Overview of Internet of VehiclesYANG Fangchun, WANG Shangguang, LI Jinglin, LIU Zhihan, SUN QiboState Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications, Beijing, ChinaV EHICULAR N ETWORKING1/7037738/The_Inter-net_of_Things_A_Study_in_Hype_Reality_Disrup-tion_and_Growtthe conventional Vehicle Ad-hoc Networks (V ANETs), Vehicle Telematics, and other con-nected vehicle networks have to evolve into the Internet of Vehicle (IoV). The question accordingly arises as to why such systems did not evolve into IoT, Internet or wireless mo-bile networks.The main reason is that some characteris-tics of IoV are different from IoT, Internet or wireless mobile networks. Firstly, in wireless mobile networks, most end-users’ trajectories follow a random walk model. However, in IoV , the trajectory of vehicles is subject to the road distributions in the city. Secondly, IoT focuses on things and provides data-aware-ness for connected things, while the Internet focuses on humans and provides information services for humans. However, IoV focuses on the integration of humans and vehicles, in which, vehicles are an extension of a human’s abilities, and humans are an extension of a vehicle’s intelligence. The network model, the service model, and the behavior model of human-vehicle systems are highly different from IoT, Internet or wireless mobile network. Finally, IoV interconnects humans within and around vehicles, intelligent systems on board vehicles, and various cyber-physical systems in urban environments, by integrating vehi-cles, sensors, and mobile devices into a global network, thus enabling various services to be delivered to vehicles and humans on board and around vehicles. Several researchers have referred to the vehicle as a manned computer with four wheels or a manned large phone in IoV. Thus, in contrast to other networks, ex-isting multi-user, multi-vehicle, multi-thing and multi-network systems need multi-level collaboration in IoV .In this paper, we first provide a network model of IoV using the swarm model and an individual model. We introduce existing re-search work focusing on activation and main-tenance of IoV. Then, we survey the various applications based on some currently existing technologies. Finally, we give several open re-search challenges for both the network model and the service model of human-vehicle sys-network that provides services for large cities or even a whole country. IoV is an open and integrated network system with high manage-ability, controllability, operationalization and credibility and is composed of multiple users, multiple vehicles, multiple things and multiple networks. Based on the cooperation between computation and communication, e.g., col-laborative awareness of humans and vehicles, or swarm intelligence computation and cog-nition, IoV can obtain, manage and compute the large scale complex and dynamic data of humans, vehicles, things, and environments to improve the computability, extensibility and sustainability of complex network systems and information services. An ideal goal for IoV is to finally realize in-depth integration of human-vehicle-thing-environment, reduce social cost, promote the efficiency of trans-portation, improve the service level of cities, and ensure that humans are satisfied with and enjoy their vehicles. With this definition, it is clear that V ANET is only a sub network of IoV. Moreover, IoV also contains Vehicle Telematics [2], which is a term used to define a connected vehicle interchanging electronic data and providing such information services as location-based information services, remote diagnostics, on-demand navigation, and au-dio-visual entertainment content. For IoV , Ve-hicle Telematics is simply a vehicle with more complex communication technologies, and the intelligent transportation system is an applica-tion of IoV , but vehicle electronic systems do not belong to IoV .In the last several years, the emergence of IoT, cloud computing, and Big Data has driven demand from a large number of users. Individ-ual developers and IT enterprises have pub-lished various services/applications. However, because V ANET and Vehicle Telematics lack the processing capacity for handling global (whole) information, they can only be used in short term applications or for small scale ser-vices, which limits the development and popu-lar demand for these applications on consumer vehicles. There is a desperate need for an openand integrated network system. Therefore,people who consume or provide services/ap-plications of IoV . Human do not only contain the people in vehicles such as drivers and pas-sengers but also the people in environment of IoV such as pedestrians, cyclists, and drivers’ family members. Vehicle in IoV terminology refers to all vehicles that consume or provide services/applications of IoV . Thing in IoV ter-minology refers to any element other than hu-man and vehicle. Things can be inside vehicles or outside, such as AP or road. Environment refers to the combination of human, vehicle and thing.The individual model focuses on one vehi-cle. Through the interactions between human and environment, vehicle and environment, and thing and environment, IoV can provide services for the vehicles, the people and the things in the vehicles. In the model, the in-tra-vehicle network is used to support the interaction between human and vehicle, and the interaction between vehicle and thing in that vehicle. The inter-vehicle network is usedtems, i.e., enhanced communication through computation and sustainability of service pro-viding, and outline essential future research work in the area of IoV .The rest of this paper is organized as fol-lows. Section 2 describes o ur proposed net-work model of IoV. The overview of IoV is presented from three different perspectives in Section 3. In Section 4, several open research challenges and essential future research work related to IoV are outlined. Finally, we present this paper’s conclusions in Section 5.II. N ETWORK M ODEL OF IOVAs shown in Fig. 1, we propose a network model of IoV based on our previous work [3], in which the model is composed of a swarm model and an individual model. The key as-pect of the network model is the integration between human, vehicle, thing, and environ-ment.Human in IoV terminology refers to all theFig.1Network model of IoVsignificantly improve the quality of vehicle service, while a bad wireless access may often lead to the breakdown of services. As is well-known, routing technology is the research core of traditional networks. For IoV , while routing is still the core of the inter-vehicle network, it is also essential for delivering the control message. Finally, IoV has the two most im-portant elements, i.e., users and network. For a simple IoV, wireless access is its user, and routing is its network. With the development of IoV , however, these elements might be less important, and other technologies may play a vital role, such as collaboration technology and swarm intelligence computing. However, due to page limitations, a detailed discussion is beyond this paper.Note that the technologies introduced in this section cannot cover the technologies of IoV , and most of them belong to V ANET [4] or Ve-hicle Telematics. The reason is that IoV is an open and integrated network system composed of multiple users, multiple vehicles, multiple things and multiple networks, and an integrat-ed IoV is not described. Hence, this section mainly focuses on existing technologies and applications, even if they do not represent the technologies and applications of IoV .3.1 Activation of IoVThere are many steps in the activation of IoV , but the most important step is to take the vehi-cles into the integrated network of IoV using wireless access technologies. At present, there are many existing wireless access technologies such as WLANs, WiMAX, Cellular Wireless, and satellite communications [5]. As shown in Fig. 1, most of these technologies are used to connect vehicles to each other in IoV .WLAN contains IEEE 802.11a/b/g/n/p standards. IEEE 802.11-based WLAN, which has achieved great acceptance in the market, supports short-range, relatively high-speed data transmission. The maximum achievable data rate in the latest version (802.11n) is ap-proximately 100 Mbps. IEEE 802.11p is a new communication standard in the IEEE 802.11 family which is based on the IEEE 802.11a.to support the interaction between human and environment, vehicle and environment, and thing and environment. Swarm model focus-es on multi-user, multi-vehicle, multi-thing and multi-network scenarios. Through swarm intelligence, crowd sensing and crowd sourc-ing, and social computing, IoV can provide services/applications. Moreover, in this model, the interaction between human and human, ve-hicle and vehicle, and thing and thing, all need an integrated network to collaborate with each other and with the environment. Note that IoV has a computation platform for providing vari-ous decisions for whole network, and there are many virtual vehicles with drivers correspond-ing to physica vehicles and drivers. Then we call the virtual vehicle with driver as Autobot. In the IoV, Autobot can interact with each other by using swarm computing technologies and provide decision-making information for IoV in the computation platform.III. T ECHNOLOGY AND A PPLICATION OF IOVOver a decade ago, both industrial and aca-demic researchers proposed many advanced technologies for the application layer, the mo-bile model & the channel model, the physical layer & the data link layer, the network layer & the transport layer, and security & privacy; these technologies are all used in IoV . In this section, we only focus on giving an overview of the technologies and their applications in IoV, and do not describe the details of the technologies. The overview describes the acti-vation of the IoV , maintenance of the IoV , and IoV applications.For the activation and maintenance of the IoV, we only summarize the wireless access technology and the routing technology. There are several reasons for focusing on these two technologies. Firstly, most researchers working on IoV focus on wireless access and routing, for which the number of proposed re-search works are the highest. Secondly, wire-less access technologies play an important role in IoV . A good wireless access technology canquality of service, even for non-line-of-sight transmissions. The key advantage of WiMAX compared to WLAN is that the channel access method in WiMAX uses a scheduling algo-rithm in which the subscriber station needs to compete only once for initial entry into the network.Cellular wireless comprises of 3G, 4G and LTE. Current 3G networks deliver data at a rate of 384 kbps to moving vehicles, and can go up to 2 Mbps for fi xed nodes. 3G sys-tems deliver smoother handoffs compared to WLAN and WiMAX systems, and many nota-ble works have been proposed. For example, Chao et al. [8] modeled the 3G downloading and sharing problem in integration networks. Qingwen et al. [9] made the first attempt in exploring the problem of 3G-assisted data delivery in V ANETs. However, due to central-ized switching at the mobile switching center (MSC) or the serving GPRS support node (SGSN), 3G latency may become an issue for many applications. Vinel [3] provided an an-IEEE 802.11p is designed for wireless access in the vehicular environment to support intel-ligent transport system applications. The use of wireless LANs in V ANETs requires further research. For example, Wellens et al. [6] pre-sented the results of an extensive measure-ment campaign evaluating the performance of IEEE 802.11a, b, and g in car communication scenarios, and showed that the velocity has a negligible impact, up to the maximum tested speed of 180 km/h. Yuan et al. [7] evaluated the performance of the IEEE 802.11p MAC protocol applied to V2V safety communica-tions in a typical highway environment. Wi-MAX contains IEEE 802.16 a/e/m standards. IEEE 802.16 standard-based WiMAX are able to cover a large geographical area, up to 50 km, and can deliver significant bandwidth to end-users - up to 72 Mbps theoretically. While IEEE 802.16 standard only supports fixed broadband wireless communications, IEEE 802.16e/mobile WiMAX standard supports speeds up to 160 km/h and different classes of Fig.2 Wireless access technologies in IoVAPManagement and Control on the APIEEE 802.16WiMax DatabaseAP Management and Control on the APAPManagement and Control on the APCellular NetworkCellular NetworkDatabaseSatellite NetworkSatellite Network DatabaseAPManagement and Control on the APIEEE 802.11WLAN DatabaseVehicleVehicleVehicleVehicleCentralized Management and Control Unitand Control Unit (CMCU)NetworkDatabaseCMCUIoV3.2 Maintenance of IoVThere are also many aspects to the mainte-nance of IoVs, such as data-awareness, virtual networks, and encoding, but the most im-portant aspect is the switching of the control message for IoV. Routing technology is the suitable solution, and in IoV , is dependent on a number of factors such as velocity, density, and direction of motion of the vehicles. As shown in Fig. 1, vehicles can either be the source or the destination during the process of routing, and various standards have been built to accomplish the task of routing. With the growing needs of the users to access various resources during mobility, efficient techniques are required to support their needs and keep them satisfied.Topology based maintenance: Because of the large overhead incurred for route discovery and route maintenance for highly mobile unco-ordinated vehicles, only a few of the existing routing protocols for inter-vehicle networks are able to handle the requirements of safety applications [10,11]. An important group of routing protocols for ad-hoc networks is based on topology, and needs the establishment of an end-to-end path between the source and the destination before sending any data packet. Due to rapid changes in the network topology and highly varying communication channel conditions, the end-to-end paths determined by regular ad-hoc topology-based routing pro-tocols are easily broken. To solve this prob-lem, several routing protocols have been pro-posed [12,13] [14,15] [16] [17]. For example, Namboodiri and Gao [12] proposed a predic-tion-based routing for V ANETs. The PBR is a reactive routing protocol, which is specifically tailored to the highway mobility scenario, to improve upon routing capabilities without us-ing the overhead of a proactive protocol. The PBR exploits the deterministic motion pat-tern and speeds, to predict roughly how long an existing route between a “node” vehicle and a “gateway” vehicle will last. Using this prediction, the authors pre-emptively create new routes before the existing route lifetimealytical framework which allows comparing 802.11p/WA VE and LTE protocols in terms of the probability of delivering the beacon before the expiration of the deadline. Lei et al. [4] studied the potential use cases and technical design considerations in the operator con-trolled device-to-device communications. The potential use cases were analyzed and classi-fied into four categories. Each use case had its own marketing challenges and the design of related techniques should take these fac-tors into consideration. Gerla and Kleinrock [5] discussed LTE cellular service in a future urban scenario with very high bandwidth and broad range. The so-called cognitive radios will allow the user to be “best connected” all the time. For instance, in a shopping mall or in an airport lounge, LTE will become congested, and the user’s cognitive radio will disconnect from LTE. For vehicles, due to large costs, sat-ellite communications are barely used, except for GPS. It is only a supplement for temporary and emergency uses, when other communica-tion technologies are invalid or unavailable. Looking at the wireless access technologies described above, we think that the 4G or LTE should be the most efficient technology to launch the inter-vehicle network and to acti-vate the IoV . The reasons are as follows. First-ly, 4G or LTE is the most used communication standard, and has been deployed by most countries to provide access services. Obvious-ly, any vehicle can use it to connect to the IoV . Secondly, in the context of high buildings and a complex city environment, the performance of 4G or LTE is the best among all wireless access technologies. Finally, in the past ten years, the development of VANET has been very slow, and can barely be used in the real world. The main reason is that the connected vehicles cannot maintain V ANET in city roads because the goals of drivers are random and different. To maintain the V ANET, all vehicles must access the integrated network of IoV, after which IoV can be activated to provide services for users.which combines store-carry-and-forward tech-nique with routing decisions based on geo-graphic location. These geographic locations are provided by GPS devices. In GeoSpray, authors proposed a hybrid approach, mak-ing use of a multiple copy and a single copy routing scheme. To exploit alternate paths, GeoSpray starts with multiple copy schemes which spread a limited number of bundle cop-ies. Afterwards, it switches to a single copy scheme, which takes advantage of additional opportunities. It improves delivery success and reduces delivery delay. The protocol ap-plies active receipts to clear the delivered bun-dles across the network nodes. Compared with other geographic location-based schemes, and single copy and non-location based multiple copy routing protocols, it was found that Geo-Spray improves delivery probability and re-duces delivery delay. In contrast to the above work, Bernsen and Manivannan proposed [20] a routing protocol for V ANETs that utilizes an undirected graph representing the surrounding street layout, where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street seg-ments between those vertices. Unlike existing protocols, it performs real-time, active traffic monitoring and uses these data and other data gathered through passive mechanisms to as-sign a reliability rating to each street edge. Then, considering the different environments, a qualitative survey of position-based rout-ing protocols was made in [21], in which the major goal was to check if there was a good candidate for both environments or not. An-other perspective was offered by Liu et al. [22], who proposed a relative position based message dissemination protocol to guarantee high delivery ratio with acceptable latency and limited overhead. Campolo et al. [23] used the time, space and channel diversity to improve the efficiency and robustness of network ad-vertisement procedures in urban scenarios. Clustering based maintenance: In this type of routing scheme, one of the nodes among the vehicles in the cluster area becomes a clusterhead (CH), and manages the rest ofexpires. Toutouh et al. [13] proposed a well-known mobile ad hoc network routing proto-col for V ANETs to optimize parameter settings for link state routing by using an automatic optimization tool. Nzounta et al.[15] proposed a class of road-based VANET routing proto-cols. These protocols leverage real-time ve-hicular traffic information to create paths. Fur -thermore, geographical forwarding allows the use of any node on a road segment to transfer packets between two consecutive intersections on the path, reducing the path’s sensitivity to individual node movements. Huang et al. [16] examined the efficiency of node-disjoint path routing subject to different degrees of path coupling, with and without packet redundancy. An Adaptive approach for Information Dis-semination (AID) in VANETs was presented in [14], in which each node gathered the in-formation on neighbor nodes such as distance measurements, fixed upper/lower bounds and the number of neighboring nodes. Using this information, each node dynamically adjusts the values of local parameters. The authors of this approach also proposed a rebroadcast-ing algorithm to obtain the threshold value. The results obtained show that AID is better than other conventional schemes in its cate-gory. Fathy et al. [17] proposed a QoS Aware protocol for improving QoS in VANET. The protocol uses Multi-Protocol Label Switching (MPLS), which runs over any Layer 2 technol-ogies; and routers forward packets by looking at the label of the packet without searching the routing table for the next hop.Geographic based maintaining. The geo-graphic routing based protocols rely mainly on the position information of the destination, which is known either through the GPS sys-tem or through periodic beacon messages. By knowing their own position and the destination position, the messages can be routed directly, without knowing the topology of the network or prior route discovery. V . Naumov et al. [18] specifically designed a position-based routing protocol for inter-vehicle communication in a city and/or highway environment. Soares et al. [19] proposed the GeoSpray routing protocol,dynamic transmission range, the direction of vehicles, the entropy, and the distrust value parameters. Wang et al. [26] refined the orig -inal PC mechanism and proposed a passive clustering aided mechanism, the main goal of which is to construct a reliable and stable clus-ter structure for enhancing the routing perfor-mance in V ANETs. The proposed mechanism includes route discovery, route establishment, and data transmission phases. The main idea is to select suitable nodes to become cluster-heads or gateways, which then forward route request packets during the route discovery phase. Each clusterhead or gateway candidate self-evaluates its qualification for clusterhead or gateway based on a priority derived from athe nodes, which are called cluster members. If a node falls in the communication range of two or more clusters, it is called a border node. Different protocols have been proposed for this scheme, and they differ in terms of how the CH is selected and the way the routing is done. R. S. Schwartz et al. [24] proposed a dissemination protocol suitable for both sparse and dense vehicular networks. Suppression techniques were employed in dense networks, while the store-carry-forward communication model was used in sparse networks. A. Daein-abi [25] proposed a novel clustering algorithm - vehicular clustering - based on a weighted clustering algorithm that takes into consider-ation the number of neighbors based on theavoidance. At present, collision avoidance technologies are largely vehicle-based systems offered by original equipment manufacturers as autonomous packages which broadly serve two functions, collision warning and driver assistance. The former warns the driver when a collision seems imminent, while the latter partially controls the vehicle either for steady-state or as an emergency intervention [41]. To be specific, collision warning includes notifi -cations about a chain car accident, warnings about road conditions such as slippery road, and approaching emergency vehicle warning [5]. On the one hand, collision warnings could be used to warn cars of an accident that oc-curred further along the road, thus presenting a pile-up from occurring. On the other hand, they could also be used to provide drivers with early warnings and prevent an accident from happening in the first place. Note that driving near and through intersections is one of the most complex challenges that drivers face be-cause two or more traffic flows intersect, and the possibility of collision is high [42]. The intelligent intersection, where such conven-tional traffic control devices as stop signs and traffic signals are removed, has been a hot area of research for recent years. Vehicles coordi-nate their movement across the intersection through a combination of centralized and dis-tributed real-time decision making, utilizing global positioning, wireless communications and in-vehicle sensing and computation 1. A number of solutions for collision avoidance of multiple vehicles at an intersection have been proposed. A computationally efficient control law [43-45] has been derived from ex-ploitation of the monotonicity of the vehicles’ dynamics, but it has not been applied to more than two vehicles. An algorithm that addresses multi-vehicle collisions, based on abstraction, has been proposed in [46]. An algorithmic ap-proach to enforcing safety based on a time slot assignment, which can handle a larger number of vehicles, is found in [41]. Colombo et al. [47] designed a supervisor for collision avoid-ance, which is based on a hybrid algorithm that employs a dynamic model of the vehiclesweighted combination of the proposed metrics. P. Miao [27] proposed a cooperative commu-nication aware link scheduling scheme, with the objective of maximizing the throughput for a session in C-V ANETs. They let the RSU schedule the multi-hop data transmissions among vehicles on highways by sending small sized control messages.Based on the above overview, we provide a relative comparison of all routing protocols in Tab 1. In this table, Route length is the total distance between source and destination. PDR is the packet delivery ratio. Latency is the in-terval of time between the first broadcast and the end of the last host’s broadcast. Latency includes buffering, queuing, transmission and propagation delays.3.3 IoV applicationsWith the rapid development of numeric infor-mation technology and network technology, it is brought forward that theautomatization and intelligentization of vehicle.This gives birth to lots of applications which combine safe driving with service provision. For example, Apple CarPlay, originally introduced as iOS in vehicles, offer full-on automobile integration for Apple’s Maps and turn-by-turn navigation, phone, iMeessage, and music service 5. Similar to CarPlay, Google Android Auto provides a distraction-free interface that allows drivers enjoy the services by connecting Android de-vices to the vehicle. Chinese Tecent recently launched its homegrown navigation app Lu-bao that features user generated contents and social functions 7. For demonstration purposes, in this paper, IoV applications can be divided into two major categories: Safety applications and User applications. Applications that in-crease vehicle safety and improve the safety of the passengers on the roads by notifying the vehicles about any dangerous situation in their neighborhood are called safety applications. Applications that provide value-added services are called User applications.Technologies to enhance vehicular and passenger safety are of great interest, and one of the important applications is collision。
车载自组网的单层与跨层路由协议研究张一宸;王海;彭来献【摘要】VANET (Vehicle Ad hoc network) is an important application technology of mobile Ad hoc network in intelligent transportation system (ITS),and also a branch of traditional MANET field.With the continuous development of the Internet,the vehicular ad hoc network is of good prospects for development.Therefore,the characteristics and differences between VANET and MANET are discussed,the two aspects of single layer routing and cross layer routing summarized,the advantages and disadvantages for these two classes of routing expounded,typical cases and recent research status of the two classes of VANET routing described,and their respective characteristics analyzed.Finally,the development direction and research emphases for future VANET are explored.%车载自组织网络(VANET)是移动自组网在智能交通系统(ITS)中的重要技术应用,也是传统MANET领域的一个分支.随着互联网的不断发展,车载自组织网络的前景发展良好.因此,总结VANET与MANET的特征与区别,并从单层路由和跨层路由两个方面进行总结,阐述两类路由各自的优缺点,介绍VANET两类路由的典型案例和最新研究现状,分析它们各自的特点.最后,探讨未来VANET的发展方向与研究重点.【期刊名称】《通信技术》【年(卷),期】2017(050)010【总页数】6页(P2279-2284)【关键词】车载自组网;单层路由协议;跨层路由协议;协议分析【作者】张一宸;王海;彭来献【作者单位】解放军理工大学通信工程学院,江苏南京210007;解放军理工大学通信工程学院,江苏南京210007;解放军理工大学通信工程学院,江苏南京210007【正文语种】中文【中图分类】TP393车载自组织网络(Vehicular Ad-hoc Network,VANET)也称为车间通信[1](Inter-Vehicle Communication,IVC)网络。
基于节点密度和链路稳定性的AODV路由协议孙友伟;王楠;孙小田【摘要】为提高车联网通信中节点间数据传输的效率,提出一种基于节点密度和链路稳定性的按需路由算法.在节点的有效信号覆盖范围内根据节点间的相对距离设置转发等待时间,利用Hello报文统计各节点的邻节点数,依据邻节点数确定各节点分组转发概率,根据运动速度及方向计算中继节点的活跃时间,得到整条源至目的节点的链路有效时间,比较链路有效时间的大小选择稳定性高的路由.NS2仿真结果表明,优化后的算法提高了节点的平均分组投递率,降低了网络的平均时延,尤其在车辆节点密集情况下,路由的整体性能较AODV具有明显优化.%To ensure the effective transmission of data between nodes in the vehicle network communication,a routing algorithm based on node density and link stability was submitted.According to the relative distance between the nodes in the effective sig-nal coverage of the node,the forwarding waiting time was set,the Hello packet was used to obtain the adjacent node number and determine the packet forwarding probability.According to the velocity and direction of motion,the active time of the node was calculated to get the link effective time from the entire source to the destination node.The high stability of the better route was selected.The NS2 simulation results show that the optimized algorithm improves the average packet delivery ratio of the nodes and the average time delay is reduced,especially in the dense case of vehicle nodes,the overall performance of the routing is opti-mized obviously compared to AODV.【期刊名称】《计算机工程与设计》【年(卷),期】2016(037)012【总页数】5页(P3201-3204,3234)【关键词】车联网;最佳路由;盲目洪泛;按需距离矢量路由;自组织网络【作者】孙友伟;王楠;孙小田【作者单位】西安邮电大学通信与信息工程学院,陕西西安 710061;西安邮电大学通信与信息工程学院,陕西西安 710061;西安邮电大学通信与信息工程学院,陕西西安 710061【正文语种】中文【中图分类】TN913.6VANET(vehicular Ad Hoc network)即车辆自组织网络[1-3],它是Ad Hoc的一种特殊形式,每辆汽车自发组成一个无中心控制的自组织网络,以无线多跳的方式进行车辆间信息的传递,为驾驶中的司机提供实时性交通道路信息。
References[1]A.Bazzi, B.Masini, A.Zanella, G.Pasolini, Virtual road side units for georouting in VANETs, in: Proceedings of the International Conferenceon Connected Vehicles & Expo (ICCVE,2014),2014.[2]NHSTA web page. , (accessedJune2015).[3]R.Uzcategui, G.Acosta-Marum, WAVE: atutorial, IEEE Commun. Mag. 47(5) (2009)126–133, doi: 10.1109/MCOM.2009.4939288.[4]A.Bazzi, B.Masini, G.Pasolini, V2V and V2R for cellular resources saving in vehicular applications, in: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), 2012, pp. 3199–3203,doi:10.1109/WCNC.2012.6214358.[5]R.Ganti, F.Ye, H.Lei, Mobile crowdsensing: current state and future challenges, IEEE Commun.Mag.49(11)(2011)32–39,doi: 10.1109/MCOM.2011.6069707.[6]H.Ma, D.Zhao, P.Yuan, Opportunities in mobile crowd sensing, IEEE Commun.Mag.52(8) (2014)29–35,doi:10.1109/MCOM.2014.6871666.[7]X.Yu, H.Zhao, L.Zhang, S.Wu, B.Krishnamachari, V.Li, Cooperative sensing and compression in vehicular sensor networks for urban monitoring, in: Proceedings of the IEEE International Conference on Communications (ICC),2010,pp.1–5,doi:10.1109/ICC.2010.5502562.[8]A.R.Al-Ali, I.Zualkernan, F.Aloul, Amobile GPRS-sensors array for air pollution monitoring, IEEE Sens. J. 10(10)(2010)1666–1671,doi:10.1109/JSEN.2010.2045890.[9]A.Bazzi, B.Masini, O.Andrisano, On the frequent acquisition of small data through RACH in UMTS for ITS applications, IEEE Trans. Veh.Technol.60(7)(2011)2914–2926,doi:10.1109/TVT.2011.2160211.[10]C.Lochert, B.Scheuermann, C.Wewetzer, A.Luebke, M.Mauve, Data aggregation and roadside unit placement for a VANET traffic information system, in: Proceedings of the Fifth ACM International Workshopon Vehicular Inter-Networking, in: VANET’08, ACM, NewYork, NY, USA, 2008, pp.58–65, doi:10.1145/1410043.1410054.[11]B.Aslam, F.Amjad, C.Zou, Optimal roadside units placement in urban areas for vehicular networks, in: Proceedings of the IEEE Symposium on Computers and Communications (ISCC), 2012, pp. 000423–000429,doi:10.1109/ISCC.2012.6249333.[12]N.Benamar, K.D.Singh, M.Benamar, D.E.Ouadghiri, J.-M.Bonnin, Routing protocols in vehicular delay tolerant networks: a comprehensive survey, Comput. Commun. 48(0) (2014)141–158, doi:10.1016/com.2014.03.024.[13]Z.Taysi, A.Yavuz, Routing protocols for geonet: asurvey, IEEE Trans. Intell. Transp. Syst. 13(2) (2012)939–954,doi:10.1109/TITS.2012.2183637.[14]M.Mauve, J.Widmer, H.Hartenstein, A survey on position-basedrouting in mobile ad hoc networks, Network, IEEE15 (6) (2001)30–39,doi:10.1109/65.967595.[15]B.Karp, H.T.Kung, GPSR: greedy perimeter stateless routing for wireless networks, in: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom’00),ACM,NewYork,NY,USA,2000,pp.243–254,doi:10.1145/345910.345953.[16]C.Lochert, M.Mauve, H.Füssler, H.Hartenstein, Geographic routing in city scenarios, SIGMOBILE mun. Rev. 9(1)(2005)69–72,doi:10.1145/1055959.1055970.[17]U.Lee, E.Magistretti, B.Zhou, M.Gerla, P.Bellavista, A.Corradi, Efficient data harvesting in mobile sensor platforms, in: Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom), 2006, pp.5–356,doi:10.1109/PERCOMW.2006.47.[18]ert, M.Cetin, Queue length estimation from probe vehicle location and the impacts of sample size, Eur.J.Oper.Res.197(1)(2009)196–202,doi:10.1016/j.ejor.2008.06.024.[19]R.Stanica, M.Fiore, F.Malandrino, Offloading floating car data,in :Proceedings of the 14th IEEE International Symposium and Workshops on a World of Wireless, Mobile and Multimedia Networks(WoWMoM),2013,pp.1–9,doi:10.1109/WoWMoM.2013.6583391.[20]U.Lee, M.Gerla, A survey of urban vehicular sensing platforms, w.54(4)(2010)527–544,doi:10.1016/net.2009.07.011.[21]B.Masini, L.Zuliani, O.Andrisano, On the effectiveness of a GPRS based intelligent transportation system in a realistic scenario, in: Proceedings of the IEEE 63rd Vehicular Technology Conference(VTC2006-Spring),6,2006,pp.29973001, doi:10.1109/VETECS.2006.1683418.[22]I.Leontiadis, G.Marfia, D.Mack, G.Pau, C.Mascolo, M.Gerla, On the effectiveness of an opportunistic traffic management system for vehicular networks, IEEE Trans.Intell.Transp.Syst.12(4)(2011)1537–1548,doi:10.1109/TITS.2011.2161469.[23]C.deFabritiis, R.Ragona, G.Valenti, Traffic estimation and prediction based on real time floating car data, in: Proceedings of the 11th International IEEE Conference on Intelligent Transportation Systems(ITSC),2008,pp.197–203,doi:10.1109/ITSC.2008.4732534.[24]A.Skordylis, N.Trigoni, Efficient data propagation in traffic-monitoring vehicular networks, IEEE Trans.Intell.Transp.Syst.12(3)(2011)680694,doi:10.1109/TITS.2011.2159857.[25]A.Bazzi, B.M.Masini, A.Zanella, G.Pasolini, {IEEE} 802.11p for cellular offloading in vehicular sensor networks, Comput. Commun.60(2015)97–108,doi:10.1016/com.2015.01.012. [26]F.Li, Y.Wang, Routing in vehicular ad hoc networks: asurvey,IEEEVeh. Technol. Mag. 2(2)(2007)1222,doi:10.1109/MVT.2007.912927.[27]V.Naumov, T.Gross, Connectivity-aware routing (CAR) in vehicular ad-hoc networks, in: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), 2007,pp.1919–1927,doi:10.1109/INFCOM.2007.223.[28]J.Haerri, F.Filali, C.Bonnet, Performance comparison of AODV and OLSR in VANETs urban environments under realistic mobility patterns, in:Proceedings of the 5th IFIP Mediterranean Ad-Hoc Networking Workshop (Med-Hoc-Net-2006), Lipari,Italy,2006.[29]A.Vahdat, D.Becker, etal., Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, DukeUniversity, Durham, NorthCarolina,2000.[30]T.Spyropoulos, K.Psounis, C.S.Raghavendra, Sprayandwait: anefficient routing scheme for intermittently connected mobile networks,in: Proceedings of the 2005 ACM SIGCOMM Workshop on Delaytolerant Networking(WDTN’05),ACM,NewYork,NY,USA,2005,pp.252259,doi:10.1145/1080139.1080143. [31]Y.Xiang, Z.Liu, R.Liu, W.Sun, W.Wang, GeoSVR: a map-based stateless VANET routing, Ad HocNetw.11(7)(2013)2125–2135, doi:10.1016/j.adhoc.2012.02.015.[32]K.Mershad, H.Artail, M.Gerla, ROAMER: roadside units as message routers in VANETs, Ad Hoc Netw.10(3)(2012)479–496,doi:10.1016/j.adhoc.2011.09.001.[33]S.Ahmed, S.S.Kanere, SKVR: Scalable knowledge-based routing architecture for public transport networks, in: Proceedings of the 3rd International Workshop on Vehicular Ad Hoc Networks(VANET’06),ACM,NewYork,NY,USA,2006,pp.92–93,doi:10.1145/1161064.1161082.[34]Q.Yuan, I.Cardei, J.Wu, An efficient prediction-based routing in disruption-tolerant networks ,IEEE Trans. Parallel Distrib.Syst.23(1)(2012)19–31,doi:10.1109/TPDS.2011.140.[35]C.Lochert, H.Hartenstein, J.Tian, H.Fussler, D.Hermann, M.Mauve, A routing strategy for vehicular ad hoc networks in city environments, in: Intelligent Vehicles Symposium,2003.Proceedings.IEEE,2003,pp.156–161,doi:10.1109/IVS.2003.1212901.[36]T.Camp, J.Boleng, L.Wilcox, Location information services in mobile ad hoc networks, in: Proceedings of IEEE International Conference on Communications (ICC),5,2002,pp.3318–3324, doi:10.1109/ICC.2002.997446.[37]J.Bernsen, D.Manivannan, Unicast routing protocols for vehicular ad hoc networks: acritical comparison and classification, Pervasive Mob.Comput.5(1)(2009)1–18,doi:10.1016/j.pmcj.2008.09.001.[38]K.Lee, J.Haerri, U.Lee, M.Gerla, Enhanced perimeter routing for geographic forwarding protocols in urban vehicular scenarios, in: Proceedings of IEEE Globecom Workshops,2007,pp.1–10,doi:10.1109/GLOCOMW.2007.4437832.[39]A.Bazzi, G.Pasolini, C.Gambetti, SHINE: simulation platform for heterogeneous interworking networks, in: Proceedings of IEEE International Conference on Communications(ICC’06),12,2006,pp.5534–5539,doi:10.1109/ICC.2006.255543.[40]A.Toppan, A.Bazzi, P.Toppan, B.Masini, O.Andrisano, Architecture of a simulation platform for the smart navigation service investigation, in:Proceedings of the 6th International IEEE Conference on Wireless and Mobile Computing, Networking and Communications(WiMob),2010,pp.548-554,doi:10.1109/WIMOB.2010.5645014.[41]SHINE web page. r.it/people/bazzi/SHINE.html,(accessedJune2015).[42]C.Campolo, A.Molinaro, Multichannel communications in vehicular ad hoc networks: a survey,IEEE Commun.Mag.51(5)(2013)158–169,doi:10.1109/MCOM.2013.6515061.[43]S.Uppoor, O.Trullols-Cruces, M.Fiore, J.Barcelo-Ordinas, Generation and analysis of a large-scale urban vehicular mobility dataset, IEEE put.99(PP)(2013),doi:10.1109/TMC.2013.27.[44]A.Benslimane, S.Barghi, C.Assi, An efficient routing protocol for connecting vehicular networks to the internet, Pervasive Mob. Comput.7(1)(2011)98–113,doi:10.1016/j.pmcj.2010.09.002.[45]J.-J.Chang, Y.-H.Li, W.Liao, I.-C.Chang, Intersection-based routing for urban vehicular communications with traffic-light considerations, IEEEmun19(1)(2012)82–88,doi:10.1109/MWC.2012.6155880.[46]F.Martinez, C.-K.Toh, J.-C.Cano, C.Calafate, P.Manzoni, Realistic radio propagation models (RPMs) for VANET simulations, in: Proceedings of IEEE Wireless Communication sand Networking Conference (WCNC),2009,pp.1–6,doi:10.1109/WCNC.2009.4917932.[47]L.Cheng, B.Henty, D.Stancil, F.Bai, P.Mudalige, Mobile vehicle-to-vehicle narrow-band channel measurement and characterization of the 5.9 GHz dedicated short range communication (DSRC)frequencyband, IEEE J. Sel. AreasCommun.25(8)(2007)1501–1516,doi:10.1109/JSAC.2007.071002.引用[1] A.Bazzi, B.Masini, A.Zanella, G.Pasolini, 由、虚拟路边单元在VANETs georouting:《国际会议上连接车辆&世博会(ICCVE,2014),2014。
VANET 场景下的 GPSR-R 路由算法李超;韩江洪;魏振春;卫星【摘要】Routing is a key technology of vehicular ad hocnetworks(VANET) .VANET will not work without appropriate and efficient routing algorithm .Because the long‐distance multi‐hop routing is breakable ,the communication link only need to satisfy the basic need of communication .In this pa‐per ,a GPSR‐R routing algorithm in VANET scenario is proposed to make an improvement in GPSR routingprotocol .GPSR‐R takes comprehensive consideration of network requirements which is built up by the mobile nodes ,and makes full advantage of routing w hich is unstable but can complete trans‐mission of information .The simulation results show that GPSR‐R does better than GPSR and GPSR‐AD in packet delivery rate and packet loss rate .%路由选择是实现VANET的关键技术之一,没有合适而高效的路由选择算法,VANET 就无法工作。
由于路由在长距离通信时多跳易断裂,通信链路只需满足通信需求即可。
Strategies for Effective New RetailManagementEffective new retail management is crucial for retail businesses to stay competitive in today's rapidly changing market. In this article, we will discuss some strategies that can help retailers successfully navigate the challenges and capitalize on opportunities in the new retail landscape.1. Embrace technology:The first strategy for effective new retail management is to embrace technology. By integrating cutting-edge technologies, such as artificial intelligence (AI), big data analytics, and Internet of Things (IoT), retailers can enhance their operational efficiency, improve customer experiences, and ultimately increase sales. For example, AI-powered chatbots can provide personalized recommendations to customers, while big data analytics can help retailers analyze consumer behavior and make data-driven decisions.2. Create an omnichannel experience:Another important strategy is to create an omnichannel experience for customers. This means integrating all the different channels through which customers interact with the brand, such as physical stores, online platforms, mobile apps, and social media. By providing a seamless and consistent experience across all channels, retailers can cater to customers' diverse preferences and increase customer loyalty.3. Personalize customer experiences:Personalization is key in new retail management. By leveraging customer data and AI technologies, retailers can deliver personalized product recommendations, tailored marketing campaigns, and customized shopping experiences. For instance, personalized emails with relevant product suggestions based on customers' browsing and purchase history can significantly increase conversion rates.4. Enhance supply chain and inventory management:Efficient supply chain and inventory management are crucial for retailers to meet customer demands and reduce costs. By leveraging technology, such as RFID (Radio Frequency Identification) and real-time inventory tracking systems, retailers can optimize their supply chain, minimize out-of-stock situations, and improve inventory turnover. Additionally, implementing just-in-time inventory management strategies can help retailers avoid excess inventory and reduce the risk of financial losses.5. Invest in employee training and development:To achieve effective new retail management, retailers must invest in employee training and development. Retail staff should be equipped with the necessary skills and knowledge to provide excellent customer service, navigate technological systems, and adapt to changing market trends. Regular training sessions and performance assessments can help retailers identify areas for improvement and ensure that employees are up-to-date with the latest retail practices.6. Foster customer engagement and loyalty:Engaging customers and building a loyal customer base is crucial for long-term success. Retailers can use various strategies, such as offering loyalty programs, organizing exclusive events for loyal customers, and providing exceptional customer service, to foster customer engagement and loyalty. By focusing on building relationships with customers, retailers can encourage repeat purchases and positive word-of-mouth recommendations.7. Stay agile and adapt to market changes:Lastly, effective new retail management requires retailers to stay agile and adapt to market changes. The retail landscape is constantly evolving, and retailers must be proactive in embracing new technologies, adjusting business strategies, and staying ahead of competitors. Regularly monitoring and analyzing market trends, competitor activities, and customer feedback can help retailers identify opportunities and make timely adjustments to their business operations.In conclusion, effective new retail management requires retailers to embrace technology, create omnichannel experiences, personalize customer experiences, enhance supply chain and inventory management, invest in employee training and development, foster customer engagement and loyalty, and stay agile and adaptable. By implementing these strategies, retailers can navigate the challenges of the new retail landscape and achieve long-term success.。
Ad-hoc路由算法1 前言为满足信息社会对资源共享及信息传递的需求,计算机网络技术和无线通讯技术在近几十年得到了极大的发展。
20世纪50年代诞生的利用导线传输数据的有线网络经过几十年的发展,从双绞线、同轴电缆发展到如今的光纤通讯网络,网络的性能和覆盖范围虽然得到了很大的提升但是仍然无法满足人们在移动场景中对网络接入的需求。
在一些场合如抢险救灾、数字化战场、野外勘探及临时会议等场合无法快速高效的建立这常用无线网络,因此需要一种新型网络满足这些应用需求。
为满足在上述场合下快速高效组网的需求,无需基础设施的移动自组织网络(Mobile Ad-hoc Network)应用而生[2]。
Ad Hoc网络是一种不需要任何基站或固定基础设施的多跳无线网络,具有独立组网、自组织、动态拓扑、无约束移动、多跳路由等众多特点,能够快速地布设局部通信网络。
近年来,Ad Hoc网络研究得到了很大的发展,尤其是对网络路由协议的研究已经逐步成熟。
自二十世纪七十年代开始,由美国国防部所属的国防先进研究项目局推动了移动自组织网络方面最初的研究项目“战场环境中的数据包无线网络”(Packet Radio Networking),并在此后对多项相关研究进行支持。
最初由军方推动的移动自组织网主要应用在军事领域,然而随着微电子技术、嵌入式系统技术、无线通信技术等的发展和相关硬件成本的降低,移动自组织网络技术开始在民用领域推广[1]。
尤其在近十年,一些新技术与移动自组织网络的结合产生了许多新的研究热点如无线传感网络(Wirless Sensor Network)、车载自组网(Vehicular Ad hoc Network)、无线个人局域网(Wireless Personal Area Networks)以及无线Mesh网(Wireless Mesh Network)等[5]。
2 正文2.1、Ad-hoc网络的优点(1)无中心Ad hoc网络没有严格的控制中心。
收稿日期:2012-06-03;修回日期:2012-07-16基金项目:国家自然科学基金资助项目(60972036);上海市民办高校骨干教师科研资助项目作者简介:徐会彬(1982-),男,讲师,博士研究生,主要研究方向为VANET 安全技术/路由技术(xuhuibin188@163.com );夏超(1985-),男,助教,硕士研究生,主要研究方向为网络通信.VANETs 路由综述*徐会彬1,2,夏超2(1.同济大学电子与信息工程学院,上海200092;2.上海师范大学天华学院,上海201815)摘要:针对车载自组织网络拓扑结构高动态性,阐述了路由协议研究的重要性;分析并比较了在车载自组织网络中各种路由协议的优缺点,并将现有的路由协议分为基于连通的、基于移动的、基于基础设施的、基于概率的以及基于地理位置的路由五类;根据每一类路由分析其研究现状及特性;最后展望了车载自组织网络路由技术的未来研究方向。
关键词:车载自组织网络;路由协议;概率;地理位置;移动预测;泛洪中图分类号:TP393文献标志码:A文章编号:1001-3695(2013)01-0001-06doi :10.3969/j.issn.1001-3695.2013.01.001Survey on routing in vehicular Ad hoc networksXU Hui-bin 1,2,XIA Chao 2(1.School of Electronics &Information ,Tongji University ,Shanghai 200092,China ;2.Tianhua College of Shanghai Normal University ,Shanghai 201815,China )Abstract :This paper addressed the importance of the present research in VANETs routing since the network topology wasconstantly changing.It discussed and compared the lots of routing protocols merits and faults.It classified existing VANET rou-ting protocols into five categories :connectivity-based ,mobility-based ,infrastructure-based ,probability-model-based and geo-graphic-location-based.For each category ,it presented state of the art and character.Finally ,this paper discussed the direc-tions for further for researchers of VANETs routing protocols.Key words :vehicular Ad hoc networks (VANETs );routing protocol ;probability ;geographic location ;mobility ;flooding车辆自组织网络(VANETs )作为智能交通的重要组成部分,通过车间通信以及车辆与路边设施间通信,高效地实现了事故预警、辅助驾驶、道路交通信息查询以及Internet 接入服务等多种应用[1]。
A Routing Strategy for Vehicular Ad Hoc Networks in CityEnvironments1Christian Lochert Hannes Hartenstein Jing TianNetwork Laboratories Network Laboratories Distributed Systems DepartmentNEC Europe Ltd.NEC Europe Ltd.University of StuttgartHeidelberg,Germany Heidelberg,Germany Stuttgart,Germanylochert@ccrle.nec.de hartenst@ccrle.nec.de jing.tian@informatik.uni-stuttgart.de Holger Füßler Dagmar Hermann Martin Mauve Department of Computer Science Traffic Assistance Systems Department of Computer Science University of Mannheim DaimlerChrysler AG University of MannheimMannheim,Germany Stuttgart,Germany Mannheim,Germany fuessler@informatik.uni-mannheim.de dagmar.hermann@ mauve@informatik.uni-mannheim.deAbstractRouting of data in a vehicular ad hoc network is a chal-lenging task due to the high dynamics of such a network. Recently,it was shown for the case of highway traffic that position-based routing approaches can very well deal with the high mobility of network nodes.However,base-line position-based routing has difficulties to handle two-dimensional scenarios with obstacles(buildings)and voids as it is the case for city scenarios.In this paper we an-alyze a position-based routing approach that makes use of the navigational systems of vehicles.By means of simula-tion we compare this approach with non-position-based ad hoc routing strategies(Dynamic Source Routing and Ad-Hoc On-Demand Distance Vector Routing).The simula-tion makes use of highly realistic vehicle movement pat-terns derived from DaimlerChrysler’s Videlio traffic simu-lator.While DSR’s performance is limited due to problems with scalability and handling mobility,both AODV and the position-based approach show good performances with the position-based approach outperforming AODV.1IntroductionCommunication between vehicles by means of wireless technology has a large potential to improve traffic safety and travel comfort of drivers and passengers.Current ad-vances in thefield of wireless ad hoc networks show that inter-vehicle communication based on vehicular ad hoc net-works is a feasible approach that has a competitive edge over cellular network-based telematics with respect to several as-pects:low data transport times for emergency warnings,ro-bustness due to the network’s mesh structure,and low costs for usage due to the use of unlicensed frequency bands.The 1This work has been carried out within the framework of the‘FleetNet’project as part of BMBF contract no.01AK025D.J.Tian acknowledges support from EU IST Project CarTalk2000(IST-2000-28185).FleetNet project is currently developing a communication platform for inter-vehicle communication following the ad hoc networking paradigm[6].Several potential applications in the area of inter-vehicle communications require data routing algorithms for the un-derlying ad hoc network:when communication endpoints are not within their respective radio transmission range,uni-cast routing is required to establish communication between two vehicles or between a vehicle and afixed gateway. Communication partners are either selected based on their identity,e.g.,IP address,or based on their geographic po-sition.The latter case refers to applications where a person in a vehicle requests some information,e.g.,on trafficflow or road conditions,from a specific geographic region.To support such application,geocast routing[7]should also be provided by the underlying routing protocol.Traditional ad hoc routing protocols have difficulties in deal-ing with the high mobility specific to vehicular ad hoc net-works.In a recent paper[5]we have shown for highway scenarios that routing approaches using position informa-tion,e.g.,obtained from on-board GPS receivers,can very well deal with the mobility of the nodes.A general survey on position-based routing approaches is presented in[12]. Related to our work with its focus on vehicular networks is the work described in[14]that proposes to add geocast abilities to the Ad Hoc On-demand Distance Vector proto-col(AODV).In this paper we discuss aspects of position-based routing for the case of vehicular ad hoc networks in a city envi-ronment.In contrast to highway scenarios,we now have to deal with problems associated to a truly two-dimensional system area as well as with problems like radio obstacles due to buildings.We present a simulation study that com-pares a position-based routing approach with classical ad hoc routing methods(Dynamic Source Routing and Ad Hoc On-Demand Distance Vector).To the best of our knowl-edge,our study is thefirst one that evaluates ad hoc routing protocols over a realistic vehicle movement pattern for a city scenario.The vehicular traffic simulation was done using a simulation tool of DaimlerChrysler and is based on actual traffic measurements taken in the city of Berlin,Germany. The paper is structured as follows:In Section2wefirst dis-cuss the challenges of position-based routing in a city sce-nario,show the shortcomings of existing approaches and then outline our algorithm that is based on ideas from the Terminodes project[2]and on a proposal presented in[15]. Section4gives details on the generation of the vehicle movement patterns used in our simulation study.The re-sults of the routing protocol simulations are presented and discussed in Section5.Section6summarizes our analysis and outlines open issues.2Challenges of Position-Based Routing in a CityEnvironmentPosition-based routing bases forwarding decisions on posi-tion information.Thus,there are several requirements on the availability of position information:first of all,position-based routing requires position-awareness of all participat-ing nodes,e.g.,through a GPS receiver on each node.Fur-thermore,it is assumed that each node is aware of the po-sitions of its direct neighbors:each node periodically sends out beacon messages that indicate the current position of the node1.In order to send a packet to a destination node, a sending node also requires information on the current ge-ographic position of the destination in order to include it in the packet header and to make the routing decision.This in-formation is gained via a so-called location service.While several proposals for location services have recently been made in the literature[12],in this paper we make use of a very simple reactive location service(RLS)described in Section3.With the above-mentioned information at hand a node for-wards the packet to the direct neighbor that is closest to the destination position.This strategy is called‘greedy position-based routing’.Since this is a purely local decision, no route setup or maintenance is required.Instead,forward-ing hops are determined‘on thefly’.Greedy forwarding, however,can fail when there is no neighbor available that is closer to the destination than the current forwarding hop.In such a case,position information points in the right direction but is not correlated with available paths to the destination. Several recovery strategies like Perimeter Mode in Greedy Perimeter Stateless Routing(GPSR)[9]or face-2[3]were proposed in the literature.For the remainder of this paper, we stick to the notations and definitions of[9].1The beacon messages are not forwarded,they are only intended to in-form the direct neighbors.The perimeter mode of GPSR consists of two elements:i)a distributed planarization algorithm and ii)an online routing algorithm for planar graphs.The planarization algorithm transfers(locally)the connectivity graph into a planar graph by eliminating‘redundant’edges.The elimination criteria used for the perimeter mode approach are illustrated in Fig-ure1.The online routing algorithm then forwards a packet along the faces2of the planar graph towards the destina-tion.Intuitively,as depicted in Figure4(a)the packet will be routed according to the‘Right Hand Rule’from node u where perimeter mode is entered via v,w,x,and y to desti-nation node D.In case the packet traverses an inner face and the destination is not part of the this face,the algo-rithm switches towards the face closer to the destination node whenever it encounters an edge that crosses the imag-inary line from the perimeter mode starting point(here:u) to the destination node D.By referring the reader to[9]for details on this algorithm,we now study the deficiencies of the perimeter mode approach for the case of city scenarios.(a)GG(b)RNGFigure1:Gabriel Graph and Relative Neighborhood Graph crite-ria for planarization:the edge between u and v is elim-inated when there is another node in the grey-shadedregion.Network disconnection.City scenarios–with almost all area between streets covered with buildings–significantly limit the applicability of purely greedy position-based rout-ing and of corresponding recovery strategies.Due to these obstacles,nodes that would have‘seen’each other in a free-space model might not be aware of each other anymore. Since the planarization methods outlined above assume that the connectivity between nodes only depends on the node distances,planarization of the neighborhood in the presence of obstacles can lead to network disconnection as illustrated in Figure2.Both criteria,GG and RNG,would lead to elim-ination of the edge between u and v under the misconception that nodes w1and w2can reach node v.Too many hops.A planarized connectivity graph for vehi-cles along a single street essentially leads to a graph where a vehicle no longer sends packts to the neighbor with the largest forward progress(Fig.3).Thus,compared to greedy routing,many more nodes have to be traversed when routed in perimeter mode.This leads to increased delays and,fre-quently,to elapsed hop counts.2A planar graph partitions the plane in an unbounded outer face and several bounded inner faces.Figure 2:Planarizationproblems.(a)traversing a pla-nar graph(b)greedy routingFigure 3:Traversing a planar graph versus greedy routing.Routing Loops.As indicated in [9,8]mobility can induce routing-loops for packets being routed in perimeter mode.Figure 4sketches a corresponding scenario.Node S wants to send a packet to node D .In node u ,greedy forwarding fails because there is reachable node closer to the destina-tion node.So the forwarding mode is switched to perimeter-mode .The initial face will be set to uv .In a static network,the packet would reach D according to the ‘Right Hand Rule’as expected,but with movement of node x reaching node v ’s radio range while v already has sent the packet,a routing loop is created between vwx by the ‘Right Hand Rule’.The traversal of the initial face would be used to de-termine a face-loop but since it is never traversed again,the packet is circled until the max hop count is reached.Wrong Direction.As one can see in Fig.4(a)the perimeter mode following the ‘Right Hand Rule’is biased towards a specific direction when selecting a next hop.When there ex-ist more than one routing alternative this can lead to routes longer than necessary.These long routes lead again to the problem of ‘Too many hops’and also is prone to error be-cause of mobility.3Geographic Source RoutingAs a strategy to deal with the high mobility of nodes on the one hand and with the specific topological structure of a city on theother hand,we have chosen a position-based routing(a)Working Perimeter Mode(b)Routing LoopFigure 4:Problems while Routing in Perimeter Mode.method that is supported by a map of the city.It is called Ge-ographic Source Routing (GSR).The presence of a map is avalid assumption,e.g.,when vehicles are equipped with on-board navigation systems.As outlined in the introduction to position-based routing above,we make use of our ‘reactive location service’in order to learn the current position of a desired communication partner.RLS is a direct translation of the route discovery procedure used in reactive non-position-based ad hoc routing protocols to the position discovery of position-based routing.Essen-tially,the querying node floods the network with a ‘posi-tion request’for some specific node identifier.When the node that corresponds to the requested identifier receives the position request,it sends a ‘position reply’back to the querying node.In order to avoid extensive flooding as well as the well-known ‘broadcast storm problem’,several opti-mizations have been implemented for RLS.An extensive analysis of RLS is given in [11].With this information,the sending node can compute a path to the destination by using the underlying map of the streets.In other words,the sender computes a sequence of junctions the packet has to traverse in order to reach the destination.The sequence of junctions can either be put into the packet header –as it would be done in a geographic source routing approach [2]–or it can be computed by each forwarding node.Clearly,there is a trade-off between bandwidth con-sumption and required processing performance when choos-ing between these two options.But one can see that there are only differences in the result if a node uses informa-tion about its neighborhood,i.e.,to look for connectivity breaks of a route which was chosen before and therefore recomputes another route to the destination.Forwarding a packet between two successive junctions is done on the ba-sis of greedy forwarding since here no ‘obstacles’should block the way.In the current implementation for our sim-ulations,the path between source and destination is deter-mined by a Dijkstra shortest path calculation based on the street map.Since we do not take into account whether thereare enough vehicles on a street to provide connectivity be-tween the two involved junctions,there is a large potential to improve our results by other path-finding strategies.Sim-ulations results for the outlined methods in comparison to non-position-based routing strategies are given in Section5. The following section provides some insight into the mod-eling of the vehicles in a city environment.4City Traffic SimulationsCity traffic simulation itself is a complex challenge because the trafficflow in conurbation deeply depends on rules at its intersections and on the capacity of the roads and inter-sections.The trafficflow simulator Videlio[10],developed by DaimlerChrysler AG,is based on microscopic simulation using time depending origin destination matrices.Core el-ements are the Optimal Velocity Model[1],a special lane changing model[10]and the C-logit model[16]to calculate the traffic assignments.Videlio uses a detailed description of the road network with information about,e.g.,lane num-bers,traffic regulations,and time tables of the traffic lights. For the vehicular movement pattern generation,a small part (6.25km×3.45km)of the city of Berlin was modeled as a graph of streets with28vertices and67edges as depicted in Figures5and6.In total,movements of955vehicles have beensimulated.Figure5:Part of the city of Berlin modeled for our simulation.5Simulations and ResultsThe simulation study presented in this section compares the map-based geographic source routing approach(GSR) with Dynamic Source Routing(DSR)and Ad Hoc On-Demand Distance Vector Routing(AODV),two‘classical’non-position-based ad hoc routing strategies.Simulations were done with the network simulator NS-2[13]in its ver-sion ns-2.1b8a(with some bugfixes from ns-2.1b9a)with Figure6:Graph of streets of our vehicular movement simula-tions.the CMU-extensions[4].The simulator was extended with a basic form of obstacle modeling:spaces between streets are assumed to be buildings and,therefore,radio waves cannot propagate through them.Thus,two nodes can only com-municate directly with each other when they are in their respective transmission ranges and also obey the‘line-of-sight’criterion.We assume that nodes transmit according to the IEEE 802.11wireless LAN standard(2Mbps).The transmission range was originally set to250m but an analysis of the con-nectivity graph of the network shows that with this range too often there is no connectivity along the street between two junctions.Real-world tests with vehicles equipped with IEEE802.11b cards also have shown that transmission ranges in the order of500to800meters are feasible with external antennas.We thus have set the transmission range in our simulations to500m.We selected several pairs of nodes randomly;the reactive location service is used to determine the current position of the communication partner.Then,each pair of nodes exchanges20packets over5seconds.We measured the achieved packet delivery rate(Fig.7)versus the distance between the two communication partners(at the beginning of the communication)as well as the associated bandwidth consumption(Fig.8),latency for thefirst packet(Fig.9) and number of hops(Fig.10).Each point in the above men-tioned graphs is based on at least10000packets exchanged. The study on achievable packet delivery rate(Fig.7)shows good results for the position-based approach compared to DSR that shows some performance problems.In compari-son to AODV there is still some advantage for the position-based approach.A detailed analysis of the causes for not delivering packets indicates that the position-based routing approach fails when the connectivity on a street selected by the path-finding algorithm is broken.This is also confirmed by Fig.11that shows the effect of reducing the transmission range from500m to250m.Thus,with improved and more adaptive path selection procedures one can expect to im-prove the obtained results for the position-based approach.00.10.20.30.40.50.60.70.80.915001000150020002500300035004000p a c k e t d e l i v e r y r a t edistance [m]Avg. Delivery RateGSR 500AODV 500DSR 500Figure 7:Packet delivery ratio versus distance of communicationpartners.32641282565121024204840968192163845001000150020002500300035004000b a n d w i d t h [k b p s ]distance [m]Avg. Total BandwidthAODV 500GSR 500DSR 500Figure 8:Average Total Bandwidth consumption per second.The main problem of DSR appears to be the network load it generates with its ‘signaling traffic’(Fig.8).A study on the performance of DSR that makes use of an ‘ideal’MAC scheme with (almost)unlimited bandwidth available shows significantly better results for DSR.The achieved packet de-livery rate grows significantly,e.g.,for communication part-ners with a distance up to 4km from about 20%up to the range of 60%to 70%(Fig.12).But still DSR creates large packets because of the source route inscribed in the headers,especially during route discovery phase,which leads to a significant bandwidth overload.The second cause of failure for DSR is mobility causing frequent route breaks.But this is less dramatic than for highway scenarios since mobility rate of city scenarios is much lower than of highway sce-narios.On the positive side DSR has less problems when a given street does not provide connectivity,since it can very well find other ‘non-direct’routes.In contrast to the significant bandwidth consumption of DSR,simulations of AODV show delivery rates similar to GSR.By extending the communication distances band-width consumption of AODV is increasing up to the regions of GSR because AODV uses an expanding ring search -technique for route discovery.With the position-based ap-00.20.40.60.811.21.41.61.85001000150020002500300035004000t i m e [s e c ]distance [m]Avg. Latency of First Delivered PacketAODV 500GSR 500DSR 500Figure 9:Latency of first packet per ‘connection’.1248165001000150020002500300035004000# h o p sdistance [m]Avg. Number of HopsGSR 500AODV 500DSR 500Figure 10:Average number of hops depending on distance.proach,the packets flooded during the reactive location re-quest period are of constant size.The observed latency Fig.9for the first packet of a ‘connec-tion’is similar for DSR and GSR approaches with a small advantage for DSR.This was to be expected since the route establishment in DSR and the location discovery in position-based routing are very similar.The usage of expanding ring search technique of AODV is responsible for the higher la-tency since it is a trade-off between bandwidth consumption and latency.In contrast to DSR where a node drops a packet when route breaks occur GSR uses some recovery strategies (fall back on greedy mode)to by-pass this particular node.As can be seen in Fig.10this strategy implies a slightly longer route to the destination node.AODV using routing tables instead of source routes shows similar results to GSR.One can assume that DSR is much more aggressive in routing to a destina-tion,i.e.,uses the node with the largest progress which also could go out of radio range shortly.This would lead to more route breaks involving more packet drops which we have seen in our simulations.00.10.20.30.40.50.60.70.80.915001000150020002500300035004000p a c k e t d e l i v e r y r a t edistance [m]Avg. Delivery RateGSR 500GSR 250Figure 11:Packet delivery ratio of GSR for case 250m and 500mtransmission range.00.10.20.30.40.50.60.70.80.915001000150020002500300035004000p a c k e t d e l i v e r y r a t edistance [m]Avg. Delivery RateDSR 500 - EMUDSR 500Figure 12:Comparison of DSR with 802.11and with an ideal-ized MAC scheme with (almost)unlimited bandwidth available.In general,the ‘bumpiness’of the curves have their reason in the restricted scenario and is not due to an insufficient number of packet transmission.6Conclusions and Future WorkIn this paper we proposed ‘geographic source routing’(GSR),which combines position-based routing with topo-logical knowledge,as a promising routing strategy for ve-hicular ad hoc networks in city environments.We demon-strated by a simulations study that made use of realistic ve-hicular traffic in a city environment that GSR outperforms topology-based approaches like DSR and AODV with re-spect to delivery rate and latency.We are currently extending the work into the following three directions.First,we are going to perform large scale simu-lations in order to get results independently from the struc-ture of a given scenario.Second,we work on strategies to avoid running into streets with no or not sufficiently manyvehicles.Third,we study approaches that do not need a navigational system but where ‘local maps’,particularly for junctions,are inferred from observing transmitted packets and vehicle movement patterns.References[1]M.Bando,K.Hasebe, A.Nakayama, A.Shibata,and Y .Sugiyama.Dynamical model of traffic congestion and numeri-cal simulation.Physical Review ,E 51:1035–1042,1995.[2]L.Blazevic,S.Giordano,and J.Y .Le Boudec.Self-organizing wide-area routing.In In Proc.of SCI 2000/ISAS 2000,Orlando,2000.[3]P.Bose,P.Morin,I.Stojmenovic,and J.Urrutia.Routing with guaranteed delivery in ad hoc wireless networks.In Proc.of 3rd ACM Intl.Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications DIAL M99,pages 48–55,1999.[4]The cmu monarch wireless and mobility extensions to ns-2.http://www.monarch.cs.˙c /cmu-ns.html.[5]H.Füßler,M.Mauve,H.Hartenstein,M.Käsemann,and D.V ollmer.Location-based routing for vehicular ad hoc networks.student poster,ACM Mobicom ’02,Atlanta,Georgia,USA,2002.[6]H.Hartenstein, B.Bochow, A.Ebner,M.Lott,M.Radimirisch,and D.V ollmer.Position-aware ad hoc wireless networks for inter-vehicle communications:the FleetNet project.In Proceedings of the second ACM international symposium on Mobile and ad hoc networking and computing (MobiHoc ’01),2001.[7]X.Jiang and T.Camp.Review of geocasting protocols for a mobile ad hoc network.In Proceedings of the Grace Hopper Celebration (GHC),2002.[8] B.Karp.Challenges in Geographic Routing:Sparse Net-works,Obstacles,and Traffic Provisioning.Talk at DIMACS Workshop on Pervasive Networking,May 2001.[9] B.Karp and H.T.Kung.GPSR:Greedy Perimeter State-less Routing for Wireless Networks.In Proceedings of the sixth annual ACM/IEEE International Conference on Mobile comput-ing and networking (MobiCom ’00),pages 243–254,Boston,Mas-sachusetts,August 2000.[10]W.Kronjäger and D.Hermann.Travel time estimation on the base of microscopic traffic flow simulation.ITS World Congress,1999.[11]M.Käsemann,H.Füßler,H.Hartenstein,and M.Mauve.A Reactive Location Service for Mobile Ad Hoc Networks.Techni-cal Report TR-02-014,Department of Computer Science,Univer-sity of Mannheim,Nov.2002.[12]M.Mauve,J.Widmer,and H.Hartenstein.A Survey on Position-Based Routing in Mobile Ad-Hoc Networks.IEEE Net-work ,15(6):30–39,November/December 2001.[13]The ns-2network simulator./nsnam/ns/.[14] C.Schwingenschlögl and T.Kosch.Geocast enhancements of AODV for vehicular networks.ACM SIGMOBILE Mobile Com-puting and Communications Review ,6(3):96–97,2002.[15]J.Tian,I.Stepanov,and K.Rothermel.Spatial aware geo-graphic forwarding for mobile ad hoc networks.Technical Report TR2002/01,University of Stuttgart,2002.[16] F.Zurheide.Dynamische Verkehrsumlegung in einer mikroskopischen Simulation.Master’s thesis,Fachhochschule Braunschweig/Wolfenbüttel,1999.。