CN106685819A - AOMDV protocol energy saving method based on node energy division - Google Patents
AOMDV protocol energy saving method based on node energy division Download PDFInfo
- Publication number
- CN106685819A CN106685819A CN201611203615.XA CN201611203615A CN106685819A CN 106685819 A CN106685819 A CN 106685819A CN 201611203615 A CN201611203615 A CN 201611203615A CN 106685819 A CN106685819 A CN 106685819A
- Authority
- CN
- China
- Prior art keywords
- node
- energy
- threshold
- path
- message
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- 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/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an AOMDV protocol energy saving method based on node energy division. According to residual energy of nodes, classification is performed, and a transmission path with relatively-uniform energy is established. A realization scheme is characterized in that when a source node emits a route request message RREQ, the route request message RREQ collects residual energy information passing through the nodes on the way; through the collected information, values of an energy division first threshold and an energy division second threshold are calculated so that all the nodes are divided into three kinds according to the residual energy; and during later data transmission, each node can selectively transmit a data packet to the node with a highest energy type in the neighbor nodes and the node is taken as a next hop so as to form a path with a relatively average energy level. In a previous multipath self-organizing network, node energy consumption is not uniform and survival time is short. By using the method of the invention, the above problems are solved and simultaneously end-to-end time delay is reduced.
Description
Technical field
The invention belongs to communication technical field, more particularly to a kind of AOMDV agreement energy-saving squares divided based on node energy
Method.
Background technology
Network routing protocol is generally divided into two kinds of proactive routing protocol and passive type Routing Protocol.Active Routing Protocol in Active is
On the internet dynamic looks for all-network to router, it is ensured that all-router possesses the agreement of identical routing table.Proactive routing
Agreement is router not automatic searching network, needs manual configuration, once all of router has understood all of network, passively
Routing Protocol just can be used to send user data, is dispatched on interface by internet routed protocol and determination data
The load mode of bag.Proactive routing protocol needs substantial amounts of route test message, and protocol overhead is larger, compared with passive agreement
More resources are consumed, so passive type Routing Protocol is current use, and many one kind must be compared.At present, self-organizing network is passive
Multipath distance vector routing protocol AOMDV as most widely used multipath routing protocols, by obtaining Link-disjoint paths
Or node nonintersecting paths and a plurality of loop free are remaining effectively fault-tolerant and realize the fast quick-recovery of route.But AOMDV agreements do not have
The characteristics of having the limited energy for really considering mobile node, it is impossible to real energy consumption and the dump energy of node according to network
Accomplish the energy ezpenditure for balancing the whole network.In ad hoc networks, node can be computer, mobile phone or sensor, PDA etc.
Equipment, generally battery-powered, finite energy, and the energy constraints of node are the key factors for restricting network lifetime,
The energy pre-mature exhaustion of key node is simultaneously deleted from network, when will affect the operating efficiency of network and reducing the existence of network
Between.
The content of the invention
For the problems referred to above, it is an object of the invention to propose a kind of AOMDV agreement energy-conservations divided based on node energy
Method.This method, so as to form energy level transmission path evenly, has by the way that node is classified according to dump energy
Beneficial to the energy ezpenditure of each node in balance network, so as to extend the life span of network.
For achieving the above object, the technical scheme of the method for the invention is as follows：
The AOMDV agreement power-economizing methods divided based on node energy are planted, is comprised the following steps：
Step one：Source node needs to retrieve itself routing table when sending data；
Step 2：Receive the information in the node processing message of route requests message RREQ；
Step 3：The node for receiving route requests message RREQ judges whether oneself is purpose node；
Step 4：Destination node obtains energy binned first threshold, energy binned Second Threshold and to node-classification；
Step 5：Destination node selects route replies message according to energy binned first threshold, energy binned Second Threshold
The transmission path of RREP；
Step 6：The transmission path of packet is selected according to energy binned first threshold, energy binned Second Threshold.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, source node needs in step one
Itself routing table is retrieved when sending data：
The routing table of nodes includes, destination node IP address, destination node sequence number, broadcast jumping figure and path column
Table, path list includes next-hop, jumping figure, w (u) and marked_node, and wherein w (u) represents the dump energy of node u,
Marked_node is used to record node and whether be reversed path to choose；If next-hop node is by marked_node in current path
Field mark is chosen to be reversed link, then node will not use the path when data are forwarded, so that it is guaranteed that Link-disjoint paths
To remain effectively fault-tolerant and realize the fast quick-recovery of route；
When source node is needed to destination node transmission data, source node first check for whether having in present node routing table to
Up to the path of destination node；
If there is the path for reaching destination node in source node routing table, packet is transmitted to finger according to the routing information
Fixed next-hop node；
If not reaching the path of destination node in routing table, source node broadcasts a route requests message RREQ to it
All neighbors, route requests message RREQ increases extra field on the basis of AOMDV route requests messages：Sum and
The value of P, sum is equal to esum(Pi(u0,un)), wherein Pi(u0,un) it is from source node u0To destination node unAll paths in
I-th paths, esum(Pi(u0,un)) then represent that the dump energy of all nodes is with P is used to record route requests report on this path
The dump energy information of all nodes that literary RREQ is passed through；
Routing table is retrieved in source node, sum values are equal to source node dump energy, and P only possesses the dump energy letter of source node
Breath.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, route is received in step 2 please
Seek the information in the node processing message of message RREQ：
Neighbors is received after route requests message, does following process：
Update the routing table of the neighbors：It is route requests message source section by all next-hops in the neighbors routing table
W (u) in the path of point is updated to the dump energy of route requests message source Nodes；
Update route requests message：The neighbors dump energy is added into field P in route requests message；Please by route
Sum sums before asking field sum in message to be updated to the dump energy of present node and do not update.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, route is received in step 3 please
The node for seeking message RREQ judges whether oneself is purpose node：
If the node for receiving route requests message RREQ checks that the destination address in outgoing packet is not corresponded with Self address,
Check whether there is the path for reaching destination node in the node route list, if having, pass route requests message according to the path
Transport to next-hop node；If no, route requests message is forwarded to into all neighbors of the node in addition to source Nodes,
Until route requests message is sent to into destination node；
If the node for receiving route requests message RREQ checks that the destination address in outgoing packet is consistent with Self address, i.e., should
Receiving node is purpose node, then destination node waits first the time that one section of length is RREQ_Wait_time, so as in this section
All route requests messages are received in time, destination node is by the routing table of the information updating in message to itself；
Now destination node possess from source node reach destination node all path interior joints dump energy information with
Dump energy and information.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, destination node is obtained in step 4
Take energy binned first threshold, energy binned Second Threshold and to node-classification：
Destination node according to the sum values and node total number that receive in all of message draw energy binned first threshold,
Energy binned Second Threshold, specifically obtains in the following manner the value of two parameters：
(1) energy binned first threshold：
Wherein Pi(u0,un) it is from source node u0To destination node unIn all paths in the i-th paths, esum(Pi
(u0,un)) be on this path the dump energy of all nodes and, therefore e can be obtainedsum(P(u0,un)) it is from source node u0To purpose
Node unIn all paths on node dump energy and, energy binned first threshold eaverageNet(P(u0,un)), have：
WhereinIt is from source node u0To destination node unIn all paths on node sum, therefore energy
Amount divides the average residual energy that first threshold is actually this all node；
(2) energy binned Second Threshold：
Destination node receives altogether M route requests message within the RREQ_Wait_time times, and destination node is by all sections
Point sorts from big to small according to its dump energy；
Energy binned Second Threshold is the residual energy value of node residual energy flow control M little in all nodes；
After obtaining energy binned first threshold and energy binned Second Threshold, node is classified, residue energy of node
It is low energy class less than the node of energy binned Second Threshold, dump energy is high energy higher than the node of energy binned first threshold
Amount class, and node of the dump energy between two energy binned threshold values is middle energy class；
Energy binned first threshold is the average residual energy of all nodes in network, therefore any dump energy is higher than energy
Amount divides the node of first threshold and is deemed suitable for that, in the node of transmission, data transfer will be preferentially used.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, destination node root in step 5
The transmission path of route replies message RREP is selected according to energy binned first threshold, energy binned Second Threshold：
Destination node to source node sends a route replies message, and route replies message carries energy binned first threshold
With energy binned Second Threshold, while in transmitting procedure by route replies message reach node dump energy update to route
In response message next-hop node, so as to help the dump energy of node updates itself neighbors；
During forwarding route replies message, node can according to node type, by RREP messages be forwarded to node type with it is current
Node type identical node；If the type of all adjacent nodes is differed with the type of present node, Selective type is most
It is low but forwarded higher than the node of present node type；If not higher than present node type neighbors, select surplus
Type highest node in remaining node；
Each intermediate node repeats this process until route replies message reaches source node, first road of source node reception
During by response message RREP, the time that one section of length is RREP_Wait_time is waited, during this period of time to receive all roads
By response message, so that it is determined that there is the path for reaching destination node, and then to destination node transmission data.
Further according to the AOMDV agreement power-economizing methods divided based on node energy, drawn according to energy in step 6
First threshold, energy binned Second Threshold is divided to select the transmission path of packet：
Source node is received after route replies message, and source node will be acquired up to the node on all paths of destination node more
The new dump energy crossed, when source node needs any one in transmission packet to these nodes, the class of path interior joint
Type is, it is known that the selection of transmission paths of packet can reach next-hop dump energy type highest in the path of destination node
Forwarded, all intermediate nodes equally select next-hop dump energy type highest in the path for can reach destination node
Forwarded, until packet reaches destination node.
The present invention compared with prior art, has the advantages that：
1. the present invention to node by classifying, it is established that the average transmission path of energy level, so as to effective
The quality of transmission is improved, time delay end to end is effectively improved while reducing energy ezpenditure.
2. the transmission path of higher energy level will be used preferentially, so as to the consumption of the equilibrium energy effectively in the whole network.
The transmission path of high-energy will be used to transmit more data, and low-energy path then participates in as few as possible transmission.From
And avoid the energy of low-energy node pre-mature exhaustion itself and deleted from network, cause network topology structure to occur acute
Strong change, so as to the life span for effectively increasing the life span of each node so as to extend whole network.
Description of the drawings
Fig. 1 is a kind of AOMDV agreement power-economizing methods divided based on node energy of the present invention；
Fig. 2 is improved route table items structure in method for routing of the present invention；
Values of the Fig. 3 by parameter in the actually active emulation experiment for carrying out of the checking present invention；
Fig. 4 is the relation of the nodes with simulated time of the depleted of energy of the different method for routing obtained in emulation experiment；
Fig. 5 is the relation of the energy ezpenditure with simulated time of the different method for routing obtained in emulation experiment；
Fig. 6 be the different method for routing that obtain in emulation experiment node motion speed for (0,2.5] in the case of it is different
The relation of number of nodes and average end-to-end time delay；
Fig. 7 be the different method for routing that obtain in emulation experiment node motion speed for (2.5,5] in the case of it is different
The relation of number of nodes and average end-to-end time delay.
Specific embodiment
To make the objects, technical solutions and advantages of the present invention become more apparent, below in conjunction with accompanying drawing to of the present invention
Scheme and effect are described in further detail.
A kind of AOMDV agreement power-economizing methods divided based on node energy of the present invention, are comprised the following steps：
Step one：Source node needs to retrieve itself routing table when sending data.
The router-table structure of nodes is as shown in Fig. 2 wherein w (u) represents the dump energy of node u, marked_
Node is used to record node and whether be reversed path to choose.If next-hop node is by marked_node field marks in current path
Choose to be reversed link, then node will not use the path when data are forwarded, so that it is guaranteed that Link-disjoint paths are maintaining
The effectively fault-tolerant and fast quick-recovery of realization route.
When a certain source node is needed to destination node transmission data, source node first check for be in present node routing table
It is no to have the path for reaching destination node.
(1) if there is the path for reaching destination node in source node routing table, packet is passed according to the routing information
Transport to the next-hop node specified.
(2) if not reaching the path of destination node in routing table, source node broadcasts a route requests message
All neighbors of RREQ to it.Route requests message RREQ increases extra word on the basis of AOMDV route requests messages
Section：Sum and P.The value of sum is equal to esum(Pi(u0,un)), wherein Pi(u0,un) it is from source node u0To destination node unIt is all
The i-th paths in path.esum(Pi(u0,un)) then represent on this path the dump energy of all nodes and.P is used to record road
The dump energy information of all nodes passed through by request message (RREQ).Routing table is retrieved in source node, sum values are saved equal to source
Point dump energy, P only possesses the dump energy information of source node.
Step 2：Receive the information in the node processing message of route requests message RREQ.
Neighbors is received after route requests message, does following process：
(1) routing table of the neighbors is updated：All next-hops in the neighbors routing table are come for route requests message
W (u) in the path of source node is updated to the dump energy of route requests message source Nodes.
(2) route requests message is updated：The neighbors dump energy is added into field P in route requests message；By road
Sum sums before being updated to the dump energy of present node and do not updated by field sum in request message.
Step 3：The node for receiving route requests message RREQ judges whether oneself is purpose node.
(1) if receiving node checks that the destination address in outgoing packet is not corresponded with Self address, the node-routing is checked
Whether the path that reach destination node is had in table.If having, according to the path by route requests message transmissions to next-hop node；
If no, route requests message is forwarded to into all neighbors of the node in addition to source Nodes, until by route requests
Message is sent to destination node.
(2) if receiving node checks that the destination address in outgoing packet is consistent with Self address, i.e., for the purpose of the receiving node
Node, then destination node wait first one section of length be RREQ_Wait_time time, it is all during this period of time to receive
Route requests message, destination node is by the routing table of the information updating in message to itself.Now destination node possesses from source
Node reaches the dump energy information and dump energy and information of all path interior joints of destination node.
Step 4：Destination node obtains energy binned first threshold, energy binned Second Threshold and to node-classification.
Destination node according to the sum values and node total number that receive in all of message draw energy binned first threshold,
Energy binned Second Threshold.The value of two parameters is specifically obtained in the following manner：
(1) energy binned first threshold：
Wherein Pi(u0,un) it is from source node u0To destination node unIn all paths in the i-th paths.esum(Pi
(u0,un)) be on this path the dump energy of all nodes and, therefore e can be obtainedsum(P(u0,un)) it is from source node u0To purpose
Node unIn all paths on node dump energy and.Energy binned first threshold eaverageNet(P(u0,un)), have：
WhereinIt is from source node u0To destination node unIn all paths on node sum, therefore energy
Amount divides the average residual energy that first threshold is actually this all node.
(2) energy binned Second Threshold：
Destination node receives altogether M route requests message within the RREQ_Wait_time times, and destination node is by all sections
Point sorts from big to small according to its dump energy.
The residual energy value of residual energy flow control M little node in energy binned Second Threshold=all nodes.
After obtaining energy binned first threshold and energy binned Second Threshold, node is classified, residue energy of node
It is low energy class less than the node of energy binned Second Threshold, dump energy is high energy higher than the node of energy binned first threshold
Amount class, and node of the dump energy between two energy binned threshold values is middle energy class.Energy binned first threshold is network
In all nodes average residual energy, therefore any dump energy is considered as suitable higher than the node of energy binned first threshold
Together in the node of transmission, data transfer will be preferentially used.
Step 5：Destination node selects route replies message according to energy binned first threshold, energy binned Second Threshold
The transmission path of RREP.
Destination node to source node sends a route replies message, and route replies message carries energy binned first threshold
With energy binned Second Threshold, while in transmitting procedure by route replies message reach node dump energy update to route
In response message next-hop node, so as to help the dump energy of node updates itself neighbors.During forwarding route replies message,
RREP messages can be forwarded to node type and present node type identical node by node according to node type.If all
The type of adjacent node is differed with the type of present node, then Selective type is minimum but higher than the node of present node type
Forwarded；If not higher than present node type neighbors, type highest node in remaining node is selected.Often
One intermediate node repeats this process until route replies message reaches source node, source node first route replies message of reception
During RREP, the time that one section of length is RREP_Wait_time is waited, during this period of time to receive all route replies messages,
So that it is determined that there is the path for reaching destination node, and then to destination node transmission data.
Step 6：The transmission path of packet is selected according to energy binned first threshold, energy binned Second Threshold.
Source node is received after route replies message, and source node will be acquired up to the node on all paths of destination node more
The new dump energy crossed, when source node needs any one in transmission packet to these nodes, the class of path interior joint
Type is, it is known that the selection of transmission paths of packet can reach next-hop dump energy type highest in the path of destination node
Forwarded, all intermediate nodes equally select next-hop dump energy type highest in the path for can reach destination node
Forwarded, until packet reaches destination node.
The above is only and the preferred embodiment of the present invention is described, be not limited to technical scheme
This, any known deformation that those skilled in the art are made on the basis of the major technique design of the present invention belongs to the present invention
Claimed technology category, the specific protection domain of the present invention is defined by the record of claims.
The effect of the present invention can be further illustrated by following simulated experiment：
1. experiment condition
This experiment is estimated using network simulator ns-2 to method for routing of the present invention, and each simulator runs
The time of 300 seconds.Every time constant bit rate is produced in simulation, 4 sizes of transport per second are the packet of 512 bytes.
The value of RREQ_Wait_Time and RREP_Wait_Time is disposed as 1.0 seconds, identical with the parameter in AOMDV.
The different network node quantity used in one 840 × 840 meters of environment from 30 to 190 is simulated to obtain not
Same scene.Carry out the motion of analog node using random walk point model, each node motion speed is selected at random from 0 to 5 meter per seconds
Select.Similar to the WaveLAN of commercial wireless interface Lucent, a kind of bit rate is 2Mbit/s to the feature that radio model is used, extensively
The shared media broadcast that scope is 250 meters is broadcast, meets the standard of IEEE 802.11.The acquisition of performance indications is random at one
The dry run of average more than 20 times between the source node and destination node of selection is obtained.Assume node work(in acceptance or transmission
Rate is 281.8mW.Due to reaching in the state of energy resource consumption is idle or excessive without real node energy optimization,
So not considering the idle or excessive state of energy resource consumption in simulation process.In simulations, random initializtion node makes node
Energy be uniformly distributed between 10 to 60 joules.Analog parameter value is as shown in Figure 3.
2. experiment content
Road of the present invention is assessed with AOMDV and ZD-AOMDV Routing Protocols by method for routing relatively more of the present invention
By the performance of method.This is because AOMDV has proven to a kind of healthy and strong Routing Protocol and in most of simulated scenarios
In show more preferably, and select ZD-AOMDV be then because that it is intended to improve the life span of self-organizing network, while also with this
Inventing the method for routing has identical feature, i.e. reactivity, the characteristic of multipath, and using AOMDV as basic agreement.
The nodes and simulated time of depleted of energy of three kinds of different method for routing when network node quantity is equal to 190
Relation as shown in figure 4, under identical duration, the number of nodes of depleted of energy node is less than under method for routing of the present invention
AOMDV and ZD-AOMDV agreements.
Fig. 5 shows method for routing of the present invention, when the energy consumption status of ZD-AOMDV, AOMDV agreement are with simulating
Long relation.Method for routing of the present invention is for relative two other agreement of incipient stage energy consumption of simulation and bad, but
Subsequently it is improved.Although it is unlike ZD-AOMDV, AOMDV is good, because now most of data not yet send, this
When the gross energy that consumed of the packet that sends and receives it is unimportant.In latter stage, increase over time, some sections
The energy imbalance of point starts to occur, and the starting of method for routing of the present invention embodies advantage.Can see, road of the present invention
The energy consumed by method is less than ZD-AOMDV and AOMDV.
Fig. 6 and Fig. 7 show the contrast of the average end-to-end time delay of three kinds of agreements.With the continuous expansion of network size,
The average end-to-end delay of three kinds of agreements increased, but the average end-to-end delay of method for routing of the present invention is less than
ZD-AOMDV and AOMDV.It is visible in Fig. 6 and Fig. 7, when node quantity be less than 70 when, using same paths in the case of ZD-
The average end-to-end time delay of AOMDV agreements is slightly better than method for routing of the present invention.Once and the increase of network size, the present invention
The method for routing more preferable time delay performance for which type of node speed all will have.
In general, method for routing of the present invention is compared with ZD-AOMDV with AOMDV agreements and more effectively reduces energy
The quantity of the node that amount exhausts.Simultaneously because method for routing of the present invention selects the higher section of energy when transmission path is set up
Point is transmitted, and so as to effectively raise transmission quality, reduces average end-to-end time delay.Method for routing energy of the present invention
Enough node life span is effectively extended by the energy ezpenditure of all nodes in reducing energy consumption and balance network, it is whole so as to extend
The life span of individual network.At the same time method for routing of the present invention can also reduce end-to-end time delay, improve data transfer
Quality.
It is above-mentioned to be only intended to clearly illustrate example of the present invention, not to the restriction of embodiment.For affiliated
For the those of ordinary skill in field, the change or variation of other multi-forms can also be made on the basis of the above description.
There is no need to be exhaustive to all of embodiment, and the obvious change thus amplified out or change still
Among protection scope of the present invention.
Claims (7)
1. it is a kind of based on node energy divide AOMDV agreement power-economizing methods, it is characterised in that comprise the following steps：
Step one：Source node needs to retrieve itself routing table when sending data；
Step 2：Receive the information in the node processing message of route requests message RREQ；
Step 3：The node for receiving route requests message RREQ judges whether oneself is purpose node；
Step 4：Destination node obtains energy binned first threshold, energy binned Second Threshold and to node-classification；
Step 5：Destination node selects route replies message RREP according to energy binned first threshold, energy binned Second Threshold
Transmission path；
Step 6：The transmission path of packet is selected according to energy binned first threshold, energy binned Second Threshold.
2. the AOMDV agreement power-economizing methods for being divided based on node energy according to claim 1, it is characterised in that step one
Middle source node needs to retrieve itself routing table when sending data：
The routing table of nodes includes, destination node IP address, destination node sequence number, broadcast jumping figure and path list,
Path list includes next-hop, jumping figure, w (u) and marked_node, and wherein w (u) represents the dump energy of node u, marked_
Node is used to record node and whether be reversed path to choose；If next-hop node is by marked_node field marks in current path
Choose to be reversed link, then node will not use the path when data are forwarded, so that it is guaranteed that Link-disjoint paths are maintaining
The effectively fault-tolerant and fast quick-recovery of realization route；
When source node is needed to destination node transmission data, source node first checks for whether having arrival mesh in present node routing table
Node path；
If there is the path for reaching destination node in source node routing table, packet is transmitted to specified according to the routing information
Next-hop node；
If not reaching the path of destination node in routing table, source node broadcasts the institute of a route requests message RREQ to it
There is neighbors, route requests message RREQ increases extra field on the basis of AOMDV route requests messages：Sum and P, sum
Value be equal to esum(Pi(u0,un)), wherein Pi(u0,un) it is from source node u0To destination node unAll paths in i-th
Path, esum(Pi(u0,un)) then represent that the dump energy of all nodes is with P is used to record route requests message on this path
The dump energy information of all nodes that RREQ is passed through；
Routing table is retrieved in source node, sum values are equal to source node dump energy, and P only possesses the dump energy information of source node.
3. it is according to claim 1 or claim 2 based on node energy divide AOMDV agreement power-economizing methods, it is characterised in that step
The information in the node processing message of route requests message RREQ is received in two：
Neighbors is received after route requests message, does following process：
Update the routing table of the neighbors：It is route requests message source Nodes by all next-hops in the neighbors routing table
W (u) in path is updated to the dump energy of route requests message source Nodes；
Update route requests message：The neighbors dump energy is added into field P in route requests message；By route requests report
Field sum in text be updated to the dump energy of present node with do not update before sum sums.
4. the AOMDV agreement power-economizing methods for being divided based on node energy according to any one of claim 1-3, its feature is existed
In the node that route requests message RREQ is received in step 3 judges whether oneself is purpose node：
If the node for receiving route requests message RREQ checks that the destination address in outgoing packet is not corresponded with Self address, check
Whether have in the node route list reach destination node path, if having, according to the path by route requests message transmissions extremely
Next-hop node；If no, route requests message is forwarded to into all neighbors of the node in addition to source Nodes, until
Route requests message is sent to into destination node；
If the node for receiving route requests message RREQ checks that the destination address in outgoing packet is consistent with Self address, i.e. the reception
Node is purpose node, then destination node waits first the time that one section of length is RREQ_Wait_time, so as in this period
All route requests messages are inside received, destination node is by the routing table of the information updating in message to itself；
Now destination node possesses the dump energy information and residue of all path interior joints from source node arrival destination node
Energy and information.
5. the AOMDV agreement power-economizing methods for being divided based on node energy according to any one of claim 1-4, its feature is existed
In destination node obtains energy binned first threshold, energy binned Second Threshold and to node-classification in step 4：
Destination node draws energy binned first threshold, energy according to the sum values and node total number that receive in all of message
Second Threshold is divided, the value of two parameters is specifically obtained in the following manner：
(1) energy binned first threshold：
Wherein Pi(u0,un) it is from source node u0To destination node unIn all paths in the i-th paths, esum(Pi(u0,
un)) be on this path the dump energy of all nodes and, therefore e can be obtainedsum(P(u0,un)) it is from source node u0To destination node
unIn all paths on node dump energy and, energy binned first threshold eaverageNet(P(u0,un)), have：
WhereinIt is from source node u0To destination node unIn all paths on node sum, therefore energy draw
Point first threshold is actually the average residual energy of this all node；
(2) energy binned Second Threshold：
Destination node receives altogether M route requests message within the RREQ_Wait_time times, and destination node presses all nodes
Sort from big to small according to its dump energy；
Energy binned Second Threshold is the residual energy value of node residual energy flow control M little in all nodes；
After obtaining energy binned first threshold and energy binned Second Threshold, node is classified, residue energy of node is less than
The node of energy binned Second Threshold is low energy class, and dump energy is high-energy higher than the node of energy binned first threshold
Class, and node of the dump energy between two energy binned threshold values is middle energy class；
Energy binned first threshold is the average residual energy of all nodes in network, therefore any dump energy is higher than energy stroke
The node of point first threshold is deemed suitable in the node of transmission, will be preferentially used data transfer.
6. the AOMDV agreement power-economizing methods for being divided based on node energy according to any one of claim 1-5, its feature is existed
In destination node selects route replies message RREP according to energy binned first threshold, energy binned Second Threshold in step 5
Transmission path：
Destination node to source node sends a route replies message, and route replies message carries energy binned first threshold and energy
Amount divides Second Threshold, while the dump energy that route replies message reaches node is updated to route replies in transmitting procedure
In message next-hop node, so as to help the dump energy of node updates itself neighbors；
During forwarding route replies message, RREP messages can be forwarded to node type and present node by node according to node type
Type identical node；If the type of all adjacent nodes is differed with the type of present node, Selective type it is minimum but
Forwarded higher than the node of present node type；If not higher than present node type neighbors, remaining section is selected
Type highest node in point；
Each intermediate node repeats this process until route replies message arrival source node, source node receives first route should
When answering message RREP, the time that one section of length is RREP_Wait_time is waited, should during this period of time to receive all routes
Message is answered, so that it is determined that there is the path for reaching destination node, and then to destination node transmission data.
7. the AOMDV agreement power-economizing methods for being divided based on node energy according to any one of claim 1-6, its feature is existed
According to energy binned first threshold, the transmission path of energy binned Second Threshold selection packet in step 6：
Source node is received after route replies message, and source node will be acquired up to the node updates mistake on all paths of destination node
Dump energy, when source node needs any one in transmission packet to these nodes, the type of path interior joint is equal
, it is known that the selection of transmission paths of packet can reach next-hop dump energy type highest in the path of destination node carrying out
Forwarding, all intermediate nodes equally select next-hop dump energy type highest in the path for can reach destination node to carry out
Forwarding, until packet reaches destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611203615.XA CN106685819B (en) | 2016-12-23 | 2016-12-23 | A kind of AOMDV agreement power-economizing method divided based on node energy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611203615.XA CN106685819B (en) | 2016-12-23 | 2016-12-23 | A kind of AOMDV agreement power-economizing method divided based on node energy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106685819A true CN106685819A (en) | 2017-05-17 |
| CN106685819B CN106685819B (en) | 2019-05-31 |
Family
ID=58870143
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611203615.XA Active CN106685819B (en) | 2016-12-23 | 2016-12-23 | A kind of AOMDV agreement power-economizing method divided based on node energy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106685819B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449271A (en) * | 2018-04-13 | 2018-08-24 | 吉林大学 | A kind of method for routing of monitoring path node energy and queue length |
| CN109788522A (en) * | 2019-02-14 | 2019-05-21 | 中国联合网络通信集团有限公司 | A kind of routing discovering method, device |
| CN113382416A (en) * | 2021-05-31 | 2021-09-10 | 兰州交通大学 | Method, device and equipment for optimizing data path of wireless sensor network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
| CN104010338A (en) * | 2014-05-13 | 2014-08-27 | 南京邮电大学 | Improved AODV routing method based on terminal energy sensing |
| CN104023367A (en) * | 2014-06-17 | 2014-09-03 | 河海大学 | Directed diffusion protocol based on visual path and promoted evaluation criterion |
-
2016
- 2016-12-23 CN CN201611203615.XA patent/CN106685819B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
| CN104010338A (en) * | 2014-05-13 | 2014-08-27 | 南京邮电大学 | Improved AODV routing method based on terminal energy sensing |
| CN104023367A (en) * | 2014-06-17 | 2014-09-03 | 河海大学 | Directed diffusion protocol based on visual path and promoted evaluation criterion |
Non-Patent Citations (2)
| Title |
|---|
| BHAVNA SHARMA，等: ""Energy efficient load balancing approach to improve AOMDV routing in MANET"", 《2014 FOURTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES》 * |
| 胡平，等: ""基于能量均衡的AOMDV路由协议的改进"", 《计算机工程与设计 2011年09期》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108449271A (en) * | 2018-04-13 | 2018-08-24 | 吉林大学 | A kind of method for routing of monitoring path node energy and queue length |
| CN109788522A (en) * | 2019-02-14 | 2019-05-21 | 中国联合网络通信集团有限公司 | A kind of routing discovering method, device |
| CN113382416A (en) * | 2021-05-31 | 2021-09-10 | 兰州交通大学 | Method, device and equipment for optimizing data path of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106685819B (en) | 2019-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gaddour et al. | Quality-of-service aware routing for static and mobile IPv6-based low-power and lossy sensor networks using RPL | |
| CN101980565B (en) | QoS-based Ad Hoc network adaptive node speed multi-path routing method | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| De Rango et al. | OLSR vs DSR: A comparative analysis of proactive and reactive mechanisms from an energetic point of view in wireless ad hoc networks | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| Tareq et al. | Mobile ad hoc network energy cost algorithm based on artificial bee colony | |
| CN105848238B (en) | Wireless sensor network IPv6 method for routing based on multi-parameter | |
| Rajput et al. | Comparison of ad-hoc reactive routing protocols using opnet modeler | |
| Ali et al. | An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks | |
| CN105916183A (en) | Wireless sensor network routing method based on link quality and residual energy | |
| Mahmud et al. | Energy efficient routing for Internet of Things (IoT) applications | |
| Zhang et al. | An efficient hop count routing protocol for wireless ad hoc networks | |
| Nassiri et al. | Energy-aware and load-balanced parent selection in RPL routing for wireless sensor networks | |
| CN106685819B (en) | A kind of AOMDV agreement power-economizing method divided based on node energy | |
| Tabatabaei et al. | Fuzzy-based routing protocol to increase throughput in mobile ad hoc networks | |
| Sasidharan et al. | Improving network lifetime and reliability for machine type communications based on LOADng routing protocol | |
| Parthiban et al. | Maximizing the network life time based on energy efficient routing in ad hoc networks | |
| Lodhi et al. | Transient Multipath routing protocol for low power and lossy networks. | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Sadat et al. | A trade-off between reliability and energy efficiency for inter-cluster communication in wireless sensor networks | |
| Singh et al. | Optimization of Routing Protocol in MANET using GA | |
| Steenbrink | Routing in the Internet of Things | |
| Wane et al. | Effect of propagation models on energy consumption of MANET | |
| Fei et al. | Lifetime and latency aware data collection based on k-tree | |
| KR102199577B1 (en) | Node and method for routing in heterogeneous traffic wireless sensor network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information |
Inventor after: Yang Pengji Inventor after: Wang Zhihan Inventor after: Liu Tao Inventor after: Liu Yupeng Inventor before: Yang Pengji Inventor before: Liu Tao Inventor before: Liu Yupeng |
|
| CB03 | Change of inventor or designer information |