Abstract: Wireless Ad-hoc networks are widely employed in military and emergency scenarios due to their flexibility and ease of deployment. These networks must operate effectively under severe environmental conditions and electromagnetic interference. However, traditional routing protocols often fail to address the specific requirements of military operations, such as high-speed data needs and multi-radio frequency constraints. This paper presents a new routing metric integrated into the A* algorithm. The metric aims to select routes that minimize both physical distance and transmission delay by factoring in available bandwidth and frequency compatibility. Simulation results demonstrate that this approach identifies optimal routes with significantly lower transmission delays compared to traditional shortest-path routing.
Introduction
In modern battlefield environments, mobile ad-hoc networks (MANETs) are indispensable for maintaining situational awareness without relying on fixed infrastructure. Standard routing protocols like AODV (Ad hoc On-Demand Distance Vector) or DSR (Dynamic Source Routing) typically prioritize the "shortest path," often defined by the minimum hop count.
While effective in static or low-demand environments, this logic is insufficient for military contexts for two primary reasons. First, high-speed data transmission for reconnaissance and real-time video requires high bandwidth; a physically short path with low bandwidth may result in higher latency than a longer, high-capacity route. Second, military vehicles are frequently equipped with multiple radios operating across different frequencies. Standard protocols do not inherently account for the "frequency matching" required to bridge these disparate communication channels.
Methodology
The Novel Routing Metric
The authors utilize the A* search algorithm, a classic heuristic method, but modify its evaluation function to prioritize throughput. The core contribution is a new metric ($p$) defined as:
$$p = \frac{\sum_{i=1}^{n} (d_i + d_{esti})}{\sum_{i=1}^{n} bw_i}$$
Where:
- $d_i$ represents the Euclidean distance between neighboring nodes.
- $d_{esti}$ is the estimated distance to the destination node.
- $bw_i$ is the available bandwidth of the node.
By placing bandwidth in the denominator, the algorithm naturally seeks paths that minimize distance while maximizing throughput. This ensures that the "cost" of a high-bandwidth link is lower than that of a low-bandwidth link, even if the physical distance is slightly greater.
Frequency-Aware Routing
To handle multi-radio complexity, the implementation treats each vehicle as a node but explores all equipped radios during the neighbor-discovery phase. A link is only considered valid if the neighboring node possesses at least one radio operating on the same frequency as the current node. This approach allows the algorithm to elegantly manage both internal communication (within a single vehicle) and external communication (between different vehicles) without over-complicating the search space.
Experimental Results
The approach was evaluated using Computer Generated Force (CGF) Software, a simulation tool developed to model 30 vehicles randomly distributed in a 1000m × 1000m area with a communication range of 200m.
Throughput and Delay Performance
The simulation results confirmed that the new metric consistently outperforms shortest-path logic in high-demand scenarios. As shown in the performance analysis, the new metric achieved an average bandwidth of approximately 7.4 Kb/sec, whereas the traditional shortest-distance metric averaged only 5 Kb/sec.
Furthermore, the algorithm successfully navigated complex frequency constraints. In scenarios where the physically closest neighbor had a mismatched frequency, the A* algorithm correctly bypassed it to find a viable multi-hop route that maintained connectivity and high throughput.
Conclusion
This paper demonstrates that incorporating bandwidth and frequency compatibility into routing metrics significantly improves the performance of military MANETs. By moving beyond simple hop-count logic, the proposed A*-based approach reduces transmission delay and ensures more reliable data flow. Future work will focus on adapting the algorithm to handle active electromagnetic interference (jamming) and developing high-performance re-routing strategies for highly dynamic environments where nodes may be frequently disabled or moved out of range.
Summary updated