Dynamic Probabilistic Forwarding in Wireless Ad Hoc Networks Based on Game Theory
Bibliographic record
Abstract
This paper proposes Forwarding Game Routing Protocol (FGRP), which can be applied to any routing protocol in mobile ad hoc network (MANET) such as Ad Hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols. A node enters the forwarding game upon receiving a flooding packet. In this game, nodes select one of the following mixed strategies: (1) forwarding and (2) not-forwarding. The strategy changes based on player's utility, which is a function of its availability, selected strategy and forwarding probability of other nodes. Each node tries to maximize its utility by selecting the appropriate strategy. Parameters such as residual energy level, channel congestion, number of packets in the node's queue, and the distance from the source of the flooding packet are included in the availability. Since the forwarding decision is made locally by every node, unlike clustering or hierarchical algorithms, there is no extra overhead involved. This paper presents the performance improvement results of FGRP integrated with AODV in network simulator NS-2. Simulation results show that integrating FGRP with AODV improves network performance metrics such as end-to-end delay per packet, and packet delivery ratio.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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".