A Hop Count–Based Distance Vector Routing Model for Dynamic Networks

Dynamic networks require routing mechanisms that are simple, reliable, and capable of adapting to frequent topology changes. Distance vector routing remains widely used due to its low computational overhead and ease of implementation. This paper presents a hop count–based distance vector routing model designed for dynamic network environments. The proposed model uses hop count as the primary routing metric and periodically exchanges routing information among neighboring nodes to maintain updated path selections. Techniques such as route aging, periodic updates, and loop prevention are incorporated to improve convergence and stability. The model is evaluated under varying network conditions, including link failures and topology changes, to assess convergence time, routing overhead, and path efficiency. Experimental results demonstrate that the proposed approach provides consistent routing performance with minimal control overhead, making it suitable for small to medium-scale dynamic networks where simplicity and robustness are critical.