Tehnički vjesnik, Vol. 27 No. 3, 2020.
Izvorni znanstveni članak
https://doi.org/10.17559/TV-20180821050724
A Multi-Objective Routing Algorithm Based on Auction Game for Space Information Network
Ligang Cong
; School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022, China
Huamin Yang
; School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022, China
Yanghui Wang
; School of Artificial Intelligence, Changchun University of Science and Technology, Changchun 130022, China
Xiaoqiang Di
; School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022, China
Sažetak
This paper aims to create a resource-saving method for the routing problem in space information network. To this end, a multi-objective routing algorithm was created based on game theory for space information network. Specifically, the auction game was introduced to solve the routing problem using the delay-tolerating network (DTN) protocol. Considering the topological periodicity of low earth orbit (LEO) satellite network, a typical space information network, the dynamic topological structure was divided into relatively static time slots. Then, the routing problem was solved through the auction game in these slots. The proposed algorithm can minimize the number of selfish nodes in the network and avoid network congestion resulted from excessive resource consumption of individual nodes. Finally, the proposed algorithm was compared with other well-known routing models like the epidemic routing model (Epidemic) and the first contact routing model (FC). The results show that the proposed algorithm outperformed the contrastive models in both average delay and network overhead ratio. The research findings shed important new light on the routing of space information network.
Ključne riječi
auction game; multi-objective routing; space information networks
Hrčak ID:
239075
URI
Datum izdavanja:
14.6.2020.
Posjeta: 1.232 *