Ad hoc routing protocol by taking the communication quality into account between adjacent links

In an ad hoc network, communication distance is limited by the need to minimize the power consumption of the communication nodes. To deal with this, we usually employ multi-hop relaying functions that use the number of hops as a routing metric. But in an environment where traffic density is high, the same relaying node may be used by multiple sending nodes due to their spatial distribution. Data packets sent from such nodes may collide and cause packet loss at the relaying node, causing degradation of data transmission throughput. To improve this situation, we propose ad hoc on-demand distance vector (AODV) using TCP with cache function and CM (Cross-layered Multipath)-AODV using SINR (Signal to Interference and Noise Ratio) to determine the next hop. However, in both methods the alternate path is determined based on AODV when the current path fails. It usually takes a long time to establish the new path, varying in proportion to the number of hops. So we need to invent a method that can realize high throughput even if communication failures are frequent. In this paper, we propose a method in which hello packets are used to generate the routing metric by monitoring the communication quality between adjacent links in AODV. We also describe the evaluation results of simulation experiments demonstrating the avoidance of throughput degradation when data traffic density is high.