US20220386169A1 - Method for transferring a message in a communications network for communication between a road user and at least one further road user - Google Patents

Method for transferring a message in a communications network for communication between a road user and at least one further road user Download PDF

Info

Publication number
US20220386169A1
US20220386169A1 US17/773,555 US202017773555A US2022386169A1 US 20220386169 A1 US20220386169 A1 US 20220386169A1 US 202017773555 A US202017773555 A US 202017773555A US 2022386169 A1 US2022386169 A1 US 2022386169A1
Authority
US
United States
Prior art keywords
message
communications network
segments
priority
road user
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
US17/773,555
Other languages
English (en)
Inventor
Ignacio Llatser Marti
Florian Alexander Schiegg
Frank Hofmann
Maxim Dolgov
Florian Wildschuette
Hendrik Fuchs
Thomas MICHALKE
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
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 Robert Bosch GmbH filed Critical Robert Bosch GmbH
Assigned to ROBERT BOSCH GMBH reassignment ROBERT BOSCH GMBH ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WILDSCHUETTE, FLORIAN, Schiegg, Florian Alexander, Dolgov, Maxim, FUCHS, HENDRIK, HOFMANN, FRANK, MICHALKE, THOMAS, Llatser Marti, Ignacio
Publication of US20220386169A1 publication Critical patent/US20220386169A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433Allocation of priorities to traffic types
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0289Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/08Testing, supervising or monitoring using real traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30Services specially adapted for particular environments, situations or purposes
    • H04W4/40Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30Services specially adapted for particular environments, situations or purposes
    • H04W4/40Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H04W4/46Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W8/00Network data management
    • H04W8/02Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04Registration at HLR or HSS [Home Subscriber Server]

Definitions

  • the present invention relates to a method, an evaluation unit, a computer program and a computer-readable medium for transferring a message in a communications network for communication between a road user and at least one further road user.
  • V2I Vehicle-to-infrastructure communication
  • V2V vehicle-to-vehicle communication
  • RSUs roadside units
  • vehicle dynamics data may be exchanged, such as position or velocity, or pieces of information about surroundings of a vehicle.
  • V2X communication in connection with driver assistance systems for automated driving is considered particularly promising.
  • Technologies such as collective perception, i.e., a sharing of pieces of information about objects, which were “recognized by an on-board sensor system of a vehicle, with adjacent vehicles, and a coordination of vehicle maneuvers based on an exchange of anticipated vehicle trajectories, may increase the safety level, driving comfort and traffic efficiency; in this regard, also see: Laurens Hobert et al., “Enhancements of V2X Communication in Support of Cooperative Autonomous Driving,” IEEE Communications Magazine 53(12), pp. 64-70, 2015.
  • V2X messages such as the Collective Perception Message (CPM) and the Maneuver Coordination Message (MCM), which are currently being proposed for standardization by the Commission of the European Telecommunications Standards Institute (ETSI).
  • CPM Collective Perception Message
  • MCM Maneuver Coordination Message
  • ETSI Commission of the European Telecommunications Standards Institute
  • These messages typically contain obligatory fields, which must be contained in each message, for example a header, and a number of optional fields, which may be added to a message according to certain rules. This relates to, for example, recognized objects in a CPM or vehicle trajectories in an MCM.
  • a transfer of V2X messages for cooperative driving may result in a higher load on a V2X radio channel. If the ITS G5 technology is used, which was standardized in the EU for V2X communication, a channel overload may result in a reduced communication performance, i.e., in a higher packet error rate and higher latencies.
  • DCC Distributed Congestion Control
  • the goal of the DCC protocol is to optimize the network stability, the throughput rate and the assignment of resources to participating network stations.
  • a method, an evaluation unit, a computer program and a computer-readable medium for transferring a message in a communications network for communication between a road user and at least one further road user are provided in accordance with the present invention.
  • Advantageous refinements on and improvements of the approach presented here result from the disclosure herein.
  • Specific embodiments of the present invention advantageously make it possible to transfer messages in a V2X communications network, taking into account their particular relevance for participating vehicles or road users and taking into account an instantaneous network utilization. Due to the fact that a transfer is controlled as a function of a message content, it may be prevented, for example, that high-priority messages, for example a warning of a potentially imminent collision with a pedestrian, are discarded, while low-priority messages are transferred, for example a position and velocity of a vehicle driving on an expressway in the opposite direction. In other words, more higher-priority messages may be transferred in the case of higher network utilization in that fewer low-priority messages are transferred at the same time.
  • a first aspect of the present invention relates to a method for transferring a message in a communications network for communication between a road user and at least one further road user.
  • the road user and the further road user each have an evaluation unit for transferring messages via the communications network.
  • the method includes the following steps, which may be carried out, in particular, in the indicated order: receiving a first message in the evaluation unit, the first message including message segments each having a priority value; determining an instantaneous capacity utilization of the communications network; filtering message segments to be transferred out of the first message, based on the priority values and the instantaneous capacity utilization of the communications network; and generating a second message including the message segments to be transferred, and sending the second message via the communications network.
  • a road user may be understood to be, for example, a motor vehicle, such as a passenger car, truck, bus or a motorcycle, an element of a traffic infrastructure, also referred to as a roadside unit, a bicycle, a kick scooter or a pedestrian.
  • a motor vehicle such as a passenger car, truck, bus or a motorcycle
  • an element of a traffic infrastructure also referred to as a roadside unit
  • a bicycle a kick scooter or a pedestrian.
  • a communications network may be understood to be a network for traffic networking, for example from vehicle to vehicle (V2V or car2car), from vehicle to road (V2R), from vehicle to infrastructure (V2I), from vehicle to network (V2N) or from vehicle to persons (V2P).
  • V2V or car2car vehicle to vehicle
  • V2R vehicle to road
  • V2I vehicle to infrastructure
  • V2N vehicle to network
  • V2P vehicle to persons
  • messages between users of the communications network may be transferred via a wireless communication link, such as a WLAN, Bluetooth or mobile radio link.
  • the road users each include a sensor system for detecting their surroundings.
  • the sensor system may be, for example, a camera, a radar sensor or a LIDAR sensor.
  • the evaluation unit may be designed to recognize objects, based on sensor data generated by the sensor system, and/or to control the relevant road user, for example a vehicle, according to the recognized objects, i.e., to steer, brake and/or accelerate it by activating a corresponding actuator system.
  • the evaluation unit may be designed to control the road user, based on messages provided by other road users and received via the communications network.
  • a recognized object may also be, for example, a trajectory of an adjacent road user or a piece of maneuver information, based on at least one possible trajectory of the road user and/or at least one possible trajectory of at least one adjacent road user.
  • a priority value may be assigned to a recognized object, which indicates a relevance of the recognized object for the relevant road user and/or further road users.
  • This assignment may take place, for example, with the aid of a surroundings model, which stores objects in the surroundings as object models and updates them continuously, based on the sensor data.
  • the surroundings model may determine the relevance of the object, based on a position, location, velocity, trajectory or object class of the object and quantify this relevance by calculating a corresponding priority value.
  • a message to be transferred in the communications network may be viewed as a V2X message for cooperative driving, for example a CPM or an MCM.
  • a message of this type may contain not only a header but also one or multiple message segments.
  • the message segments may be optional.
  • each message segment describes a recognized object, for example its position, location, velocity, size or object class, and is marked by the priority value of the recognized object.
  • the individual message segments of a message may differ from each other in terms of their priority value.
  • the message may furthermore contain pieces of information about anticipated trajectories, a steering angle, a position, a direction or a velocity of the road user.
  • the field of vision or the range of the sensor system may be described in the message.
  • a second aspect of the present invention relates to an evaluation unit, which is designed to carry out the method as described above and below.
  • Features of the method, as described above and below, may also be features of the evaluation unit.
  • the computer-readable medium may be, for example, a hard disk, a USB memory device, a RAM, ROM, EPROM or a flash memory.
  • the computer-readable medium may also be a data communications network, which permits a download of a program code, such as the Internet.
  • the computer-readable memory may be transitory or non-transitory.
  • a DCC protocol as presently used for V2X communication, primarily controls a message transfer rate i.e., a transfer of messages based on a measured channel busy ratio; in this regard, also see: ETSI TS 102 687 V1.2.1, Intelligent Transport Systems (ITS); Decentralized Congestion Control Mechanisms for Intelligent Transport Systems Operating in the 5 GHz Range; Access Layer Part. ETSI TS 103 175 V1.1.1, Intelligent Transport Systems (ITS); Cross Layer DCC Management Entity for Operation in the ITS G5A and ITS G5B Medium. ETSI TR 101 612 V1.1.1, Intelligent Transport Systems (ITS); Cross Layer DCC Management Entity for Operation in the ITS G5A and ITS G5B Medium; Report on Cross layer DCC Algorithms and Performance Evaluation.
  • the main component of this DCC protocol is a gatekeeper, which is situated between an access layer and a network layer, which places the messages to be transferred into queues according to their priority and limits the message transfer rate as a function of a measured channel busy ratio.
  • the message transfer rate is limited regardless of a particular type and a particular content of the messages.
  • a list of message segments including transfer priorities is generated.
  • This list may be provided, for example, by a collective perception service or a maneuver coordination service.
  • the message segments correspond, for example, to the optional fields of a message mentioned in the following. For example, it may be decided, with the aid of a DCC protocol, which of the message segments in a message are to be transferred and which are not.
  • a transfer priority of a message segment may be calculated, for example, by an application, based on a functional use of the message segment, and provided as input for a DCC protocol.
  • Examples of functionally useful message segments are recognized objects having high dynamics or preferred vehicle trajectories.
  • the DCC protocol selects which of the message segments (if present) are to be transferred, based on the list of message segments and a channel condition, and returns the result to the application.
  • the application then creates a V2X message, based on the message segments selected for transfer, and forwards the V2X message to a network layer.
  • present DCC protocols do not take into account the contents of the messages. As a result, they are not able to distinguish between important and less important messages or transfer certain messages as a priority over other messages.
  • present DCC protocols also see: M. Sepulcre, J. Mittag, P. Santi, H. Hartenstein and J. Gozalvez, “Congestion and Awareness Control in Cooperative Vehicular Systems,” in Proceedings of the IEEE, Vol. 99, No. 7, pp. 1260-1279, July 2011. Bengi Aygun, Mate Boban, Alexander M. Wyglinski, “ECPR: Environment- and Context-Aware Combined Power and Rate Distributed Congestion Control for Vehicular Communications,” Computer Communications, Vol. 93, pp. 3-16, 2016. C. B.
  • the approach described here in accordance with the present invention facilitates a priority-based selection of message segments to be transferred, for the purpose of reaching a good compromise between functional use and channel load.
  • Message segments having a high priority are selected with preference for each message.
  • the method may further include: determining a maximum message size of a message to be transferred as a function of the instantaneous capacity utilization of the communications network, and determining a priority threshold value as a function of the instantaneous capacity utilization of the communications network and/or based on priority values of message segments last transferred; filtering the message segments to be transferred out of the first massage, based on the maximum message size and the priority threshold value.
  • the priority threshold value may vary from message to message and be recalculated for each message to be transferred, based on one or multiple preceding messages.
  • the priority threshold value may be continuously adapted thereby to changing situations in the surroundings of the road user as well as to temporal fluctuations of the network capacity utilization.
  • a filter list for message segments to be filtered may be created.
  • the priority values of the message segments may each be compared with the priority threshold value.
  • the filter list may be shortened by removing message segments whose priority value is below the priority threshold value.
  • the message segments to be transferred may then be selected from the shortened filter list, taking into account the maximum message size.
  • the filtering out may take place in two stages, by means of which the efficiency of the method may be increased.
  • the method also includes the following steps, which may be preferably carried out in the indicated order: selecting a message segment including the highest priority value from the shortened filter list; ascertaining a message segment size of the selected message segment; comparing the message segment size with the maximum message size; when the message segment size is smaller than the maximum message size: adding the selected message segment to a transfer list of message segments to be transferred; removing the selected message segment from the shortened filter list; reducing the maximum message size by the message segment size.
  • the steps of selecting, ascertaining, comparing, adding, removing and reducing may be repeated cyclically until the message segment size is smaller than or equal to the maximum message size and/or all message segments have been removed from the shortened filter list.
  • the method may additionally include the following step: checking whether the transfer list contains at least one message segment. If it does, the generation of the second message with the transfer list and the transfer of the second message via the communications network may take place. For example, the sending of messages without message segments may be avoided thereby.
  • the priority threshold value may be calculated from a channel busy ratio (CBR).
  • CBR channel busy ratio
  • the priority threshold value may increase and/or decrease along with the channel busy ratio.
  • a channel busy ratio may generally be understood to be a ratio of a time interval, in which a radio channel assigned to the communications network is used, to a measuring interval, in which the channel busy ratio is measured.
  • the priority threshold value may be proportional to the channel busy ratio.
  • at least one statistical characteristic may be calculated from the priority values of message segments last transferred.
  • the priority threshold value may then be calculated from the statistical characteristic.
  • a statistical characteristic of this type may be, for example, an arithmetic mean value or a median. It is possible that the priority threshold value increases and/or decreases along with the statistical characteristic.
  • the priority threshold value may be proportional to the statistical characteristic. As a result, random fluctuations may be compensated for during the calculation of the priority threshold value.
  • a data transfer rate may be understood to be a theoretical bandwidth or a bandwidth of the radio channel necessary for a transfer.
  • the necessary bandwidth may be, for example, approximately two-thirds of the theoretical bandwidth.
  • the capacity utilization of the communications network may thus be very easily ascertained.
  • T is understood to be a time since the last transfer of a message via the radio channel.
  • the maximum message size may be determined as a function of a transfer frequency. For example, the message size selected may be greater, the lower the transfer frequency, and vice versa.
  • FIG. 1 schematically shows a traffic scenario including networked vehicles, each being equipped with an evaluation unit according to one exemplary embodiment of the present invention.
  • FIG. 2 schematically shows how message segments are filtered by the evaluation unit according to FIG. 1 .
  • FIG. 3 shows a flowchart of a method according to one exemplary embodiment of the present invention.
  • FIG. 1 shows an example of four vehicles 101 , 102 , 103 , 104 , each of which is equipped with a sensor system 106 for detecting surroundings, an evaluation unit 108 for evaluating sensor data 110 generated by sensor system 106 , and an actuator system 112 .
  • Evaluation unit 108 is furthermore configured to send and/or receive a message 114 via a wireless V2X communications network, in which the four vehicles 101 , 102 , 103 , 104 are networked with each other, based on sensor data 110 .
  • a received message 114 may be evaluated by evaluation unit 108 , for example to activate actuator system 112 . It is thus possible, for example, to coordinate individual driving maneuvers of vehicles 101 , 102 , 103 , 104 in an automated manner, which may also be referred to as cooperative driving.
  • the three vehicles 101 , 103 , 104 drive on an expressway 115 , while vehicle 102 is in the process of entering expressway 115 .
  • sensor system 106 is implemented as a camera. However, sensor system 106 may also include multiple sensor units of different types. For example, sensor system 106 may include, for example, at least one radar, LIDAR or ultrasonic sensor or laser scanner in addition or as an alternative to the camera.
  • Actuator system 112 may include, for example, a steering or brake actuator or an actuator for controlling the engine.
  • Evaluation unit 108 may be designed to generate a control signal 116 for activating actuator system 112 , based on sensor data 110 and/or message 114 , for the purpose of controlling, i.e., steering, braking, accelerating the relevant vehicle in an automated manner, or to navigate it according to a predefined route in a digital map, for example, taking into account anticipated trajectories of the other vehicles in each case.
  • Evaluation unit 108 is configured, in particular, to extract objects in the surroundings from sensor data 110 , for example, adjacent vehicles or their possible trajectories.
  • Evaluation unit 108 of vehicle 103 thus recognizes, for example, the three vehicles 101 , 102 , 104 .
  • evaluation unit 108 assigns a priority value to each of the recognized objects, which quantifies a relevance of the recognized object for vehicle 103 .
  • the two vehicles 101 , 104 receive a lower priority value than entering vehicle 102 , whose trajectory is expected to intersect with a trajectory of vehicle 103 .
  • evaluation unit 108 ascertains an instantaneous channel capacity utilization of a radio channel, via which vehicles 101 , 102 , 103 , 104 communicate with each other. Based on the instantaneous channel capacity utilization and the particular priority values, evaluation unit 108 now selects from among the recognized objects the ones which are particularly relevant, in this case, for example, recognized vehicle 102 , and generates and sends a message 114 including a piece of relevant information, for example, about the position, velocity, trajectory of recognized vehicle 102 . Less relevant objects are excluded from message 114 , to avoid unnecessarily loading the radio channel. Message 114 may be received by other vehicles, for example by vehicles 101 , 104 .
  • FIG. 2 shows a filter list L 1 generated by evaluation unit 108 , based on sensor data 110 , including different message segments S 1 , S 2 , S 3 , S 4 , S 5 , each of which describes a recognized object in the surroundings of vehicle 103 , including, for example, vehicles 101 , 102 , 104 .
  • Each of message segments S 1 , S 2 , S 3 , S 4 , S 5 is marked with a priority value p i , which indicates a particular priority of the object described in the message segment.
  • evaluation unit 108 Based on a threshold value comparison, in a first step, evaluate unit 108 removes message segments S 1 , S 3 having low priority values p 1 and p 3 from filter list L 1 , which thereby becomes a shortened filter list L′ 1 . In a second step, evaluation unit 108 creates a transfer list L 2 from message segments S 2 , S 4 , S 5 contained in shortened filter list L′ 1 , which, in this case, contains message segments S 2 , S 4 having particularly high priority values p 2 and p 4 . Transfer list L 2 is created in such a way that it does not exceed a predefined maximum message size.
  • the message size is not sufficient, for example, to add message segment S 5 to transfer list L 2 in addition to the two message segments S 2 , S 4 .
  • Evaluation unit 108 determines the maximum message size, for example, from the instantaneous channel capacity utilization, as described in greater detail below, based on FIG. 3 .
  • evaluation unit 108 generates message 114 from transfer list L 2 .
  • Message 114 contains not only message segments S 2 , S 4 to be transferred from transfer list L 2 but also a header H including obligatory data about vehicle 103 and its sensor system 106 , among others.
  • FIG. 3 shows a flowchart of a method 300 for transferring message 114 .
  • Method 300 may be carried out, for example, by evaluation unit 108 according to FIG. 2 .
  • a message sent by another road user 101 , 102 , 104 is received in evaluation unit 108 , the message containing message segments S 1 through S 5 to be filtered, which have priority values p 1 through p 5 .
  • filter list L 1 is created, which includes message segments S 1 through S 5 having associated priority values p 1 through p 5 .
  • sensor data 110 are optionally received in evaluation unit 108 in first step 301 .
  • objects 101 , 102 , 104 are recognized in the surroundings of vehicle 103 by a corresponding processing and evaluation of sensor data 110 .
  • Different priority values p 1 are assigned to objects 101 , 102 , 104 , depending on their relevance.
  • filter list L 1 is created, which includes message segments S 1 through S 5 to be filtered, which have associated priority values p 1 through p 5 and describe objects 101 , 102 , 104 .
  • An instantaneously available data transfer rate R a of a radio channel assigned to the communications network is determined in a further step 304 .
  • a maximum message size M max of a message to be transferred and a priority threshold value p th are calculated from instantaneously available data transfer rate R a .
  • filter list L 1 is filtered with maximum message size M max and priority threshold value p th as filter criteria.
  • Message segments S 1 , S 3 including priority values p 1 and p 3 below priority threshold value p th are removed from filter list L 1 .
  • Message segments are selected from message segments S 2 , S 4 , S 5 including priority values p 2 , p 4 and p 5 above priority threshold value p th for priority list L 2 until maximum message size M max is reached. This is the case here after message segments S 2 , S 4 have been added to transfer list L 2 .
  • message 114 is generated from transfer list L 2 and transferred via the radio channel in the communications network.
  • Method 300 described above may be viewed as an extension of an ETSI DCC protocol mentioned further above.
  • Filter list L 1 may be provided, for example, by an application layer and received by an underlying layer, for example a DCC protocol.
  • an underlying layer for example a DCC protocol.
  • the following six principle steps may be carried out by the DCC protocol.
  • a data transfer rate R a instantaneously available for a transfer is first estimated in step 304 .
  • an instantaneous channel busy ratio CBR may be measured for this purpose.
  • Channel busy ratio CBR describes a time portion, in which the radio channel is used by other stations (0 ⁇ CBR ⁇ 1).
  • available throughput R a is calculated to:
  • step 305 maximum message size M max is calculated to:
  • priority threshold value p th is furthermore calculated as a function of channel busy ratio CBR, a higher channel busy ratio CBR resulting in a higher priority threshold value p th and vice versa.
  • priority threshold value p th may be ultimately calculated, based on a statistical distribution of priority values p i , for a transfer of selected message segments S i , for example based on an arithmetic mean value or a median.
  • Priority threshold value p th is greater, the greater are priority values p 1 of message segments S i last selected, and vice versa.
  • a step 308 all message segments S 1 , S 3 are now discarded from filter list L 1 , whose priority value p 1 or p 3 is below priority threshold value p th .
  • Filter list L 1 is shortened accordingly thereby. If, at the outset, filter list L 1 contains only message segments S i including priority values p 1 below priority threshold value p th , entire filter list L 1 , for example, is discarded, and the method is aborted in a step 309 .
  • transfer list L 2 is created as a new empty list. Message segments for transfer list L 2 are now selected from message segments S 2 , S 4 , S 5 of shortened filter list L′ 1 .
  • filter list L 1 is processed step by step.
  • Message segment S 2 including highest priority value p 2 is first selected in step 310 .
  • a message segment size M of selected message segment S 2 is ascertained in a step 311 .
  • Message segment size M is compared with maximum message size M max in a step 312 . If M ⁇ M max , selected message segment S 2 is added to transfer list L 2 in a step 313 and removed from filter list L′ 1 in a step 314 .
  • steps 310 through 315 are repeated for message segments S 4 , S 5 remaining in filter list L′ 1 .
  • the message segment including the highest priority value is now message segment S 4 .
  • Steps 310 through 315 are generally repeated cyclically until filter list L′ 1 is empty. With the aid of completed transfer list L 2 , message 114 is finally generated and sent in step 307 .
  • step 312 if it turns out in step 312 that a message segment S i to be added to transfer list L 2 is greater or equal to maximum message size M max , as in the case here of message segment S 5 , for example, it may be checked, for example, in an additional step 316 before generating message 114 whether transfer list L 2 contains at least one message segment S i or more than one predefined minimum number of message segments S i . If this is the case, message 114 is generated and sent in step 307 . If it is not the case, no message 114 is generated, and method 300 is aborted.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Traffic Control Systems (AREA)
