WO2014036819A1 - Collection and transmission method of real-time traffic information of limited region in front of automobile - Google Patents

Collection and transmission method of real-time traffic information of limited region in front of automobile Download PDF

Info

Publication number
WO2014036819A1
WO2014036819A1 PCT/CN2013/072400 CN2013072400W WO2014036819A1 WO 2014036819 A1 WO2014036819 A1 WO 2014036819A1 CN 2013072400 W CN2013072400 W CN 2013072400W WO 2014036819 A1 WO2014036819 A1 WO 2014036819A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
database
time
area
vehicle
Prior art date
Application number
PCT/CN2013/072400
Other languages
French (fr)
Chinese (zh)
Inventor
杨华龙
杨曦
Original Assignee
Yang Hualong
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Yang Hualong filed Critical Yang Hualong
Publication of WO2014036819A1 publication Critical patent/WO2014036819A1/en

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • G08G1/0962Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0967Systems involving transmission of highway information, e.g. weather, speed limits
    • G08G1/096766Systems involving transmission of highway information, e.g. weather, speed limits where the system is characterised by the origin of the information transmission
    • G08G1/096791Systems involving transmission of highway information, e.g. weather, speed limits where the system is characterised by the origin of the information transmission where the origin of the information is another vehicle

Definitions

  • the invention relates to the collection, coding, road zoning and wireless communication mode planning of the vehicle speed, position and time information based on the satellite navigation vehicle terminal, the information exchange method without the control center between the vehicles and the automatic wireless broadcast of the real-time traffic information Technology such as relay transmission. Background technique
  • the real-time traffic information has high timeliness and large amount of information.
  • the commonality of the methods for providing real-time traffic information in the prior art is that the information is first concentrated and distributed.
  • the disadvantage is that the radio frequency resources are large in occupation, low in economy, and difficult to implement. .
  • the present invention provides a method for automatically obtaining real-time traffic information of roads in front of a limited area using a wireless broadcast communication method on a satellite navigation vehicle terminal. Its function is to enable the vehicle to obtain real-time traffic information of the limited area in front, and to use the characteristics of urban road network density to effectively avoid low-speed and congested road sections, greatly improve the carrying capacity of urban roads, and solve the problem of urban road congestion.
  • the invention is based on an in-vehicle satellite navigation system and is composed of a wireless communication system, a road and communication mode planning system, a real-time traffic information collection and processing system, a database system and a real-time traffic information transmission system (see Fig. 1).
  • Wireless communication system is composed of a wireless communication system, a road and communication mode planning system, a real-time traffic information collection and processing system, a database system and a real-time traffic information transmission system (see Fig. 1).
  • the 802.11 standard is used as the basis of the wireless communication system, and the system hardware is used in a wireless broadcast manner.
  • the 802.11 chip receives all the information of all the logic points and sends information, and the chip is used to access the wireless network.
  • the frequent parking places of the intersections are determined as nodes, and the roads are based on nodes as the starting point, east and south.
  • 4 directions of west and north each direction is divided into 4 sections (each section has a basic length of 100 meters). If the remainder is less than 50 meters, it will be merged into the last zone. If the remainder is greater than or equal to 50 meters, it will be divided into another zone. .
  • Use A, B, C, and D to sequentially mark the partitions.
  • the vehicles in the west, south, east, and north directions are made with 1, 2, 3, and 4, respectively, to generate westward Al, Bl, Cl, D1, northward A2. , B2, C2, D2, east A3, B3, C3, D3, south A4, B4, C4, D4 A total of 16 different codes representing 16 different zones.
  • 16 radio communication frequency points are allocated to 16 areas, and frequency points of the same time period are allocated to areas in the same direction. The correspondence between road partitions and communication frequency points is shown in Table 1 (see Figure 2):
  • the size of the last zone when it is greater than or equal to 100 meters, divide it into two; otherwise, merge it with the last two zones, and then divide it into two two.
  • the road segment between the two nodes is divided into the number of zones that are not (4N+1) to avoid communication interference.
  • the direction is determined as the east-west or north-south direction, and the direction is determined to the next node.
  • the node size is based on the busyness of the road traffic. If the size cannot be distinguished, it is determined that the nodes in the west and north are large.
  • the complex road sections such as turntable intersections, multi-entry and multiple exits are converted into intersections for division, and the main traffic roads are prioritized (allocation of communication frequency points).
  • the areas where the main traffic roads have communication interference are all marked as A5, and they are partitioned according to the above-mentioned partition rules without affecting the communication of the main traffic roads.
  • the busiest road sections are identified as the main traffic roads for division, and other areas with communication interference to the main traffic roads are marked as A5.
  • A5 area does not allocate communication frequency Point, only receive wireless signals (see Figure 3).
  • the navigation map is planned at one time, and the road and radio frequency planning database (hereinafter referred to as the planning database) is obtained for the application of the system.
  • the planning database the road and radio frequency planning database
  • a speed value is obtained every second from the satellite navigation system, and the speed is divided by 5 times to obtain an average value, which is used as the speed of the area where the vehicle is located. Simplify the speed information to 0, 1, 1, 5, 10, 15, 20, 30, 50, 75, and 90 (km/h). 11 levels above: 0. 1 is set to 0; greater than 0 is less than or equal to 1 5 ⁇ 1 ⁇ 5 is less than 1. 5 is less than 2. 5 is greater than 2. 5 is less than 2. 5 is greater than 2; greater than 2. 5 is less than 7. 5 is set to 5; greater than 7. 5 is less than 12. 5 is set to 10; 5 ⁇ 15 ⁇ More than 17. 5 is greater than 2. 5 is greater than 22. 5 is greater than 2; greater than 22. 5 is less than 37.
  • the function of the above speed grading method is to increase the stability of the speed value to generate duration information of the speed with actual use value and to reduce the amount of information to be transmitted (hereinafter, the speed represents the speed level of the area in which the vehicle is located).
  • R initial value is 2 and minimum value is 1).
  • the size of the finite area can be automatically adjusted according to the change in the amount of information and the transmission capacity.
  • the rules are as follows: If the time period of the information transmission period is surplus and the remaining time is greater than 10% of the actual usage time, the R value is increased by one step unit; If it is less than one thousandth of the actual use time, the R value is reduced by one step unit; the R value step unit is 100 meters.
  • a planning database, a historical database, a vehicle information exchange database, and a real-time database are established.
  • the real-time database is based on a limited area, and the size of the included area varies with the network density and communication capability.
  • Planning database Generated once by the road and communication mode planning system for use by the system.
  • Historical database All the obtained speed data before 30 minutes is averaged and stored in 5 minutes. The time is based on the last time. Each group of information consists of 2 data of position and speed.
  • Dialogue database Storage vehicle T1 (conversation) Information generated by the time period itself, information sent by other vehicles in the area, and vehicle information exchange control variables.
  • Real-time database This includes the top-level database (real-time traffic information with a speed of 0 in the limited area (R+2) and a duration of more than 5 minutes. Each group of information consists of 2 locations of location and duration); The speed in the finite area (R+1) is 1 and the duration is large In 2 minutes of real-time traffic information, each group of information consists of two data: location and duration); external information database (traffic traffic in limited area (R), traffic temporary control, emergency avoidance information, severe congestion information on urban roads); Limited area database (storing the latest traffic information in each area of the limited area, each group of information consists of three pieces of data: position, speed, duration). Real-time traffic information transmission system
  • the system is cycled in three periods: T1 (conversation), T2 (transmission), and T3 (foreign).
  • T1 conversation
  • T2 transmission
  • T3 foreign
  • the time is 1. 5 seconds, 3 seconds, and 0.5 seconds.
  • the total time is 5 seconds.
  • T1 time vehicle information exchange control variable K; Ki; G i ; J i ; Vi ; Qi ; S i ; G; J; V; Kj ; C; N; D; Tx; Ti.
  • variable K-1 ⁇ ⁇ is the random number of the vehicle dialogue process
  • the variable Kj is the random number of other vehicles received
  • the variable V is the number of times the information is sent successfully during the recording of the vehicle conversation
  • the variable Vi is the record of the vehicle conversation
  • the number of successful transmissions in the process variable J is the number of times the information is transmitted during the conversation of the vehicle; the variable J i is the number of the transmission of the transmitting vehicle during the recording of the conversation; and the variable C is the number of times of information conflict during the recording of the vehicle conversation;
  • the variable S i is a flag for recording whether the self information is correctly obtained by other vehicles in the vehicle conversation period (0 is no, 1 is YES);
  • the variable G is the number of times the information in the vehicle conversation period is finally succeeded;
  • the variable Gi is the recording vehicle conversation period.
  • the variable M2 is the success or failure information of the sender of the vehicle conversation process (Vi is greater than 0 indicates that the sender of the message is successful); the variable M1 is the vehicle conversation information (including Ki, speed, position, Qi, M2).
  • the vehicle first classifies itself into a certain area according to the geographical location information, and then determines the communication frequency point that should be used according to the road and communication mode planning database information.
  • the unsuccessfully transmitted information vehicle generates a random number Ki (point A) of 1 to K. Ti timing begins.
  • the vehicle is not synchronized.
  • the backward vehicle immediately waits for the system to operate, and performs the prescribed action to join the normal dialogue process.
  • the start of the next conversation process starts at a multiple of 5 microseconds for the T1 period.
  • the information of other vehicles is obtained in the dialogue database of the vehicles in the area, and the information in all the vehicle dialogue databases in the area is completely the same.
  • the highest speed value generated by the vehicle in the area is determined as the value of the area, and the value of the area is compared with the value of the previous time. If the values are equal, the duration of the previous time speed is increased by 5 seconds as the current speed. The duration value, otherwise the duration of its speed is set to 5 seconds.
  • the speed of this area is 0, if the speed of the rear adjacent area is greater than or equal to 10 (km/h) and the duration is longer than 1 minute, the speed of this area takes the rear value and its duration is set to 1 second.
  • the information weight (Qi) is the largest, the information transmission is the same. If the information weights are the same, the nearest one is the center of the local area. If the distance is equal, the lowest successful transmission number is obtained.
  • the sending vehicle will prioritize the database information (top level, first level and limited area database information to generate the time closest to the first time, if the time is the same, the nearest to the area is preferred; the external database information priority is the emergency avoidance, urban road Serious congestion, traffic temporary control and traffic light information) transmission, while receiving information. Since the data is relayed, high-level information may be late, and the priority of the database information is re-queued after each set of information is transmitted. First transfer the top-level database information (the longest time is a quarter of the T2 period), then transfer the primary database information (the longest time is a quarter of the T2 period), and then transfer the external database information (the longest time is T2) One-ninth of the time period), the last limited database information is transmitted.
  • the database information of the upper level may be late, the database will be continuously updated, and when the information transmission of the next level database is completed, it will be transferred to the detection of the top database information. If the transmission time allocated by the top database is not used up and new The data is transferred to the top-level database information preferentially, otherwise it is transferred to the detection of the secondary database information and runs according to the above rules. Limited area database information is transmitted in 30 groups According to the post-transfer detection top-level database information and run with the above rules. The total time segmentation used for each database information transmission is cumulative.
  • Finite region R value adjustment rule If (T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw)) is greater than 0.1, then R is increased by one step unit; if ((T2-Td) -Ty-Th-Tw) / (Td+Ty+Th+Tw) ) is less than 0.001, then R is reduced by one step unit; otherwise, the R value is not adjusted.
  • Running tasks in the T3 period Receive traffic lights in the limited area (R), traffic temporary control, emergency avoidance information. Receive heavy traffic congestion on city roads. Adjust the R value. DRAWINGS
  • Figure 1 is a general frame view of the present invention.
  • FIG. 2 is a schematic diagram of a road and communication mode planning system for a simple road in the present invention.
  • FIG. 3 is a schematic diagram of a road and communication mode planning system for a complex road in the present invention.
  • Figure 4 is a schematic illustration of a limited area range in the present invention.
  • Fig. 5 is a schematic diagram showing the flow of the T1 (conversation) time period in the present invention.
  • Fig. 6 is a flow chart showing the operation flow of the T2 (transmission) period in the present invention.
  • Fig. 7 is a schematic view showing the operation of the vehicle in time to avoid the congested road section in the present invention. detailed description
  • the road and communication mode planning system will partition the roads on the satellite navigation map to realize the wireless communication frequency point conflict-free application and generate a planning database, and establish a historical database, a real-time database and a vehicle dialogue database.
  • a satellite navigation system time Beijing time
  • every 5 seconds is a cycle, and the vehicles transmit real-time traffic information to each other.
  • the cycle is divided into Tl (1.5 seconds), ⁇ 2 (3 seconds), ⁇ 3 (0). . 5 seconds) 3 time slots.
  • the second step is to generate real-time traffic information of the vehicle based on the satellite navigation system.
  • the vehicle classifies the vehicle into a certain area according to the planning database information, and determines its own communication frequency.
  • each district vehicle uses the communication frequency points of the district to talk to each other to exchange information, process and process real-time traffic information in the area, and determine the information transmitter (see Figure 5).
  • each zone information transmitter sends real-time traffic information while receiving real-time traffic information from other information transmitters, and other vehicles receive real-time traffic information from the information transmitter as much as possible (see Figure 6).
  • T3 period In the seventh step, the vehicle receives external information.
  • the vehicle adjusts the R value according to the time data required for information transmission in the T2 period: if ((T2-Td-Ty-Th-Tw) I (Td+Ty+Th+Tw)) is greater than 0.1, then R increases a step unit; if ((T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw) ) is less than 0. 001 then R is reduced by one step unit; otherwise, the R value is not adjusted.
  • the task is transferred to the T1 time period.
  • the vehicle can obtain real-time traffic information of the limited area in the front within 5 seconds.
  • the satellite navigation system is responsible for displaying and using real-time traffic information.
  • Drivers and satellite navigation systems can timely avoid congestion and low-speed sections based on real-time traffic information. For example, a vehicle at point C of a city road must pass point A to point B (see Figure 7). If congestion occurs at point A, the vehicle continuously enters the AC section, and congestion will occur immediately at point C, which will quickly cause Cl and C2 to occur. Congestion, causing large-scale traffic congestion.
  • the invention provides real-time traffic information in a limited area in front of the vehicle, and the vehicle at point C finds that there is congestion at point A, and the other two routes can be selected (C-C1 - A1 - B1 - B; C - C2 - A2 - B2 - B) ) Arrived at point B, thus avoiding congestion and improving the capacity of urban roads.

