Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Time Division Based Maximum Flow Routing Method for Transceiver Constrained Spatial Information Networks

A space information network, information network technology, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve problems such as limitations

Active Publication Date: 2020-08-25
XIDIAN UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to address the deficiencies in the prior art above, and propose a time-division-based maximum flow routing method for the limited space information network of transceivers. This method independently distributes transceivers by dividing the time interval into multiple time segments. Signal resource, which solves the limitation of the number of transceivers on the number of connected links, can make more efficient use of node resources and transceiver resources, and improve the throughput of end-to-end nodes in the spatial information network

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
  • Time Division Based Maximum Flow Routing Method for Transceiver Constrained Spatial Information Networks
  • Time Division Based Maximum Flow Routing Method for Transceiver Constrained Spatial Information Networks
  • Time Division Based Maximum Flow Routing Method for Transceiver Constrained Spatial Information Networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0046] refer to figure 1 , the specific implementation steps of the present invention will be further described in detail.

[0047] Step 1, construct the time expansion graph of the spatial information network.

[0048] Taking the time period in which the topology of the spatial information network maintains the same state as the time interval, divide an operating cycle [0, T] of the spatial information network equally with τ as the time length, and obtain L equal-length time intervals, that is, T =τ·L, record the lth time interval as time interval l according to the time sequence, assuming that the network topology state under the condition of unlimited transceivers remains unchanged in each time interval, only at the moment of time interval switching change.

[0049] The time expansion graph G(V) of constructing the spatial information network C ,E), wh...

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

The invention discloses a time-division-based maximum flow routing method for a limited space information network of a transceiver. The specific implementation steps are as follows: first construct a time expansion graph, divide node copy link types, and generate extended inflow and outflow link sets; then divide time segments, allocate transceiver resources in units of time segments; finally adjust spatial information network chains The amount of data transmitted in the road generates the maximum flow route of the spatial information network. The invention solves the problem that the number of transceivers limits the number of connected links, can utilize node resources and transceiver resources more efficiently, and improve the throughput of end-to-end nodes in a space information network.

Description

technical field [0001] The invention belongs to the field of electric communication technology, and further relates to a time-division-based maximum flow routing method for a limited space information network of a transceiver in the field of space information network technology. The invention can be used for data transmission in the limited space information network of transceivers such as the Internet, the Internet of Things, mobile communication, satellite communication and deep space. Background technique [0002] The space information network is a network system that acquires, transmits and processes space information in real time with space platforms (such as geostationary satellites or medium- and low-orbit satellites and manned or unmanned aircraft) as carriers. Because the nodes in the spatial information network are in high-speed movement, the network topology often has the characteristics of changing with time and intermittent connectivity, and satellite nodes usua...

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 Patents(China)
IPC IPC(8): H04L12/721H04L12/759H04L45/28
CPCH04L45/38H04L45/028
Inventor 刘伟朱琳李红艳李建东
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com