US17/773,555 2019-11-04 2020-09-25 Method for transferring a message in a communications network for communication between a road user and at least one further road user Pending US20220386169A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE102019216916.3A DE102019216916A1 (de) 2019-11-04 2019-11-04 Verfahren zum Übertragen einer Nachricht in einem Kommunikationsnetzwerk zur Kommunikation zwischen einem Verkehrsteilnehmer und mindestens einem weiteren Verkehrsteilnehmer
DE102019216916.3 2019-11-04
PCT/EP2020/076923 WO2021089237A1 (fr) 2019-11-04 2020-09-25 Procédé de transmission d'un message dans un réseau de communication pour la communication entre un usager de la route et au moins un autre usager de la route

Publications (1)

Publication Number Publication Date
US20220386169A1 true US20220386169A1 (en) 2022-12-01

Family

ID=72665254

Family Applications (1)

Application Number Title Priority Date Filing Date
US17/773,555 Pending US20220386169A1 (en) 2019-11-04 2020-09-25 Method for transferring a message in a communications network for communication between a road user and at least one further road user

Country Status (7)

Country Link
US (1) US20220386169A1 (fr)
EP (1) EP4055848B1 (fr)
JP (1) JP7326607B2 (fr)
KR (1) KR20220098176A (fr)
CN (1) CN114642022A (fr)
DE (1) DE102019216916A1 (fr)
WO (1) WO2021089237A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240013655A1 (en) * 2022-07-05 2024-01-11 Qualcomm Incorporated Misbehavior detection in a vehicle-to-everything (v2x) maneuver coordination message

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102021210687A1 (de) 2021-09-24 2023-03-30 Psa Automobiles Sa Effizienzgesteigerte Kommunikation kooperativ agierender automatisierter Fahrzeuge
WO2023122586A1 (fr) * 2021-12-21 2023-06-29 Tusimple, Inc. Architecture de passerelle de communication de véhicule autonome
EP4366340A1 (fr) * 2022-11-02 2024-05-08 Robert Bosch GmbH Procédé de fourniture d'un message objet et dispositif de génération de message

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160197825A1 (en) * 2013-08-22 2016-07-07 Continental Teves Ag & Co. Ohg Filtering of data packets to be forwarded in the car2x network
WO2018182591A1 (fr) * 2017-03-29 2018-10-04 Intel IP Corporation Division d'un message permettant une transmission multi-rat
WO2019160176A1 (fr) * 2018-02-14 2019-08-22 엘지전자(주) Dispositif de communication v2x et procédé d'émission et de réception de message v2x au moyen de celui-ci

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3704022B2 (ja) 2000-04-25 2005-10-05 株式会社東芝 無線通信システム、無線制御局および無線通信方法
JP3896056B2 (ja) 2002-09-02 2007-03-22 日本電信電話株式会社 フレーム処理方法及びフレーム処理装置
US8224370B2 (en) 2009-07-10 2012-07-17 Honda Motor Co., Ltd. Method of controlling a communication system in a motor vehicle
US10493907B2 (en) 2015-07-31 2019-12-03 Hitachi Automotive Systems, Ltd. Vehicle periphery information management device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160197825A1 (en) * 2013-08-22 2016-07-07 Continental Teves Ag & Co. Ohg Filtering of data packets to be forwarded in the car2x network
WO2018182591A1 (fr) * 2017-03-29 2018-10-04 Intel IP Corporation Division d'un message permettant une transmission multi-rat
WO2019160176A1 (fr) * 2018-02-14 2019-08-22 엘지전자(주) Dispositif de communication v2x et procédé d'émission et de réception de message v2x au moyen de celui-ci

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240013655A1 (en) * 2022-07-05 2024-01-11 Qualcomm Incorporated Misbehavior detection in a vehicle-to-everything (v2x) maneuver coordination message

