<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>International Conference on Applied Informatics
Eger, Hungary, January</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Modelling and Examination of Collective Perception Service for V2X Supported Autonomous Driving∗</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Máté Herbert</string-name>
          <email>mherbert1@sch.bme.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>András Váradi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>László Bokor</string-name>
          <email>bokorl@hit.bme.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Budapest University of Technology and Economics Deptartment of Networked Systems and Services</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>2</volume>
      <fpage>9</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>Thanks to evolving cooperative V2X (Vehicle-to-Anything) communication, soon trafic participants do not have to use only their own perceptions of the environment to make a certain decision in a trafic situation, but also have the opportunity to use external originated data, which information could be hardly perceived or even totally unperceivable from their perspective. Collective Perception Service (CPS) is a Day 2 V2X service which can be used by an ITS-Station (ITS-S) to share information about its environment with other ITS-Ss by providing data about perceived objects (e.g., vehicles, obstacles, pedestrians) and available free space which can be safely allocated by other ITS-Ss (e.g., in an overtaking maneuver). Such extensive exchange of sensor data representations with growing bandwidth demand will aggravate the problem of the increasing load on the radio channels in future C-ITS usecases. Motivated by this, we modeled CPS in an environment with changing vehicular trafic and communication conditions and examined the perceived Channel Busy Ratio (CBR) in multiple scenarios.</p>
      </abstract>
      <kwd-group>
        <kwd>V2X</kwd>
        <kwd>Collective Perception Service</kwd>
        <kwd>DCC</kwd>
        <kwd>OMNeT++</kwd>
        <kwd>Artery</kwd>
        <kwd>SUMO</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>In recent times innovation of connectivity in all domains is continuing at an
increasing pace. Information is becoming more reliable and is delivered faster than ever
before, helping the IT ecosystem to perform at a similarly increasing speed. The
transport industry has shown great interest in harvesting such connectivity-based
solutions to deliver better C-ITS services. However, connectivity’s significant role
in ITS is to increase safety and eficiency radically. V2X (Vehicle-to-Everything)
is a term used for low latency (and usually safety-relevant) information exchange
between trafic participants. The concept of avoiding nearly all accidents involving
all trafic participants by the use of V2X has been introduced in the early 2000s
by the Automotive industry, followed by the founding of the Car2Car
Communication Consortium and thereafter by initial cross-OEM pilot projects like CVIS [1],
DriveC2X [2] and SimTD [3].</p>
      <p>After nearly 20 years of research and validation, currently the so-called Day 1
system is being rolled out in Europe by major OEMs introducing (among other
services) Cooperative Awareness (CA) where connected vehicles are made aware
of each other to avoid accidents including non-line-of-site (NLOS) situations where
classic ADAS systems are not able to help.</p>
      <p>
        The Collective Perception Service (CPS) considered as a Day 2 service is
foreseen as the biggest gamechanger when it comes to assisted and automated driving
systems as it enablers connected cars to not only disseminate their presence (via
Cooperative Awareness) but the presence of all nearby (non-connected) entities
whether it is a vehicle, a cyclist or an animal running across the street. CPS will
digitalize trafic at a very early stage (meaning a meager penetration ratio of
enabled cars). Collective Perception Message (CPM) used by CPS could include and
share prosperous sensor data like position, speed, or dimension and even perceived
objects and free space which describe the environment of the station around. ETSI
ITS is currently standardizing the Collective Perception Message (CPM) under the
Technical Specification number TS 103 324 with an initial Technical Report (TR
103 562) already published [
        <xref ref-type="bibr" rid="ref2">5</xref>
        ].
      </p>
      <p>The message can be used to transmit up to 10 times per second the complete
environmental perception of a single vehicle, providing sensor properties and
capabilities, a database of identified objects, and occupiable free space within the range
of its sensors. Consequently, CPS reduces the uncertainty of an ITS-S about the
current environment, therefore supporting autonomous driving in the future.</p>
      <p>
        With the growing penetration of V2X applications and V2X-capable devices,
the load on the used channel will also increase. Frequent exchange of sensor data
representations with higher size demand, like in the case of CPS, will further
aggravate this problem. Therefore, simulation-based realistic modeling and examination
of CPS and relating services is essential for further development of such advanced
V2X solutions. This article introduces our initial simulation results gathered from
Artery-based [
        <xref ref-type="bibr" rid="ref10">13</xref>
        ] CPS and sensor models we designed and developed relying on the
