MATLAB Code Implementation of the DV-Hop Algorithm

During our research on the DV-Hop algorithm, we conducted simulation experiments by implementing a MATLAB-based source code that follows the algorithm's core principles. The DV-Hop algorithm implementation involves three key phases: distance vector exchange between nodes, hop count estimation to anchor nodes, and distance calculation using average hop distance. Our experimental results demonstrate that this algorithm effectively estimates inter-node distances and shows improved performance in larger-scale network deployments. The code includes functions for network topology generation, distance calculation using the DV-Hop methodology, and error analysis between estimated and actual positions. Furthermore, we generated multiple visualization plots to better illustrate the algorithm's working mechanism and performance metrics, including node deployment diagrams, distance estimation errors, and network connectivity graphs. Through these simulation results and graphical representations, we gain deeper insights into the algorithm's behavior, enabling further investigation of its practical applications and limitations in real-world scenarios.