Proof of a modified Dijkstra´s algorithm for computing shortest bundle delay in networks with deterministically time-varying links

Author

Lee, Daniel C.

Author_Institution

Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC

Volume

10

Issue

10

fYear

2006

Firstpage

734

Lastpage

736

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;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2006.051982

Filename

1705916