Landscapes

  • Life Sciences & Earth Sciences (AREA)
  • Atmospheric Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A collection and transmission method of real-time traffic information of a limited region in front of an automobile. Based on an automotive navigation system, the method comprises a wireless communication system, a road and communication manner planning system, a real-time traffic information collection and processing system, a database system, and a real-time traffic information transmission system. The present invention transmits information in a radio broadcasting communication manner. A road is divided into regions and communication resources are allocated to the regions. Automobiles in each region exchange information mutually and determine speed information in the region and an information transmitter. The information transmitter transmits real-time traffic information of the limited region in front of the automobile backward in a relay manner based on a weight. An automobile at the back automatically obtains the real-time traffic information at the front. The automobile utilizes the characteristic of a great urban road network density to avoid low-speed and congested road sections in time, so that bearing capability of an urban road is improved and an urban road congestion problem is solved.

Description

一种汽车前方有限区域实时交通信息的采集和传输方法 技术领域  Method for collecting and transmitting real-time traffic information in limited area in front of automobile
本发明涉及基于卫星导航车载终端之上的汽车速度、 位置、 时间信息 的釆集、 编码、 道路分区和无线通信方式规划、 车辆之间无控制中心的信 息交换方法及实时交通信息的自动无线广播式接力传输等技术。 背景技术  The invention relates to the collection, coding, road zoning and wireless communication mode planning of the vehicle speed, position and time information based on the satellite navigation vehicle terminal, the information exchange method without the control center between the vehicles and the automatic wireless broadcast of the real-time traffic information Technology such as relay transmission. Background technique
汽车文明是人类社会发展不可抗拒的方向, 交通畅通是人们追求的永 恒目标。 卫星导航、 智能交通系统及现代通信等领域的科技进步为人们实 现交通畅通的目标奠定了基础。  Automobile civilization is an irresistible direction for the development of human society. The smooth flow of traffic is the constant goal pursued by people. Technological advances in areas such as satellite navigation, intelligent transportation systems, and modern communications have laid the foundation for people to achieve smooth traffic.
对汽车驾驶员来讲, 驾驶安全是头等大事, 目前有关车联网的技术开 发方向对驾驶员来讲有不足之处, 它分散了驾驶员的注意力, 形成安全隐 患。 全自动, 智能化为驾驶员提供交通信息才是发展方向。  For the driver of the car, driving safety is a top priority. At present, the technical development direction of the Internet of Vehicles is insufficient for the driver. It distracts the driver and creates a safety hazard. Fully automatic, intelligent transportation information for drivers is the development direction.
实时交通信息时效性要求高, 信息量大, 现有技术提供实时交通信息 的方法的共性是信息先集中后分发, 其不足之处是对无线频率资源占用量 大, 经济性低, 实施难度高。  The real-time traffic information has high timeliness and large amount of information. The commonality of the methods for providing real-time traffic information in the prior art is that the information is first concentrated and distributed. The disadvantage is that the radio frequency resources are large in occupation, low in economy, and difficult to implement. .
当前及以后很长一段时期, 交通拥堵问题主要发生在城市。 城市道路 具有密度大、 交叉路口多的特点, 车辆如能及时得到前方有限区域路段的 实时交通信息, 避开低速及拥堵路段, 将能极大提高城市道路的承载能力 和人们的出行效率。 发明内容  For a long time now and in the future, traffic congestion problems mainly occur in cities. Urban roads have the characteristics of high density and many intersections. If vehicles can get real-time traffic information of limited road sections in front and avoid low-speed and congested road sections, it will greatly improve the carrying capacity of urban roads and people's travel efficiency. Summary of the invention
为克服上述现有技术之不足, 本发明提供一种汽车在卫星导航车载终 端之上使用无线广播通信方式自动获得前方有限区域道路实时交通信息的 方法。 其作用是使车辆及时得到前方有限区域路段的实时交通信息, 利用 城市路网密度大的特点, 有效规避低速及拥堵路段, 极大提高城市道路的 承载能力, 解决城市道路拥堵问题。 本发明基于车载卫星导航系统, 由无 线通信系统、 道路及通信方式规划系统、 实时交通信息釆集处理系统、 数 据库系统及实时交通信息传输系统组成(参见图 1 )。 无线通信系统  In order to overcome the above deficiencies of the prior art, the present invention provides a method for automatically obtaining real-time traffic information of roads in front of a limited area using a wireless broadcast communication method on a satellite navigation vehicle terminal. Its function is to enable the vehicle to obtain real-time traffic information of the limited area in front, and to use the characteristics of urban road network density to effectively avoid low-speed and congested road sections, greatly improve the carrying capacity of urban roads, and solve the problem of urban road congestion. The invention is based on an in-vehicle satellite navigation system and is composed of a wireless communication system, a road and communication mode planning system, a real-time traffic information collection and processing system, a database system and a real-time traffic information transmission system (see Fig. 1). Wireless communication system
使用 802. 11标准作为无线通信系统基础, 以无线广播方式使用系统硬 件。 用 2. 4G公用无线频段中 2412MHz、 2432MHz , 2452MHz , 2472MHz四个 频点(分别用 h、 i、 j、 k表示),以时分复用(TDM)方法(分别用 1、 2、 3、 4表示不同时段, 每个时段长度为 10毫秒)得到 16个虚拟频点(频点编码 为: hl、 i l、 j l、 kl、 h2、 i 2、 j 2、 k2、 h3、 i 3、 j 3、 k3、 h4、 i4、 j 4、 k4 )。 用 802. 11 芯片接收所有逻辑频点的全部信息并发送信息, 该芯片用 于接入无线网络。 道路及通信方式规划系统 The 802.11 standard is used as the basis of the wireless communication system, and the system hardware is used in a wireless broadcast manner. Use the four frequency points of 2412MHz, 2432MHz, 2452MHz, 2472MHz in the 2.4G public radio frequency band (represented by h, i, j, k respectively), in time division multiplexing (TDM) method (1, 2, 3, respectively) 4 denotes different time periods, each time period is 10 milliseconds) and 16 virtual frequency points are obtained (the frequency points are coded as: hl, il, jl, kl, h2, i 2, j 2, k2, h3, i 3, j 3 , k3, h4, i4, j 4, k4 ). The 802.11 chip receives all the information of all the logic points and sends information, and the chip is used to access the wireless network. Road and communication mode planning system
以卫星导航地图为依据, 将交叉(平交、 立交、 转盘、 多交)路、 丁 字路、 收费站、 检查站等车辆经常停车地点确定为节点,将道路以节点为起 点按东、 南、 西、 北 4个前进方向, 每个方向用 4个区 (每个区基本长度 为 100米)循环分割, 余数小于 50米的, 并入最后一区, 余数大于等于 50 米者另作一区。 用 A、 B、 C、 D对分区依次循环标注, 向西、 南、 东、 北方 向车辆分别用 1、 2、 3、 4做注脚, 生成向西 Al、 Bl、 Cl、 D1 , 向北 A2、 B2、 C2、 D2 , 向东 A3、 B3、 C3、 D3 , 向南 A4、 B4、 C4、 D4 共计 16个不同 的编码代表的 16个不同的区。 为 16个区分配 16个无线通信频点, 将相同 时段的频点分配给同方向的区。 道路分区与通信频点的对应关系如表 1 所 示 (参见图 2 ):  Based on the satellite navigation map, the frequent parking places of the intersections (level crossing, interchange, turntable, multi-crossing), T-shaped roads, toll stations, checkpoints, etc. are determined as nodes, and the roads are based on nodes as the starting point, east and south. 4 directions of west and north, each direction is divided into 4 sections (each section has a basic length of 100 meters). If the remainder is less than 50 meters, it will be merged into the last zone. If the remainder is greater than or equal to 50 meters, it will be divided into another zone. . Use A, B, C, and D to sequentially mark the partitions. The vehicles in the west, south, east, and north directions are made with 1, 2, 3, and 4, respectively, to generate westward Al, Bl, Cl, D1, northward A2. , B2, C2, D2, east A3, B3, C3, D3, south A4, B4, C4, D4 A total of 16 different codes representing 16 different zones. 16 radio communication frequency points are allocated to 16 areas, and frequency points of the same time period are allocated to areas in the same direction. The correspondence between road partitions and communication frequency points is shown in Table 1 (see Figure 2):
表 1 (道路分区与通信频点对应关系表)  Table 1 (Road partition and communication frequency correspondence table)
Figure imgf000004_0001
Figure imgf000004_0001
若两节点间总区数为 4的倍数加 1时, 判断最后一个区的大小: 大于 等于 100米时, 将其一分为二;否则将其与后两区合并, 再将其一分为二。 将两个节点之间的路段分成不为(4N+1)的区数, 以免除通信干扰。  If the total number of the two nodes is a multiple of 4 plus 1, determine the size of the last zone: when it is greater than or equal to 100 meters, divide it into two; otherwise, merge it with the last two zones, and then divide it into two two. The road segment between the two nodes is divided into the number of zones that are not (4N+1) to avoid communication interference.
对于非正东西、 南北道路, 以节点处的道路前进方向为依据, 以最接 近原则, 将方向确定为东西或南北方向, 到下一节点再重新确定方向。  For non-orthogonal, north-south roads, based on the direction of the road at the node, the direction is determined as the east-west or north-south direction, and the direction is determined to the next node.
当两节点之间距离小于 150米时, 将较小的节点忽略。 节点大小以道 路交通繁忙程度为依据,若不能区分大小,则认定偏西和偏北的节点为大。  When the distance between two nodes is less than 150 meters, the smaller nodes are ignored. The node size is based on the busyness of the road traffic. If the size cannot be distinguished, it is determined that the nodes in the west and north are large.
将转盘路口、 多入多出路口等复杂路段转化为十字路口进行分区, 为 主要交通道路优先分区 (分配通信频点)。 非主要交通道路, 对主要交通道 路有通信干扰(干扰距离定为直线 200米) 的区全部标注为 A5 , 在不影响 主要交通道路通信情况下依上述分区规则为其分区。 对于同方向多层、 平 行(垂直距离小于 200米)道路, 将最繁忙路段确定为主要交通道路进行 分区, 其它对主要交通道路有通信干扰的区标注为 A5。 A5区不分配通信频 点, 只接收无线信号 (参见图 3 )。 The complex road sections such as turntable intersections, multi-entry and multiple exits are converted into intersections for division, and the main traffic roads are prioritized (allocation of communication frequency points). For non-main traffic roads, the areas where the main traffic roads have communication interference (the interference distance is set at a straight line of 200 meters) are all marked as A5, and they are partitioned according to the above-mentioned partition rules without affecting the communication of the main traffic roads. For multi-layer, parallel (vertical distance less than 200 m) roads in the same direction, the busiest road sections are identified as the main traffic roads for division, and other areas with communication interference to the main traffic roads are marked as A5. A5 area does not allocate communication frequency Point, only receive wireless signals (see Figure 3).
用以上规则, 将导航地图一次性规划, 得到道路及无线频率规划数据 库(下文称之为规划数据库)供本系统应用。 实时交通信息釆集处理系统  Using the above rules, the navigation map is planned at one time, and the road and radio frequency planning database (hereinafter referred to as the planning database) is obtained for the application of the system. Real-time traffic information collection and processing system
从卫星导航系统每秒获取一个速度值, 将 5次速度相加除 5得到平均 值,并将其作为车辆所在区的速度。将速度信息简化为 0、 1、 1、 5、 10、 15、 20、 30、 50、 75及 90 (千米 /小时) 以上 11个等级: 0. 1 以下定为 0; 大 于 0小于等于 1. 5定为 1 ; 大于 1. 5小于等于 2. 5定为 2; 大于 2. 5小于等 于 7. 5定为 5; 大于 7. 5小于等于 12. 5定为 10; 大于 12. 5小于等于 17. 5 定为 15; 大于 17. 5小于等于 22. 5定为 20; 大于 22. 5小于等于 37. 5定为 30; 大于 37. 5小于等于 62. 5定为 50; 大于 62. 5小于等于 87. 5定为 75; 大于 87. 5定为 90以上。上述速度分级方法的作用是加大速度值的稳定性, 以生成具有实际使用价值的速度的持续时间信息并减少需要传输的信息量 (下文以速度代表车辆所在区的速度等级)。 数据库系统  A speed value is obtained every second from the satellite navigation system, and the speed is divided by 5 times to obtain an average value, which is used as the speed of the area where the vehicle is located. Simplify the speed information to 0, 1, 1, 5, 10, 15, 20, 30, 50, 75, and 90 (km/h). 11 levels above: 0. 1 is set to 0; greater than 0 is less than or equal to 1 5以下为1。 5 is less than 1. 5 is less than 2. 5 is greater than 2. 5 is less than 2. 5 is greater than 2; greater than 2. 5 is less than 7. 5 is set to 5; greater than 7. 5 is less than 12. 5 is set to 10; 5为为15。 More than 17. 5 is greater than 2. 5 is greater than 22. 5 is greater than 2; greater than 22. 5 is less than 37. 5 is set to 30; greater than 37. 5 is less than 62. 5 is set to 50; 5以下为为75. 5为为75. More than 87. 5 is set to 90 or more. The function of the above speed grading method is to increase the stability of the speed value to generate duration information of the speed with actual use value and to reduce the amount of information to be transmitted (hereinafter, the speed represents the speed level of the area in which the vehicle is located). database system
有限区域定义(参见图 4 ): 将汽车前方、 左右各 R千米半径内所包含 的道路作为有限区域 (R初值为 2 , 最小值为 1)。 依据信息量大小及传输能 力变化, 有限区域大小可自动调整, 其规则为: 如果信息传输时段时间富 余, 剩余时间大于实际使用时间的百分之十, 则 R值增加一个步长单位; 剩余时间小于实际使用时间的千分之一, 则 R值减少一个步长单位; R值步 长单位为 100米。  Limited area definition (see Figure 4): The roads included in the front and left and right R km radius of the car are used as finite areas (R initial value is 2 and minimum value is 1). The size of the finite area can be automatically adjusted according to the change in the amount of information and the transmission capacity. The rules are as follows: If the time period of the information transmission period is surplus and the remaining time is greater than 10% of the actual usage time, the R value is increased by one step unit; If it is less than one thousandth of the actual use time, the R value is reduced by one step unit; the R value step unit is 100 meters.
建立规划数据库、 历史数据库、 车辆信息交换数据库及实时数据库, 实时数据库以有限区域为基础, 所包含区域大小随路网密度及通信能力而 变化。  A planning database, a historical database, a vehicle information exchange database, and a real-time database are established. The real-time database is based on a limited area, and the size of the included area varies with the network density and communication capability.
规划数据库: 由道路及通信方式规划系统一次性生成,供本系统使用。 历史数据库: 将 30分钟以前所有得到的速度数据以 5分钟为时间段进 行平均再存储, 时间以最后时间为准, 每组信息由位置、 速度 2 个数据组 成。  Planning database: Generated once by the road and communication mode planning system for use by the system. Historical database: All the obtained speed data before 30 minutes is averaged and stored in 5 minutes. The time is based on the last time. Each group of information consists of 2 data of position and speed.
对话数据库: 存放车辆 T1 (对话) 时段自身生成的信息、 本区其它车 辆发出的信息及车辆信息交换控制变量。  Dialogue database: Storage vehicle T1 (conversation) Information generated by the time period itself, information sent by other vehicles in the area, and vehicle information exchange control variables.
实时数据库: 其中包括顶级数据库(存储有限区域(R+2 ) 内速度为 0 且持续时间大于 5分钟的实时交通信息, 每组信息由位置、 持续时间 2个 数据组成); 一级数据库(存储有限区域(R+1 ) 内速度为 1 且持续时间大 于 2分钟的实时交通信息, 每组信息由位置、 持续时间 2个数据组成); 外 部信息数据库(存储有限区域(R ) 内红绿灯、 交通临时管制、 紧急避让信 息, 城市道路严重拥堵信息); 有限区域数据库 (存储有限区域各区最新交 通信息, 每组信息由位置、 速度、 持续时间 3个数据组成)。 实时交通信息传输系统 Real-time database: This includes the top-level database (real-time traffic information with a speed of 0 in the limited area (R+2) and a duration of more than 5 minutes. Each group of information consists of 2 locations of location and duration); The speed in the finite area (R+1) is 1 and the duration is large In 2 minutes of real-time traffic information, each group of information consists of two data: location and duration); external information database (traffic traffic in limited area (R), traffic temporary control, emergency avoidance information, severe congestion information on urban roads); Limited area database (storing the latest traffic information in each area of the limited area, each group of information consists of three pieces of data: position, speed, duration). Real-time traffic information transmission system
本系统分 T1 (对话)、 T2 (传输)、 T3 (涉外)三个时段循环运行, 分 别用时 1. 5秒、 3秒和 0. 5秒, 三个时段共计用时 5秒。  The system is cycled in three periods: T1 (conversation), T2 (transmission), and T3 (foreign). The time is 1. 5 seconds, 3 seconds, and 0.5 seconds. The total time is 5 seconds.
设立 T1时段车辆信息交换控制变量: K; Ki ; G i ; J i ; Vi ; Qi ; S i ; G; J; V; Kj ; C; N; D; Tx; Ti。  Set the T1 time vehicle information exchange control variable: K; Ki; G i ; J i ; Vi ; Qi ; S i ; G; J; V; Kj ; C; N; D; Tx; Ti.
变量 K为车辆对话过程随机编号最大值;变量 Ki{ Ki = l, 2, 3 ... ... ( K-2 ), The variable K is the random number maximum of the vehicle dialogue process; the variable Ki{ Ki = l, 2, 3 ... ( K-2 ),
( K-1 ) , Κ }为车辆对话过程的随机编号; 变量 Kj 为接收到的其它车辆的 随机编号; 变量 V为记录车辆对话过程中信息发送成功的次数; 变量 Vi为 记录发信车辆对话过程中发信成功的编号; 变量 J 为记录车辆对话过程中 信息发送的次数; 变量 J i为记录对话过程中发信车辆的发信编号; 变量 C 为记录车辆对话过程中信息冲突的次数; 变量 S i为记录车辆对话时段中自 身信息是否被其它车辆正确得到的标志 (0为否, 1为是); 变量 G为记录 车辆对话时段中信息最终成功的次数; 变量 Gi为记录车辆对话时段中信息 最终成功的编号; 变量 D为用以判断区内是否只有一辆车; 变量 N为用以 记录对话过程次数; 变量 Tx为 T1时段计时器; 变量 Ti为每个对话过程计 时器; 变量 Q i为车辆信息权重系数 (其具体数值等于顶级数据库和一级数 据库数据数之和); 变量 M2为车辆对话过程发信者成功与否信息 (Vi大于 0者表示第 J i号发信者发信成功);变量 Ml为车辆对话信息(其中包括 Ki、 速度、 位置、 Qi、 M2 )。 (K-1), Κ } is the random number of the vehicle dialogue process; the variable Kj is the random number of other vehicles received; the variable V is the number of times the information is sent successfully during the recording of the vehicle conversation; the variable Vi is the record of the vehicle conversation The number of successful transmissions in the process; variable J is the number of times the information is transmitted during the conversation of the vehicle; the variable J i is the number of the transmission of the transmitting vehicle during the recording of the conversation; and the variable C is the number of times of information conflict during the recording of the vehicle conversation; The variable S i is a flag for recording whether the self information is correctly obtained by other vehicles in the vehicle conversation period (0 is no, 1 is YES); the variable G is the number of times the information in the vehicle conversation period is finally succeeded; the variable Gi is the recording vehicle conversation period. The number of the final success of the information; the variable D is used to determine whether there is only one car in the zone; the variable N is used to record the number of dialogue processes; the variable Tx is the T1 time period timer; the variable Ti is the timer of each dialog process; Q i is the vehicle information weight coefficient (the specific value is equal to the sum of the top-level database and the primary database data) The variable M2 is the success or failure information of the sender of the vehicle conversation process (Vi is greater than 0 indicates that the sender of the message is successful); the variable M1 is the vehicle conversation information (including Ki, speed, position, Qi, M2).
T1时段运行规则 (参见图 5 ):  T1 time period running rules (see Figure 5):
车辆首先依据地理位置信息, 将自身归入某区, 再依据道路及通信方 式规划数据库信息确定自身应使用的通信频点。车辆初始化对话数据库 (令 信息交换控制变量中 K=30, N=D=G=V=J=C=Kj=Gi=S i=Ti=Tx=0 )0 Tx计时开 始。未成功发送信息车辆生成 1至 K的随机编号 Ki (A点)。 Ti计时开始。 编 号为 Ki的车辆侦听区内若无其它车辆发信, 则从( 10 ( Ki-Kj-C-1 ) +1 ) 微秒(下文中时间单位无明确标注时均以微妙为单位 )时刻开始, 在 0至 8 时刻随机发出信息 Ml并令自身信息交换控制变量中 J i=J=J+l。 Ki号相同 没有抢到发信机会者判断自身编号 Ki+5是否小于 K: 若是, 重新在(Ki+1) 至 K 之间随即编号参加本次过程; 否则参加下一次过程(下文中用变量代 表信息交换控制变量)。 车辆接收信息, 若信息成功, 则令其变量中 Gi=G=G+l、 Ji=J=J+K Vi=V=V+ Kj=Ki、 C=0; 对 M2信息中 Vi大于 0者, 令其变量中 Si=l; 否 则, 令其变量中 Ji=J=J+l、 C=C+1、 Gi=Vi=Ki=0o The vehicle first classifies itself into a certain area according to the geographical location information, and then determines the communication frequency point that should be used according to the road and communication mode planning database information. Vehicle Initialization Conversation Database (K=30 in the information exchange control variable, N=D=G=V=J=C=Kj=Gi=S i=Ti=Tx=0) 0 Tx timing starts. The unsuccessfully transmitted information vehicle generates a random number Ki (point A) of 1 to K. Ti timing begins. If no other vehicle sends a message in the vehicle listening area numbered Ki, then (10 ( Ki-Kj-C-1 ) +1 ) microseconds (the time units are not explicitly marked in the following subtle units) Initially, the information M1 is randomly sent from 0 to 8 and the self information is exchanged in the control variable J i=J=J+l. If the Ki number is the same, the person who has not received the letter will judge whether the number Ki+5 is less than K: If yes, re-number the process between (Ki+1) and K to participate in the process; otherwise, participate in the next process (hereinafter, use the variable) Represents the information exchange control variable). The vehicle receives the information. If the information is successful, let the variable Gi=G=G+l, Ji=J=J+K Vi=V=V+ Kj=Ki, C=0; for the M2 information, if Vi is greater than 0, Let Si=l in its variable; otherwise, let Ji=J=J+l, C=C+1, Gi=Vi=Ki=0 o in its variable
完成发信动作的车辆, 依据后续车辆发出的信息判断自身发信成功否: 若成功, 则令自身变量中 Gi=G=G+l、 Vi=V=V+l、 Si=l; 否则, 令自身变量 中 Gi=Vi=Ki+0。  The vehicle that completes the sending action determines whether the success of its own transmission is successful according to the information sent by the following vehicle: If it succeeds, let Gi=G=G+l, Vi=V=V+l, Si=l in its own variable; otherwise, Let Gi=Vi=Ki+0 in its own variable.
车辆在无信号时间大于 (10 (K-Kj-C) +1 )后, 判断 J如果等于 0则 结束对话时段; 否则, 判断 (PI ) N与 G如果均大于 0, 则编号为 G1的车 辆发出信息 M2。 车辆依据 M2信息对 Vi大于 0者, 令其变量中 Si=l。 最后 完成发信动作的车辆依据 M2信息判断(P2) 自身发信成功否: 若成功, 令 自身变量中 Gi=G=G+l、 Vi=V=V+l、 Kj=Ki、 Si=l。 所有车辆令 Si=0的变量 中 Ki=Gi=Vi=0。 判断 G是否大于 10: 若是, 结束对话时段; 否则, 为 N 计数器加 1再判断 N是否大于 2: 若是, 结束对话时段; 否则, 判断 Ti是 否大于 Tl-Tx-1: 若是, 结束对话时段; 否则, 令车辆变量中 V=J=C=Vi=Ji=Ki=Kj=Ti=0o 返回 A点。 After the vehicle has no signal time greater than (10 (K-Kj-C) +1 ), it is judged that J is equal to 0 to end the dialogue period; otherwise, if the judgment (PI) N and G are both greater than 0, the vehicle numbered G1 Send the message M2. The vehicle is based on the M2 information, and the value of Vi is greater than 0, so that Si=l in the variable. The vehicle that finally completes the sending action judges according to the M2 information (P2) whether the self-delivery succeeds or not: If it succeeds, let Gi=G=G+l, Vi=V=V+l, Kj=Ki, Si=l in its own variable . All vehicles have a value of Si = 0 in Ki = Gi = Vi = 0. Determine whether G is greater than 10: If yes, end the session period; otherwise, add 1 to the N counter to determine whether N is greater than 2: If yes, end the session period; otherwise, determine if Ti is greater than Tl-Tx-1: If yes, end the session period; Otherwise, let V=J=C=Vi=Ji=Ki=Kj=Ti=0 o in the vehicle variable return to point A.
(P2) 否则, 令自身变量中 Gi=Vi=Ki=0。 所有车辆令 Si=0 的变量中 Ki=Gi=Vi=0。 判断 G是否大于 10: 若是, 结束对话时段; 否则, 为 N计数 器加 1再判断 N是否大于 2: 若是, 结束对话时段; 否则, 判断 Ti是否大 于 Tl-Tx-1 : 若是, 结束对话时段; 否则 , 令车辆变量中 V=J=C=Vi=Ji=Ki=Kj=Ti=0o 返回 A点。 (P2) Otherwise, let Gi=Vi=Ki=0 in its own variable. For all vehicles, the value of Si = 0 is Ki = Gi = Vi = 0. Determine whether G is greater than 10: If yes, end the session period; otherwise, add 1 to the N counter to determine whether N is greater than 2: If yes, end the session period; otherwise, determine if Ti is greater than Tl-Tx-1: If yes, end the session period; Otherwise, let V=J=C=Vi=Ji=Ki=Kj=Ti=0 o in the vehicle variable return to point A.
(P1 ) 否则, 则判断 (P3) J是否大于 1: 若否, D计数器加 1后再判 断 D是否大于 2: 若是, 则断定只有一辆车, 该车定为信息传输者, 结束对 话时段; 否则, 返回 A点。  (P1) Otherwise, it is judged whether (P3) J is greater than 1: If no, the D counter is incremented by 1 and then judged whether D is greater than 2: If yes, it is determined that there is only one car, the car is designated as the information transmitter, and the dialogue period is ended. ; Otherwise, return to point A.
(P3) 否则, 判断(P4 ) V是否大于 1: 若是, 编号为 VI的车辆发出 信息 M2, VI及其它辆依据 M2信息对 Vi大于 0者, 令其变量中 Si=l。 最后 完成发信动作的车辆依据 M2信息判断(P5) 自身发信成功否: 若成功, 令 自身变量中 Gi=G=G+l、 Vi=V=V+l、 Kj=Ki、 Si=l。 所有车辆令 Si=0的变量 中 Ki=Gi=Vi=0。 判断 G是否大于 10: 若是, 结束对话时段; 否则, 为 N 计数器加 1再判断 N是否大于 2: 若是, 结束对话时段; 否则, 判断 Ti是 否大于 Tl-Tx-1 : 若是, 结束对话时段; 否则, 令车辆变量中 V=J=C=Vi=Ji=Ki=Kj=Ti=0o 返回 A点。 (P3) Otherwise, judge (P4) whether V is greater than 1: If yes, the vehicle numbered VI sends the message M2, VI and other vehicles according to the M2 information for Vi greater than 0, so that Si=l in the variable. The vehicle that finally completes the sending action is judged according to the M2 information (P5). If the self-delivery succeeds: If it succeeds, let Gi=G=G+l, Vi=V=V+l, Kj=Ki, Si=l . All vehicles have a value of Si = 0 in Ki = Gi = Vi = 0. Determine whether G is greater than 10: If yes, end the session period; otherwise, add 1 to the N counter to determine whether N is greater than 2: If yes, end the session period; otherwise, determine if Ti is greater than Tl-Tx-1: If yes, end the session period; Otherwise, let V=J=C=Vi=Ji=Ki=Kj=Ti=0 o in the vehicle variable return to point A.
(P5) 否则, 令自身变量中 Gi=Vi=Ki+0。 所有车辆令 Si=0 的变量中 Ki=Gi=Vi=0。 判断 G是否大于 10: 若是, 结束对话时段; 否则, 为 N计数 器加 1再判断 N是否大于 2: 若是, 结束对话时段; 否则, 判断 Ti是否大 于 Tl-Tx-1 : 若是, 结束对话时段; 否则 , 令车辆变量中 V=J=C=Vi=J i=Ki=Kj=Ti=0o 返回 A点。 (P5) Otherwise, let Gi=Vi=Ki+0 in its own variable. For all vehicles, the value of Si = 0 is Ki = Gi = Vi = 0. Determine whether G is greater than 10: If yes, end the session period; otherwise, add 1 to the N counter to determine whether N is greater than 2: If yes, end the session period; otherwise, determine if Ti is greater than Tl-Tx-1: If yes, end the session period; Otherwise, make the vehicle variable V=J=C=Vi=J i=Ki=Kj=Ti=0 o returns to point A.
( P4 ) 否则, 令所有车辆变量中 G=0。 所有车辆令 S i=0 的变量中 K i=Gi=Vi=0。 判断 G是否大于 10: 若是, 结束对话时段; 否则, 为 N计数 器加 1再判断 N是否大于 2: 若是, 结束对话时段; 否则, 判断 Ti是否大 于 Tl-Tx-1 : 若是, 结束对话时段; 否则 , 令车辆变量中 V=J=C=Vi=J i=Ki=Kj=Ti=0o 返回 A点。 ( P4 ) Otherwise, let G = 0 in all vehicle variables. In all variables where the vehicle makes S i = 0, K i = Gi = Vi = 0. Determine whether G is greater than 10: If yes, end the session period; otherwise, add 1 to the N counter to determine whether N is greater than 2: If yes, end the session period; otherwise, determine if Ti is greater than Tl-Tx-1: If yes, end the session period; Otherwise, let V=J=C=Vi=J i=Ki=Kj=Ti=0 o in the vehicle variable return to point A.
车辆在对话过程中, 由于车辆得到的 Kj、 C 的数据差异, 使得车辆运 行不同步, 落后车辆在侦听到系统运行时立刻结束等待, 执行规定动作, 加入到正常对话过程。 下一个对话过程开始时间起点为 T1时段 5微秒的倍 数。  During the dialogue process, due to the data difference between the Kj and C obtained by the vehicle, the vehicle is not synchronized. The backward vehicle immediately waits for the system to operate, and performs the prescribed action to join the normal dialogue process. The start of the next conversation process starts at a multiple of 5 microseconds for the T1 period.
多次对话过程后区内车辆的对话数据库中均得到其他车辆的信息, 并 且, 本区内所有车辆对话数据库内信息完全相同。 将区内车辆生成的最高 速度值确定为本区值, 将本区值与上一时次的值进行对比, 若数值相等, 则将上一时次速度的持续时间加 5 秒作为本时次速度的持续时间值, 否则 其速度的持续时间值定为 5秒。 本区速度为 0时, 若后方相邻区速度大于 等于 10 (千米 /小时)且持续时间大于 1分钟, 本区速度取后方值, 其持续 时间定为 1秒。 以信息权重(Qi )最大者作为本区信息传输者,若信息权重 相同, 则取距离本区中心最近者,若距离相等, 则取成功发信编号最小者。  After the multiple dialogue process, the information of other vehicles is obtained in the dialogue database of the vehicles in the area, and the information in all the vehicle dialogue databases in the area is completely the same. The highest speed value generated by the vehicle in the area is determined as the value of the area, and the value of the area is compared with the value of the previous time. If the values are equal, the duration of the previous time speed is increased by 5 seconds as the current speed. The duration value, otherwise the duration of its speed is set to 5 seconds. When the speed of this area is 0, if the speed of the rear adjacent area is greater than or equal to 10 (km/h) and the duration is longer than 1 minute, the speed of this area takes the rear value and its duration is set to 1 second. If the information weight (Qi) is the largest, the information transmission is the same. If the information weights are the same, the nearest one is the center of the local area. If the distance is equal, the lowest successful transmission number is obtained.
设立车辆 T2时段信息传输控制变量 Td、 Ty、 Th、 Tw及 ND、 NY、 丽、 而, 分别记录四个(顶级、 一级、 外部及有限区域)数据库信息传输累计 时间及四个数据库信息剩余量(不重复计数, 数据余量为 0表示信息已传 完)。  Set the vehicle T2 time period information transmission control variables Td, Ty, Th, Tw and ND, NY, and Li, and record four (top, first, outer and limited areas) database information transmission cumulative time and four database information remaining respectively. Quantity (do not repeat the count, the data margin is 0 means the information has been transmitted).
T2时段运行规则 (参见图 6 ):  T2 time period running rules (see Figure 6):
发信车辆对各数据库信息按优先级别 (顶级、 一级及有限区域数据库 信息以生成时间最近者优先、 若时间相同, 以距离本区最近者优先; 外部 数据库信息优先次序为紧急避让、 城市道路严重拥堵、 交通临时管制及红 绿灯信息)传输, 同时接收信息。 由于数据是接力传输,高级别的信息可能 晚到, 每传输一组信息后重新对数据库信息的优先级别排队。 首先传输顶 级数据库信息 (最长时间为 T2 时段的四分之一), 其次传输一级数据库信 息 (最长时间为 T2 时段的四分之一), 接着传输外部数据库信息 (最长时 间为 T2 时段的九分之一), 最后传输有限区域数据库信息。 由于数据是接 力传输,上一级数据库信息可能晚到, 数据库会被不断更新, 当下一级数据 库信息传输完成后转入检测顶级数据库信息, 若顶级数据库分配的传输时 间没有用完且有了新的数据, 则优先传输顶级数据库信息, 否则转入检测 次一级数据库信息并以上述规则运行。 有限区域数据库信息在传输 30组数 据后转入检测顶级数据库信息并以上述规则运行。 各数据库信息传输所用 总时间分段累计。 The sending vehicle will prioritize the database information (top level, first level and limited area database information to generate the time closest to the first time, if the time is the same, the nearest to the area is preferred; the external database information priority is the emergency avoidance, urban road Serious congestion, traffic temporary control and traffic light information) transmission, while receiving information. Since the data is relayed, high-level information may be late, and the priority of the database information is re-queued after each set of information is transmitted. First transfer the top-level database information (the longest time is a quarter of the T2 period), then transfer the primary database information (the longest time is a quarter of the T2 period), and then transfer the external database information (the longest time is T2) One-ninth of the time period), the last limited database information is transmitted. Since the data is relay transmission, the database information of the upper level may be late, the database will be continuously updated, and when the information transmission of the next level database is completed, it will be transferred to the detection of the top database information. If the transmission time allocated by the top database is not used up and new The data is transferred to the top-level database information preferentially, otherwise it is transferred to the detection of the secondary database information and runs according to the above rules. Limited area database information is transmitted in 30 groups According to the post-transfer detection top-level database information and run with the above rules. The total time segmentation used for each database information transmission is cumulative.
有限区域 R值调整规则: 若( (T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw) )大于 0. 1 , 则 R增加一个步长单位; 若( (T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw) )小于 0. 001 , 则 R减少一个步长单位; 否则, R值不做调整。  Finite region R value adjustment rule: If ((T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw)) is greater than 0.1, then R is increased by one step unit; if ((T2-Td) -Ty-Th-Tw) / (Td+Ty+Th+Tw) ) is less than 0.001, then R is reduced by one step unit; otherwise, the R value is not adjusted.
T3时段运行任务: 接收有限区域(R ) 内红绿灯、 交通临时管制、 紧急 避让信息。 接收城市道路严重拥堵信息。 调整 R值。 附图说明  Running tasks in the T3 period: Receive traffic lights in the limited area (R), traffic temporary control, emergency avoidance information. Receive heavy traffic congestion on city roads. Adjust the R value. DRAWINGS
图 1是本发明总体框架图。  BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a general frame view of the present invention.
图 2是本发明中简单道路的道路及通信方式规划系统示意图。  2 is a schematic diagram of a road and communication mode planning system for a simple road in the present invention.
图 3是本发明中复杂道路的道路及通信方式规划系统示意图。  3 is a schematic diagram of a road and communication mode planning system for a complex road in the present invention.
图 4是本发明中有限区域范围示意图。  Figure 4 is a schematic illustration of a limited area range in the present invention.
图 5是本发明中 T1 (对话) 时段运行流程示意图。  Fig. 5 is a schematic diagram showing the flow of the T1 (conversation) time period in the present invention.
图 6是本发明中 T2 (传输 ) 时段运行流程示意图。  Fig. 6 is a flow chart showing the operation flow of the T2 (transmission) period in the present invention.
图 7是本发明中车辆及时规避拥堵路段运行示意图。 具体实施方式  Fig. 7 is a schematic view showing the operation of the vehicle in time to avoid the congested road section in the present invention. detailed description
用道路及通信方式规划系统将卫星导航地图上的道路分区, 实现无线 通信频点无冲突应用并生成规划数据库, 建立历史数据库、 实时数据库及 车辆对话数据库。 以卫星导航系统时间 (北京时间)为标准, 每 5 秒钟为 一循环周期,车辆互相传输一次实时交通信息,循环周期分为 Tl ( 1. 5秒)、 Τ2 ( 3秒)、 Τ3 ( 0. 5秒 ) 3个时段。  The road and communication mode planning system will partition the roads on the satellite navigation map to realize the wireless communication frequency point conflict-free application and generate a planning database, and establish a historical database, a real-time database and a vehicle dialogue database. Taking the satellite navigation system time (Beijing time) as the standard, every 5 seconds is a cycle, and the vehicles transmit real-time traffic information to each other. The cycle is divided into Tl (1.5 seconds), Τ2 (3 seconds), Τ3 (0). . 5 seconds) 3 time slots.
T1 时段: 第 一 步 , 令信 息 交换控制 变量 中 Κ=30 , N=D=G=V=J=C=Kj=G i=S i=Ti=Tx=0。 第二步, 以卫星导航系统为基础生成车 辆实时交通信息。 第三步, 车辆依据规划数据库信息,将本车归入某一区, 并确定自身的通信频点。 第四步, 各区车辆使用本区通信频点互相对话, 以交换信息、 加工处理本区实时交通信息及确定信息传输者(参见图 5 )。  T1 period: In the first step, let the information exchange control variable Κ=30, N=D=G=V=J=C=Kj=G i=S i=Ti=Tx=0. The second step is to generate real-time traffic information of the vehicle based on the satellite navigation system. In the third step, the vehicle classifies the vehicle into a certain area according to the planning database information, and determines its own communication frequency. In the fourth step, each district vehicle uses the communication frequency points of the district to talk to each other to exchange information, process and process real-time traffic information in the area, and determine the information transmitter (see Figure 5).
T2时段:第五步,令信息传输控制变量中 Td=Ty=Th=Tw=ND=NY H=而 =0。 第六步, 各区信息传输者发出实时交通信息的同时接收其它信息传输者发 出的实时交通信息, 其它车辆尽可能多的接收信息传输者发出的实时交通 信息 (参见图 6 )。  T2 period: The fifth step is to make the information transmission control variable Td=Ty=Th=Tw=ND=NY H= and =0. In the sixth step, each zone information transmitter sends real-time traffic information while receiving real-time traffic information from other information transmitters, and other vehicles receive real-time traffic information from the information transmitter as much as possible (see Figure 6).
T3时段: 第七步, 车辆接收外部信息。 第八步, 车辆依据 T2时段信息 传输所需时间数据调整 R值: 若( (T2-Td-Ty-Th-Tw) I (Td+Ty+Th+Tw) )大于 0. 1 , 则 R增加一个步长单位; 若( (T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw) )小于 0. 001则 R减少一个步长单位; 否则, R值不做调整。 第九步, 转入执行 T1 时段任务。 T3 period: In the seventh step, the vehicle receives external information. In the eighth step, the vehicle adjusts the R value according to the time data required for information transmission in the T2 period: if ((T2-Td-Ty-Th-Tw) I (Td+Ty+Th+Tw)) is greater than 0.1, then R increases a step unit; if ((T2-Td-Ty-Th-Tw) / (Td+Ty+Th+Tw) ) is less than 0. 001 then R is reduced by one step unit; otherwise, the R value is not adjusted. In the ninth step, the task is transferred to the T1 time period.
通过以上步骤,车辆在 5秒之内均能得到前方有限区域实时交通信息。 卫星导航系统负责显示和使用实时交通信息, 驾驶员和卫星导航系统依据 实时交通信息能及时规避拥堵及低速路段。 例如, 处于城市道路 C点的车 辆要通过 A点到达 B点 (参见图 7 ), 若 A点发生拥堵, 车辆不断进入 A-C 路段, C点马上会发生拥堵, 很快会使 Cl、 C2点发生拥堵, 从而引起大面 积交通拥堵。 本发明提供了车辆前方有限区域的实时交通信息, 处于 C点 的车辆发现 A点发生拥堵, 可选择另外两条路线(C一 C1一 A1— B1— B; C— C2— A2— B2— B )到达 B点,从而避免了拥堵,提高了城市道路的通行能力。  Through the above steps, the vehicle can obtain real-time traffic information of the limited area in the front within 5 seconds. The satellite navigation system is responsible for displaying and using real-time traffic information. Drivers and satellite navigation systems can timely avoid congestion and low-speed sections based on real-time traffic information. For example, a vehicle at point C of a city road must pass point A to point B (see Figure 7). If congestion occurs at point A, the vehicle continuously enters the AC section, and congestion will occur immediately at point C, which will quickly cause Cl and C2 to occur. Congestion, causing large-scale traffic congestion. The invention provides real-time traffic information in a limited area in front of the vehicle, and the vehicle at point C finds that there is congestion at point A, and the other two routes can be selected (C-C1 - A1 - B1 - B; C - C2 - A2 - B2 - B) ) Arrived at point B, thus avoiding congestion and improving the capacity of urban roads.

