Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Dynamic priority dispatching method of satellite network many-to-one communication conflicts

A dynamic priority and communication conflict technology, applied in the field of satellite communication network, can solve problems such as difficult practical application, complex algorithm, and insufficient response to satellite real-time task scheduling, and achieve high practical value, simple algorithm, and less resources.

Active Publication Date: 2012-07-18
DALIAN UNIV
View PDF1 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, according to domestic and foreign literature, the scheduling methods to solve such conflicts mainly include: mixed integer programming, insertion algorithm and replacement algorithm, etc. The algorithm is suitable for situations where there are few data transmission tasks and relatively simple constraints; the priority segmentation algorithm, proposed by Wang Yuanzhen et al. Heuristic scheduling algorithms such as the method of optimal scheduling of equipment, this type of algorithm greatly simplifies the problem, but there is a certain gap in solving practical problems, and it is difficult to apply in practice; Yan Zhiwei et al. In terms of sensor scheduling, the parallel taboo genetic algorithm has been studied. Li Yunfeng et al. ("System Engineering Theory and Practice", 2008) proposed intelligent scheduling algorithms such as the satellite data transmission hybrid scheduling algorithm based on this genetic algorithm. Task scheduling response is not sensitive enough

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Dynamic priority dispatching method of satellite network many-to-one communication conflicts
  • Dynamic priority dispatching method of satellite network many-to-one communication conflicts
  • Dynamic priority dispatching method of satellite network many-to-one communication conflicts

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] In order to enable those skilled in the art to better understand and realize the present invention, the specific implementation of the present invention will be described in detail below in conjunction with the accompanying drawings and specific examples. The protection scope of the present invention is not limited to the scope described in the specific examples. .

[0021] The following will combine figure 1 The design scheme of the embodiment of the present invention is described as follows:

[0022] 1. Many-to-one conflict model of relay satellites in satellite network:

[0023] The present invention has the characteristics of real-time and time flexibility for the relay satellite communication task, mainly considers the characteristic parameters of the deadline and idle time of the communication task, and proposes a dynamic priority scheduling algorithm. The basic idea is , to dynamically change the priority of the task, so that the task can be completed before th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A dynamic priority dispatching method of satellite network many-to-one communication conflicts belongs to the satellite communication network field. The method includes calculating the time window of a current satellite communication task, judging whether the time window of the communication task is larger than the minimum execution time of the communication task, calculating the priority of the communication task if the communication task is larger than the minimum execution time of the communication task, judging whether the priority of the current satellite communication task is the highest by a target satellite, and communicating with the current satellite if the priority of the current satellite communication task is the highest. The method has the advantages that randomness of the communication task is considered, the method is suitable for relay satellite communication system with fixed or random communication tasks; the change of the task priority dynamic can fully utilize the task spare time, so that the communication time of the satellite is improved; the algorithm is simple, the needed resources are less, and the method is suitable for satellite communications with limited communication resources.

Description

technical field [0001] The technical field of the invention is a satellite communication network, in particular, it relates to a dynamic priority scheduling method for many-to-one communication conflicts in a satellite network. Background technique [0002] With the continuous development of satellite technology, satellite communication network occupies an increasingly important position in the field of communication. However, the communication resources of a single satellite are limited, and there are more and more communication conflicts in the satellite communication network, among which the main one is the many-to-one conflict of relay satellites. At present, the method to resolve such conflicts is mainly to reasonably schedule the relay satellite tasks in the satellite network. [0003] At present, according to domestic and foreign literature, the scheduling methods to solve such conflicts mainly include: mixed integer programming, insertion algorithm and replacement a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04B7/185H04B7/005
Inventor 潘成胜王延春魏德宾陈波吴志涛
Owner DALIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products