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

A route optimization method for aviation ad hoc network

A self-organizing network and optimization method technology, applied in the field of aviation self-organizing network routing optimization, can solve problems such as shortening data transmission paths, achieve the effects of improving communication capabilities, optimizing cache distribution, and improving business continuity

Active Publication Date: 2022-07-01
CHINESE AERONAUTICAL RADIO ELECTRONICS RES INST
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the problems of fast response of aviation self-organizing network nodes and shortest path transmission of information, the present invention proposes an aviation self-organizing network routing optimization method to ensure business continuity, thereby optimizing the cache distribution of the cache algorithm and shortening the data transmission path

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
  • A route optimization method for aviation ad hoc network
  • A route optimization method for aviation ad hoc network
  • A route optimization method for aviation ad hoc network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0030] The specific steps of a cache-based route optimization method for aviation ad hoc networks are:

[0031] Step 1: Initialize the route, let the source node of the data to be forwarded in the aviation ad hoc network be A0, the node first sends a "HELLO" packet to the entire network, and each node that receives the data packet will return a message , which contains its own address information;

[0032] Step 2: Evaluate the link delay. The source node A0 sends a response packet to the entire network, and each node that receives the packet returns a response packet. Divide the round-trip time by 2, and the source node A0 can Calculate the delay to reach other nodes;

[0033] Step 3: Select the best path. For the source node A0 and the destination node A1, the source node A0 selects the path with the shortest delay from the set of all paths that can reach the destination node A1, and transmits the data through the shortest path. Also receive information sent by other nodes;...

Embodiment 2

[0060] The invention compares three existing algorithms MAGIC, AGE-BASED and PROBCACHE, sets the simulation time to 25 seconds, and sets the amount of information to 100 pieces. Finally, the requirements of the three algorithms are satisfied as follows: figure 2 shown. After multiplying the number of hops of the transmission node by the sum of the number of requests satisfied, it can be concluded that the total transmission times of the three algorithms are 496 times for the MAGIC algorithm, 594 times for the ABC algorithm, and 872 times for the Probcache algorithm. The final cache conditions of the three algorithms are shown in Tables 1, 2, and 3.

[0061] Table 1 MAGIC algorithm cache distribution

[0062]

[0063] Table 2 Cache distribution of ABC algorithm

[0064]

[0065] Table 3 Cache distribution of Probcache algorithm

[0066]

[0067] From the experimental results, it can be seen that among the three existing cache policy algorithms, the MAGIC algorithm ...

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 present application provides an aviation ad hoc network routing optimization method. The method includes: a source node A0 sends a packet data packet to other nodes respectively, and receives a first message returned by the other nodes; A0 evaluates the link delay according to the first message, Send response packet data packets to other nodes respectively, and receive the second message returned by other nodes, A0 calculates the delay to reach other nodes; for A0 and destination node A1, source node A0 according to its own delay to reach other nodes, from all nodes From the set of paths that can reach the destination node A1, select the best path with the shortest delay, transmit the data to be sent through the best path, and also receive information sent by other nodes; obtain the hop value of the data packet according to the distance from the server , find the best cache node in the best path; if the node along the way receives the request information sent by its previous node, it will migrate the cache data to the best cache node and clear its own cache data.

Description

technical field [0001] The present application relates to the field of computers, in particular to a route optimization method for an aviation self-organizing network. Background technique [0002] Today, with the rapid development of the air transportation industry, the communication technology in air transportation is also facing unprecedented challenges. With the continuous increase in the type and number of aircraft, the pressure on the current civil aviation communication system has also approached saturation. At present, the space-based network is based on satellite communication, which has a wide coverage but high usage costs, large delay and limited bandwidth; the ground-based network is based on ground base stations and has a small coverage, and increasing the number of base stations in order to improve the coverage will also lead to a sharp increase in cost. , and the ground-based network cannot cover the sky over the ocean. In this regard, the emergence of mobil...

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): H04L45/121H04L45/00H04L45/02H04L67/5682H04L67/568H04L67/63
CPCH04L45/121H04L45/70H04L45/26H04L67/568H04L67/5682H04L67/63
Inventor 郑学理王科翔邓平煜王云辉闫鑫阳
Owner CHINESE AERONAUTICAL RADIO ELECTRONICS RES INST
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