Claims

权利要求 Rights request
1. 一种汽车前方有限区域实时交通信息的釆集和传输方法, 其特征是: 以 车载卫星导航系统为基础, 釆用无线广播通信方式进行信息传输,将道路分 隔为区并为其分配通信资源, 区内车辆釆集本区实时交通信息、 互相交换 信息、 确定信息传输者并将前方有限区域内实时交通信息按权重大小向后 方接力传输; 本发明包括无线通信系统, 道路及通信方式规划系统, 实时 交通信息釆集处理系统, 数据库系统及实时交通信息传输系统。 A method for collecting and transmitting real-time traffic information in a limited area in front of a vehicle, characterized in that: based on the in-vehicle satellite navigation system, wireless broadcast communication is used for information transmission, the road is divided into zones and communication is assigned thereto. Resources, vehicles in the area collect real-time traffic information in the area, exchange information with each other, determine the information transmitter and transmit the real-time traffic information in the limited area ahead to the rear by weight; the invention includes wireless communication system, road and communication mode planning System, real-time traffic information collection system, database system and real-time traffic information transmission system.
2. 根据权利要求 1 所述的方法, 其特征是: 所述无线通信系统使用 802. 11标准作为无线通信系统基础,以无线广播方式使用系统硬件,用 2. 4G 公用无线频段中 2412MHz、 2432MHz , 2452MHz , 2472MHz四个频点, 以时分 复用(TDM)方法得到 16个虚拟频点,用 802. 11芯片接收所有逻辑频点的全 部信息并发送信息, 该芯片用于接入无线网络。  2. The method according to claim 1, wherein: the wireless communication system uses the 802.11 standard as a basis of the wireless communication system, and uses the system hardware in a wireless broadcast mode, using a 24.4G public radio frequency band of 2412 MHz, 2432 MHz. , 2452MHz, 2472MHz four frequency points, get 16 virtual frequency points by time division multiplexing (TDM) method, use 802.11 chip to receive all the information of all logic frequency points and send information, the chip is used to access the wireless network.
3. 根据权利要求 1所述的方法, 其特征是: 所述道路及通信方式规划 系统以车载卫星导航地图为依据, 将道路以节点 (交叉路口中心点) 为起 点按东、 南、 西、 北 4个前进方向, 每个方向用 4个区 (每个区基本长度 为 100米)循环分割, 共生成 16个不同的区并为其分配通信频点, 将相同 时段的频点分配给同方向的区; 调整区的长度, 将两个节点之间的路段分 成不为(4N+1)的区数以免除通信干扰; 将复杂路段以保证主干道正常通信 为原则进行分区并分配频点; 将道路分区及频点分配信息生成道路及无线 频率规划数据库(下文称之为规划数据库)。  3. The method according to claim 1, wherein: the road and communication mode planning system is based on an in-vehicle satellite navigation map, and the road is based on nodes (intersection center points) as east, south, west, Four directions of northward direction, each direction is divided into four sections (each section has a basic length of 100 meters), and 16 different zones are generated and assigned communication frequency points, and the frequency points of the same time period are allocated to the same The direction of the zone; the length of the zone is divided into two sections (4N+1) to avoid communication interference; the complex sections are partitioned and allocated frequency to ensure normal communication of the main road The road partition and frequency allocation information is generated into a road and radio frequency planning database (hereinafter referred to as a planning database).
4. 根据权利要求 1所述的方法, 其特征是: 所述实时交通信息釆集处 理系统从卫星导航系统每秒获取一个速度值, 将 5次速度相加除 5得到的 平均值作为车辆所在区的速度, 将车辆所在区的速度信息简化为 0、 1、 2、 5、 10、 15、 20、 30、 50、 75及 90 (千米 /小时) 以上 11个等级, 其作用 是加大其值的稳定性, 以生成具有实际使用价值的车辆所在区的速度等级 的持续时间信息并减少需要传输的信息量(下文以速度代表车辆所在区的 速度等级)。  4. The method according to claim 1, wherein: the real-time traffic information collection and processing system acquires a speed value from the satellite navigation system every second, and adds the average value of 5 speeds divided by 5 as the vehicle location. The speed of the area, the speed information of the area where the vehicle is located is simplified to 0, 1, 2, 5, 10, 15, 20, 30, 50, 75 and 90 (km / h) above 11 levels, its role is to increase The stability of its value is used to generate duration information of the speed grade of the area in which the vehicle has actual use value and to reduce the amount of information that needs to be transmitted (hereinafter, the speed represents the speed grade of the area in which the vehicle is located).
5. 根据权利要求 1所述的方法, 其特征是: 所述数据库系统包括规划 数据库、 历史数据库、 车辆信息交换数据库和实时数据库; 实时数据库包 括有限区域数据库(汽车前方、 左右各 R (R初值为 2最小值为 1)千米半径 内所包含道路的最新交通信息), 顶级数据库(汽车前方 (R+2 ) 千米半径 内速度为 0且持续时间大于 5分钟的实时交通信息), 一级数据库(汽车前 方 (R+l ) 千米半径内速度为 1且持续时间大于 2分钟的实时交通信息), 外部信息数据库(汽车前方 R千米半径内红绿灯、 交通临时管制、 紧急避 让信息, 城市道路严重拥堵信息); 有限区域数据库中每组信息由位置、 速 度、持续时间 3个数据组成;顶级数据库及一级数据库中每组信息由位置、 持续时间 1 个数据组成; 有限区域大小可自动调整, 其规则为: 如果信息 传输时段时间富余, 剩余时间大于实际使用时间的百分之十, 则 R值增加 一个步长单位; 剩余时间小于实际使用时间的千分之一, 则 R值减少一个 步长单位; R值步长单位为 100米。 5. The method according to claim 1, wherein: the database system comprises a planning database, a historical database, a vehicle information exchange database, and a real-time database; the real-time database includes a limited area database (in front of the car, left and right R (R) The value is 2 and the minimum value is 1) the latest traffic information of the roads included in the radius of the kilometer), the top-level database (real-time traffic information with a speed of 0 in the front of the car (R+2) and a duration of more than 5 minutes), Primary database (before the car Square (R+l) Real-time traffic information with a speed of 1 in a kilometer radius and a duration of more than 2 minutes), external information database (traffic lights within R km radius in front of the car, temporary traffic control, emergency avoidance information, severe congestion on urban roads) Information); each group of information in the limited area database consists of three pieces of data: position, speed, and duration; each group of information in the top-level database and the primary database consists of 1 position and duration; the size of the limited area can be automatically adjusted. The rule is: If the information transmission time is rich, and the remaining time is greater than ten percent of the actual usage time, the R value is increased by one step unit; if the remaining time is less than one thousandth of the actual usage time, the R value is decreased by one step. Unit; R value step unit is 100 meters.
6. 根据权利要求 1所述的方法, 其特征是: 所述实时交通信息传输系 统分为 T1 ( 1. 5秒)、 T2 ( 3秒)、 T3 ( 0. 5秒) 3个时段, 在规划数据库支 持下以无线广播通信方式循环运行; T1 时段的任务是区内车辆互相对话, 以交换信息、 确定本区速度及信息传输者; T2 时段的任务是各区信息传输 者将顶级数据库、 一级数据库、 外部数据库及有限区域数据库信息依次向 外传输, 所有车辆接收其它车辆发出的信息; T3时段的任务是所有车辆接 收外部信息, 依据 T2时段运行数据及权利要求 5中的规则调整有限区域大 小。  6. The method according to claim 1, wherein: the real-time traffic information transmission system is divided into three periods of T1 (1.5 seconds), T2 (3 seconds), and T3 (0.5 seconds). The planning database supports cyclic operation in the form of wireless broadcast communication; the task of the T1 period is that the vehicles in the area talk to each other to exchange information, determine the speed of the area and the information transmitter; the task of the T2 period is that the information transmitter of each area will have the top database, The level database, the external database and the limited area database information are transmitted outwards in turn, all vehicles receive information from other vehicles; the task of the T3 period is that all vehicles receive external information, and the limited area is adjusted according to the T2 period operation data and the rules in claim 5. size.
7. 根据权利要求 6所述的方法, 其特征是: 所述 T1时段, 每个对话 过程中各区内未成功发出信息车辆随机生成 1至 30的编号, 以编号大小为 发信时间依据, 随机在 0至 8微秒之间发出各自的随机编号、速度、位置、 信息权重系数 (信息权重系数值等于顶级数据库和一级数据库数据数之和)、 本对话过程发信者成功与否信息, 每个车辆接收其它车辆发出的信息并判 断自身发信是否成功及确定自身接收到的信息是否被其它车辆认同, 未成 功发出信息车辆重新生成 1至 30的随机编号进行下一个对话过程, 多次对 话过程后区内车辆均得到其它车辆信息并使得所有车辆的信息互相认同; 以车辆的最高速度作为本区速度, 依据本区上一时次的速度及其持续时间 来确定本区速度的持续时间; 本区速度为 0 时, 若后方相邻区的速度大于 1 0 (千米 /小时)且持续时间大于 1分钟, 本区速度取后方值, 其持续时间 定为 1秒;以信息权重系数最大者作为本区信息传输者(若信息权重相同, 则取距离本区中心最近者; 若距离相等, 则取成功发信编号最小者)。  7. The method according to claim 6, wherein: in the T1 period, the information is randomly generated in each area in each session, and the vehicle randomly generates a number from 1 to 30, and the number is based on the time of sending, random. Send each random number, speed, position, and information weight coefficient between 0 and 8 microseconds (the information weight coefficient value is equal to the sum of the top-level database and the primary database data), and the success or failure information of the sender of the dialogue process. Vehicles receive information from other vehicles and determine whether their own transmission is successful and determine whether the information they receive is recognized by other vehicles. The information is not successfully sent. The vehicle regenerates the random number from 1 to 30 for the next dialogue process, multiple conversations. After the process, the vehicle obtains other vehicle information and makes the information of all the vehicles mutually agree; taking the highest speed of the vehicle as the speed of the area, determining the duration of the speed of the area according to the speed of the previous time and its duration in the area; When the speed of this area is 0, if the speed of the rear adjacent area is greater than 10 (km/h) and The duration is greater than 1 minute, the speed of the zone is taken as the rear value, and the duration is set to 1 second; the one with the largest information weight coefficient is used as the information transmitter of the zone (if the information weight is the same, the nearest is the center of the zone; if the distance is If they are equal, the one with the lowest successful transmission number).
8. 根据权利要求 6所述的方法, 其特征是: 所述 T2时段各数据库信 息按优先级别 (顶级、一级及有限区域数据库信息以生成时间最近者优先、 若时间相同, 以距离本区最近者优先; 外部数据库信息优先次序为紧急避 让、 城市道路严重拥堵、 交通临时管制及红绿灯信息)传输, 信息传输者 在发出信息的同时接收信息, 由于高级别信息可能晚到, 每发出一组信息 后重新对信息优先级别排队; 首先传输顶级数据库信息(使用时间为 T2时 段的四分之一), 其次传输一级数据库信息 (使用时间为 T2 时段的四分之 一), 再次传输外部数据库信息(使用时间为 T2时段的九分之一), 最后传 输有限区域数据库信息; 由于上一级数据库信息可能晚到, 下一级数据库 信息传输完成后转入检测顶级数据库信息, 若顶级数据库分配的传输时间 没有用完且有了新的数据, 则优先传输顶级数据库信息, 否则转入检测次 一级数据库信息并以上述规则运行; 有限区域数据库信息在传输 30组数据 后转入检测顶级数据库信息并以上述规则运行。 8. The method according to claim 6, wherein: the database information of the T2 period is according to a priority level (top level, first level and limited area database information to generate time is the closest, if the time is the same, to the distance area) Most recent priority; external database information prioritization is emergency avoidance, severe urban road congestion, traffic temporary control, traffic light information) transmission, information transmitters receive information while sending information, because high-level information may be late, each group issued Re-queue the information priority level after the information; first transmit the top-level database information (when the usage time is T2) One-fourth of the segment), the second-level database information is transmitted (the usage time is one quarter of the T2 period), the external database information is transmitted again (the usage time is one-ninth of the T2 period), and the limited area database is finally transmitted. Information; Since the upper-level database information may be late, the next-level database information transfer is transferred to the detection top-level database information. If the top-level database allocation transmission time is not used up and new data is available, the top-level database information is preferentially transmitted. Otherwise, it transfers to the detection sub-level database information and runs according to the above rules; the limited area database information is transferred to the detection top-level database information after the transmission of 30 sets of data and runs according to the above rules.
9. 根据权利要求 6所述的方法, 其特征是: 所述 T3时段所有车辆接 收有限区域红绿灯、 交通临时管制、 紧急避让信息, 城市道路严重拥堵信 息, 实现交通管理部门对本系统车辆的管理、 调度及指挥功能。  9. The method according to claim 6, wherein: all vehicles in the T3 period receive a limited area traffic light, traffic temporary control, emergency avoidance information, urban road serious congestion information, and implement traffic management department management of the system vehicle, Scheduling and command functions.
PCT/CN2013/072400 2012-09-04 2013-03-11 Collection and transmission method of real-time traffic information of limited region in front of automobile WO2014036819A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210323352.1 2012-09-04
CN2012103233521A CN102842241A (en) 2012-09-04 2012-09-04 Collection and transition method of real-time traffic information of limited region in front of car

