P-AODV: A Priority Based Route Maintenance Process in Mobile Ad Hoc Networks

Novel ETX-Based Metrics for Overhead Reduction in Dynamic Ad Hoc Networks

“…One of the interesting research papers that analyze the use of AODV protocol in various types of MANETs is given in [11]. Priority AODV (P-AODV) [12] created for MANETs presents a new route maintenance mechanism that repairs a route by selecting a neighbor based on the traffic being handled by it. Fitness Function Ad hoc On demand Multipath Distance Vector (FF-AOMDV) [13] protocol is specially designed to reduce energy consumption in MANETs.…”

“…As can be seen from (12) only reverse probability is used to calculate ETXr l , so the size of broadcast LPP packets is kept fixed and small, thus reducing the ETX overhead.…”

“…where ETXr l is given by (12), and parameter X represents the influence of Receiver Signal Strength Indicator (RSSI) into the metric, and is given by:…”

“…The ETX and L-ETX metrics store data for both forward and reverse probabilities of receiving probe packets. The LR-ETX metric only store data for the reverse LPP reception probability and the metric is calculated according to (11)- (12).…”

UAV Routing Protocol Based on Link Stability and Selectivity of Neighbor Nodes in ETX Metrics

“…Bahloul et al [12] designed a cluster-based UAV routing protocol (BR-AODV), which calculates in accordance with the on-demand routing mechanism of AODV and achieves routing maintenance as well as data transmission by introducing the base station discovery mechanism and Boids mechanism; Ramesh et al [13] put forward a congestion adaptive routing protocol (CA-AODV) with a mechanism for monitoring node congestion, in which a warning will be issued between nodes once congestion occurs in the routing path so as to avoid node congestion; Wu et al [14] mentioned an optimized protocol based on node residual energy and relative movement speed (EV-AODV), which considered the power of node receiving signal, the number of link hops and the node residual energy, normalized relative movement speed, as well as strengthened the node link mechanism; Tan et al [15] presented an efficient digital signature algorithm based on elliptic curve cryptosystem and applied it to the AODV protocol; Chen et al [16] proposed a greedy perimeter stateless routing protocol (TQNGPSR), which implemented flow balancing and evaluated the quality of wireless links by taking advantage of the neighboring congestion packets. In addition to above, there are still many other studies achieved good results in various indicators [17][18][19][20][21][22].…”