Min-variance routing over a MIMO ad-hoc tactical environments

Abstract

In an ad-hoc tactical environment, it is important to determine an optimal routing path for guaranteeing Quality of Service (QoS). In this paper, we explore the two routing algorithms, named min-variance and max-cost for two different cases (i.e., urgent and ordinary) for transmitting multimedia data in MIMO ad-hoc network such as tactical circumstance. For the ordinary case, each source node finds the effective routing path based on the max-cost routing algorithm. However, for the emergency case, the node with a high priority utilizes the min-variance routing algorithm. The simulation results show that the max-cost and min-variance routing algorithms are effective for the ordinary and emergency cases respectively.