CN108684063A - A kind of on-demand routing protocol improved method based on network topology change - Google Patents
A kind of on-demand routing protocol improved method based on network topology change Download PDFInfo
- Publication number
- CN108684063A CN108684063A CN201810447408.1A CN201810447408A CN108684063A CN 108684063 A CN108684063 A CN 108684063A CN 201810447408 A CN201810447408 A CN 201810447408A CN 108684063 A CN108684063 A CN 108684063A
- Authority
- CN
- China
- Prior art keywords
- node
- speed
- routing
- rrep
- source
- 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.)
- Granted
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
- H04W40/026—Route selection considering the moving speed of individual devices
-
- 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
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- 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/246—Connectivity information discovery
-
- 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
The present invention relates to computer realms, more particularly, to a kind of on-demand routing protocol improved method based on network topology change.It is analyzed first by the relative motion state to node, the topology variation situation of network can be embodied, variation degree, threshold speed V are reflected with coefficient gammaTHIt is to be calculated by this coefficient.Then, for route discovery mainly there are two RREP strategies are replied, it is exactly the current speed of related movement speed of decision node and threshold value V to choose two tactful foundationsTHThe size compared.Therefore, the invention has the advantages that：1. lower end-to-end delay；2. higher Packet delivery fractions；3. the network for high change in topology has better adaptability；4. node is extended network lifecycle, is improved network quality using equilibrium.
Description
Technical field
The present invention relates to computer realms, are improved more particularly, to a kind of on-demand routing protocol based on network topology change
Method.
Background technology
In mobile ad hoc network network, node can move freely, and have very high flexibility, the dynamic change of network topology
The stability for affecting communication link leads to the increase of the packet loss and end-to-end time delay of network.For MSNET network, routing
Agreement can be broadly divided into table- driven type and on-demand routing type according to discovery mechanism.
Table- driven agreement is extended out based on the modification to Routing Protocol in Internet network.Although when routing
Prolong relatively low, all nodes must maintain and store the routing table for the routing information that one leads to other nodes, in advance default broadcast
Circulation time is maintained and updates, it is ensured that routing table information therein is newest.Such agreement is regardless of having
Communicating requirement is required for Broadcast routing information at regular intervals.When number of nodes increases therewith, movement velocity also increases therewith
Add, can result in waste of resources too many, is relatively more suitable for scale is smaller and the more stable Ad Hoc networks of topological structure, therefore press
Agreement is needed to be born under such circumstances.
Wherein on-demand routing protocol topological structure and route-caching are established on demand, due to its routing cost and routing control
Making the features such as simple makes in the mobile network of dynamic change using than on-demand routing protocol having more advantage.It is with traditional road
Similar by protocol comparison, each node should send multicasting routing iinformation, also safeguard the routing letter towards other nodes
Breath, when node monitors network topology structure variation, just the newer message of broadcast into network, makes the node in network
Keep the consistency of routing iinformation.
The common on-demand routing protocols of MANET have AODV and DSR at present.Both Routing Protocols are all mainly to be sent out by routing
It is now formed with route maintenance two parts, reduces network resource consumption.
AODV Routing Protocol route finding process is realized with the mode of broadcast, and containing type disappears during transmission
Breath：Route requests (RREQ), routing reply (RREP) and routing error (RERR).If by array grouping need to transmit, first when
Front nodal point can check whether oneself routing table has the routing for being stored to destination node, if there is no will broadcast to its neighbor node
RREQ, receiving the node of request grouping can detect whether itself is whether to have to destination node in destination node or its routing table
Routing, if its not to be destination node and routing table be not present to the node when routing of destination node will continue to RREQ points of forwarding
Group, until source node establishes a routing that can be communicated to destination node.
Source node, which can first detect to whether there is in routing table before wanting transmission data, in dynamic source routing protocol DSR arrives mesh
Node routing, if so, this information can be attached to data packet header by he, the intermediate node of process can turn in sequence
Hair, eventually arrives at destination node；If not provided, source node starts route discovery, RREQ groupings, forwarding are broadcasted in a manner of flooding
The address of oneself is attached in RREQ and continues to forward downwards by the node of this grouping, until arriving destination node, then replys RREP points
Group.Source node can be made to store a plurality of routing for reaching destination node in route finding process, when interruption or road occur for link
It is expired by information, other routing can be selected to carry out data transmission so that in terms of DSR agreements reduce routing iinformation maintenance
Expense.
The advantages of on-demand agreement, which is node, need to play the routing iinformation safeguarded and reach all nodes in network, when node needs to lead to
When letter, as long as the routing towards destination node exists, grouping can be directly transmitted according to this routing, the delay very little needed；But
It is this network there are also deficiency, for example, DSR protocol comparisons are suitble to scale is smaller and the little network of topologies change,
When network topology structure changes greatly, the routing of failure is more, effective to keep routing to implement, it is necessary to constantly transmission point
Group carrys out the routing iinformation of more new node, this can significantly reduce the utilization rate of channel.And AODV is in scale is smaller and topological structure
Change in little network since it excessively frequently reduces its network performance instead with new routing node information.
Invention content
The present invention is mainly to solve to solve current Routing Protocol for network topology change present in the prior art
The packet loss occurred in frequent mobile ad-hoc network is serious (Packet delivery fractions are low), the big technical problem of network delay；It provides
A kind of on-demand routing protocol improved method based on network topology change.
The above-mentioned technical problem of the present invention is mainly to be addressed by following technical proposals：
A kind of on-demand routing protocol improved method based on network topology change, which is characterized in that including：
Step 1, network topology stability is calculated, analyzes, obtains particular by the relative motion state to node
The topology variation situation of network reflects variation degree with coefficient gamma, and passes through coefficient gamma calculating speed threshold value VTH；
Step 2, mobility model routing is established, particular by the current speed of related movement of decision node and threshold value VTHIt compares
Size, selection carry out RREP strategies reply：
Selection executes one：Speed of related movement is less than threshold value VTHJust assert that link is stablized, and source-routed information can be added indirectly
RREP is replied, destination node stores source-routed information after receiving RREP；
Selection executes two：Speed of related movement is greater than or equal to threshold value VTHJust assert that link is stablized indirectly, using setting in advance
Fixed RREQ formats are replied.
In a kind of above-mentioned on-demand routing protocol improved method based on network topology change, the step 1 is based on fixed
Justice：Network node motion state is random, it is specified that node maximum movement speed vmax, and obtain the transient motion speed of present node
Spend vc(t), the predetermined speed at a moment is v (t-1) on node, is specifically included：
Step 1.1, the forecast updating speed of calculate node：V (t)=ρ v (t-1)+(1- ρ) vc(t) v in formulac(t)=
r·vmax, r is the random number of ranging from (0,1), and ρ is self-defined speed update coefficient, and value range is (0,1), the bigger section of ρ values
Spot speed vector is more stable.
Step 1.2, for the movement node i (position (x in same two dimensional surfacei,yi), speed vi, direction of motion angle θi)
With node j (position (xj,yi), speed vj, direction of motion angle θj), as shown in Figure 1.
The calculate node link duration
Wherein
A=vicosθi-vjcosθj
B=xi-xj
C=visinθi-vjsinθj
D=yi-yj
Step 1.3, i, the most short link prediction duration between j, according to following formula are calculated
Step 1.4, the change in topology coefficient of link is calculated according to following formula
Step 1.5, link topology pace of change threshold value is calculated according to following formula
vTH=γ vmax。
Wherein, θiFor the node i direction of motion and horizontal direction angle, viFor the movement velocity scalar of node i, θjFor node j
The direction of motion and horizontal direction angle, vjFor the movement velocity scalar of node j, TI, jIt is node link duration, TSIt is most short
Link prediction duration, γ are the change in topology coefficient of link, vTHFor link topology pace of change threshold value.
In a kind of above-mentioned on-demand routing protocol improved method based on network topology change, the step 2 specifically includes：
Step 2.1, whether there is or not reach destination node routing in detection source node route list.It is successfully established if there is routing,
If without or expired failure carry out step 2.
Step 2.2, source node can one RREQ grouping of broadcast transmission.Packet content include source node address, source sequence number,
Broadcast ID, source node speed, hop count device, destination address, aim sequence number.
Step 2.3, other nodes receive RREQ grouping, according to RREQ grouping information judgements itself whether destination node,
Meet step 5；With the presence or absence of the routing for reaching destination node in routing table, step 4 is arrived；It does not meet, continues to forward RREQ
Grouping repeats step 3, and failure is established if hop count information is beyond regulation hop count.
Step 2.4, according to the routed path for reaching destination node in routing table, RREQ is sent to destination node.
Step 2.5, destination node calculates link topology pace of change coefficient gamma and threshold speed vTH, compareWith
vTHMovement velocity, ifMore than vTH, directly reply RREP；IfLess than vTH, source mark sets 1 in RREP, and adds
Enter source-routed information, replys RREP.
Wherein, | vi+vj| it is source node and the speed of related movement of destination node,
Step 2.6, source node receives RREP according to RREP records routing iinformation, and foundation is route successfully.
Therefore, the invention has the advantages that：1. lower end-to-end delay；2. higher Packet delivery fractions；3. for
The network of high change in topology has better adaptability；4. it is multiple to establish network topology according to network topology complexity by the present invention
Miscellaneous degree model, and efficient route discovery maintenance strategy is used according to the network topology change coefficient that motion state is established, pass through
Corresponding routing table is established in route requests grouping, makes the rational consumption network bandwidth resources of nodes.Compared to existing road
By agreement, the experimental results showed that, Routing Protocol of the present invention is frequent in network size and node topology variation, end-to-end
Advantage is all had more in terms of time delay, Packet delivery fractions, improves network service quality.
Description of the drawings
Attached drawing 1 is node relative motion model of the present invention.
Attached drawing 2 is the method flow schematic diagram of the present invention.
Attached drawing 3 is the route requests form schematic diagram of the present invention.
Attached drawing 4 is the routing reply form schematic diagram of the present invention.
Attached drawing 5 be the present invention emulation experiment in different maximum movement speed average delay schematic diagrames.
Attached drawing 6 be the present invention emulation experiment in different maximum movement speed average delay schematic diagrames.
Attached drawing 7 be the present invention emulation experiment in different maximum movement speed average delay schematic diagrames.
Attached drawing 8 be the present invention emulation experiment in different maximum movement speed average packet delivery ratio schematic diagrames.
Specific implementation mode
Below with reference to the embodiments and with reference to the accompanying drawing the technical solutions of the present invention will be further described.
1, important parameter related with the method for the present invention, network topology change velocity coeffficient γ are introduced first.
The stability of network topology is the network tune under Different Dynamic topological environmental an important factor for determining this routing algorithm
Route discovery and route maintenance mechanism are saved, the path for selecting link more stable carries out data transmission, and it is unnecessary to reduce some
Route handoff.Be given below that Routing Protocol of the present invention uses based on network topology calculation method for stability.Assuming that network
Joint movements state is random, it is specified that node maximum movement speed vmax, and obtain the transient motion speed v of present nodec(t),
The predetermined speed at a moment is v (t-1) on node, then the prediction of speed of node more new formula is carried out according to following formula：
V (t)=ρ v (t-1)+(1- ρ) vc(t)
V in formulac(t)=rvmax, r is the random number of ranging from (0,1), and ρ is speed update coefficient, and value range is
(0,1), ρ values are bigger, and node speed vector is more stable.
Assuming that two node is, j is moved with respective speed vi and vj in same two dimensional surface, and node i is toward destination locations
Direction of motion angle is θ i, and the direction of motion angle of node j toward destination locations is θ j, and position is respectively (xi, yi) and (xj, yj), and
And all mutually in other side communication range in, two node communication ranges are r, as above scheme, then the link duration by with
Lower formula calculates：
Wherein
A=vicosθi-vjcosθj
B=xi-xj
C=visinθi-vjsinθj
D=yi-yj
Work as vi=vjAnd θi=θjWhen, TI, jFor infinity.Pass through the link of 2 links of arbitrary neighborhood in acquisition approach
It predicts the duration, and is minimized the prediction duration that can obtain fullpath.Assuming that in a certain motion state,
The direction of motion of two nodes is just on the contrary, namely θi-θjWhen=π, then node i, the most short link prediction duration between j
For
Here the ratio of the most short link prediction duration and link duration that take all nodes are as quantitative selection
The velocity coeffficient of different route discovery mechanisms to reflect indirectly the change in topology degree of whole network, sets a link topology and becomes
Change threshold speed
vTH=γ vmax
When node relative velocity is less than vTHWhen, source routing discovery mechanism is added in the route construction process of node, and will routing
The mulitpath generated in discovery procedure is recorded in routing table；When node speed is more than vTHWhen, node carries out route maintenance phase
Period update mechanism will be used.Wherein network topology change velocity coeffficient γ is
2, route finding process of the present invention is described below.
In the DSAODV of proposition, when source node wants transmission data, can detect first in routing table whether there is or not reach purpose section
Point routing, if without or expired failure, need at this time initiate a new round route finding process.Source node can broadcast transmission
One content includes source node address, source sequence number, broadcast ID, source node speed, hop count device, destination address, purpose sequence
The RREQ of row number is grouped.Itself can be detected whether in destination node or routing table first by receiving the node of this RREQ groupings
With the presence or absence of the routing for reaching destination node, continue to forward RREQ groupings if not meeting；If met, when destination node connects
The relative moving speed and and v of current state are detected when receiving RREQ groupings firstTHCompare, when movement speed is more than threshold speed
When it can generate a route replies packet RREP, source node is transmitted to by reverse route.When relative moving speed is small
When threshold speed, same he can generate multiple packet RREP, intermediate node in the process when forwarding this RREP,
The address of oneself is attached to wherein, final purpose node can receive the RREQ that different paths reach and be grouped and return corresponding
RREP information, source node are that purpose node stores a plurality of routing.
The foundation of DSAODV routing tables is more special to be divided into two processes：The foundation of forward route and reverse route.If section
Need transmission data between point, and there is no when available routing inside routing table, node will start route finding process, to all
One RREQ grouping of node broadcasts.During RREQ is grouped and transmits, reverse route is established between front and back node, when purpose section
After point receives RREQ groupings, a complete reverse route is formed.Then different strategies is taken by the mobile status of node
RREP groupings are replied to source node, after intermediate node receives RREP groupings, purpose section can be played according to the foundation of RREP packet contents
The forward route of point is finally completed the routing of source node and destination node until source node receives the RREP.
(1) foundation of reverse route.
Source node first looks for routing table, if there is the available routing for reaching destination node in routing table, just passes through
The route transmission data.If do not have to lead to the routing of destination node or unavailable existing routing in routing table, source node
To the one RREQ grouping of all node broadcasts.Message content field in RREQ is：<Source IP address, source sequence number, source node speed
Degree broadcasts ID, hop count counter, purpose IP address, aim sequence number>.Structure such as Fig. 3 of RREQ groupings.
When source node re-initiates RREQ, the value of broadcast ID counters adds 1, is distinguished not by source address and broadcast ID
RREQ groupings in the same time.If the two information are all identical, the RREQ groupings received below are abandoned；If source address phase
Together, it broadcasts ID increased, then uses RREQ groupings to replace original grouping, establish the reverse route to previous node.So
After be further continued for transmitting RREQ groupings, until finding destination node, the final reverse route established from destination node to source node.
(2) foundation of forward route.
Destination node or have reach destination node can be received with the intermediate node of routing RREQ grouping after, pass through reverse route
RREP groupings are replied to source node.The structure of RREP groupings is as shown in Figure 4.
It, often will be between two nodes by a node during RREP groupings return to source node by reverse route
Routing in the same direction is established, while recording the information such as next-hop node and the sequence number of current RREP groupings in the routing table.Anti-
The node used to routing and the node not passed through during RREP, the reverse route established by them will be in active ways
By failing after time-out.
3, it is below the emulation experiment carried out using the present invention.
Emulation emulates network using NS2 softwares.It is used as mac-layer protocol, setting node to communicate model using 802.11
It encloses for 250m, simulation time is 300 seconds, sends 2 CBR data flows each second, and each data packet length is 512byte, is built
Vertical 10 pairs of communication connections, joint movements residence time 1s.Emulation experiment is average mainly under different node maximum movement speeds
The performance for improving Routing Protocol and original two kinds of agreements is evaluated in terms of Packet delivery fractions and average end-to-end delay two.It is flat
Equal Packet delivery fractions are the ratio for the total packet quantity that the total packet quantity that all nodes receive is sent out with CBR streams, this
Parameter reflects the efficiency of improved protocol and the reliability of network transmission.Average end-to-end time delay packet from source node to
The average time consumed between destination node reflects in route finding process and seeks diameter efficiency, experimental result such as Fig. 6 to Fig. 8
It is shown.
It compared performance of 3 kinds of Routing Protocols in the case where node maximum speed changes.Analogue simulation certain amount
Node in fixed communication zone maximum speed be respectively 5m/s to 40m/s scene.Each scene simulation 30 times, and it is comprehensive
To close 30 experimental results be average behavior index, comparative analysis tri- kinds of agreement average delays of AODV, DSR and DSAODV and average
Packet delivery fractions, the results showed that DSAODV agreements have better network performance at various speeds.
It compared performance of the Routing Protocol under heterogeneous networks scale.The a certain number of nodes of analogue simulation are fixed
The scene that maximum node number is 10 to 90 in communication zone.Same comprehensive 30 experimental results are average behavior index, experiment knot
Fruit shows that in the case of different network size (number of nodes), DSAODV has better network performance.
The following table 1 is Fig. 2,3 simulation parameter simulation parameters
Table 1
The following table 2 is Fig. 4,5 simulation parameter simulation parameters
Table 2
It is described in the present invention that specific embodiments are merely illustrative of the spirit of the present invention.Technology belonging to the present invention
The technical staff in field can make various modifications or additions to the described embodiments or by a similar method
It substitutes, however, it does not deviate from the spirit of the invention or beyond the scope of the appended claims.
Claims (3)
1. a kind of on-demand routing protocol improved method based on network topology change, which is characterized in that including：
Step 1, network topology stability is calculated, is analyzed particular by the relative motion state to node, obtains network
Topology variation situation, variation degree is reflected with coefficient gamma, and pass through coefficient gamma calculating speed threshold value VTH；
Step 2, mobility model routing is established, particular by the current speed of related movement of decision node and threshold value VTHThat compares is big
Small, selection carries out the reply of RREP strategies：
Selection executes one：Speed of related movement is less than threshold value VTHJust assert that link is stablized, and source-routed information reply can be added indirectly
RREP, destination node store source-routed information after receiving RREP；
Selection executes two：Speed of related movement is greater than or equal to threshold value VTHJust assert that link is stablized indirectly, use is preset
RREQ formats are replied.
2. a kind of on-demand routing protocol improved method based on network topology change according to claim 1, feature exist
In the step 1 is based on definition：Network node motion state is random, it is specified that node maximum movement speed vmax, and obtain
The transient motion speed v of present nodec(t), the predetermined speed at a moment is v (t-1) on node, is specifically included：
Step 1.1, the forecast updating speed of calculate node：V (t)=ρ v (t-1)+(1- ρ) vc(t) v in formulac(t)=r
vmax, r is the random number of ranging from (0,1), and ρ is self-defined speed update coefficient, and value range is (0,1), the bigger node of ρ values
Velocity vector is more stable；
Step 1.2, for the movement node i (position (x in same two dimensional surfacei,yi), speed vi, direction of motion angle θi) and section
Point j (position (xj,yi), speed vj, direction of motion angle θj), such as scheme；The calculate node link duration
Wherein
A=vi cosθi-vj cosθj
B=xi-xj
C=vi sinθi-vj sinθj
D=yi-yj
Step 1.3, i, the most short link prediction duration between j, according to following formula are calculated
Step 1.4, the change in topology coefficient of link is calculated according to following formula
Step 1.5, link topology pace of change threshold value is calculated according to following formula
vTH=γ vmax；
Wherein, θiFor the node i direction of motion and horizontal direction angle, viFor the movement velocity scalar of node i, θjIt is moved for node j
Direction and horizontal direction angle, vjFor the movement velocity scalar of node j, Ti,jIt is node link duration, TSFor most short chain road
Predict the duration, γ is the change in topology coefficient of link, vTHFor link topology pace of change threshold value.
3. a kind of on-demand routing protocol improved method based on network topology change according to claim 1, feature exist
In the step 2 specifically includes：
Step 2.1, whether there is or not reach destination node routing in detection source node route list；It is successfully established if there is routing, if not having
Have or expired failure has carried out step 2；
Step 2.2, source node can one RREQ grouping of broadcast transmission；Packet content includes source node address, source sequence number, broadcast
ID, source node speed, hop count device, destination address, aim sequence number；
Step 2.3, other nodes receive RREQ grouping, according to RREQ grouping information judgements itself whether destination node, meet
To step 5；With the presence or absence of the routing for reaching destination node in routing table, step 4 is arrived；It does not meet, continues to forward RREQ groupings,
Step 3 is repeated, failure is established if hop count information is beyond regulation hop count；
Step 2.4, according to the routed path for reaching destination node in routing table, RREQ is sent to destination node；
Step 2.5, destination node calculates link topology pace of change coefficient gamma and threshold speed vTH, compareWith vTHFortune
Dynamic speed, ifMore than vTH, directly reply RREP；IfLess than vTH, source mark sets 1 in RREP, and source road is added
By information, RREP is replied；
Wherein, | vi+vj| it is source node and the speed of related movement of destination node,
Step 2.6, source node receives RREP according to RREP records routing iinformation, and foundation is route successfully.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810447408.1A CN108684063B (en) | 2018-05-11 | 2018-05-11 | On-demand routing protocol improvement method based on network topology change |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810447408.1A CN108684063B (en) | 2018-05-11 | 2018-05-11 | On-demand routing protocol improvement method based on network topology change |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108684063A true CN108684063A (en) | 2018-10-19 |
| CN108684063B CN108684063B (en) | 2020-12-01 |
Family
ID=63805449
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810447408.1A Active CN108684063B (en) | 2018-05-11 | 2018-05-11 | On-demand routing protocol improvement method based on network topology change |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108684063B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109787902A (en) * | 2019-02-28 | 2019-05-21 | 中国科学院国家空间科学中心 | A kind of selection method of mobile ad-hoc network adaptive routing protocol |
| CN111935002A (en) * | 2020-06-11 | 2020-11-13 | 哈尔滨聚车科技有限公司 | High-adaptability vehicle-mounted routing communication method based on AODV (Ad hoc on-demand distance vector) |
| CN112507032A (en) * | 2020-12-22 | 2021-03-16 | 正链科技(深圳)有限公司 | K-bucket structure improvement method of kademlia protocol |
| CN113271642A (en) * | 2021-05-18 | 2021-08-17 | 北京邮电大学 | Method and device for realizing self-organizing network routing protocol of multi-agent system |
| CN114449607A (en) * | 2022-02-09 | 2022-05-06 | 北京润科通用技术有限公司 | Routing method, device and routing equipment based on DSDV protocol |
| CN115835163A (en) * | 2023-02-08 | 2023-03-21 | 四川省商投信息技术有限责任公司 | Method and system for rapid networking of portable interphone |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060067232A1 (en) * | 2004-09-24 | 2006-03-30 | Samsung Electronics Co., Ltd. | Mobile network system for dynamically controlling communication path and method thereof |
| US20100246480A1 (en) * | 2009-03-31 | 2010-09-30 | Motorola, Inc. | System and method for selecting a route based on link metrics incorporating channel bandwidth, spatial streams and/or guard interval in a multiple-input multiple-output (mimo) network |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN107071850A (en) * | 2016-12-08 | 2017-08-18 | 南京航空航天大学 | A kind of improved AODV Routing Protocols for being suitable for different motion scene |
-
2018
- 2018-05-11 CN CN201810447408.1A patent/CN108684063B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060067232A1 (en) * | 2004-09-24 | 2006-03-30 | Samsung Electronics Co., Ltd. | Mobile network system for dynamically controlling communication path and method thereof |
| US20100246480A1 (en) * | 2009-03-31 | 2010-09-30 | Motorola, Inc. | System and method for selecting a route based on link metrics incorporating channel bandwidth, spatial streams and/or guard interval in a multiple-input multiple-output (mimo) network |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN107071850A (en) * | 2016-12-08 | 2017-08-18 | 南京航空航天大学 | A kind of improved AODV Routing Protocols for being suitable for different motion scene |
Non-Patent Citations (2)
| Title |
|---|
| 王浩: ""移动Ad_Hoc网络一种新的动态源路由协议的研究"", 《信息科技辑》 * |
| 赵春晓: ""一种用于MANET网络的模糊控制路由协议"", 《东北大学学报》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109787902A (en) * | 2019-02-28 | 2019-05-21 | 中国科学院国家空间科学中心 | A kind of selection method of mobile ad-hoc network adaptive routing protocol |
| CN109787902B (en) * | 2019-02-28 | 2021-03-09 | 中国科学院国家空间科学中心 | Selection method of self-adaptive routing protocol of mobile self-organizing network |
| CN111935002A (en) * | 2020-06-11 | 2020-11-13 | 哈尔滨聚车科技有限公司 | High-adaptability vehicle-mounted routing communication method based on AODV (Ad hoc on-demand distance vector) |
| CN112507032A (en) * | 2020-12-22 | 2021-03-16 | 正链科技(深圳)有限公司 | K-bucket structure improvement method of kademlia protocol |
| CN113271642A (en) * | 2021-05-18 | 2021-08-17 | 北京邮电大学 | Method and device for realizing self-organizing network routing protocol of multi-agent system |
| US11576102B2 (en) | 2021-05-18 | 2023-02-07 | Beijing University Of Posts And Telecommunications | Method and device for implementing ad hoc network routing protocol in multi-agent system |
| CN114449607A (en) * | 2022-02-09 | 2022-05-06 | 北京润科通用技术有限公司 | Routing method, device and routing equipment based on DSDV protocol |
| CN115835163A (en) * | 2023-02-08 | 2023-03-21 | 四川省商投信息技术有限责任公司 | Method and system for rapid networking of portable interphone |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108684063B (en) | 2020-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ehsan et al. | Performance comparison of ad hoc wireless network routing protocols | |
| CN108684063A (en) | A kind of on-demand routing protocol improved method based on network topology change | |
| Patil et al. | On-demand multipath routing protocols for mobile ad hoc networks issues and comparison | |
| Deepalakshmi et al. | Ant colony based QoS routing algorithm for mobile ad hoc networks | |
| Abd Elmoniem et al. | Ant colony and load balancing optimizations for AODV routing protocol | |
| Kunz | Energy-efficient variations of OLSR | |
| Sivapriya et al. | Efficient fuzzy based multi-constraint multicast routing with multi-criteria enhanced optimal capacity–delay tradeoff | |
| Pal et al. | A study on the effect of traffic patterns on Routing protocols in Ad-hoc network following RPGM Mobility model | |
| Smail et al. | Energy-aware and stable cluster-based multipath routing protocol for wireless ad hoc networks | |
| Abdullah et al. | Energy Efficient MANET Routing Protocol Based on Ant Colony Optimization. | |
| Chaudhari et al. | Multilayered distributed routing for power efficient MANET performance | |
| Dhanapal et al. | Efficient clustering protocol based on ant-bee agent for large scale MANET | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Sinha et al. | Clar: A novel cluster oriented agent based routing protocol for manet | |
| Tabatabaei et al. | Routing and quality of service support for mobile ad hoc networks | |
| Adekiigbe et al. | Issues and challenges in clustering techniques for wireless mesh networks | |
| Adebanjo et al. | An evaluation of improved cluster-based routing protocol in ad-hoc wireless network | |
| Kapoor et al. | To improve the QoS in MANETs through analysis between reactive and proactive routing protocols | |
| Rehman et al. | Associativity-based on-demand multi-path routing in mobile ad hoc networks | |
| Ziane et al. | A QoS adaptive multi-path reinforcement learning routing algorithm for manet | |
| Manjula | Service discovery in clustered MANET and internet | |
| Kim et al. | Traffic load and lifetime deviation based power-aware routing protocol for wireless ad hoc networks | |
| Bojd et al. | A new connectionless routing algorithm using cross-layer design approach in MANETs | |
| Pahuja et al. | Analysis and Simulations of Routing Protocols with Different Load Conditions of MANETs | |
| Shivaprakash et al. | Efficient passive clustering and gateway selection in MANETs |
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 | ||
| CB02 | Change of applicant information |
Address after: 430062, Friendship Avenue 368, Wuchang District, Hubei, Wuhan Applicant after: Hubei University Address before: 430062 School of education, Hubei University, 368 Friendship Avenue, Wuchang District, Hubei, Wuhan Applicant before: Hubei University |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |