Intelligent Transport System Using Time Delay-Based Multipath Routing Protocol for Vehicular Ad Hoc Networks
Bibliographic record
Abstract
During the last decade, the research on Intelligent Transportation System (ITS) has improved exponentially in real-life scenarios to provide optimized transport network performance. It is a matter of importance that alert messages are delivered promptly to prevent vehicular traffic problems. The fact is an ITS system per se could be a part of a vehicular ad hoc network (VANET) which is an extension of a wireless network. In all sorts of wireless ad hoc networks, the network topology is subjected to change due to the mobility of network nodes; therefore, an existing explored route between two nodes could be demolished in a minor fraction of time. When it comes to the VANETs, the topology likely changes due to the high velocity of nodes. On the other hand, time is a crucial factor playing an important role in message handling between the network's nodes. In this paper, we propose Time delay-based Multipath Routing (TMR) protocol that effectively identifies an optimized path for packet delivery to the destination vehicle with a minimal time delay. Our algorithm gives a higher priority to alert messages compared to normal messages. It also selects the routes with the short round-trip time (RTT) within the RTT threshold. As a result, our algorithm would realize two goals. Firstly, it would speed up the data transmission rate and deliver data packets, particularly warning messages, to the destination vehicle promptly and therefore avoid vehicular problems such as car accidents. Secondly, the TMR algorithm reduces the data traffic load, particularly of the normal messages, to alleviate the pressure on the network and therefore avoids network congestion and data collisions. This, in turn, lessens the packets' retransmissions. To demonstrate the effectiveness of the proposed protocol, the TMR has been compared with the other protocols such as AOMDV, FF-AOMDV, EGSR, QMR, and ISR. Simulation results demonstrate that our proposed protocol proves its excellent performance compared to other protocols.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".