framework capabilities [
        <xref ref-type="bibr" rid="ref1">4</xref>
        ]. Our implementation was then deployed and measured
in an environment with changing vehicular trafic and communication conditions
and used in diferent trafic situations together with the mandatory and already
deployed CA service.
      </p>
      <p>The rest of the paper is organized as follows. First, we give a short overview of
the background, focusing on the details of Decentralized Congestion Control (DCC)
and CA and CP services. Then we introduce the simulation environment and the
implemented scenarios and applied parameters we used in our experiments, followed
by the gathered measurement results and their analysis. Finally, we conclude the
paper and highlight our future work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <sec id="sec-2-1">
        <title>2.1. Decentralized Congestion Control (DCC)</title>
        <p>
          In the ETSI ITS–G5 C–ITS architecture DCC [
          <xref ref-type="bibr" rid="ref8 ref9">11, 12</xref>
          ] is a cross–layer entity with
the main role of the congestion control of the packets in VANET (Vehicular Ad–
hoc Network, implementing IEEE 802.11p [
          <xref ref-type="bibr" rid="ref3">6</xref>
          ] specifications) environments. The
operation of DCC is based on CBR (Channel Busy Ratio) value measured on
the selected channel. CBR is counted with the formula [
          <xref ref-type="bibr" rid="ref4">7</xref>
          ]  =   /  ,
where   is the duration of time in milliseconds, when the signal power of the
measured channel exceeds -85 dBm through   , which equals to 100 ms. The
essence of the DCC-based operation is that it delays message generation and packet
transmission to control the congestion level of the channel. According to C2C-CC
Basic System Profile [
          <xref ref-type="bibr" rid="ref5">8</xref>
          ], the Access layer part of DCC contains four queues, and
each can store up to two messages. These queues have diferent priorities, and
the messages fill them up according to the Trafic Class (TC) field value of each
packet. The priority profiles of the queues are named from DP0 to DP3 (lower
value means higher priority) [
          <xref ref-type="bibr" rid="ref5">8</xref>
          ]. DP0: TC = 0, only high priority DENM [
          <xref ref-type="bibr" rid="ref6">9</xref>
          ], DP1:
TC = 1, only low priority DENM [
          <xref ref-type="bibr" rid="ref6">9</xref>
          ], DP2: TC = 2, only CAM [
          <xref ref-type="bibr" rid="ref7">10</xref>
          ], DP3: every
other packet. When packet sending happens, the next message is chosen from a
not empty queue, which has the highest priority. Behavior is not defined in the
case when a packet arrives in a queue with no more free space. Still, in Artery
(the simulation framework we use, see later), the oldest message is dropped in this
situation so that messages with the most recent information shall be sent out the
radio interface.
        </p>
        <p>In our investigations, we used two reactive implementations of DCC, which
means their operations are based on two Finite State Machines (FSM). One is
called Fully Meshed, and the other one is called Gradual. Table 1 represent the
states of these two FSMs. To each state, a   value is assigned, which is the
minimum time interval between two message transmissions and generations.</p>
        <p>These two implementations also operate quite diferently. The Gradual one
switches states step by step, and it uses only the latest value of CBR measurement.
However, the Fully Meshed implementation can change rules by skipping one or
more (for instance, it can shift Active 1 to Active 3 immediately). Still, it uses more
(a) States of Gradulal DCC
(b) States of Fully Meshed DCC
of the recent measurements to determine the proper state. According to C2C-CC
BSP, the chosen implementation for deployments is the Gradual FSM.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. CA and CP Services</title>
        <p>Cooperative Awareness (Day 1) and Collective Perception (Day 2) services are
