CN106131911A - A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics - Google Patents
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics Download PDFInfo
- Publication number
- CN106131911A CN106131911A CN201610415902.0A CN201610415902A CN106131911A CN 106131911 A CN106131911 A CN 106131911A CN 201610415902 A CN201610415902 A CN 201610415902A CN 106131911 A CN106131911 A CN 106131911A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- route
- gateway
- routing table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, comprise 1) the same internal method set up and safeguard route of forming into columns；2) when formation information is mutual, this node to gateway send the method for route requests message, 3) node processing method after receiving the route replies message that gateway node sends, 4) this section point method of carrying out on-demand route maintenance；5) gateway approach is set up；6) node adds the method and 7 formed into columns) the node method that exits formation.Present invention incorporates based on table-driven and on-demand two kinds of route drive forms, in same tactics are formed into columns, use Table Driven, it is ensured that real-time service demand；Using demand-based routing between forming into columns, greatly reduce the average routing table entry of node, non-" blindly " forwards route application to rely on gateway node " to have purpose ", decreases network flood.
Description
Technical field
The invention belongs to the radio self organizing network technology of avionics information, be a kind of boat for topology change at a high speed
Air data link network environment works in coordination with the hybrid Routing Protocol of aeronautical Ad hoc networks (Routing Protocol) of formation based on tactics
Implementation method, is applied to aviation wireless data chain networking arts.
Technical background
Mobile ad hoc network (Mobile Ad hoc Network, MANET) is a kind of special mobile radio networks,
It need not fixed base stations support, it is possible to realizes acentric distributed management, can temporal organization, and have highly mobile
Property.Routing Protocol is one of core technology of aeronautical Ad hoc networks Internet, has been largely fixed network performance.In view of number
Be often equipped with the platform in the high-speed mobile such as aircraft, guided missile according to chain equipment, its follow the tracks of, capture, position and attack to as if
Time critical target, this information propagation delay time requiring Data-Link system offer Millisecond and higher information transmission bandwidth are with satisfied essence
Close efficient track algorithm.The existing Routing Protocol of MANET cannot adapt to there is again node high-speed mobile band under aviation channel environment
The topology come frequently change, when number of nodes is big, mobility strong in the case of, Routing Protocol control overhead can be increased dramatically, and leads
Cause regular route break.
Formation flight is to make multi-aircraft arrange according to certain shape, and makes it keep in whole flight course
Formation is constant or relative position changes within the specific limits.The equipment that unit carries is limited, will complete more complicated appointing
During business, it is necessary for setting out repeatedly, and the unit of formation work can disperse carrying equipment, the task that complicated is split as several
Individual simple task, distributes to the different aircrafts in forming into columns, it is possible to guarantee task once completes, and improves the efficiency of execution task.
Formation cooperation at modern wireless air as one of the important tactics of deployment of forces, use in air battle correct formation and
Cooperative mode contributes to expanding the detection visual field, improves the whole battle benefit of aircraft, Mission Success rate and flight economy
Deng, antagonism obtains bigger air superiority.
For adapting to the space-air-ground integration operational information platform requirement that future battlefield is quick, efficient, survivability is strong, country exists
Aviation wireless data chain networking arts has carried out input energetically, and development has the wireless data chain networking neck of independent intellectual property right
Every technology in territory become at present and over the next several years in the vital task of domestic each related research institutes.In wireless data chain group
In net field, the Design of Routing Protocol transmitting demand in conjunction with aviation wireless network environment and Network is a crucial ring.At present,
Domestic existing aeronautical data chain uses networking based on FDMA or TDMA to access system, enters fidonetFido complicated, lacks flexibility ratio,
The research in Design of Routing Protocol field and application for aviation wireless communication data chain networking are the most ripe, and are abroad correlated with
How the block strict to China of the key technology in field, broken external monopolization in this art, carried by autonomous innovation
Rise China integration capability of every key technology area in aeronautical data link network, be that promote that we carry out studying main swashs
Encourage.
Summary of the invention
The goal of the invention of the present invention is to provide a kind of hybrid route side of aeronautical Ad hoc networks working in coordination with formation based on tactics
Method, for solving the foundation that the network topology changed at a high speed, variable wireless network environment and unbalanced service distribution are brought
And safeguard the problem that aviation wireless networking is reliable, high usage route is the most difficult.By hybrid route technology and convenient reliably
Networking logout mechanism, reduces routing cost on the basis of reducing routing delays to greatest extent, improves router efficiency, it is achieved adaptive
Should be in change of network environment Routing Protocol.
The goal of the invention of the present invention is achieved through the following technical solutions:
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, comprise same form into columns internal set up and
The method safeguarding route, step is as follows:
Step 1.1), after this node receives the HELLO message that neighbor node is sent, from the frame head of HELLO message
Read message length, turn to step 1.2) start to process from Article 1 frame data；Wherein: described message length represents this
Comprising how many frame data in HELLO message, every frame data represent the described neighbor node route to a destination node
Information；
Step 1.2), from these frame data, read the content of destination address field (DAF), the destination node IP address that will obtain
Compare with this node IP address, if identical, abandon this frame data, turn to step 1.7)；If difference, turn to step
1.3)；
Step 1.3), from these frame data read next hop address field content, the next-hop node IP that will obtain
Address compares with this node IP address, if identical, abandon this frame data, turns to step 1.7)；If difference, walk
Rapid 1.4)；
Step 1.4), according to destination address field (DAF) obtains from these frame data destination node IP address search this locality road
By table, it may be judged whether there is the routing iinformation of this route destination node, if without, update local routing table, turn to step
1.7)；If having, turn to step 1.5)；
Step 1.5), from these frame data read distance field value, this section that will obtain after the distance value+1 of acquisition
Point with the absolute distance of destination node after, the current distance of absolute distance with this node in current routing table with destination node is entered
Row compares, if absolute distance is more than current distance, abandons this frame data, turns to step 1.7)；If less than, the local road of change
By table information, the next hop address going to destination node is revised as the source address in this HELLO message, turns to step
1.7)；If equal to, turn to step 1.6)；
Step 1.6), whether the next hop address that judges to go in local routing table destination node report equal to this HELLO
Source address in literary composition, if equal to, the amendment routing update time, to current time, if not waiting, not processing these frame data, turning to
Step 1.7)；
Step 1.7), read next frame data, repeated execution of steps 1.2)-1.6), until each in this HELLO message
Bar frame data terminate whole HELLO Message processing flow process after being all disposed.
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, is also included in across formation information
Time mutual, the method that this node sends route requests message to gateway node, step is as follows:
Step 2.1), this node sending before route requests, first look for destination node in local chained list
The mark of FailToFindRoute, if equal to 1, after waiting one period of set time, setting to 0 FailToFindRoute and again hold
Row step 2.1)；If equal to 0, turning to step 2.2)；
Step 2.2), the mark of the FlagWasFound of destination node in the chained list of this node checks this locality, if equal to 1, stopping
Only send route requests；If equal to 0, turning to step 2.3)；
Step 2.3), this node judge that in local chained list, whether the request transmission times of destination node is more than in maximum times
Limit, if then putting 1 by FailToFindRoute mark and terminate flow process；If otherwise turning to step 2.4)；
Step 2.4), this node search whether to have existed from local routing table go to destination node route, if having,
Flow process is terminated after the route discovery mark FlagWasFound mark of destination node puts 1 in chained list；If otherwise turning to step
2.5)；
Step 2.5), this node checks local routing table, it may be judged whether there is the gateway node going to destination node, if nothing
Then terminate flow process；If having, turn to step 2.6)；
Step 2.6), this node to go to destination node gateway node send route requests message, simultaneously by this ground chain
The request transmission times of the destination node in table adds 1, returns to step 2.1 after waiting for a period of time).
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, is also included in across formation information
Time mutual, node processing method after receiving the route replies message that the gateway node going to destination node is replied, step
As follows:
Step 3.1), this node checks local routing table, it may be judged whether exist go to reply route replies message gateway
The route of node, if without, abandon this message；If having, turn to step 2)；
Step 3.2), this node checks local routing table, it may be judged whether there is the route going to destination node, if without; would add
Add local routing table, and terminate flow process；If having, turn to step 3.3)；
Step 3.3), first calculate this node and go to reply route replies message gateway node distance and reply route
The gateway node of response message and the distance sum of destination node, then by this distance sum and this node and mesh in local routing table
The current distance of node compare, if current distance is more than distance sum, turn to step 3.4), if less than; would abandon this
Bar message；
Step 3.4), this node judge current time and local routing table update the time difference of time, if more than maximum
Patient time then abandons this message；If less than, turn to step 5)；
Step 3.5), the gateway node going to destination node in local routing table is changed into reply route replies message net
Articulare, flow process terminates.
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, is also included in across formation information
Time mutual, the method that this section point carries out on-demand route maintenance, step is as follows:
Step 4.1) this node judges currently the most still have data to need to send, if having, turns to step 4.2)；If nothing
Then terminate on-demand route maintenance flow process；
Step 4.2) this node checks local routing table, it is judged that destination address is the most effective, if having, turns to step
4.3)；If without, perform the method that described node sends route requests message to gateway；
Step 4.3) this node judges whether self or destination node become gateway node, is then to wait weight after some cycles
Newly return to step 4.1)；Otherwise turn to step 4.4)；
Step 4.4) this node checks local routing table, it is judged that go to the gateway node of destination node the most still on local road
By in table, it is, turns to step 4.5)；Otherwise perform the method that described node sends route requests message to gateway；
Step 4.5) this node sends route maintenance message to the gateway node going to destination node, waits after some cycles
Come back to step 4.1).
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, also comprises the side setting up gateway
Method, comprises the steps of:
Within a cycle, the docking of this node receives all HELLO messages and resolves, according in HELLO message frame head
Formation sequence number determine whether to receive the HELLO message that inter-network node sends, if having, by this node identification be gateway joint
Point, and noticed by HELLO message；If without, it is ordinary node by this node identification, and is noticed by HELLO message.
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, also comprises node and adds formation
Method, step is as follows:
Step 6.1) when this node adds into any formation, after receiving the networking invitation signal that net interior nodes sends, root
Replying according to the source node address comprised in networking message request accepts to network invites；
Step 6.2) this section point receive net interior nodes to the confirmation invited that accepts to network after, update local neighbor table and this locality
Routing table, enters network process and completes.
Step 6.3) this section property dot cycle broadcast networking invitation signal, if receiving the acceptance networking treating that network access node is replied
Invite, then to treating that network access node sends confirmation and updates local neighbor table and local routing table.
Described a kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, also comprises node and exits formation
Method, step is as follows:
Step 7.1), this node to this formation neighbor node send logout application message；
Step 7.2), neighbor node after receiving described logout application message, to this node reverts back logout confirmation message, and
This node is deleted from local routing table；
Step 7.3) after this section point receives the confirmation to logout application message that neighbor node sends, stop HELLO message
Transmitting-receiving；If this node does not receives neighbor node yet to logout application message after sending a number of logout application message
Confirm, then force logout.
The invention have the benefit that
1. in using signal quality to form into columns with the Link State of network busy, Table Driven is machine-processed, identical formation node root
According to current network state real-time servicing neighbor table and routing table, it is possible to ensure that formation interior business real-time is transmitted, and commonly
Node only needs to safeguard the routing iinformation of this formation node, significantly reduces local routing table number of entries and route processing time,
Reduce the routing cost caused due to broadcast HELLO message.
2. using based on multiple gateway across formation on-demand routing mechanism, gateway node is responsible for safeguarding on-demand routing between formation
Setting up and safeguard, owing to there is gateway node in network, tactics formation intermediate node can learn network topology situation in advance, carries out
" there is purpose " rather than transmission route requests message blindly, significantly reduce routing cost and reduce pathfinding time delay simultaneously.
3. use the networking mechanism actively invited, it is possible to prevent from disturbing normal data service into network process, use conventional/
Extremely the logout mechanism combined, it is ensured that node was when unexpected inefficacy, and other nodes are able to confirm that this node logout.
4. the on-demand hybrid Routing Protocol combined between proposing the interior table-driven of formation and forming into columns, with existing maturation
The MANET Routing Protocols such as AODV, DSR, ZRP are compared, and under the airborne circumstance working in coordination with scene towards tactics, have highly reliable, low
Time delay, the advantage of low overhead.
5. propose based on pre-planning form into columns Routing Protocol, typical hybrid route such as ZRP agreement, the most still
It is that each node selects to set up with table-driven or on-demand to route according to the jumping figure facing node centered by oneself, and this route
Technology considers the scene that lead aircraft wing plane formation flight formation is hit, and the mode using pre-planning to form into columns sets up network；
6. devise complete node to network and logout mechanism, it is ensured that the safety of network, prevent unauthorized user
Enter network, the network information is intercepted, distort, palm off, attack etc..
Accompanying drawing explanation
Fig. 1 is the system construction drawing realizing the present invention；
Fig. 2 is the form schematic diagram of HELLO message；
The same internal schematic flow sheet set up and safeguard the method routeing of forming into columns of Fig. 3；
Fig. 4 is when formation information is mutual, and this node sends the schematic flow sheet of the method for route requests message to gateway；
Fig. 5 is when formation information is mutual, node process after receiving the route replies message that gateway node sends
The schematic flow sheet of method；
Fig. 6 is when formation information is mutual, and this section point carries out the schematic flow sheet of the method for on-demand route maintenance；
Fig. 7 is that node adds the schematic flow sheet formed into columns；
Fig. 8 is the schematic flow sheet that node exits formation.
Detailed description of the invention
The design is based on altera corp FPGA Stratix IV and Freescale company PowerPC Mpc8270 hardware
The aeronautical data chain ad-hoc network layer solution of platform, applies in aviation wireless data chain networking arts.The present invention combines
Based on table-driven and on-demand two kinds of route drive forms, it would be preferable to support 16 tactics are formed into columns, the network size of 32 nodes, have possessed
Standby node networking-logout mechanism, uses Table Driven, it is ensured that real-time service demand in same tactics are formed into columns；Across volume
Use demand-based routing between team, greatly reduce the average routing table entry of node, rely on gateway node " to have purpose " non-" blind
Mesh " forward route application, decrease network flood.
The hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics completes each node in identical formation
Neighbor table and the foundation of routing table and maintenance, and confirm according to network topology situation and safeguard gateway node, when between forming into columns
When having business datum to need transmission, source node initiates route requests, and is responsible for setting up and safeguarding that source node is to mesh by gateway node
Node between across form into columns route.
With reference to Fig. 1, the technology modules that the present invention mainly comprises has: Table Driven module, on-demand routing module, gateway select
Delivery block and networking logout module.Wherein, Route establishment and maintenance within the formation of single tactics rely on Table Driven mould
Block functional realiey；Gateway is chosen module and is responsible for implementing choosing and noticing across multiple tactics formation gateway node；When network is deposited
When across multiple tactics formation data transfer demands, on-demand routing module is responsible for the foundation across route of forming into columns and maintenance, net simultaneously
Articulare is responsible for the transmitting-receiving of data between formation；Networking logout module is responsible for new node and is added network or existing node when exitting network
Certification and confirmation.
Actual according to formation takeoff for aircraft, when network pre-planning, each node has unique No. ID and played the part of
The role drilled and the formation of formation, set up the initial stage at network, and being the discovery that of neighbor node is capable of the basis of communication, initially
Changing in neighbor node discovery procedure, node finds neighbor node by receiving HELLO message, and sends by message
The neighbor node found sets up the topological relation in the range of double bounce.According to the needs of practical situation, network there will be new joint
The networking of point and the logout of node, network topology can be affected greatly by these situations, and this programme is networked by design
Ensure not affect network proper communication with logout mechanism.Due to the dynamic mobile characteristic of network node, network topology also can
Therefore changing, this programme is periodically sent HELLO information and carries out the maintenance of network topology by node.
For supporting application in different scales and type of service network system, in the present invention HELLO message send the cycle,
Route requests message sends the cycle, route maintenance message sends the cycle and the maximum route break time all can join according to practical situation
Put, and the present invention can easily complete comprehensively with existing main MAC layer access protocol.
Below according to accompanying drawing, main functional modules of the present invention is described in further detail:
1. Table Driven module:
Table Driven module (Table Driven Routing Module) is set up for the node within same formation
And safeguard route, node is by the transmitting-receiving (TTL=1) of periodically HELLO message, with the route that neighbor node exchanges its this locality
Table, each node, by judging how many arrival destination node state weight values selects optimal path, is set up and safeguards this node
Routing table, with reference to Fig. 2, gives HELLO message data form, mainly includes frame head and frame data two parts content.
Frame header fields is defined as follows:
Source address: for identifying the source node IP address sending HELLO message；
Destination address: for identifying the destination node IP address receiving HELLO message；
Type of message: being used for identifying this type of message, 0x00 represents HELLO message；
Formation sequence number: for identifying the formation sequence number belonging to this node；
Whether gateway: be used for identifying whether this node is gateway node；
Message length: be used for identifying in this HELLO message and comprise N bar frame data.
Frame data field is defined as follows:
Destination address: be used for identifying this route destination node IP address；
Gateway address: be used for identifying this route institute through gateway address；
Next hop address: be used for identifying this route next jump node IP address；
Distance: go to the distance of destination node for identifying this route；
Formation sequence number: for identifying this route formation sequence number belonging to destination node；
Cover formation number: be used for indicating that this route destination node covers formation quantity.
With reference to Fig. 3, give by the process of HELLO message being realized the same internal side set up and safeguard route of forming into columns
Method, detailed process is as follows:
Step 1.1), after this node receives the HELLO message that neighbor node is sent, from the frame head of HELLO message
Read message length, turn to step 1.2) start to process from Article 1 frame data；Wherein: described message length represents this
Comprising how many frame data in HELLO message, every frame data represent the described neighbor node road to a certain destination node
By information；
Step 1.2), from these frame data, read the content of destination address field (DAF), the destination node IP address that will obtain
Compare with this node IP address, if identical, abandon this frame data, turn to step 1.7)；If difference, turn to step
1.3)；
Step 1.3), from these frame data read next hop address field content, the next-hop node IP that will obtain
Address compares with this node IP address, identical, abandons this frame data, turns to step 1.7)；If difference, carry out step
1.4)；
Step 1.4), according to destination address field (DAF) obtains from these frame data destination node IP address search this locality road
By table, it may be judged whether there is the routing iinformation of this route destination node, if without, update local routing table, at local routing table
The routing iinformation of middle adding purpose node, turns to step 1.7)；If having, turn to step 1.5)；
Step 1.5), from these frame data read distance field value, this section that will obtain after the distance value+1 of acquisition
Point with the absolute distance of destination node after, the current distance of absolute distance with this node in current routing table with destination node is entered
Row compares, if absolute distance is more than current distance, abandons this frame data, turns to step 1.7)；If less than, the local road of change
By table information, the next hop address going to destination node is revised as the source address in this HELLO message, turns to step
1.7)；If equal to, turn to step 1.6)；
Step 1.6), whether the next hop address that judges to go in local routing table destination node report equal to this HELLO
Source address in literary composition, if equal to, the amendment routing update time, to current time, if not waiting, not processing these frame data, turning to
Step 1.7)；
Step 1.7), read next frame data, repeated execution of steps 1.2)-1.6), until each in this HELLO message
Bar frame data terminate whole HELLO Message processing flow process after being all disposed.
After each node receives HELLO message, the routing iinformation comprised is processed according to above-mentioned steps, passes through the cycle
The HELLO message interaction of property, each node sets up local routing table.
All nodes, according to certain cycle, make regular check on the effectiveness of route entry in its local routing table, prevent by
It is saved in for a long time in local routing table in invalid routes such as movement or node logouts, takies resource and produce invalid route simultaneously.
2. across formation on-demand routing module
On-demand routing module (On-Demand Routing Module) is being initiated when formation information is mutual for node,
Searched across route of forming into columns by gateway.When this node needs to initiate on-demand routing lookup, this node searches this as source node
Ground routing table and local chained list, send route requests message (Route Request Packet) to gateway node, and wait road
By response message (Route Reply Packet).Chained list is a data base depositing on-demand routing request specially, Mei Dangyou
One new on-demand request is initiated then to update chained list.The information of storage of linked list include destination address, gateway address, the renewal time,
Current distance, request transmission times, affiliated formation number, FailToFindRoute, FlagWasFound.Wherein
FailToFindRoute be 1 expression in the time that the number of times that on-demand request sends specifies not above maximum transmission route requests
Number of times, but still do not find route, FailToFindRoute is that 0 expression sends on-demand routing request number of times in the stipulated time
The most also it is not above maximum number of times of transmission.FlagWasFound is that 1 expression has discovered that the route going to destination address,
FlagWasFound is that 0 expression is not found that the route going to destination address.With reference to Fig. 4, give on-demand routing request message
Transmission flow figure, detailed process is as follows:
Step 2.1), this node sending before route requests, first look for FailToFindRoute mark in local chained list
Know, if equal to 1, after waiting one period of set time, FailToFindRoute being set to 0 and re-executes step 2.1, it is to avoid frequently send out
Send and cause network congestion；If equal to 0, turning to step 2.2)；
Step 2.2), the route discovery mark FlagWasFound of destination node in the chained list of this node checks this locality, if etc.
Stop sending route requests in 1；If equal to 0, turning to step 2.3).Wherein, FlagWasFound is that 1 expression has been found that
Go to the route of destination address, owing to on-demand request is periodically to send, may have sending interim node every time
Establish route, FlagWasFound=0；It is also possible to receive routing reply and has established route,
FlagWasFound=1.So being previously required to judge once sending route requests every time.
Step 2.3), too much cause network congestion to prevent from searching number of times, this node judges that in local chained list, request is sent out
Send number of times whether more than the maximum times upper limit, put 1 if then FailToFindRoute being identified and terminate flow process；If otherwise turning
To step 2.4)；
Step 2.4), this node search whether to have existed from local routing table go to destination node route, if having,
Flow process is terminated after the route discovery mark FlagWasFound mark of destination node puts 1 in chained list；If otherwise turning to step
2.5)；
Step 2.5), this node checks local routing table, it may be judged whether there is the gateway node going to destination node, if nothing
Then terminate flow process；If having, turn to step 2.6)；
Step 2.6), this node send route requests message, and by chained list to the gateway node going to destination node
Request transmission times adds 1, returns to step 2.1 after waiting for a period of time).
Gateway node sends route replies to source node and destination node, comprises the routing iinformation of source node, and source node exists
After receiving the route replies message that gateway node sends, this route replies information is processed.With reference to Fig. 5, give
On-demand routing response message process chart, detailed process is as follows:
Step 3.1), this node checks local routing table, it may be judged whether exist go to reply route replies message gateway
The route of node, if without, abandon this message；If having, turn to step 2).Owing to network topology is dynamically change, from transmission
Route requests is to there may be the situation of route break in receiving during route replies, so needing to rejudge current net
Close whether effectively up to.
Step 3.2), this node checks local routing table, it may be judged whether there is the route going to destination node, if without; would add
Adding local routing table, if having, turning to step 3.3).Here there are two kinds of situations, the first is when there being multiple gateway, this
Node all sends route requests to all gateways, now can receive multiple route replies, is receiving second or the three or four
During network answer, this node may have built up across route of forming into columns；The second situation is as change in topology, this node or mesh
Node self become gateway node, by Table Driven HELLO message interaction in forming into columns, this node and destination address it
Between had built up route.
Step 3.3), first calculate this node with reply route replies message gateway node distance and reply route replies
The distance sum of the gateway node of message and destination node, then will in sum with local routing table this node and destination node
Current distance compare, if current distance more than distance sum; turn to step 3.4), if less than; would abandon this message；
Step 3.4), this node judge current time and local routing table update the time difference of time, if more than maximum
Patient time then abandons this message；If less than, turn to step 5)；
Step 3.5), the inter-network gateway node going to destination address in local routing table is changed into reply route replies message
Gateway node, flow process terminates.
Source node establish go to destination node across form into columns route after, enter on-demand route maintenance state, according to necessarily
Cycle issue route maintenance message (Route Maintaining Packet), it is ensured that whole data send during route
Effectively.With reference to Fig. 6, giving on-demand route maintenance process chart, detailed process is as follows:
Step 4.1) this node judges currently the most still have data to need to send, if having, turns to step 4.2)；If nothing
Then terminate on-demand route maintenance flow process；
Step 4.2) this node checks local routing table, it is judged that destination address is the most effective, if having, turns to step
4.3)；If without, perform the method that described node sends route requests message to gateway, i.e. step 2.1) to step 2.6)；
Step 4.3) this node judges whether self or destination node become gateway node, is then to wait weight after some cycles
Newly return to step 4.1)；Otherwise turn to step 4.4)；
Step 4.4) this node checks local routing table, it is judged that the inter-network gateway node formed into columns in destination address place is the most still
In local routing table, it is, turns to step 4.5)；Otherwise perform described node and send the side of route requests message to gateway
Method, i.e. step 2.1) to step 2.6)；
Step 4.5) this node sends route maintenance message to local gateway node, and wait and come back to step after some cycles
Rapid 4.1).
Here, our the claimed active/on-demand routing establishment model formed into columns based on tactics selects switching machine
System, this mechanism is numbered according to forming into columns belonging to node and present node neighbor table situation selects actively or on-demand routing, for satisfied system
System reliability index lays the foundation.
3. gateway processes module:
Node according to whether there being non-formation node area to be divided into ordinary node and gateway node in its signal cover, with
Node quickly to move, network topology produces change, and now ordinary node is likely to become gateway node, and gateway node is also simultaneously
It is likely to become ordinary node.
Within a cycle, the docking of this node receives all HELLO messages and resolves, according in HELLO message frame head
Formation sequence number determine whether to receive the HELLO message that inter-network node sends, if having, by this node identification be gateway joint
Point, and being noticed by HELLO message, making these other nodes of forming into columns be able to know that, this node has become as goes to a certain formation net
Close, also be able to know the gateway having which non-the node formed into columns to become this formation simultaneously.If without, it is general by this node identification
Logical node, and noticed by HELLO message.When a certain node needs to initiate on-demand routing request, can be by having searched whether
Go to the gateway that destination node is formed into columns, carry out foundation and the maintenance of on-demand routing.
Here, we claim gateway node affirmation mechanism based on network topological location, and this mechanism introduces
According to coverage scope select across formation gateway ensure that source node can search out go to destination node form into columns road
By, lay the foundation for meeting system accessibility index.
4. networking logout module
With reference to Fig. 7, giving networking and inviting and issue and new node networking flow chart, networking logout module responsible node according to
Flow process adds certain already present formation, and authorizes certain network access node to exit certain formation.All node cycles in network
Property broadcast network invite, broadcast network invite life cycle (TTL) be 1, after network access node receives networking invitation signal, according to
The source node address comprised in information replys this networking application.Net interior nodes receives the networking application of networking aircraft node reverts back
After, reply networking confirmation, after the node that application networks receives networking confirmation, update local neighbor table and routing table,
Enter network process to complete.Wherein, neighbor table is the subset of routing table, represents apart from the node that this node jumping figure is 1 jumping, in neighbor table
If there is other nodes formed into columns, this node becomes gateway node.
With reference to Fig. 8, giving node logout flow chart, node logout is divided into conventional logout and forces logout two ways.
Conventional logout refers to that the node treating logout sends logout application message to this formation neighbor node, and waits logout confirmation message,
After receiving logout confirmation message, normal logout, stops HELLO packet sending and receiving.Neighbor node is receiving the logout of this formation node
After application message, reply logout confirmation message to it, and this node is deleted from local routing table.Abnormal logout refers to wait to move back
The node of net does not receives logout confirmation message after sending a number of logout application message yet, no longer carries out conventional logout
Flow process, forces logout.
Here, we are claimed conventional and abnormal, and the logout combined is machine-processed, and this mechanism is prevented from currently
Node cannot be normally received logout and confirm and cannot complete logout flow process, lays the foundation for meeting system Complete relation.
Illustrate: assume currently there are node A1～A4, B1～B4 totally 8 nodes, be divided into A to form into columns and B forms into columns and is present in
In current network topology, A1 and B1 node invites publisher node for networking, and remaining node is non-network access node.Netinit
After, non-network access node utilizes networking logout functions of modules, receiving networking invite and confirm after realize add network, afterwards according to
Reactiver outing functions of modules, periodically HELLO message mutual with neighbor node realize interior Route establishment of forming into columns.Simultaneously, it is assumed that joint
Point A4 with B4 can mutually cover in direct communication distance, has respectively become gateway node, has utilized gateway processes module to notice
These other nodes of forming into columns oneself become gateway.Now, it is assumed that A1 needs transmission data to B1 node, utilizes on-demand routing module merit
Can, it is achieved on-demand routing finds, after establishing route, realize data by gateway node transmit.Meanwhile, on-demand routing mould
Block is periodicmaintenance on-demand routing during whole data are transmitted, it is ensured that a route to be valid.
It is understood that for those of ordinary skills, can be according to technical scheme and send out
Bright design in addition equivalent or change, and all these change or replace the guarantor that all should belong to appended claims of the invention
Protect scope.
Claims (8)
1. work in coordination with the hybrid method for routing of aeronautical Ad hoc networks of formation based on tactics, comprise same internal foundation and dimension of forming into columns
Road maintenance by method, step is as follows:
Step 1.1), after this node receives the HELLO message that neighbor node is sent, from the frame head of HELLO message read
Message length, turns to step 1.2) start to process from Article 1 frame data；Wherein: described message length represents this HELLO report
Comprising how many frame data in literary composition, every frame data represent the described neighbor node routing iinformation to a destination node；
Step 1.2), from these frame data, read the content of destination address field (DAF), the destination node IP address that will obtain and this
Node IP address compares, if identical, abandon this frame data, turns to step 1.7)；If difference, turn to step 1.3)；
Step 1.3), from these frame data read next hop address field content, the next-hop node IP address that will obtain
Compare with this node IP address, if identical, abandon this frame data, turn to step 1.7)；If difference, carry out step
1.4)；
Step 1.4), according to destination address field (DAF) obtains from these frame data destination node IP address search local routing
Table, it may be judged whether there is the routing iinformation of this route destination node, if without, update local routing table, turn to step 1.7)；
If having, turn to step 1.5)；
Step 1.5), from these frame data, read the value of distance field, by this node of obtaining after the distance value+1 of acquisition with
After the absolute distance of destination node, the current distance of absolute distance with this node in current routing table with destination node is compared
Relatively, if absolute distance is more than current distance, abandons this frame data, turn to step 1.7)；If less than, change local routing table
Information, is revised as the next hop address going to destination node the source address in this HELLO message, turns to step 1.7)；If
Equal to then turning to step 1.6)；
Step 1.6), whether judge local routing table is gone to the next hop address of destination node equal in this HELLO message
Source address, if equal to; amendment the routing update time to current time, if not wait; do not process these frame data, turn to step
1.7)；
Step 1.7), read next frame data, repeated execution of steps 1.2)-1.6), until each bar frame in this HELLO message
Data terminate whole HELLO Message processing flow process after being all disposed.
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, its feature
Being also to be included in when formation information is mutual, the method that this node sends route requests message to gateway node, step is as follows:
Step 2.1), this node sending before route requests, first look for destination node in local chained list
The mark of FailToFindRoute, if equal to 1, after waiting one period of set time, setting to 0 FailToFindRoute and again hold
Row step 2.1)；If equal to 0, turning to step 2.2)；
Step 2.2), the mark of the FlagWasFound of destination node in the chained list of this node checks this locality, if equal to 1, stop sending out
Send route requests；If equal to 0, turning to step 2.3)；
Step 2.3), this node judge that in local chained list, whether the request transmission times of destination node is more than the maximum times upper limit,
If then FailToFindRoute mark being put 1 and is terminated flow process；If otherwise turning to step 2.4)；
Step 2.4), this node search whether to have existed from local routing table go to destination node route, if having, by chain
In table, the route discovery mark FlagWasFound mark of destination node terminates flow process after putting 1；If otherwise turning to step 2.5)；
Step 2.5), this node checks local routing table, it may be judged whether there is the gateway node going to destination node, if without; would tie
Line journey；If having, turn to step 2.6)；
Step 2.6), this node to go to destination node gateway node send route requests message, simultaneously by the chained list of this locality
The request transmission times of destination node add 1, return to step 2.1 after waiting for a period of time).
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, its feature
Being also to be included in when formation information is mutual, node is receiving the route replies that the gateway node going to destination node is replied
Processing method after message, step is as follows:
Step 3.1), this node checks local routing table, it may be judged whether exist go to reply route replies message gateway node
Route, if without; would abandon this message；If having, turn to step 2)；
Step 3.2), this node checks local routing table, it may be judged whether there is the route going to destination node, if without; would add this
Ground routing table, and terminate flow process；If having, turn to step 3.3)；
Step 3.3), first calculate this node and go to reply route replies message gateway node distance and reply route replies
The gateway node of message and the distance sum of destination node, then this distance sum is saved with purpose with this node in local routing table
The current distance of point compares, if current distance is more than distance sum, turns to step 3.4), if less than, abandon this report
Literary composition；
Step 3.4), this node judge current time and local routing table update the time difference of time, if more than maximum tolerance
Time then abandons this message；If less than, turn to step 5)；
Step 3.5), the gateway node going to destination node in local routing table is changed into reply route replies message gateway joint
Point, flow process terminates.
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, its feature
Being also to be included in when formation information is mutual, the method that this section point carries out on-demand route maintenance, step is as follows:
Step 4.1) this node judges currently the most still have data to need to send, if having, turns to step 4.2)；If without, tie
Bundle on-demand route maintenance flow process；
Step 4.2) this node checks local routing table, it is judged that destination address is the most effective, if having, turns to step 4.3)；
If without, perform the method that described node sends route requests message to gateway；
Step 4.3) this node judges whether self or destination node become gateway node, is again to return after waiting some cycles
To step 4.1)；Otherwise turn to step 4.4)；
Step 4.4) this node checks local routing table, it is judged that go to the gateway node of destination node the most still at local routing table
In, it is to turn to step 4.5)；Otherwise perform the method that described node sends route requests message to gateway；
Step 4.5) this node sends route maintenance message to the gateway node going to destination node, waits after some cycles again
Return to step 4.1).
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, its feature
It is also to comprise the method setting up gateway, comprises the steps of:
Within a cycle, the docking of this node receives all HELLO messages and resolves, according to the volume in HELLO message frame head
Team's sequence number determines whether to receive the HELLO message that inter-network node sends, if having, is gateway node by this node identification, and
Noticed by HELLO message；If without, it is ordinary node by this node identification, and is noticed by HELLO message.
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics, its feature
Being that also comprising node adds the method formed into columns, step is as follows:
Step 6.1) when this node adds into any formation, after receiving the networking invitation signal that net interior nodes sends, according to entering
The source node address comprised in net message request is replied to accept to network and is invited；
Step 6.2) this section point receive net interior nodes to the confirmation invited that accepts to network after, update local neighbor table and local routing
Table, enters network process and completes.
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics the most according to claim 6, it is special
Levy and be in the method that the addition of described node is formed into columns also to comprise the steps of:
Step 6.3) this section property dot cycle broadcast networking invitation signal, treat that the acceptance networking that network access node is replied is invited if receiving
Please, then to treating that network access node sends confirmation and updates local neighbor table and local routing table.
A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics the most according to claim 1, it is special
Levying and be also to comprise the method that node exits formation, step is as follows:
Step 7.1), this node to this formation neighbor node send logout application message；
Step 7.2), neighbor node after receiving described logout application message, to this node reverts back logout confirmation message, and should
Node is deleted from local routing table；
Step 7.3) after this section point receives the confirmation to logout application message that neighbor node sends, stop HELLO packet sending and receiving；
If this node does not receives the neighbor node confirmation to logout application message after sending a number of logout application message yet,
Then force logout.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610415902.0A CN106131911A (en) | 2016-06-14 | 2016-06-14 | A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610415902.0A CN106131911A (en) | 2016-06-14 | 2016-06-14 | A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106131911A true CN106131911A (en) | 2016-11-16 |
Family
ID=57270635
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610415902.0A Pending CN106131911A (en) | 2016-06-14 | 2016-06-14 | A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106131911A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107018545A (en) * | 2017-04-07 | 2017-08-04 | 广西师范大学 | A kind of ad hoc network method being applied in wireless communication system |
| CN109104725A (en) * | 2018-08-27 | 2018-12-28 | 重庆邮电大学 | The method for preventing joint network from attacking in Tactical Mobile ad hoc network |
| CN109756946A (en) * | 2018-12-19 | 2019-05-14 | 北京交通大学 | A kind of multiple agent coordinated regulation formation method |
| CN110134139A (en) * | 2019-05-08 | 2019-08-16 | 合肥工业大学 | The tactical decision method and apparatus that unmanned plane is formed into columns under a kind of Antagonistic Environment |
| CN110413006A (en) * | 2019-08-30 | 2019-11-05 | 杭州电子科技大学 | A kind of unmanned plane formation group network system and method based on 5G communication |
| CN110505153A (en) * | 2019-08-12 | 2019-11-26 | 武汉大学 | A kind of mixed logic dynamic method of Incorporate |
| CN113923628A (en) * | 2021-10-29 | 2022-01-11 | 西北工业大学 | Airplane multi-airplane intensive formation communication interaction method, system and device |
| CN116634521A (en) * | 2023-07-20 | 2023-08-22 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267401A (en) * | 2008-04-25 | 2008-09-17 | 北京交通大学 | A mixed topology control method based on AODV protocol |
| CN101374108A (en) * | 2008-08-12 | 2009-02-25 | 北京交通大学 | Routing method suitable for static state self-grouping formation |
-
2016
- 2016-06-14 CN CN201610415902.0A patent/CN106131911A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267401A (en) * | 2008-04-25 | 2008-09-17 | 北京交通大学 | A mixed topology control method based on AODV protocol |
| CN101374108A (en) * | 2008-08-12 | 2009-02-25 | 北京交通大学 | Routing method suitable for static state self-grouping formation |
Non-Patent Citations (3)
| Title |
|---|
| 仇启明，方正，靳超，王白云: "无人机战术组网网络协议设计", 《中国无人机大会论文集》 * |
| 殷晓晨仇启明靳超: "基于信道统计的航空Ad Hoc网络组播路由协议设计", 《2015年第二届中国航空科学技术大会论文集》 * |
| 靳超，方正，殷晓晨: "一种基于战术协同编队的航空自组网混合式路由方法", 《航空电子技术，第46卷第2期（总第160期）》 * |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107018545B (en) * | 2017-04-07 | 2019-09-27 | 广西师范大学 | A kind of ad hoc network method applied in wireless communication system |
| CN107018545A (en) * | 2017-04-07 | 2017-08-04 | 广西师范大学 | A kind of ad hoc network method being applied in wireless communication system |
| CN109104725B (en) * | 2018-08-27 | 2021-04-20 | 重庆邮电大学 | Method for preventing united network attack in tactical mobile ad hoc network |
| CN109104725A (en) * | 2018-08-27 | 2018-12-28 | 重庆邮电大学 | The method for preventing joint network from attacking in Tactical Mobile ad hoc network |
| CN109756946A (en) * | 2018-12-19 | 2019-05-14 | 北京交通大学 | A kind of multiple agent coordinated regulation formation method |
| CN109756946B (en) * | 2018-12-19 | 2021-03-19 | 北京交通大学 | Multi-agent cooperative regulation and control formation method |
| CN110134139B (en) * | 2019-05-08 | 2022-04-08 | 合肥工业大学 | Tactical decision method and device for unmanned aerial vehicle formation in confrontation environment |
| CN110134139A (en) * | 2019-05-08 | 2019-08-16 | 合肥工业大学 | The tactical decision method and apparatus that unmanned plane is formed into columns under a kind of Antagonistic Environment |
| CN110505153A (en) * | 2019-08-12 | 2019-11-26 | 武汉大学 | A kind of mixed logic dynamic method of Incorporate |
| CN110505153B (en) * | 2019-08-12 | 2021-09-14 | 武汉大学 | Heaven and earth integrated hybrid routing method |
| CN110413006B (en) * | 2019-08-30 | 2022-04-01 | 杭州电子科技大学 | Unmanned Aerial Vehicle (UAV) formation networking system and method based on 5G communication |
| CN110413006A (en) * | 2019-08-30 | 2019-11-05 | 杭州电子科技大学 | A kind of unmanned plane formation group network system and method based on 5G communication |
| CN113923628A (en) * | 2021-10-29 | 2022-01-11 | 西北工业大学 | Airplane multi-airplane intensive formation communication interaction method, system and device |
| CN113923628B (en) * | 2021-10-29 | 2023-11-28 | 西北工业大学 | Communication interaction method, system and device for multi-aircraft dense formation of aircraft |
| CN116634521A (en) * | 2023-07-20 | 2023-08-22 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
| CN116634521B (en) * | 2023-07-20 | 2023-11-10 | 天津七一二通信广播股份有限公司 | Cross-layer protocol architecture integrating MAC layer and routing layer and implementation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106131911A (en) | A kind of hybrid method for routing of aeronautical Ad hoc networks working in coordination with formation based on tactics | |
| EP2466964B1 (en) | Wireless Ad-hoc Network | |
| CN108600942A (en) | A kind of method for routing of unmanned plane ad hoc network | |
| CN108055684B (en) | Routing method for aviation self-organizing network | |
| CN102158812B (en) | Wireless Mesh network multicasting communication method of AC-AP (Access Controller-Access Point) framework | |
| Li et al. | A multipath routing protocol with load balancing and energy constraining based on AOMDV in ad hoc network | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN107846706A (en) | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance | |
| CN102413542A (en) | Wireless mesh network routing method and wireless mesh network | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| Kim et al. | Hierarchical routing for unmanned aerial vehicle relayed tactical ad hoc networks | |
| CN108462983A (en) | Based on the Communication of Muti-robot System network-building method for improving ant colony AODV agreements | |
| Jin et al. | Epidemic-based controlled flooding and adaptive multicast for delay tolerant networks | |
| CN109688614A (en) | Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET | |
| CN108024200A (en) | For the adaptive approach and system of the unmanned plane self-organizing network of intermittence connection | |
| CN106209202B (en) | A kind of method of aviation self-organized network topology structure and linking Internet | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| CN104244230B (en) | The cast communication implementation method of next generation wireless network | |
| Liu et al. | An improved multi-channel aodv routing protocol based on dijkstra algorithm | |
| CN103929789A (en) | Automatic selection method for MANET network master control node based on active routing algorithm | |
| CN109327820B (en) | Network resource query and allocation method based on vehicle-mounted cloud | |
| CN112423356A (en) | Unmanned equipment cluster AODV routing method based on energy balance | |
| Yang et al. | Performance research of an improved hybrid routing protocol | |
| CN102905340B (en) | A kind of addressing method and device being applied to aeronautical communications network | |
| Dong et al. | Topology control mechanism based on link available probability in aeronautical ad hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20161116 |