*Result*: Least Cost Routing with Tuneable Weighted Costs between a Fixed and a Moving Node in a Dynamic Network.

*Routing is a very important and highly researched field in data networking and communication, as most applications are emphasizing on higher speed and larger data volume to meet the growing requirements of communication. Routing in dynamic networks becomes more complex in the presence of mobile nodes, varying link characteristics, and application constraints. Conventional least-cost (LC) routing, as done in static conditions of the nodes, may miss the real-time conditions of the network, like data latency and node availability. This paper suggests an adaptable LC routing algorithm between a fixed and a moving node in multi-node networks using tunable weighted costs. A cost function with a combination of quantitative parameters, which are application dependent, each with an adjustable weight, is described. The LC routing algorithm recalculates the optimal path as the network dynamically changes. This LC routing algorithm is generic and can be applied to any scenario to develop a link between one fixed node and any one of the many mobile nodes. This is illustrated through a case study of a constellation of satellites, with 3 different combinations of weights for distance, pass duration, and access time that affect the ground-to-satellite path selection. The result of the case study shows that tuning weights affect the routing outcomes, thus enabling the required application and situation-specific optimization for latency or resource efficiency. The LC routing algorithm is broadly applicable to domains, such as autonomous vehicles, UAV-ground links, mobile healthcare, warehouse logistics, and defense systems, where robust and adaptable fixed-to-mobile routing is essential. [ABSTRACT FROM AUTHOR]*