periodic type ones; they send messages periodically with a rate between 1 and
10 Hz. Furthermore, these services send messages with significant packet size, so
they mean relatively high stress to the used channel. CA Service is used to send
information about the originating ITS station like position, heading, speed, or
recent position points of the traveled path (path history). The latter is responsible
for the highest amount of the allocated message size. Using CP Service, the ITS
stations can inform each other about the perceived objects and free spaces that
can be allocated by other vehicles. Thus, in general, the messages generated by
this service are bigger than CA Messages (CAMs). Still, the message size is highly
dependable on the number of perceived objects and the used area containers to
encode free space information. For example, there are particular kinds of free space
area shapes like circle, rectangle, or radial, which can be used to describe areas in
simple ways with a low amount of consumed data. Still, there is the opportunity
to use polygon type to cover complex areas, presumably with more bytes of data.
CA and CP Services use position, heading, and speed change values to determine
whether to generate a message or include a perceived object. In our investigations,
we used three kinds of CP Message (CPM) content generation techniques:
• Objects and free space radials upon sensor detection: every perceived object
included and to each one, a free space radial was assigned to cover available
free space with a variable number of small shapes.
• Objects upon sensor detection with only one free space radial: every perceived
object included, and each CPM contains a free space polygon with 16 vertices
representing constant, but slightly high data usage.
• Every CPM is 1500 bytes large, which is the MTU size determined by 802.11
standards representing a kind of upper bound of penetration by CP Service
in our simulations.</p>
        <p>Through the investigations both CA and CP services applied the same generation
rules, i.e., with the restrictions of DCC   (which can raise the applicable
minimum generation rate) and the periodicity rules (messages shall be generated with
a rate between 1 and 10 Hz), a message shall be created when the originating ITS
station’s position changes with 4 m, heading changes with 4∘ and speed changes
with 0.5 m/s.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Simulation Environment and scenarios</title>
      <sec id="sec-3-1">
        <title>3.1. Simulation Environment</title>
        <p>
          The simulation environment we used is the Artery Framework [
          <xref ref-type="bibr" rid="ref11">14</xref>
          ] [
          <xref ref-type="bibr" rid="ref10">13</xref>
          ], where
advanced simulations can be performed using ETSI ITS-G5 based protocols (e.g.,
GeoNet, BTP, etc.). Originally Artery was an extension of the Veins
framework [
          <xref ref-type="bibr" rid="ref13">16</xref>
          ] [
          <xref ref-type="bibr" rid="ref12">15</xref>
          ] (which is for simulating WAVE, the US standards of V2X
communication), but nowadays, it can also be used without Veins. The OMNeT++,
the executor of the simulation models, is a C++ based discrete event simulator
package [
          <xref ref-type="bibr" rid="ref15">18</xref>
          ] [
          <xref ref-type="bibr" rid="ref14">17</xref>
          ] interacting with the SUMO road trafic simulator [
          <xref ref-type="bibr" rid="ref17">20</xref>
          ] [
          <xref ref-type="bibr" rid="ref16">19</xref>
          ] via
TraCI interface [
          <xref ref-type="bibr" rid="ref18">21</xref>
          ] using TCP socket.
        </p>
        <p>
          To reach our goals, we performed several extensions, modifications and
configurations in the existing Artery framework. Thanks to the Artery’s well-designed
architecture and the asn1c compiler [
          <xref ref-type="bibr" rid="ref19">22</xref>
          ], it was quite straightforward to extend the
available message set using the ASN.1 description of CPM [
          <xref ref-type="bibr" rid="ref2">5</xref>
          ]. Based on that, a
simple but rock solid CP service was created. To equip each vehicle appearing in the
simulation scenarios with the required services, we needed to record those services
in an XML file labeling them with a name and a listener (BTP) port. To mount
radars simulating sensor detection, we also needed to configure them in XML files
and to define the path of them in the omnetpp.ini, where other parameters of the
scenario, like the field-of-view range of the radars, were also configured.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Simulation Scenarios</title>
        <p>For simulations, we used the built-in car2car-grid scenario of Artery with our
modifications. Each scenario was running for 22 simulation seconds, and the number of
the vehicles followed a linear growing pattern from 0 to 90 during the simulation
time. The deployment of the cars on the grid happened in pseudo-random positions
but in a fixed way determined by an XML file so that the diferences between each
scenario shall be independent of this factor.</p>
        <p>
          Each vehicle has two radars that detect in forward and backward directions to