Publications (1)

Publication Number Publication Date
WO2014036819A1 true WO2014036819A1 (en) 2014-03-13

Family

ID=47369543

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/072400 WO2014036819A1 (en) 2012-09-04 2013-03-11 Collection and transmission method of real-time traffic information of limited region in front of automobile

Country Status (2)

Country Link
CN (1) CN102842241A (en)
WO (1) WO2014036819A1 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102842241A (en) * 2012-09-04 2012-12-26 杨华龙 Collection and transition method of real-time traffic information of limited region in front of car
CN103457875A (en) * 2013-08-29 2013-12-18 上海永畅信息科技有限公司 Message queue control method based on multi-priority in Internet of vehicles
CN105791368B (en) * 2014-12-25 2019-01-01 中国移动通信集团公司 A kind of dispatching method and device of car-mounted terminal communication
CN106157648A (en) * 2015-04-15 2016-11-23 中国电信股份有限公司 Method, traffic information server and system for distributing traffic information
CN108257416B (en) * 2016-12-28 2021-03-23 华为技术有限公司 Method, device and system for path planning
JP6802778B2 (en) * 2017-12-01 2020-12-23 本田技研工業株式会社 Vehicle, route calculation device and route calculation method
CN109195094B (en) * 2018-08-30 2020-10-02 北京邮电大学 Dynamic resource selection method, device and system based on geographic position
CN111435567B (en) * 2020-02-05 2021-01-26 珠海大横琴科技发展有限公司 Control method and device for road patrol car on customs road

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6654681B1 (en) * 1999-02-01 2003-11-25 Definiens Ag Method and device for obtaining relevant traffic information and dynamic route optimizing
CN101286267A (en) * 2008-05-30 2008-10-15 同济大学 Wireless ad hoc network traffic navigation system and method based on multi-source data
CN102385798A (en) * 2010-08-31 2012-03-21 西门子公司 Traffic information collecting method, device and system
CN102842241A (en) * 2012-09-04 2012-12-26 杨华龙 Collection and transition method of real-time traffic information of limited region in front of car

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4345832B2 (en) * 2007-03-12 2009-10-14 トヨタ自動車株式会社 Road condition detection system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6654681B1 (en) * 1999-02-01 2003-11-25 Definiens Ag Method and device for obtaining relevant traffic information and dynamic route optimizing
CN101286267A (en) * 2008-05-30 2008-10-15 同济大学 Wireless ad hoc network traffic navigation system and method based on multi-source data
CN102385798A (en) * 2010-08-31 2012-03-21 西门子公司 Traffic information collecting method, device and system
CN102842241A (en) * 2012-09-04 2012-12-26 杨华龙 Collection and transition method of real-time traffic information of limited region in front of car

