<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In the current scenario of vehicular communication, it is very difficult to believe that the aggregated packet of information is not malicious. The algorithm is developed to allocate probability to the packet transmitted by the cluster head depending upon, the number of vehicles involved in creating a clustered information. The aggregated packet with the highest value of probabilistic correctness is considered by the receiving-end cluster head when multiple packets of similar information with related timestamps are received. The performance of the technique is tested under varying vehicular densities and data-sending rates. This scheme provides robust aggregation performance in comparison to the existing state-of-the-art structured and structure-free aggregation techniques.</p>
</abstract>

In the current scenario of vehicular communication, it is very difficult to believe that the aggregated packet of information is not malicious. The algorithm is developed to allocate probability to the packet transmitted by the cluster head depending upon, the number of vehicles involved in creating a clustered information. The aggregated packet with the highest value of probabilistic correctness is considered by the receiving-end cluster head when multiple packets of similar information with related timestamps are received. The performance of the technique is tested under varying vehicular densities and data-sending rates. This scheme provides robust aggregation performance in comparison to the existing state-of-the-art structured and structure-free aggregation techniques.

Performance enhancement of in-network probabilistic aggregation (PEPA) for vehicular ad-hoc networks

International Journal on Smart Sensing and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

running-head

In the current scenario of vehicular communication, it is very difficult to believe that the aggregated packet of information is not malicious. The algorithm...

Parameter	Value or type
Simulation area	2500 m × 2500 m
Simulation time	600s
Radio model	Two-ray ground
MAC layer	IEEE802.11
Number of vehicles	50–400
Vehicle speed	40–120 km/h
Constant bit rate (CBR rate)	1–4 packet/s
Vehicle communication range	500 m
Bandwidth	20Mbps
Data packet size	500–2,500 byte
Cache replacement policy	FIFO
Mobility model	Manhattan
Traffic environment	Urban
Number of lanes	4–8
Traffic type	Multimodal
Routing protocol	AODV
Number of simulation runs	10

Performance enhancement of in-network probabilistic aggregation (PEPA) for vehicular ad-hoc networks

Article Category: Research-Article

Data publikacji: 05 sty 2021

Zakres stron: 1 - 9

Otrzymano: 08 wrz 2020

DOI: https://doi.org/10.21307/ijssis-2020-036

Słowa kluczowe
Aggregation, Broadcast storm, Information dissemination, MANET, Structured aggregation, Structure-free aggregation, VANET

© 2020 Rajeev Kumar et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Figure 1:

Figure 2:

Figure 3:

Figure 4:

Figure 5:

Figure 6:

Figure 7:

Figure 8:

Simulation parameters.

Performance enhancement of in-network probabilistic aggregation (PEPA) for vehicular ad-hoc networks

Article Category: Research-Article

Data publikacji: 05 sty 2021

Zakres stron: 1 - 9

Otrzymano: 08 wrz 2020

DOI: https://doi.org/10.21307/ijssis-2020-036

Słowa kluczoweAggregation, Broadcast storm, Information dissemination, MANET, Structured aggregation, Structure-free aggregation, VANET

© 2020 Rajeev Kumar et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Figure 1:

Figure 2:

Figure 3:

Figure 4:

Figure 5:

Figure 6:

Figure 7:

Figure 8:

Simulation parameters.

Słowa kluczowe
Aggregation, Broadcast storm, Information dissemination, MANET, Structured aggregation, Structure-free aggregation, VANET