perceive other vehicles in the line of sight. Each sensor was configured to detect
in a radius of 150 meters and field–of–view of 180 degrees thus both sensors
together detected the area in 360 degrees Every further measurement presented in
this document was performed on the same vehicle which was deployed in  = 0
and present in during the whole simulation in every examined scenario. Since the
standardization of Collective Perception began in the near past (ETSI TR [
          <xref ref-type="bibr" rid="ref2">5</xref>
          ] was
just released in December 2019), the implementation of the service was necessary
on our side. As a simplified generation rule of CP service, we utilized the one of
CA service, which in our opinion is acceptable in the scenarios because every car
followed the same behavior, thus in the meantime, they were going straight at the
same speed. Furthermore, during our investigations, the standards describing the
generation rule of CP messages were formed rapidly, and it was out of scope in our
current analysis to follow that change. As we mentioned before, we used three types
of message content generation techniques, and two of them result in variable
message sizes that are in relation to the number of perceived objects, which is shown
in Fig 1 (left) in the function of the simulation time as a reference. This kind of
detection results in CPM sizes shown in Fig 1 (right) in function of the simulation
time. According to this diagram, the size advantage of using radials against one
polygon lasts until five simulation seconds in the applied scenario; after that, the
overhead gets too big.
        </p>
        <p>Several other parameters were used to define further elaborated simulation
scenarios based on the above general details:
• Services running on each vehicle: 1) Only CA service (calibration
measurement), 2) Only CP service, 3) Both CA and CP services.
• DCC–profile of each service: 1) Both CA and CP are on DP2, 2) CA is on</p>
        <p>DP2, CP is on DP3.
• DCC Finite State Machine: 1) Fully Meshed, 2) Gradual.
• Structure of CPM: 1) One free space radial for each perceived object, 2) One
free space polygon with 16 vertices in each CPM, 3) Maximum size messages
( 1500 bytes)
Sizes of generated CAMs are between 148 and 350 bytes depending on that a packet
contains a LowFrequencyContainer with path points or not. The following key
performance indicators were taken into consideration in each scenario to analyze
simulation results:
• Instantaneous CBR: measured on access layer level; to describe the channel
load in relation to simulation time.
• number of dropped packages in each DCC queue: to describe packet loss
caused by DCC restriction.
• number of sent packages on the radio: to describe the number of packets that
got on the air interface, which is in connection with the channel load caused
by the node where the measurements were made.
• number of received erroneous packets: measured on access layer level before
any packet was transmitted to upper layers; to describe packet loss caused
by channel degradation.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results and analysis</title>
      <p>Based on the above-introduced simulation environment and scenarios, we
performed multiple simulation runs and examinations. We present the gathered results
in subsections below grouped by the applied services.</p>
      <sec id="sec-4-1">
        <title>4.1. Only CA service</title>
        <p>These cases are for calibration measurements. In scenarios applying only CA
service, just two cases can be distinct: using Fully Meshed DCC and using Gradual
DCC. However, the results showed marginal diferences to each other: the maximal
CBR value did not reach 0.2, and no packets were dropped or received as erroneous.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Only CP service</title>
        <p>The CBR values resulted from using Fully Meshed or Gradual DCC are depicted
in Fig 2 (legend: FM: Fully Meshed, G: Gradual). The diagrams show that bigger
packet sizes resulted in non-marginally higher CBR, which is conspicuous in higher
trafic. Furthermore, Fully Meshed implementation led to lower CBR in general,
mainly when maximum-sized packets were used. Using Gradual DCC, more packets
were sent on radio, and fewer packets were dropped in DCC.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Both CA and CP service with diferent DCC-profiles</title>
        <p>
          Both services were applied corresponding to C2C-CC BSP [
          <xref ref-type="bibr" rid="ref5">8</xref>
          ]: CA service on DP2,
CP service on DP3. Looking at the diagrams in Fig 3, the diferences in resulted
CBR values are enormous between the Fully Meshed and Gradual scenarios. Fully
Generated
CPMs
Dropped
in DCC
Sent
on radio
Received
erroneous
90
1
89
7
89
0
89
14
93
0
93
5
93
0
93
6
89
1
88
24
Meshed DCC restricted CBR radically while using Gradual DCC resulted in high
lfuctuation in the congested part of the scenarios, which is in connection with
the nature of Gradual DCC’s operation because it does not use more recent CBR
measurement values, only the most recent one. Table 3 shows that Fully Meshed
DCC dropped more and sent fewer packets than Gradual DCC, but using the latter
one resulted in more erroneous packets, especially when maximum-sized packets
where used. Furthermore, almost every packet was dropped from the DP3 DCC
queue; thus, we can say that CP service is handicapped by CA service.
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Both CA and CP service with the same DCC-profile</title>
        <p>These scenarios are for presenting the situation when messages of two services with
