A Shortest Path Algorithm Based on Mobile Agent in LEO Satellite Network

Author

Dong, Xiang-Jun ; Shi, Hao-Shan

Author_Institution

Sch. of Electron. & Inf., Northwestern Polytech. Univ., Xi´´an

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

5

Abstract

An LEO satellite network model based on mobile agent is mentioned. In the network model, two shortest path algorithms are proposed. For information communication, a shortest path algorithm based on Dijkstra algorithm is proposed. For deploying routing tables, a shortest path algorithm named diffuser algorithm is demonstrated. Simulation results show the feasibility of the LEO satellite network model and the high efficiency of the shortest path algorithms.

Keywords

mobile agents; satellite communication; telecommunication computing; telecommunication network routing; Dijkstra algorithm; LEO satellite network; diffuser algorithm; information communication; mobile agent; routing tables; shortest path algorithm; shortest path algorithms; Artificial satellites; Low earth orbit satellites; Mobile agents; Mobile communication; Optical fiber communication; Routing; Satellite communication; Satellite constellations; Wire; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.1017

Filename

4678925