Also Published As

Publication number Publication date
EP4055848B1 (fr) 2023-07-12
EP4055848A1 (fr) 2022-09-14
JP7326607B2 (ja) 2023-08-15
DE102019216916A1 (de) 2021-05-06
WO2021089237A1 (fr) 2021-05-14
JP2023500881A (ja) 2023-01-11
CN114642022A (zh) 2022-06-17
KR20220098176A (ko) 2022-07-11

Similar Documents

Publication Publication Date Title
US20220386169A1 (en) Method for transferring a message in a communications network for communication between a road user and at least one further road user
CN110089086B (zh) 一种中继传输的方法、相关设备及系统
US9521575B2 (en) Congestion control device and method for inter-vehicle communication
Nguyen et al. A survey on adaptive multi-channel MAC protocols in VANETs using Markov models
US9935875B2 (en) Filtering data packets to be relayed in the car2X network
KR20180042244A (ko) 단거리 전용 통신 (dsrc) 에서의 안전 이벤트 메시지 송신 타이밍
EP3226647A1 (fr) Appareil et procédé de communication sans fil
CN111988164B (zh) 用于预测至少两个通信伙伴之间的通信的服务质量的方法和用于执行该方法的步骤的装置
US20220392341A1 (en) Method for providing a maneuver message for coordinating a maneuver between a road user and at least one further road user in a communication network
Gil et al. Communication requirements for dynamic wireless power transfer for battery electric vehicles
CN115100623A (zh) 一种基于端-边-云协同的无人机辅助车联网盲区行人检测系统
Kwon Improving multi-channel wave-based V2X communication to support advanced driver assistance system (ADAS)
US20220408219A1 (en) Method for v2x service and device using same
CN111480349B (zh) 用于确定数据格式的控制设备和方法
Adler et al. Context-adaptive information dissemination in vanets-maximizing the global benefit.
CN115086908A (zh) 用于v2x通信的方法和装置
Ingrachen et al. A collaborative environment perception approach for vehicular ad hoc networks
Delooz et al. Congestion aware objects filtering for collective perception
EP4300852A1 (fr) Procédé et dispositif pour modifier la transmission de son message
Sharma et al. Fair channel distribution-based congestion control in vehicular ad hoc networks
EP4167209A1 (fr) Système de transport intelligent coopératif et procédé de commande de génération de cpm basé sur l'indice d'importance et le niveau d'importance des informations
EP4167607A1 (fr) Système et procédé de transport intelligent coopératif avec niveau d'importance des informations cpm
CN112073940B (zh) 一种车载社交网络中汽车消息发送概率的设定方法和介质
EP4243464A1 (fr) Procédé pour commander la conduite d'un véhicule v2x par un premier dispositif dans un système de communication sans fil supportant la liaison latérale, et dispositif correspondant
EP4167611A1 (fr) Système de transport coopératif intelligent et procédé avec indice de signification cpm pour atténuation de redondance

Legal Events

Date Code Title Description
AS Assignment

Owner name: ROBERT BOSCH GMBH, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LLATSER MARTI, IGNACIO;SCHIEGG, FLORIAN ALEXANDER;HOFMANN, FRANK;AND OTHERS;SIGNING DATES FROM 20220503 TO 20220510;REEL/FRAME:060898/0705

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED