CN106792912B - A kind of improvement method for routing and device based on AODV - Google Patents
A kind of improvement method for routing and device based on AODV Download PDFInfo
- Publication number
- CN106792912B CN106792912B CN201710025774.3A CN201710025774A CN106792912B CN 106792912 B CN106792912 B CN 106792912B CN 201710025774 A CN201710025774 A CN 201710025774A CN 106792912 B CN106792912 B CN 106792912B
- Authority
- CN
- China
- Prior art keywords
- routing
- node
- optimal
- present node
- update
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000006872 improvement Effects 0.000 title claims abstract description 19
- 230000005611 electricity Effects 0.000 claims description 35
- 230000005540 biological transmission Effects 0.000 description 21
- 238000005265 energy consumption Methods 0.000 description 5
- 235000013399 edible fruits Nutrition 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a kind of improvement method for routing and device based on AODV, the method includes：Present node receives the routing update request that Network Central Node is sent, and marks round；Present node determines whether to receive the routing update request for the first time；If so, the hop count of the optimal routing of the topological number of plies of setting, the minimum amount of power of optimal routing, and routing table is emptied, if not, the topological number of plies of update；If not, and judge the route entry of source node asked in the routing table with the presence or absence of next-hop for broadcast update, and it is asked according to the topological number of plies of the present node and the broadcast of optimal route record with round routing update, return simultaneously repeats present node and determines whether to receive the routing update request for the first time, using the embodiment of the present invention, the load balancing of whole network ensure that；And limitation of the data packet length limitation to network topology depth can be avoided using the balancing energy routing algorithm.
Description
Technical field
The present invention relates to wireless network routing algorithm technical field, more particularly to a kind of improvement method for routing based on AODV
And device.
Background technology
In the wireless network, each node also needs the forwarding for undertaking other node datas to appoint other than sending the data of itself
Business, this can cause the rate of each node electric quantity consumption inconsistent.The run time of whole network topology depends on exhausting at first
The working time of the node of electricity.Therefore in the routing infrastructure for building whole network, it is necessary to consider each node in routing
Charge condition reduces the data forwarding task of the below average node of electricity as far as possible.In addition, IEEE802.15.4 is provided
The length of data packet should not exceed 127 bytes during wireless transmission.In the case of using 8 byte, 64 bit address form,
Data link layer, network layer and transport layer expense (including 8 byte sources, purpose physical address, 8 byte sources, purpose network address, 1
Byte route residual hop, 1 byte data Packet type, 4 byte transmission sequence numbers, the verification of 2 bytes) 40 bytes will be occupied.If
Route discovery is carried out using simple AODV routing algorithms, it is assumed that RREQ packets often need to add present node by a node
8 byte addresses and 4 byte nodal informations can only then carry out the route discovery within 7 jumps.If since protocol fields are more complicated
Fixed or dynamic overhead is caused to increase, can more limit the scale of network topology.
Path reliability and consumption power are considered, by excavating energy and link association, and with reference to effective energy
The problem of mechanism and the reliability in path, proposes path cost balance forecast function, and using its majorized function as routing standard,
Finally obtain a plurality of node it is non-intersect and meet end to end reliability requirement simultaneously consuming little energy effective routing, more comprehensively
Solves the problems, such as the order standard of path parameter value.The program ensures the stability and reliability of routing, while reduces in network
The energy expenditure of node, but for the path cost balance forecast function of proposition, the estimation of error is predicted in specific introduction, only
It is to propose a prediction expression, internal prediction details has improvement to be designed.Existing node electric quantity consumption rate differs
The problem of the problem of cause and protocol fields complexity cause network topology scale to be restricted.
Invention content
The embodiment of the present invention is designed to provide a kind of improvement method for routing and device based on AODV, builds entire net
The charge condition of the upper each node of routing is considered during the routing infrastructure of network, optimal routing electricity is contained in routing update request
Amount and present node electricity optimize network routing by these information, ensure that the load balancing of whole network；And it adopts
Limitation of the data packet length limitation to network topology depth can be avoided with the balancing energy routing algorithm.
In order to achieve the above objectives, the embodiment of the invention discloses a kind of improvement method for routing based on AODV, network centers
Node sets initial routing update required parameter, the method includes：
Present node receives the routing update request that Network Central Node is sent, wherein, the routing update request is used for
Update the topological number of plies of the present node, the hop count of the optimal routing of the present node to the Network Central Node, institute
Present node is stated to the optimal routing minimum amount of power of the Network Central Node, the electricity of the present node, and marks round；
Present node determines whether to receive the routing update request for the first time；
If so, the topological number of plies for setting the present node is the first preset value, the setting present node is described in
The hop count of the optimal routing of Network Central Node is the second preset value, the setting present node to the Network Central Node
The minimum amount of power of optimal routing is third preset value, and empties routing table；
If not, the topological number of plies during a, the update for determining to receive are asked adds after 1 less than the present node
In the case of the topological number of plies, the topological number of plies of the present node is updated；
B, judge the route entry with the presence or absence of next-hop for the source node of broadcast update request in the routing table, such as
Fruit is no, and the information in being asked according to the routing update adds the route entry；If so, it is taken according to optimal routing minimum amount of power
Hop count takes reckling to be updated route entry, and update route record when the maximum, optimal routing minimum amount of power are equal；
It is updated in the topological number of plies of the present node；Current optimal routing is than the optimal road before update at following
In the case of one kind：
(1) the optimal routing minimum amount of power of bigger is provided；
(2) identical optimal routing minimum amount of power is provided, while smaller hop count is provided；
(3) identical optimal routing minimum amount of power, identical hop count are provided, while the next-hop node electricity of bigger is provided
Amount；
It is asked with round routing update according to the topological number of plies of the present node and the broadcast of optimal route record, returned simultaneously
It returns and repeats the step of present node determines whether to receive the routing update request for the first time.
Optionally, the update route record, including：
Route entry is jumped when taking the maximum, optimal routing minimum amount of power equal according to optimal routing minimum amount of power after updating
Next-hop node electricity takes the optimal road of the Policy Updates of the maximum when number takes reckling, optimal routing minimum amount of power and equal hop count
By recording.
Optionally, the topological number of plies of the setting present node is the first preset value, the setting present node arrives
The hop count of the optimal routing of the Network Central Node is the second preset value, the setting present node is saved to the network center
The minimum amount of power of the optimal routing of point is third preset value, including：
The topological number of plies for setting the present node is that default maximum value sets the present node to the network center
The hop count of the optimal routing of node is that default maximum value sets optimal routing of the present node to the Network Central Node
Minimum amount of power be default minimum.
Optionally, the Network Central Node sets initial routing update required parameter, including：
The topological number of plies of the Network Central Node setting present node is 0, the present node to the network center
The hop count of the optimal routing of node is 0, the minimum amount of power of the optimal routing of the present node to the Network Central Node is
The electricity of present node described in default maximum value is default maximum.
Optionally, the method further includes：
In the case where new node adds in the network that the Network Central Node creates, route acquisition request is sent；
Determine the neighbor node of the new node；
The neighbor node sends the optimal of itself and routes to the new node.
Optionally, the neighbor node for determining the new node, including：
According to neighbor node lookup algorithm, the neighbor node of the new node is determined.
A kind of improvement route device based on AODV, which is characterized in that described device includes：
First setup module sets initial routing update required parameter for Network Central Node；
Sending module receives the routing update request of Network Central Node transmission for present node, wherein, the routing
Update request includes：The topological number of plies, the present node for updating the present node are optimal to the Network Central Node
The hop count of routing, the minimum amount of power of optimal routing of the present node to the Network Central Node, the present node
Electricity, and mark round；
First judgment module determines whether to receive the routing update request for the first time for present node；
Second setup module is worked as in the case where the judging result of first judgment module is to be, setting to be described
The topological number of plies of front nodal point is the first preset value, the jump of the setting present node to the optimal routing of the Network Central Node
Number is the second preset value, the minimum amount of power of setting present node to the optimal routing of the Network Central Node is that third is pre-
If value, and empty routing table；
Second judgment module in the case of being no in the judging result of first judgment module, determines to receive
Update request in the topological number of plies add after 1 less than the topological number of plies of the present node in the case of, update is described to work as
The topological number of plies of front nodal point；
And judge the routing of source node asked in the routing table with the presence or absence of next-hop for broadcast update
, if not, the information in being asked according to the routing update adds the route entry；It is if so, minimum according to optimal routing
Hop count takes reckling to be updated route entry, and update route record when electricity takes the maximum, optimal routing minimum amount of power equal；
Update module is updated for the topological number of plies in the present node, before current optimal routing is than update
Optimal routing can provide the identical optimal routing minimum amount of power of the optimal routing minimum amount of power of bigger, person and smaller hop count, phase
With optimal routing minimum amount of power and hop count and the next-hop node electricity of bigger it is any in the case of, then according to described current
The topological number of plies of node and the broadcast of optimal route record are asked, while return repeats present node and sentences with round routing update
Whether disconnected be the step of receiving the routing update request for the first time.
Using the embodiment of the present invention, the electricity of each node in routing is considered in the routing infrastructure for building whole network
Situation contains optimal routing electricity and present node electricity in routing update request, and network is route by these information
It optimizes, ensure that the load balancing of whole network.Meanwhile data packet length can be avoided using balancing energy routing algorithm
Limit the limitation to network topology depth.L-G simulation test shows institute's extracting method of the present invention, improves the data of whole network transmission
Chartered steamer number reduces data packet average transmission energy consumption so that all routings obtain fully balancedly utilizing.
Certainly, it implements any of the products of the present invention or method must be not necessarily required to reach all the above excellent simultaneously
Point.
Description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention, for those of ordinary skill in the art, without creative efforts, can be with
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is improvement method for routing flow diagram provided in an embodiment of the present invention.
Relationships of the Fig. 2 between data transmission wheel number and balancing energy degree.
Fig. 3 is data transmission wheel number and balancing energy Degree of Accord Relation figure.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution 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, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without creative efforts
Embodiment shall fall within the protection scope of the present invention.
Referring to Fig. 1, Fig. 1 is improvement method for routing flow diagram provided in an embodiment of the present invention, main to include following step
Suddenly：
Step 1:Network Central Node updates request by broadcast and initiates the whole network routing update.
Step 2:Neighbor node is asked by routing update.
Step 3:Judge whether to be asked by routing update for the first time, be to turn Step4, otherwise turn Step5.
Step 4:The hop count of the topological number of plies of node and optimal route record is set as maximum value by optimal route record
Minimum amount of power be set as minimum and empty routing table.
Step 5:According to the Policy Updates topology number of plies, routing table and optimal route record.
Step 6:Judge whether to meet broadcast conditional, meet, turn Step7, otherwise turn Step8.
Step 7:Simultaneously broadcast more new record is constructed, turns Step2.
Step 8:Algorithm terminates.
Specifically, based on a kind of improvement method for routing based on AODV that above-mentioned steps provide, the method includes the steps：
S101, present node receive the routing update request that Network Central Node is sent, wherein, the routing update request
For updating the jump of the optimal routing of the topological number of plies of the present node, the present node to the Network Central Node
Several, described present node is marked to the minimum amount of power of the optimal routing of the Network Central Node, the electricity of the present node
Remember round.
Network Central Node sets initial routing update required parameter.The Network Central Node setting present node
The topological number of plies is 0, the hop count of the optimal routing of the present node to the Network Central Node is 0, the present node arrives
The minimum amount of power of the optimal routing of the Network Central Node is that the electricity of present node described in default maximum value is default very big
Value.The default maximum of node electricity is more than the electricity maximum value that nodes possess, which is set according to actual conditions.
S102, present node determine whether to receive the routing update request for the first time；If so, perform S103；Such as
Fruit is no, performs S104.
Judged when present node is receiving routing update request every time, if the first time for the wheel receives
The route requests, if performing S103；If not, perform S104.
S103, the topological number of plies for setting the present node is the first preset value, the setting present node to the net
The hop count of the optimal routing of network Centroid is the second preset value, the setting present node to the Network Central Node most
The minimum amount of power of excellent routing is third preset value, and empties routing table.
Further, set the topological number of plies of the present node that the present node is set to institute for default maximum value
The hop count for stating the optimal routing of Network Central Node is that default maximum value sets the present node to the Network Central Node
The minimum amount of power of optimal routing be default minimum.Wherein, the default maximum of the node topology number of plies is more than nodes
To the maximum hop count value of Centroid, which is set according to actual conditions；The default maximum of node-routing hop count is more than net
All nodes possess the maximum hop count value of routing in network, which is set according to actual conditions；The default minimum of node electricity
It is generally set to 0.
S104, a, determine that the topological number of plies in the update request received adds opening up less than the present node after 1
In the case of flutterring the number of plies, the topological number of plies of the present node is updated；
B, judge the route entry with the presence or absence of next-hop for the source node of broadcast update request in the routing table, such as
Fruit is no, and the information in being asked according to the routing update adds the route entry；If so, it is taken according to optimal routing minimum amount of power
Hop count takes reckling to be updated route entry, and update route record when the maximum, optimal routing minimum amount of power are equal.
Illustratively, if not routing update request is received for the first time, present node is in the update for determining to receive
In the case that the topological number of plies in request adds the topological number of plies for being less than the present node after 1, the present node is updated
The topological number of plies, the topological number of plies in such as being asked by update is 3, and the current topological number of plies for solving node is 5, due to 3+1<5, so
Update the topological number of plies of present node.
Illustratively, the route entry of source node asked in the routing table with the presence or absence of next-hop for broadcast update,
Information in being asked according to the routing update adds the route entry；Otherwise, according to it is optimal routing minimum amount of power take the maximum,
It is optimal routing minimum amount of power it is equal when hop count reckling is taken to be updated route entry.
Further, the maximum, optimal routing can be taken according to optimal routing minimum amount of power after route entry updates
Next-hop node electricity takes the maximum when hop count takes reckling, optimal routing minimum amount of power and equal hop count when minimum amount of power is equal
The optimal route record of Policy Updates.
S105 is updated in the topological number of plies of the present node；Current optimal routing exists than the optimal road before update
In the case of any below：
(1) the optimal routing minimum amount of power of bigger is provided；
(2) identical optimal routing minimum amount of power is provided, while smaller hop count is provided；
(3) identical optimal routing minimum amount of power, identical hop count are provided, while the next-hop node electricity of bigger is provided
Amount；
It is asked with round routing update according to the topological number of plies of the present node and the broadcast of optimal route record, returned simultaneously
It returns and repeats the step of present node determines whether to receive the routing update request for the first time.
In practical application, need to judge whether to broadcast update request, as follows：The topological number of plies of present node
It is updated, that current optimal routing than the optimal routing before update can provide the optimal routing minimum amount of power of bigger, person is identical
Optimal routing minimum amount of power and smaller hop count, identical optimal routing minimum amount of power and hop count and the next-hop node of bigger electricity
In the case of measuring any one, same round routing update request is broadcasted, performs S102；Then go off the air.
Further, the method further includes：The situation for the network that the Network Central Node creates is added in new node
Under, send route acquisition request；Determine the neighbor node of the new node；The neighbor node sends the optimal of itself and routes to
The new node.
Further, can the neighbor node of the new node be determined according to neighbor node lookup algorithm.
During practical wireless transmission, the energy expenditure of transmission data packet meets Eτx(l, d)=l*Eelec+l*εd2,
The energy expenditure of received data packet meets Eγx(l, d)=l*Eelec, i.e., it route during the multi-hop transmission of data packet and respectively saves
The energy of point received data packet consumption is only and the length of data packet is linearly related, and send the energy of consumption in addition to data packet
Length is linearly related outer also related to the physical distance of point-to-point transmission front and rear in routing.The purpose of the emulation experiment is that verification energy is equal
Weigh portfolio effect of the routing algorithm to network node electricity, and the simulating scenes built are the logic connection set between node
Property, and the actual physics distance and the electric quantity consumption numerical value of reality being not concerned between node, therefore only retain EτxIn (l, d) with away from
From unrelated part, i.e. Eτx(l, d)=Eγx(l, d), and by per bit receive energy expenditure on the basis of unit to the total of node
Electricity is quantified.
Relationships of the Fig. 2 between data transmission wheel number and balancing energy degree, emulation are laid out for given network node,
Comparison is using AODV (Ad hoc On-demand Distance Vector Routing, the on-demand plan range of wireless self-networking
Vector Routing Protocol) algorithm and improved AODV algorithms operational effect, it is equal that improved AODV algorithms are also referred to as energy
Account method.
The target of the balancing energy routing algorithm of the embodiment of the present invention is to avoid data packet length limitation to network topology depth
The limitation of degree, and according to network currently the electricity of each node and neighbor node connectivity structure equalising network electric quantity consumption road
By.AODV routing algorithms and the comparing result of balancing energy routing algorithm are as follows.
Scene is made of 1 Network Central Node, 60 common network nodes and 8 sections of obstacles, as shown in Figure 2.Wireless communication
It number propagates and to be set as along straightline propagation, propagation distance is 10 unit lengths；The data packet length of transmission is 100bit, and ACK is
50bit, the electricity of each common network node are set as 108Unit energy.Fig. 2 be occur in a network it is entire before failure node
Relational graph between the data chartered steamer number of transmission of network and balancing energy degree.
It can be seen from the figure that in this scenario, after using balancing energy algorithm, the wheel number energy of transmitted data on network packet
8 times using AODV algorithms are enough promoted to, the reason is that balancing energy algorithm can avoid those by phase in all optional routings
To the route entry of low battery node, pathfinding is carried out according to the sequence of data packet total amount that routing can carry so that all available
Routing all fully balancedly utilizes.But the granularity of balancing energy is constantly refined by improving routing update frequency, it can not be notable
Promote the effect of balancing energy.
Fig. 3 is data transmission wheel number and balancing energy Degree of Accord Relation figure, is to occur data packet before failure node in a network
Relational graph between average transmission energy consumption and balancing energy degree.It can be seen from the figure that in this scenario, using balancing energy
After algorithm, data packet average transmission energy consumption improves nearly 50% compared to AODV algorithms, the reason is that network node is route in selection
When be not preferential selection shortest path, but the routing of the maximum minimum electricity of preferential selection, this causes the transmission meeting of data packet
By more nodes so that the average energy consumption of transmission increases.When raising routing update frequency constantly refines the granularity of balancing energy
When, only more frequently switch in a plurality of optional routing, the average energy consumption increase of transmission will not significant changes.
Based on embodiment shown in FIG. 1, a kind of improvement route device based on AODV is provided, described device includes：
First setup module 201 sets initial routing update required parameter for Network Central Node；
Sending module 202 receives the routing update request of Network Central Node transmission for present node, wherein, it is described
Routing update request is for updating the topological number of plies of the present node, the present node to the Network Central Node most
The hop count of excellent routing, the minimum amount of power of optimal routing of the present node to the Network Central Node, the present node
Electricity, and mark round；
First judgment module 203 determines whether to receive the routing update request for the first time for present node；
Second setup module 204, in the judging result of first judgment module in the case of being, described in setting
The topological number of plies of present node is the first preset value, the setting present node to the optimal routing of the Network Central Node
Hop count be the second preset value, setting present node to the optimal routing of the Network Central Node minimum amount of power be third
Preset value, and empty routing table；
Second judgment module 205 in the case of being no in the judging result of first judgment module, determines to receive
To update request in the topological number of plies add after 1 less than the topological number of plies of the present node in the case of, described in update
The topological number of plies of present node；
And judge the routing of source node asked in the routing table with the presence or absence of next-hop for broadcast update
, if not, the information in being asked according to the routing update adds the route entry；It is if so, minimum according to optimal routing
Hop count takes reckling to be updated route entry, and update route record when electricity takes the maximum, optimal routing minimum amount of power equal；
Update module 206 is updated for the topological number of plies in the present node；Before current optimal routing is than update
Optimal road in the case that following any,
(1) the optimal routing minimum amount of power of bigger is provided；
(2) identical optimal routing minimum amount of power is provided, while smaller hop count is provided；
(3) identical optimal routing minimum amount of power, identical hop count are provided, while the next-hop node electricity of bigger is provided
Amount；
It is asked with round routing update according to the topological number of plies of the present node and the broadcast of optimal route record, returned simultaneously
It returns and repeats the step of present node determines whether to receive the routing update request for the first time：
It is asked with round routing update according to the topological number of plies of the present node and the broadcast of optimal route record, returned simultaneously
It returns and repeats the step of present node determines whether to receive the routing update request for the first time.
It should be noted that in embodiments of the present invention, relational terms such as first and second and the like are used merely to
It distinguishes one entity or operation from another entity or operation, without necessarily requiring or implying these entities or behaviour
There are any actual relationship or orders between work.Moreover, term " comprising ", "comprising" or its any other variant
Non-exclusive inclusion is intended to, so that process, method, article or equipment including a series of elements not only include
Those elements, but also including other elements that are not explicitly listed or further include for this process, method, article or
The intrinsic element of person's equipment.In the absence of more restrictions, the element limited by sentence "including a ...", not
Also there are other identical elements in the process, method, article or apparatus that includes the element for exclusion.
Each embodiment in this specification is described using relevant mode, identical similar portion between each embodiment
Point just to refer each other, and the highlights of each of the examples are difference from other examples.Especially for device reality
For applying example, since it is substantially similar to embodiment of the method, so description is fairly simple, related part is referring to embodiment of the method
Part explanation.
One of ordinary skill in the art will appreciate that all or part of step in realization above method embodiment is can
It is completed with instructing relevant hardware by program, the program can be stored in computer read/write memory medium,
The storage medium designated herein obtained, such as：ROM/RAM, magnetic disc, CD etc..
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention
It is interior.
Claims (6)
1. a kind of improvement method for routing based on AODV, which is characterized in that Network Central Node sets initial routing update please
Parameter is sought, the method includes：
Present node receives the routing update request that Network Central Node is sent, wherein, the routing update asks to update
The topological number of plies of the present node, the optimal routing of the present node to the Network Central Node hop count, it is described work as
Front nodal point marks round to the optimal routing minimum amount of power of the Network Central Node, the electricity of the present node；
Present node determines whether to receive the routing update request for the first time；
If so, the topological number of plies for setting the present node is the first preset value, the setting present node to the network
The hop count of the optimal routing of Centroid is the second preset value, the setting present node to the optimal of the Network Central Node
The minimum amount of power of routing is third preset value, and empties routing table；
If not, the topological number of plies during a, the update for determining to receive are asked adds the topology for being less than the present node after 1
In the case of the number of plies, the topological number of plies of the present node is updated；
B, judge the route entry with the presence or absence of next-hop for the source node of broadcast update request in the routing table, if
No, the information in being asked according to the routing update adds the route entry；If so, it is taken most according to optimal routing minimum amount of power
Hop count takes reckling to be updated route entry, and update route record when big person, optimal routing minimum amount of power are equal；
It is updated in the topological number of plies of the present node；Current optimal routing feelings more any than optimal Lu Yi before update
Under condition：
(1) the optimal routing minimum amount of power of bigger is provided；
(2) identical optimal routing minimum amount of power is provided, while smaller hop count is provided；
(3) identical optimal routing minimum amount of power, identical hop count are provided, while the next-hop node electricity of bigger is provided
It is asked according to the topological number of plies of the present node and the broadcast of optimal route record with round routing update, while returns to weight
The step of present node determines whether to receive the routing update request for the first time is performed again.
A kind of 2. improvement method for routing based on AODV according to claim 1, which is characterized in that the update routing note
Record, including：
Hop count takes when route entry takes the maximum, optimal routing minimum amount of power equal after updating according to optimal routing minimum amount of power
Next-hop node electricity takes the optimal routing note of the Policy Updates of the maximum when reckling, optimal routing minimum amount of power and equal hop count
Record.
3. a kind of improvement method for routing based on AODV according to claim 1, which is characterized in that work as described in the setting
The topological number of plies of front nodal point is the first preset value, the jump of the setting present node to the optimal routing of the Network Central Node
Number is the second preset value, the minimum amount of power of setting present node to the optimal routing of the Network Central Node is that third is pre-
If value, including：
The topological number of plies for setting the present node is that default maximum value sets the present node to the Network Central Node
Optimal routing hop count be default maximum value set the present node to the Network Central Node optimal routing most
Small electricity is default minimum.
A kind of 4. improvement method for routing based on AODV according to claim 1, which is characterized in that network center's section
Point sets initial routing update required parameter, including：
The topological number of plies of the Network Central Node setting present node is 0, the present node to the Network Central Node
Optimal routing hop count be 0, the minimum amount of power of the optimal routing of the present node to the Network Central Node is default
The electricity of present node described in maximum value is default maximum.
5. a kind of improvement method for routing based on AODV according to claim 1, which is characterized in that the method is also wrapped
It includes：
In the case where new node adds in the network that the Network Central Node creates, route acquisition request is sent；
Determine the neighbor node of the new node；
The neighbor node sends the optimal of itself and routes to the new node.
6. a kind of improvement method for routing based on AODV according to claim 5, which is characterized in that described determining described new
The neighbor node of node, including：
According to neighbor node lookup algorithm, the neighbor node of the new node is determined.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710025774.3A CN106792912B (en) | 2017-01-13 | 2017-01-13 | A kind of improvement method for routing and device based on AODV |
| CN201810303883.1A CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
| CN201810298586.2A CN108471628B (en) | 2017-01-13 | 2017-01-13 | Routing controller with optimized network load |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710025774.3A CN106792912B (en) | 2017-01-13 | 2017-01-13 | A kind of improvement method for routing and device based on AODV |
Related Child Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810298586.2A Division CN108471628B (en) | 2017-01-13 | 2017-01-13 | Routing controller with optimized network load |
| CN201810303883.1A Division CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106792912A CN106792912A (en) | 2017-05-31 |
| CN106792912B true CN106792912B (en) | 2018-06-19 |
Family
ID=58946451
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810303883.1A Active CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
| CN201810298586.2A Active CN108471628B (en) | 2017-01-13 | 2017-01-13 | Routing controller with optimized network load |
| CN201710025774.3A Active CN106792912B (en) | 2017-01-13 | 2017-01-13 | A kind of improvement method for routing and device based on AODV |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810303883.1A Active CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
| CN201810298586.2A Active CN108471628B (en) | 2017-01-13 | 2017-01-13 | Routing controller with optimized network load |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN108521660B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108521660A (en) * | 2017-01-13 | 2018-09-11 | 国家电网公司 | A kind of route renewing method of balancing energy |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449267B (en) * | 2018-03-15 | 2020-08-07 | 东北大学 | Reliable routing algorithm based on link quality estimation |
| CN109362059A (en) * | 2018-11-22 | 2019-02-19 | 广东工业大学 | A kind of car networking routing improved method |
| CN111865791B (en) * | 2020-07-13 | 2022-02-08 | 电子科技大学中山学院 | Route updating method and system for dynamic network |
| CN115866692B (en) * | 2023-02-28 | 2023-06-02 | 国网信息通信产业集团有限公司 | Wireless sensor network load balancing routing method, operation method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1347601A2 (en) * | 2002-03-18 | 2003-09-24 | Nec Corporation | Multi-hop network for transmission of packets whose size is determined by hop count number |
| CN101494599A (en) * | 2008-09-28 | 2009-07-29 | 天津大学 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
| CN101562862A (en) * | 2009-05-15 | 2009-10-21 | 湖南大学 | Routing method for balancing energy of wireless sensor network |
| CN105764108A (en) * | 2016-03-25 | 2016-07-13 | 重庆邮电大学 | Energy-balanced weight hop-count routing method for industrial wireless network |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100505700C (en) * | 2007-07-13 | 2009-06-24 | 北京航空航天大学 | A routing update method |
| CN101489293B (en) * | 2009-02-27 | 2011-05-11 | 重庆邮电大学 | Wireless sensor network routing scheduling method based on energy consumption balance policy |
| CN102413538B (en) * | 2011-12-02 | 2014-07-02 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| CN103607352A (en) * | 2013-11-22 | 2014-02-26 | 上海电机学院 | Multicast routing method based on network topology |
| US9986434B2 (en) * | 2014-04-30 | 2018-05-29 | Avago Technologies General Ip (Singapore) Pte. Ltd. | System for accelerated network route update through exclusive access to routing tables |
| CN104618983B (en) * | 2015-01-30 | 2018-11-27 | 国家电网公司 | A kind of communication means of the wireless sensor network based on random energies supply |
| CN108521660B (en) * | 2017-01-13 | 2021-07-20 | 国家电网公司 | Route updating method with balanced energy |
-
2017
- 2017-01-13 CN CN201810303883.1A patent/CN108521660B/en active Active
- 2017-01-13 CN CN201810298586.2A patent/CN108471628B/en active Active
- 2017-01-13 CN CN201710025774.3A patent/CN106792912B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1347601A2 (en) * | 2002-03-18 | 2003-09-24 | Nec Corporation | Multi-hop network for transmission of packets whose size is determined by hop count number |
| CN101494599A (en) * | 2008-09-28 | 2009-07-29 | 天津大学 | Method for implementing multicast energy-saving routing protocol of Ad Hoc network based on layer-striding mechanism |
| CN101562862A (en) * | 2009-05-15 | 2009-10-21 | 湖南大学 | Routing method for balancing energy of wireless sensor network |
| CN105764108A (en) * | 2016-03-25 | 2016-07-13 | 重庆邮电大学 | Energy-balanced weight hop-count routing method for industrial wireless network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108521660A (en) * | 2017-01-13 | 2018-09-11 | 国家电网公司 | A kind of route renewing method of balancing energy |
| CN108521660B (en) * | 2017-01-13 | 2021-07-20 | 国家电网公司 | Route updating method with balanced energy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108521660B (en) | 2021-07-20 |
| CN108471628A (en) | 2018-08-31 |
| CN108471628B (en) | 2021-10-26 |
| CN108521660A (en) | 2018-09-11 |
| CN106792912A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106792912B (en) | A kind of improvement method for routing and device based on AODV | |
| Ho et al. | A ladder diffusion algorithm using ant colony optimization for wireless sensor networks | |
| CN100574252C (en) | Be used for the deployment that topology is upgraded between the mobile router | |
| CN105916183B (en) | Wireless sensor network routing method based on link quality and residual energy | |
| CN104185242B (en) | A kind of wireless Mesh netword channel distribution for reducing interference and route combined optimization system and method | |
| CN102971988A (en) | Alternate down paths for directed acyclic graph (DAG) routing | |
| CN103780499A (en) | Routing table updating | |
| CN101867519B (en) | Dynamic area routing method and system for ad hoc network | |
| CN101127714B (en) | A route management method and device for wireless mesh network | |
| Seyedzadegan et al. | Zero-degree algorithm for internet gateway placement in backbone wireless mesh networks | |
| WO2009038877A1 (en) | Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses | |
| Gutam et al. | Optimal rendezvous points selection and mobile sink trajectory construction for data collection in WSNs | |
| Jain et al. | A route selection approach for variable data transmission in wireless sensor networks | |
| Taj et al. | Signal strength based reliability: a novel routing metric in MANETs | |
| Sharma et al. | Poisson's probability‐based Q‐Routing techniques for message forwarding in opportunistic networks | |
| CN108848030A (en) | Data transmission method and system | |
| CN105049355A (en) | Routing method and device | |
| Shokouhifar et al. | An energy efficient routing protocol in wireless sensor networks using genetic algorithm | |
| Poongkuzhali et al. | An optimized power reactive routing based on AODV protocol for Mobile Ad-hoc network | |
| KR101455505B1 (en) | Energy effective routing method and apparatus in wireless ad-hoc network | |
| Krause et al. | Optimized network structure and routing metric in wireless multihop ad hoc communication | |
| CN112311827A (en) | Intelligent ammeter management system and method | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| Levendovszky et al. | Fading-aware reliable and energy efficient routing in wireless sensor networks |
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: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing Applicant after: State Grid Corporation of China Applicant after: Suzhou Power Co., Ltd. Anhui Power Co., Ltd. Address before: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing Applicant before: State Grid Corporation of China Applicant before: Suzhou Power Supply Company of State Grid Anhui Province Electric Power Company |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |