CN107396420A - A kind of vacant lot one wireless self-organization network divides domain routing algorithm - Google Patents
A kind of vacant lot one wireless self-organization network divides domain routing algorithm Download PDFInfo
- Publication number
- CN107396420A CN107396420A CN201710675435.XA CN201710675435A CN107396420A CN 107396420 A CN107396420 A CN 107396420A CN 201710675435 A CN201710675435 A CN 201710675435A CN 107396420 A CN107396420 A CN 107396420A
- Authority
- CN
- China
- Prior art keywords
- node
- domain
- network
- airborne
- routing
- 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/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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/02—Topology update or discovery
-
- 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/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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/12—Shortest path evaluation
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of vacant lot one wireless self-organization network divides domain routing algorithm, in the network dividing area stage, according to node communication capacity, by the way of people's work point domain, network is divided into two layers, wherein all airborne node composition core domains, and all ground nodes determine the peripheral domain each belonged to, meanwhile each peripheral domain can be assigned the boundary node that a node is the domain by airborne node, be responsible for communicating with the airborne node in core domain；In the Route establishment stage, can there are inter-domain routing and the two kinds of route of intra-area routes in network, ground node in 1 domain of layer only needs to obtain the routing table in well-behaved domain, and the airborne node in core domain needs to obtain the routing table of the whole network, airborne and ground node is all that required routing table is obtained using shortest path first.The routing algorithm can take into full account the characteristic of network, so as to accelerate Route establishment, increase fast convergence rate, while it is small to reduce routing cost, and algorithm is simple and realizability is high.
Description
Technical field
The present invention relates to wireless self-organization network route technology field, specially a kind of vacant lot one wireless self-organization network
Divide domain routing algorithm.
Background technology
The communication system of three-dimensional is the core composition of following informatization and network.And current terrestrial wireless MANET can
To be extended by air communication node system, extend scope of insurance coverage.Air communication platform is mainly as entrained by unmanned plane and dirigible
Airborne communication control composition, flying height is between 3-6km, no more than 10 kilometers；The flying speed of dirigible is about
80km/h-100km/h, and the flying speed of unmanned plane then can reach hundreds of kilometer per hour.General lift-off Platform communication section
Point coverage distance requirement reaches hundreds of kilometer, can also reach the communication of hundred kilometers of level distances (below for convenience between node
Calculating explanation has exemplified by 300 kilometers).Ground communication host will be made up of vehicle-mounted radio station, general to require to complete a 30km-50km left sides
The communication of right distance.It is required that can also accomplish to interconnect between aerial platform and ground surface platform, that is, require remote absolutely empty, empty
Ground, ground link reliable communication ensure, with build vacant lot one wireless self-organization network.
However, the new challenge brought using this air-ground integrated communication network to network route.It is existing and extensive
The property and function of the wireless routing mode used are not particularly suited for new three-dimensional communication system.Existing, ripe is wireless
Network technology, typically for ground network framework, and seldom consider aerial platform and the simultaneous field of ground network
Scape.Therefore it is necessary to design the routing algorithm suitable for this vacant lot one, the connected ratio of network is improved.
The rudimentary algorithm of route has following three kinds：
(1) distance vector algorithms (Distance Vetor Routing)
Distance vector algorithms are based on following calculation formula：
Wherein, D (i, j) is represented from node i (node is network or router) to node j shortest path, d (i, k) table
Show the directapath from node i to node k, that is to say, that there is no intermediary node between node i and k.Concrete operation step is as follows：
(a) all routers establish a routing table, all purposes address in system is appeared in table.It is each
Contents in table includes destination address and next station address, is designated as tuple (N, G).
(b) router periodically sends renewal packet to neighbours, and the content for updating packet is all letters in routing table
Breath.
(c) neighbor router reception processing renewal packet.If renewal packet comes from G', calculated according to renewal packet and arrive purpose
Address N routing cost is D', if D'<D, using new route (N, G').If that is deposited in current routing table is corresponding
Next station address is G', that is, G'=G, using new route, no matter it is small greatly that D', which is,.
(2) link-state algorithm (Link State Routing)
Link-state algorithm, or referred to as SPF (Shortest Path First) algorithm, its thinking can be divided into following 4
Individual part describes：
(a) neighbours of the router are found, obtain their network address, establish neighbouring relations, and measure each phase
The expense of adjacent router or delay.Neighbouring relations are established by sending Hello packets to realize.
(b) information for exchange is got up, construction includes the link state packets of these information.Create link shape
The opportunity of state packet is divided to two kinds, and for one kind periodically to create, another kind is exactly to be created when event occurs.
(c) by Flood (diffusion) algorithm, the packet is sent to other all routers.How chain is reliably issued
Line state, which is grouped in link state routing algorithm, accounts for sizable proportion, and the quality that link-state algorithm is realized is certain
The quality of Flood algorithms is depended in degree.
(d) according to the link-state information being collected into, by dijkstra's algorithm, calculate this router and arrive other roads of the whole network
By the beeline of device or network.
(3) mixed routing algorithm
Mixed routing algorithm has used path vector to measure, and the more traditional distance vector algorithm of this measurement uses
Measurement it is more accurate.Mixed routing algorithm is driven based on the time, rather than timing occurs, and can significantly save transmission
Bandwidth, and it is faster than Distance Vector Routing Algorithm coalescence rate.To a certain extent it may be said that mixed routing algorithm
The advantages of combining two kinds of algorithms of distance vector and Link State.That representative is EIGRP, i.e., enhanced Interior Gate
By agreement.
Wherein, each method of three of the above has its advantage, but both for set by the individual layer communication network of ground
Meter, the characteristics of not accounting for vacant lot integral network.In view of the above-mentioned problems, special propose a kind of vacant lot one wireless self-organization network
Divide domain routing algorithm.
The content of the invention
It is an object of the invention to provide a kind of vacant lot one wireless self-organization network to divide domain routing algorithm, above-mentioned to solve
The problem of being proposed in background technology.
To achieve the above object, the present invention provides following technical scheme：A kind of vacant lot one wireless self-organization network divides domain
Routing algorithm, algorithm can be divided into network dividing area and the two stages of Route establishment；
The network dividing area stage：In network initialization procedure, according to node communication capacity, by the way of people's work point domain,
Network is divided into two layers, wherein all airborne node composition core domains (layer 2), and all ground nodes determine what is each belonged to
Peripheral domain (layer 1), meanwhile, each peripheral domain can be assigned the boundary node that a node is the domain by airborne node, be responsible for
Airborne node communication in core domain；
The Route establishment stage：After network dividing area, can there are inter-domain routing and the two kinds of route of intra-area routes, layer 1
Ground node in domain only needs to obtain the routing table in well-behaved domain, and the airborne node in core domain needs to obtain the route of the whole network
Table, airborne and ground node are all that required routing table is obtained using shortest path first.
Preferably, the described network dividing area stage, in network initialization procedure, according to node communication capacity, by vacant lot
The wireless self-organization network of one is realized by the way of people's work point domain, is comprised the following steps that；
Step 101, airborne node composition core domain：This divides domain model to be divided into double-layer structure, it is contemplated that space nodes are more
Remote communication capacity, the node being manually arranged to airborne node in core domain, core domain play core transfer region
Effect；
Step 102, ground node determines the peripheral domain oneself belonged to：According to the natural region of ground Node distribution position
Point, ground node is divided by region manually, i.e., similar ground node forms a peripheral domain, on ground it is all outside
Enclose domain and collectively constitute layer 1, therefore, in layer 1, can be in communication with each other between the node in a peripheral domain, still, different peripheries
Node in domain must be forwarded to by the core transfer region being made up of airborne node in corresponding peripheral domain；
Step 103, boundary node is selected：Each peripheral domain in 1 domain of layer can have a boundary node, be responsible for and layer 2
Airborne node communication in domain, and boundary node randomly selects one wherein by an airborne node nearest from the peripheral domain
Individual node after the failure of border routing node, new border will be re-elected by airborne node as border routing node
Node.
Preferably, the described Route establishment stage, two kinds of route be present in network：Inter-domain routing and Yu Nei roads
By.Wherein, inter-domain routing is that all airborne nodes obtain the whole network routing table by routing algorithm in core domain.Intra-area routes and domain
Between route all run shortest path first calculate to destination node optimal path, so as to obtain required routing table.
In shortest path first is performed, the propagation delay time between node is equivalent to distance, propagation delay time is shorter, between node
Distance it is nearer, therefore shortest path first concretely comprises the following steps：
Step 1, choosing arbitrary node a in domain then has S={ a } as source summit, by the set of other node compositions in domain
It is set to Ua；
Step 2, node a to U is obtainedaThe distance of each node in set, the minimum node k of selected distance, by it by suitable
Sequence is put into S and gathered, i.e. S={ a, k }, meanwhile, renewal set UaIn element, i.e. Ua=Ua-{k}；
Step 3, using selected node k as the relaying summit of source summit, obtain from node a and pass through node k to UaIn it is each
The distance of node, the minimum node of selected distance is sequentially added into S set, and updates set UaIn element；
Step 4, repeat step 3 is until set UaFor sky, now, node a just acquires the road of all other node in domain
By information.
Compared with prior art, the beneficial effects of the invention are as follows：A kind of vacant lot one wireless self-organization network point domain is route
Algorithm, Route establishment and fast convergence rate and expense is small, the node in peripheral domain only needs to safeguard the routing table of one's respective area, therefore
The Route establishment time of network substantially reduces and routing cost is small.When network, which is sent, to be changed, it is only necessary to update the road of one's respective area
By table, so the time of routing convergence is also fast, algorithm is simple, and realizability is high.It can be seen that from shortest route algorithm, each node
In routing table procedures are obtained, it is necessary to prior information it is few, algorithm complex is low.Meanwhile the algorithm considers two kinds of airborne nodes
With the characteristic of ground node, network management and data forwarding are placed on the airborne node that function is relatively strong and communication is stable, increase
Scheme realizability.
Brief description of the drawings
Fig. 1 is typical partition context schematic diagram；
Fig. 2 is that point domain and routing table establish process；
Fig. 3 is shortest path first flow chart.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other under the premise of creative work is not made
Embodiment, belong to the scope of protection of the invention.
Fig. 1-3 are referred to, the present invention provides a kind of technical scheme：A kind of vacant lot one wireless self-organization network point domain is route
Algorithm, algorithm can be divided into network dividing area and the two stages of Route establishment；
The network dividing area stage：In network initialization procedure, according to node communication capacity, by the way of people's work point domain,
Network is divided into two layers, wherein all airborne node composition core domains (layer 2), and all ground nodes determine what is each belonged to
Peripheral domain (layer 1), meanwhile, each peripheral domain can be assigned the boundary node that a node is the domain by airborne node, be responsible for
Airborne node communication in core domain；
The Route establishment stage：After network dividing area, can there are inter-domain routing and the two kinds of route of intra-area routes, layer 1
Ground node in domain only needs to obtain the routing table in well-behaved domain, and the airborne node in core domain needs to obtain the route of the whole network
Table, airborne and ground node are all that required routing table is obtained using shortest path first.
The described network dividing area stage, in network initialization procedure, according to node communication capacity, by the nothing of vacant lot one
Line self-organizing network is realized by the way of people's work point domain, is comprised the following steps that；
Step 101, airborne node composition core domain：This divides domain model to be divided into double-layer structure, it is contemplated that space nodes are more
Remote communication capacity, the node being manually arranged to airborne node in core domain, core domain play core transfer region
Effect；
Step 102, ground node determines the peripheral domain oneself belonged to：According to the natural region of ground Node distribution position
Point, ground node is divided by region manually, i.e., similar ground node forms a peripheral domain, on ground it is all outside
Enclose domain and collectively constitute layer 1, therefore, in layer 1, can be in communication with each other between the node in a peripheral domain, still, different peripheries
Node in domain must be forwarded to by the core transfer region being made up of airborne node in corresponding peripheral domain；
Step 103, boundary node is selected：Each peripheral domain in 1 domain of layer can have a boundary node, be responsible for and layer 2
Airborne node communication in domain, and boundary node randomly selects one wherein by an airborne node nearest from the peripheral domain
Individual node after the failure of border routing node, new border will be re-elected by airborne node as border routing node
Node.
In the described Route establishment stage, two kinds of route be present in network：Inter-domain routing and intra-area routes, wherein,
Inter-domain routing is that all airborne nodes obtain the whole network routing table by routing algorithm in core domain, and intra-area routes and inter-domain routing are all
Run shortest path first and calculate the optimal path for arriving destination node, so as to obtain required routing table.
In shortest path first is performed, the propagation delay time between node is equivalent to distance, propagation delay time is shorter, between node
Distance it is nearer, therefore shortest path first concretely comprises the following steps：
Step 1, choosing arbitrary node a in domain then has S={ a } as source summit, by the set of other node compositions in domain
It is set to Ua；
Step 2, node a to U is obtainedaThe distance of each node in set, the minimum node k of selected distance, by it by suitable
Sequence is put into S and gathered, i.e. S={ a, k }, meanwhile, renewal set UaIn element, i.e. Ua=Ua-{k}；
Step 3, using selected node k as the relaying summit of source summit, obtain from node a and pass through node k to UaIn it is each
The distance of node, the minimum node of selected distance is sequentially added into S set, and updates set UaIn element；
Step 4, repeat step 3 is until set UaFor sky, now, node a just acquires the road of all other node in domain
By information.
Route establishment and fast convergence rate and expense is small, the node in peripheral domain only needs to safeguard the routing table of one's respective area,
Therefore the Route establishment time of network substantially reduces and routing cost is small.When network, which is sent, to be changed, it is only necessary to update one's respective area
Routing table, so the time of routing convergence is also fast, algorithm is simple, and realizability is high.It can be seen that from shortest route algorithm, each
Node in routing table procedures are obtained, it is necessary to prior information it is few, algorithm complex is low.Meanwhile two kinds of algorithm consideration is airborne
The characteristic of node and ground node, network management and data forwarding are placed on the airborne node that function is relatively strong and communication is stable,
The realizability of increased scheme.
In the description of the invention, it is to be understood that term " coaxial ", " bottom ", " one end ", " top ", " middle part ",
" other end ", " on ", " side ", " top ", " interior ", " front portion ", " center ", the orientation of the instruction such as " both ends " or position relationship be
Based on orientation shown in the drawings or position relationship, it is for only for ease of the description present invention and simplifies description, rather than instruction or dark
Show that the device of meaning or element there must be specific orientation, with specific azimuth configuration and operation, thus it is it is not intended that right
The limitation of the present invention.
In the present invention, unless otherwise clearly defined and limited, term " installation ", " setting ", " connection ", " fixation ",
Terms such as " spinning " should be interpreted broadly, for example, it may be fixedly connected or be detachably connected, or integrally；Can be with
It is mechanical connection or electrical connection；Can be joined directly together, can also be indirectly connected by intermediary, can be two
The connection of individual element internal or the interaction relationship of two elements, limited unless otherwise clear and definite, for the common of this area
For technical staff, the concrete meaning of above-mentioned term in the present invention can be understood as the case may be.
Although an embodiment of the present invention has been shown and described, for the ordinary skill in the art, can be with
A variety of changes, modification can be carried out to these embodiments, replace without departing from the principles and spirit of the present invention by understanding
And modification, the scope of the present invention is defined by the appended.
Claims (3)
1. a kind of vacant lot one wireless self-organization network divides domain routing algorithm, it is characterised in that algorithm can be divided into network dividing area and
The two stages of Route establishment；
The network dividing area stage：In network initialization procedure, according to node communication capacity, by the way of people's work point domain, by net
Network is divided into two layers, wherein all airborne node composition core domains（Layer 2）, and all ground nodes determine the periphery each belonged to
Domain（Layer 1）, meanwhile, each peripheral domain can be assigned the boundary node that a node is the domain, responsible and core by airborne node
Airborne node communication in domain；
The Route establishment stage：After network dividing area, can there are an inter-domain routing and the two kinds of route of intra-area routes, in the domain of layer 1
Ground node only need to obtain the routing table in well-behaved domain, and the airborne node in core domain needs to obtain the routing table of the whole network,
Airborne and ground node is all that required routing table is obtained using shortest path first.
2. a kind of vacant lot one wireless self-organization network according to claim 1 divides domain routing algorithm, it is characterised in that institute
The network dividing area stage stated, in network initialization procedure, according to node communication capacity, by the mobile Ad hoc network of vacant lot one
Network is realized by the way of people's work point domain, is comprised the following steps that；
Step 101, airborne node composition core domain：This divides domain model to be divided into double-layer structure, it is contemplated that space nodes it is farther away from
From communication capacity, the node being manually arranged to airborne node in core domain, core domain plays a part of core transfer region；
Step 102, ground node determines the peripheral domain oneself belonged to：According to the natural differentiation of ground Node distribution position, hand
Dynamic to be divided ground node by region, i.e., similar one peripheral domain of ground node composition, on ground all peripheral domains
Layer 1 is collectively constituted, therefore, in layer 1, can be in communication with each other between the node in a peripheral domain, still, in different peripheral domains
Node must be forwarded to by the core transfer region being made up of airborne node in corresponding peripheral domain；
Step 103, boundary node is selected：Each peripheral domain in 1 domain of layer can have a boundary node, in the responsible and domain of layer 2
The communication of airborne node, and boundary node randomly selects a section wherein by an airborne node nearest from the peripheral domain
Point is used as border routing node, after the failure of border routing node, new boundary node will be re-elected by airborne node.
3. a kind of vacant lot one wireless self-organization network according to claim 1 divides domain routing algorithm, it is characterised in that institute
In the Route establishment stage stated, two kinds of route be present in network：Inter-domain routing and intra-area routes, wherein, inter-domain routing is
All airborne nodes obtain the whole network routing table by routing algorithm in core domain, and intra-area routes and inter-domain routing all run shortest path
Footpath algorithm calculates the optimal path to destination node, so as to obtain required routing table, in shortest path first is performed, by node
Between propagation delay time be equivalent to distance, propagation delay time is shorter, and the distance between node is nearer, therefore shortest path first is specific
Step is：
Step 1, choosing arbitrary node a in domain then has S={ a } as source summit, and the set of other node compositions in domain is set into Ua；
Step 2, node a to U is obtainedaThe distance of each node in set, the minimum node k of selected distance, it is put into order
S gathers, i.e. S={ a, k }, meanwhile, renewal set UaIn element, i.e. Ua=Ua-{k}；
Step 3, using selected node k as the relaying summit of source summit, obtain from node a and pass through node k to UaIn each node
Distance, the minimum node of selected distance is sequentially added into S set, and updates set UaIn element；
Step 4, repeat step 3 is until set UaFor sky, now, node a just acquires the route letter of all other node in domain
Breath.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710675435.XA CN107396420A (en) | 2017-08-09 | 2017-08-09 | A kind of vacant lot one wireless self-organization network divides domain routing algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710675435.XA CN107396420A (en) | 2017-08-09 | 2017-08-09 | A kind of vacant lot one wireless self-organization network divides domain routing algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107396420A true CN107396420A (en) | 2017-11-24 |
Family
ID=60344944
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710675435.XA Pending CN107396420A (en) | 2017-08-09 | 2017-08-09 | A kind of vacant lot one wireless self-organization network divides domain routing algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107396420A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114124716A (en) * | 2020-08-30 | 2022-03-01 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Balanced domain division method for software defined network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100163621A1 (en) * | 2006-01-11 | 2010-07-01 | Carmel-Haifa University Economic Corporation Ltd. | Uav decision and control system |
| CN101964958A (en) * | 2010-09-27 | 2011-02-02 | 北京航空航天大学 | On-board network system and backbone node message processing method thereof |
| CN103078795A (en) * | 2012-12-29 | 2013-05-01 | 天津大学 | Cooperation routing method for improving wireless network throughput capacity |
-
2017
- 2017-08-09 CN CN201710675435.XA patent/CN107396420A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100163621A1 (en) * | 2006-01-11 | 2010-07-01 | Carmel-Haifa University Economic Corporation Ltd. | Uav decision and control system |
| CN101964958A (en) * | 2010-09-27 | 2011-02-02 | 北京航空航天大学 | On-board network system and backbone node message processing method thereof |
| CN103078795A (en) * | 2012-12-29 | 2013-05-01 | 天津大学 | Cooperation routing method for improving wireless network throughput capacity |
Non-Patent Citations (3)
| Title |
|---|
| 张新: "面向临近空间通信的PMP_Mesh混合网络性能研究", 《信息科技辑》 * |
| 朱爱微: "面向空地网络的逻辑扁平化路由设计", 《信息科技辑》 * |
| 李刚: "一种面向空地一体化组网的体系架构", 《计算机工程与科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114124716A (en) * | 2020-08-30 | 2022-03-01 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Balanced domain division method for software defined network |
| CN114124716B (en) * | 2020-08-30 | 2023-10-10 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Balanced domain division method for software defined network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Singh et al. | VANET routing protocols: Issues and challenges | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| CN104581862A (en) | Measurement and control communication method and system based on low-altitude unmanned aerial vehicle self-network | |
| CN108040353A (en) | A kind of unmanned plane swarm intelligence Geographic routing method of Q study | |
| CN111294108B (en) | Efficient routing method for orthogonal circular orbit configuration satellite constellation | |
| CN109618381A (en) | Ad hoc network communication method and ad hoc network communication system | |
| CN104378297A (en) | Message forwarding method and device | |
| CN110995333B (en) | Cluster QoS route design method | |
| CN108337166A (en) | A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network | |
| CN102149161A (en) | Hierarchical and regular mesh network routing method | |
| CN108366093A (en) | One kind being based on the distributed wireless ad hoc network of " virtual center " and " mobile agent " | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| CN104618979A (en) | Adaptive partition routing method based on cross aiding | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| CN109547095A (en) | A kind of method that congestion is alleviated in satellite communication in the process | |
| CN106304184A (en) | The route discovery of many tolerance amount based on AODV and the method for foundation | |
| CN108024228A (en) | A kind of vehicle-mounted net GPSR agreement improved methods based on road network and QOS models | |
| CN102724097B (en) | A kind of ESADI processing method and system | |
| ES2957269T3 (en) | Method and set that allows end user terminals to interact through a multi-hop wireless proximity communication network with dynamic architecture | |
| CN107396420A (en) | A kind of vacant lot one wireless self-organization network divides domain routing algorithm | |
| CN108112046A (en) | A kind of routing scheduling method based on vehicle-mounted internet | |
| Auddino et al. | The nearest is not the fastest: On the importance of selecting in/out routing hops over a satellite leo constellation | |
| CN106341328A (en) | Routing method of grid structure quantum communication network | |
| Sukumaran et al. | Intersection based traffic aware routing in VANET | |
| Chen et al. | A bio-inspired geographic routing in VANETs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20171124 |
|
| WD01 | Invention patent application deemed withdrawn after publication |