Improved Load-Balancing Routing Algorithms in MANET Using Node Cardinality Metric

Routing algorithms in mobile ad-hoc networks (MANETs) avoid network flooding whenever possible as it is a very inefficient use of medium resources. While the main optimization goal in most cases is increased network efficiency by lowering the number of relays while reaching full coverage, one should strive to avoid congesting the relays as well otherwise network efficiency will decrease. In this paper, we propose a new efficient metric that captures topology traits - Node Cardinality (NC). We use this metric as a key feature for enhancing existing routing algorithms and suggest a new routing algorithm based on the NC metric to improve network efficiency via preemptively reducing the maximal usage of a relay. Thus avoiding congested relays that were otherwise bottlenecks inside the network. All proposed algorithms are compared with known table-driven algorithms using thorough simulations.