Also Published As

Publication number Publication date
CN102842241A (en) 2012-12-26

Similar Documents

Publication Publication Date Title
WO2014036819A1 (en) Collection and transmission method of real-time traffic information of limited region in front of automobile
Lyu et al. MoMAC: Mobility-aware and collision-avoidance MAC for safety applications in VANETs
Maslekar et al. CATS: An adaptive traffic signal system based on car-to-car communication
CN108009169B (en) Data processing method, device and equipment
CN105682046A (en) Interest packet forwarding method based on data attributes in vehicle-mounted named data networking
CN104575035A (en) Intersection self-adaptation control method based on car networking environment
CN109035760B (en) Road network information collection method under different RSU scenes in vehicle-mounted self-organizing network
CN109905921B (en) Multi-channel environment Internet of vehicles V2R/V2V cooperative data transmission scheduling method
CN107343024A (en) A kind of centralized car networking MAC layer merges prediction of collision and avoiding method
Shi et al. There is a will, there is a way: A new mechanism for traffic control based on VTL and VANET
CN103095593B (en) The route system of vehicular ad hoc network and method
Rizwan et al. Simulation of IoT-based vehicular ad hoc networks (VANETs) for smart traffic management systems
CN110519682B (en) V2V routing method combining position and communication range prediction
CN113823102B (en) Self-adaptive signal timing method under software-defined vehicle-mounted network environment
Moukas et al. Trafficopter: A distributed collection system for traffic information
CN107889077B (en) Rapid data transmission method based on Internet of vehicles technology
Li et al. Dynamic traffic light control scheme for reducing CO2 emissions employing ETC technology
Wu et al. An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network
CN102098230B (en) Resource scheduling method based on time and space correlation in vehicle communication
Anusa et al. enhance the performance of cluster based routing protocol using DPAL in VANET
CN109769033A (en) A kind of city VANETs distributed document transmission method
CN103095592A (en) Zone multicast routing system and method of vehicular ad hoc network
Xie et al. Design and evaluation of v2x-based dynamic bus lanes
Han et al. A bus oriented coordination method for intra-cluster BSM transmission
CN110446185B (en) Routing method for communication between vehicles based on node familiarity model

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13836145

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13836145

Country of ref document: EP

Kind code of ref document: A1