similar generation rules are sent out on the radio interface with equal chances.
The diagrams of Fig 4 show the increased CBR values resulted from more
actuGenerated
CAMs
Generated
CPMs
Dropped in
DCC–DP2
(CAM)
Dropped in
DCC–DP3
(CPM)
Sent
on radio
Received
erroneous
Generated
CAMs
Generated
CPMs
Dropped
in DCC
Sent
on radio
Received
erroneous
ally transmitted CPMs – which are more significant than CAMs in general. In
Gradual cases, the fluctuation of CBR is higher than in cases with diferent DCC
profiles, and the number of erroneous packets is more prominent, too. Based on
our experiences, we can say that Gradual DCC implementation with more
transmitted packets consequences much higher amounts of received erroneous packets
than Fully Meshed implementation because the latter one holds packets back more
drastically, thus in case of full DCC queues drops more packets, resulting in lower
CBR values.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>Our simulation results are focused on the Channel Busy Ratio (CBR) and showed
that the quality of the provided CP service degraded significantly when the two
services were used simultaneously on the same channel, therefore motivating
deployment eforts of the more sophisticated multichannel V2X solutions. Data-intensive
applications should use distinct channels, and each channel – if it is feasible – may
have its own DCC.</p>
      <p>Developing a version of CP service more accurate to its generation rules declared
in its published TR and using MCO implementation features of the newest version
of Artery could show further exciting and useful information.</p>
      <p>Acknowledgements The authors would like to thank the experts from
Commsignia Ltd. and the Department of Networked Systems and Services of BME for
their valuable comments and guiding discussions.
[1] The Cooperative Vehicle-Infrastructure Systems Project http://www.cvisproject.</p>
      <p>org/
[2] The Drive-C2X Project http://www.drive-c2x.eu/
[3] The SimTD Project http://www.simtd.de/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Garlichs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wegner</surname>
          </string-name>
          and
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <source>Realizing Collective Perception in the Artery Simulation Framework</source>
          ,
          <source>2018 IEEE Vehicular Networking Conference (VNC)</source>
          , Taipei, Taiwan,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          , doi: 10.1109/VNC.
          <year>2018</year>
          .
          <volume>8628412</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>[5] ETSI TR 103 562 V2.1</source>
          .
          <issue>1</issue>
          (
          <issue>2019</issue>
          -
          <fpage>12</fpage>
          )
          <article-title>Intelligent Transport Systems (ITS); Vehicular Communications; Basic Set of Applications; Analysis of the Collective Perception Service (CPS); Release 2</article-title>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <article-title>[6] IEEE, IEEE Standard for Information technology - Telecommunications and information exchange between systems Local and metropolitan area networks-Specific requirements -</article-title>
          <source>Part</source>
          <volume>11</volume>
          :
          <string-name>
            <surname>Wireless LAN Medium Access</surname>
          </string-name>
          <article-title>Control(MAC) and Physical Layer (PHY) Specifications</article-title>
          , IEEE Standard 802.
          <fpage>11</fpage>
          -
          <issue>2016</issue>
          ,
          <year>December 2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>ETSI</given-names>
            <surname>EN</surname>
          </string-name>
          <article-title>302 571 - Intelligent Transport Systems (ITS); Radiocommunications equipment operating in the 5 855 MHz to 5 925 MHz frequency band; Harmonised Standard covering the essential requirements of article 3.2 of Directive</article-title>
          <year>2014</year>
          /53/EU - v2.
          <fpage>1</fpage>
          .1. Feb-
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <source>[8] CAR 2 CAR Communication Consortium, “Basic System Profile - v1.4</source>
          .0.”
          <fpage>13</fpage>
          -
          <lpage>Sep2019</lpage>
          ., https://www.car-2
          <article-title>-car.org/documents/basic-system-profile/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>[9] ETSI EN 302 637-3 - Intelligent Transport Systems (ITS); Vehicular Communications; Basic Set of Applications; Part 3: Specifications of Decentralized Environmental Notification Basic Service - v1.3</source>
          .1.” Apr-
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>[10] ETSI EN 302 637-2 - Intelligent Transport Systems (ITS); Vehicular Communications; Basic Set of Applications; Part 2: Specification of Cooperative Awareness Basic Service - v1.4</source>
          .1.” Apr-
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <source>[11] ETSI TS 102 687 - Intelligent Transport Systems</source>
          (ITS);
          <article-title>Decentralized Congestion Control Mechanisms for Intelligent Transport Systems operating in the 5 GHz range; Access layer part - v1.2.1</article-title>
          . Apr-
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <source>[12] ETSI TS 103 175 - Intelligent Transport Systems</source>
          (ITS);
          <article-title>Cross Layer DCC Management Entity for operation in the ITS G5A</article-title>
          and
          <article-title>ITS G5B medium - v1.1.1</article-title>
          . Jun-
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [13] GitHub - riebl/artery: OMNeT++
          <article-title>V2X simulation framework for ETSI ITS-G5 [Online]</article-title>
          . Available: https://github.com/riebl/artery,Lastaccessedon01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Riebl</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obermaier</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Günther</surname>
            <given-names>HJ</given-names>
          </string-name>
          . (
          <year>2019</year>
          )
          <article-title>Artery: Large Scale Simulation Environment for ITS Applications</article-title>
          . In: Virdis A.,
          <string-name>
            <surname>Kirsche</surname>
            <given-names>M</given-names>
          </string-name>
          .
          <article-title>(eds) Recent Advances in Network Simulation</article-title>
          .
          <source>EAI/Springer Innovations in Communication and Computing</source>
          . Springer, Cham
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [15] GitHub - sommer/veins [Online]. Available: https://github.com/sommer/veins, Last accessed on 01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Sommer</surname>
            <given-names>C.</given-names>
          </string-name>
          et al. (
          <year>2019</year>
          )
          <article-title>Veins: The Open Source Vehicular Network Simulation Framework</article-title>
          . In: Virdis A.,
          <string-name>
            <surname>Kirsche</surname>
            <given-names>M</given-names>
          </string-name>
          .
          <article-title>(eds) Recent Advances in Network Simulation</article-title>
          .
          <source>EAI/Springer Innovations in Communication and Computing</source>
          . Springer, Cham
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [17] GitHub - omnetpp/omnetpp [Online]. Available: https://github.com/omnetpp/ omnetpp, Last accessed on 01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>András</given-names>
            <surname>Varga</surname>
          </string-name>
          and
          <string-name>
            <given-names>Rudolf</given-names>
            <surname>Hornig</surname>
          </string-name>
          ,
          <year>2008</year>
          .
          <article-title>An overview of the OMNeT++ simulation environment</article-title>
          .
          <source>In Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems &amp; workshops (Simutools '08)</source>
          .
          <article-title>ICST (Institute for Computer Sciences, Social-Informatics and</article-title>
          Telecommunications Engineering), Brussels, BEL, Article
          <volume>60</volume>
          ,
          <fpage>11</fpage>
          -
          <lpage>0</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [19] GitHub - eclipse/sumo [Online]. Available: https://github.com/eclipse/sumo, Last accessed on 01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>Pablo</given-names>
            <surname>Alvarez</surname>
          </string-name>
          <string-name>
            <given-names>Lopez</given-names>
            , Michael Behrisch, Laura Bieker-Walz, Jakob Erdmann,
            <surname>Yun-Pang</surname>
          </string-name>
          <string-name>
            <surname>Flötteröd</surname>
          </string-name>
          , Robert Hilbrich, Leonhard Lücken, Johannes Rummel,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Wagner</surname>
          </string-name>
          , and Evamarie Wießner,
          <source>Microscopic Trafifc Simulation using SUMO, IEEE Intelligent Transportation Systems Conference (ITSC)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [21]
          <string-name>
            <surname>TraCI - SUMO Documentation</surname>
          </string-name>
          [Online]. Available: https://sumo.dlr.de/docs/ TraCI.html, Last accessed on 01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [22]
          <article-title>GitHub - vlm/asn1c: The ASN.1 Compiler [Online]</article-title>
          . Available: https://github. com/vlm/asn1c, Last accessed on 01/
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>