2023
DOI: 10.56578/mits020305
|View full text |Cite
|
Sign up to set email alerts
|

A Comprehensive Exploration of Resource Allocation Strategies within Vehicle Ad-Hoc Networks

Sadashiviah Sheela,
Kanathur Ramaswamy Nataraj,
Srikantaswamy Mallikarjunaswamy

Abstract: In recent years, a surge in the utilisation of vehicle-to-vehicle (V2V) communication has been observed, serving as a pivotal factor in facilitating automatic control of vehicles without human intervention. This advancement has notably curtailed accident rates, mitigated traffic congestions, and augmented vehicular security. Consequently, a meticulous survey has been orchestrated in the domain of Vehicle Ad-Hoc Networks (VANETs), particularly as autonomous vehicles pervade urban landscapes. The necessity for r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 77 publications
0
2
0
Order By: Relevance
“…It is therefore investigated whether or not the distributed computer LB problem of the F-RAN may be solved. With regard to the F-RAN design, the simulation demonstrates that the LB strategy is more effective on the battlefield [29,30]. Figure 7 shows the functional structure of IoBT in the FC network.…”
Section: Internet Of Battlefield Things (Iobt) Fog Radio Access Netwo...mentioning
confidence: 98%
“…It is therefore investigated whether or not the distributed computer LB problem of the F-RAN may be solved. With regard to the F-RAN design, the simulation demonstrates that the LB strategy is more effective on the battlefield [29,30]. Figure 7 shows the functional structure of IoBT in the FC network.…”
Section: Internet Of Battlefield Things (Iobt) Fog Radio Access Netwo...mentioning
confidence: 98%
“…The BP decoding technique is depicted in Figure 9 as a flow chart. The process goes back to step 1 if the number of repetitions is the maximum and if it is not a valid code word [59][60][61][62][63]. The BP algorithm works well for codes such as LDPC, but the tanh and tanh-1 operations are too difficult to implement in hardware.…”
Section: Flow Chartmentioning
confidence: 99%