Title :
Proof of a modified Dijkstra´s algorithm for computing shortest bundle delay in networks with deterministically time-varying links
Author_Institution :
Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC
Abstract :
This paper presents and proves the correctness of a modified Dijkstra´s algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of such networks include interplanetary, orbital (e.g., low Earth orbit) satellite, and sensor networks. This paper presents and proves the correctness of a modified Dijkstra´s algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of such networks include interplanetary, orbital (e.g., low earth orbit) satellite, and sensor networks
Keywords :
delays; distributed sensors; graph theory; satellite communication; space communication links; delay-tolerant networks; modified Dijkstra´s algorithm; network computing; shortest bundle delay; time-varying link; Computer architecture; Computer networks; Delay effects; Disruption tolerant networking; Intelligent networks; Low earth orbit satellites; Propagation delay; Routing; Scheduling algorithm; Wireless sensor networks;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2006.051982
