CN108521660B - Route updating method with balanced energy - Google Patents
Route updating method with balanced energy Download PDFInfo
- Publication number
- CN108521660B CN108521660B CN201810303883.1A CN201810303883A CN108521660B CN 108521660 B CN108521660 B CN 108521660B CN 201810303883 A CN201810303883 A CN 201810303883A CN 108521660 B CN108521660 B CN 108521660B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- current node
- optimal route
- electric quantity
- 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 29
- 230000005540 biological transmission Effects 0.000 description 14
- 238000005265 energy consumption Methods 0.000 description 10
- 235000008694 Humulus lupulus Nutrition 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
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 an energy-balanced route updating method, wherein a current node receives a route updating request sent by a network center node and marks turns; the current node judges whether the route updating request is received for the first time; if yes, setting hop count of the optimal route of the topological layer number and minimum electric quantity of the optimal route, emptying a route table, and if not, updating the topological layer number; if not, judging whether a routing item of which the next hop is a source node of the broadcast route updating request exists in the routing table, recording the broadcast same-round route updating request according to the topological layer number of the current node and the optimal route, and returning to repeatedly execute the current node to judge whether the route updating request is received for the first time, wherein the load balance of the whole network is ensured by applying the embodiment of the invention; and the energy balance routing algorithm can avoid the limitation of the packet length limitation on the network topology depth.
Description
The application is a divisional application with application number of 201710025774.3 (application date of 2017, 1 month and 13 days).
Technical Field
The invention relates to the technical field of wireless network routing algorithms, in particular to a routing updating method with balanced energy.
Background
In a wireless network, each node needs to transmit its own data and also needs to take on the role of forwarding data of other nodes, which may cause inconsistent rate of power consumption of each node. The running time of the entire network topology depends on the operating time of the node that first drains its power. Therefore, when constructing the routing structure of the whole network, the power condition of each node on the route is necessarily considered, and the data forwarding tasks of the nodes with the power lower than the average level are reduced as much as possible. In addition, ieee802.15.4 specifies that the length of a data packet should not be greater than 127 bytes during wireless transmission. In the case of an 8-byte 64-bit address format, the data link layer, network layer, and transport layer overhead (including 8-byte source, destination physical addresses, 8-byte source, destination network addresses, 1-byte route residual hop count, 1-byte packet type, 4-byte transmission sequence number, 2-byte check) would take 40 bytes. If a simple AODV routing algorithm is adopted for route exploration, if the RREQ packet needs to add 8-byte address and 4-byte node information of the current node when passing through each node, route exploration within 7 hops can be only carried out. The size of the network topology is even more limited if fixed or dynamic overhead increases due to more complex protocol fields.
The method comprehensively considers the reliability and the power consumption of the path, provides a path cost balance prediction function by excavating the relevance of the energy and the link and combining the problem of the reliability of an effective energy mechanism and the path, and finally obtains a plurality of effective routes which are not intersected with each other, meet the end-to-end reliability requirement and have less energy consumption by taking an optimization function as a routing standard, thereby comprehensively solving the problem of the sorting standard of the path parameter values. The scheme ensures the stability and reliability of the route, reduces the energy consumption of nodes in the network, but does not specifically introduce the estimation of a prediction error for the proposed path cost balance prediction function, only proposes a prediction expression, and the internal prediction details need to be designed and improved. The existing problem that the power consumption rate of the nodes is inconsistent and the problem that the size of the network topology is limited due to the complexity of the protocol field.
Disclosure of Invention
The embodiment of the invention aims to provide an energy-balanced route updating method, which considers the electric quantity condition of each node on a route when constructing a route structure of the whole network, includes the optimal route electric quantity and the current node electric quantity in a route updating request, optimizes the network route through the information and ensures the load balance of the whole network; and the energy balance routing algorithm can avoid the limitation of the packet length limitation on the network topology depth.
In order to achieve the above object, an embodiment of the present invention discloses an energy-balanced route updating method, which is characterized in that a network central node sets an initial route updating request parameter, and specifically includes the following steps
A current node receives a route updating request sent by a network center node, updates the number of topological layers of the current node, the hop count of the optimal route from the current node to the network center node, the minimum electric quantity of the optimal route from the current node to the network center node and the electric quantity of the current node, and marks turns;
the current node judges whether the route updating request is received for the first time;
if so, setting the number of the topological layers of the current node as a first preset value, setting the hop count of the optimal route from the current node to the network center node as a second preset value, setting the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value, and emptying a route table;
if not, a, under the condition that the number of the topology layers in the received updating request is less than the number of the topology layers of the current node after 1 is added, updating the number of the topology layers of the current node;
b. judging whether a routing item of which the next hop is a source node of a broadcast routing update request exists in the routing table, if not, adding the routing item according to the information in the routing update request; if yes, updating the routing item according to the maximum minimum electric quantity of the optimal route and the minimum hop count when the minimum electric quantity of the optimal route is equal, and updating the routing record;
and under the conditions that the number of topological layers of the current node is updated, the current optimal route provides the same minimum electric quantity of the optimal route compared with the optimal route before updating, and simultaneously provides a smaller hop count, broadcasting a same-round route updating request according to the number of topological layers of the current node and the optimal route record, and simultaneously returning to the step of repeatedly executing the current node to judge whether the route updating request is received for the first time.
Optionally, the updating the route record includes:
and after the route item is updated, updating the optimal route record according to the rule that the minimum electric quantity of the optimal route is the maximum, the hop count is the minimum when the minimum electric quantity of the optimal route is equal, and the next hop node electric quantity is the maximum when the minimum electric quantity of the optimal route is equal to the hop count.
Optionally, the setting of the number of topology layers of the current node as a first preset value, the setting of the hop count of the optimal route from the current node to the network center node as a second preset value, and the setting of the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value includes:
setting the number of topological layers of the current node as a preset maximum value, setting the hop count of the optimal route from the current node to the network center node as a preset maximum value, and setting the minimum electric quantity of the optimal route from the current node to the network center node as a preset minimum value.
Optionally, the network center node sets an initial route update request parameter, including:
the network center node sets the number of topological layers of a current node to be 0, the hop count of an optimal route from the current node to the network center node to be 0, the minimum electric quantity of the optimal route from the current node to the network center node to be a preset maximum value, and the electric quantity of the current node to be the preset maximum value.
Optionally, the method further includes:
sending a route acquisition request under the condition that a new node joins the network created by the network center node;
determining neighbor nodes of the new node;
and the neighbor node sends the optimal route of the neighbor node to the new node.
Optionally, the determining the neighbor node of the new node includes:
and determining the neighbor nodes of the new node according to a neighbor node searching algorithm.
An improved AODV-based routing apparatus, said apparatus comprising:
the first setting module is used for setting initial route updating request parameters by the network center node;
a sending module, configured to receive, by a current node, a route update request sent by a network center node, where the route update request includes: updating the number of topological layers of the current node, the hop count of the optimal route from the current node to the network center node, the minimum electric quantity of the optimal route from the current node to the network center node and the electric quantity of the current node, and marking turns;
the first judging module is used for judging whether the current node receives the route updating request for the first time;
a second setting module, configured to, if a determination result of the first determining module is yes, set the number of topology layers of the current node as a first preset value, set the hop count of the optimal route from the current node to the network center node as a second preset value, set the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value, and clear a route table;
a second judging module, configured to update the number of topology layers of the current node when determining that, when the judging result of the first judging module is negative, the number of topology layers of the current node is smaller than the number of topology layers of the current node after adding 1 to the number of topology layers in the received update request;
judging whether a routing item of which the next hop is a source node of the broadcast routing update request exists in the routing table, if not, adding the routing item according to the information in the routing update request; if yes, updating the routing item according to the maximum minimum electric quantity of the optimal route and the minimum hop count when the minimum electric quantity of the optimal route is equal, and updating the routing record;
the updating module is used for updating the topological layer number of the current node, and the current optimal route can provide larger minimum electric quantity of the optimal route than the optimal route before updating;
or a minimum amount of power and a smaller number of hops to provide the same optimal route;
or the minimum power and hop count to provide the same optimal route and a larger next hop node power,
broadcasting the same-round route updating request according to the topology layer number of the current node and the optimal route record, and returning to the step of repeatedly executing the current node to judge whether the route updating request is received for the first time.
By applying the embodiment of the invention, the electric quantity condition of each node on the route is considered when the route structure of the whole network is constructed, the route updating request comprises the optimal route electric quantity and the current node electric quantity, and the network route is optimized through the information, so that the load balance of the whole network is ensured. Meanwhile, the energy balance routing algorithm can avoid the limitation of the length of the data packet on the network topology depth. Simulation tests show that the method provided by the invention improves the number of data packet rounds transmitted by the whole network, reduces the average transmission energy consumption of the data packets, and enables all routes to be fully and evenly utilized.
Of course, it is not necessary for any product or method of practicing the invention to achieve all of the above-described advantages at the same time.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of an improved routing method according to an embodiment of the present invention.
Fig. 2 shows the relationship between the number of data transmission rounds and the degree of energy balance.
Fig. 3 is a diagram of the number of data transmission rounds versus the degree of energy balance.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a schematic flow chart of an improved routing method provided by an embodiment of the present invention, which mainly includes the following steps:
and Step 1, the network central node initiates the whole network route updating through a broadcast route updating request.
And Step2, the neighbor node receives the route updating request.
And Step 3, judging whether the route updating request is received for the first time, if so, turning to Step4, and otherwise, turning to Step 5.
And Step4, setting the number of the topological layers of the nodes and the hop count of the optimal route record as maximum values, setting the minimum electric quantity of the optimal route record as minimum values, and clearing the route table.
And Step5, updating the number of the topological layers, the routing table and the optimal routing record according to the rule.
And Step 6, judging whether the broadcasting conditions are met, if so, turning to Step7, and otherwise, turning to Step 8.
Step 7. construct and broadcast route update record, go to Step 2.
And Step8, finishing the algorithm.
Specifically, based on the foregoing steps, an energy-balanced route updating method is provided, where the method includes the steps of:
s101, a current node receives a route updating request sent by a network center node, wherein the route updating request comprises: and updating the number of topological layers of the current node, the hop count of the optimal route from the current node to the network center node, the minimum electric quantity of the optimal route from the current node to the network center node and the electric quantity of the current node, and marking the turn.
The network center node sets initial route update request parameters. The network center node sets the number of topological layers of a current node to be 0, the hop count of an optimal route from the current node to the network center node to be 0, the minimum electric quantity of the optimal route from the current node to the network center node to be a preset maximum value, and the electric quantity of the current node to be the preset maximum value. The preset maximum value of the electric quantity of the node is larger than the maximum value of the electric quantity owned by the node in the network, and the parameter is set according to the actual situation.
S102, judging whether the current node receives the route updating request for the first time; if yes, executing S103; if not, S104 is executed.
When the current node receives the route updating request every time, judging whether the route updating request is received for the first time of the round, if so, executing S103; if not, S104 is executed.
S103, setting the number of topological layers of the current node as a first preset value, setting the hop count of the optimal route from the current node to the network center node as a second preset value, setting the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value, and emptying a route table.
Further, the number of topological layers of the current node is set to be a preset maximum value, the hop count of the optimal route from the current node to the network center node is set to be a preset maximum value, and the minimum electric quantity of the optimal route from the current node to the network center node is set to be a preset minimum value. The preset maximum value of the topological layer number of the node is greater than the maximum hop value from the node to the central node in the network, and the parameter is set according to the actual condition; the preset maximum value of the node routing hop number is larger than the maximum hop number of all the nodes in the network, and the parameter is set according to the actual condition; the preset minimum value of the node power is generally set to 0.
S104, a, under the condition that the number of the topology layers in the received updating request is smaller than the number of the topology layers of the current node after 1 is added, updating the number of the topology layers of the current node;
b. judging whether a routing item of which the next hop is a source node of a broadcast routing update request exists in the routing table, if not, adding the routing item according to the information in the routing update request; if yes, updating the route item according to the maximum minimum electric quantity of the optimal route and the minimum hop number when the minimum electric quantity of the optimal route is equal, and updating the route record.
Illustratively, if the route update request is not received for the first time, the current node updates the number of topology layers of the current node when it is determined that the number of topology layers in the received update request plus 1 is smaller than the number of topology layers of the current node, for example, the number of topology layers in the update request is 3, the number of topology layers of the current node is 5, and the number of topology layers of the current node is updated since 3+1< 5.
Illustratively, whether a routing entry of which the next hop is a source node of a broadcast routing update request exists in a routing table or not is determined, and the routing entry is added according to information in the routing update request; otherwise, updating the routing item according to the maximum minimum electric quantity of the optimal route and the minimum hop number when the minimum electric quantity of the optimal route is equal.
Further, the optimal route record can be updated according to the rule that the minimum electric quantity of the optimal route is the maximum, the hop count is the minimum when the minimum electric quantity of the optimal route is equal, and the next hop node electric quantity is the maximum when the minimum electric quantity of the optimal route is equal to the hop count after the route item is updated.
S105, when the topological layer number of the current node is updated, the current optimal routing ratio is more optimal routing energy before updating
The optimal route before the current optimal route is updated is used when the topological layer number of the current node is updated
A minimum amount of power to provide a larger optimal route;
or a minimum amount of power to provide the same optimal route, while providing a smaller number of hops;
or under the condition of providing the same minimum electric quantity and the same hop count of the optimal route and providing larger electric quantity of a next hop node, broadcasting the same-round route updating request according to the topological layer number of the current node and the optimal route record, and returning to the step of repeatedly executing the current node to judge whether the route updating request is received for the first time.
In practical application, it needs to determine whether to perform a broadcast route update request, as follows: under the condition that the topological layer number of the current node is updated, the current optimal route can provide larger minimum electric quantity of the optimal route than the optimal route before updating, the same minimum electric quantity and smaller hop count of the optimal route, the same minimum electric quantity and hop count of the optimal route and larger electric quantity of a next hop node, broadcasting a same-turn route updating request, and executing S102; the broadcast is stopped.
Further, the method further comprises: sending a route acquisition request under the condition that a new node joins the network created by the network center node; determining neighbor nodes of the new node; and the neighbor node sends the optimal route of the neighbor node to the new node.
Further, the neighbor node of the new node may be determined according to a neighbor node search algorithm.
During actual wireless transmission, the energy consumption of the transmitted data packet is in accordance with Eτx(l,d)＝l*Eelec+l*εd2The energy consumption of the received data packet is in accordance with Eγx(l,d)＝l*EelecThat is, in the multi-hop transmission process of the data packet, the energy consumed by each node on the route for receiving the data packet is only linearly related to the length of the data packet, and the energy consumed by the route for transmitting is also related to the physical distance between the front point and the rear point in the route besides the linear relationship with the length of the data packet. The simulation experiment aims to verify the balance effect of the energy balance routing algorithm on the electric quantity of the network nodes, and the constructed simulation scene only sets the logic connectivity among the nodes and does not concern the actual physical distance among the nodes and the actual electric quantity consumption value, so that only E is reservedτxThe distance-independent part of (l, d), i.e. Eτx(l,d)＝Eγx(l, d), and quantizing the total electric quantity of the node by taking the unit bit receiving energy consumption as a reference unit.
Fig. 2 is a relationship between the number of data transmission rounds and the energy balance degree, and the simulation compares the operation effects of an AODV (Ad hoc On-demand Distance Vector Routing) algorithm and an improved AODV algorithm, which is also called an energy balance algorithm, for a given network node layout.
The energy balance routing algorithm of the embodiment of the invention aims to avoid the limitation of the length of the data packet on the network topology depth and construct a route for balancing the power consumption of the network according to the current power of each node of the network and the connectivity of the neighbor nodes. The comparison result of the AODV routing algorithm and the energy-balanced routing algorithm is as follows.
The scenario consists of 1 hub node, 60 normal network nodes and 8 segments of obstacles, as shown in fig. 2. The wireless signal propagation is set to be along a straight line, and the propagation distance is 10 unit lengths; the length of the transmitted data packet is 100 bits, the ACK is 50 bits, and the electric quantity of each common network node is set to be 108Unit energy. FIG. 2 is a diagram of the number of data packet rounds and the energy of the data packets transmitted throughout the network before a failed node occurs in the networkRelationship between the degrees of balance.
As can be seen from the figure, in this scenario, after the energy balancing algorithm is adopted, the number of rounds of network transmission of the data packets can be increased to 8 times that of the AODV algorithm, because the energy balancing algorithm avoids those route items passing through nodes with relatively low electric quantity in all the selectable routes, and routes are searched according to the sequence of the total amount of the data packets that can be carried by the routes, so that all the available routes are fully and evenly utilized. But the granularity of energy balance is continuously refined by increasing the route updating frequency, and the effect of energy balance cannot be obviously improved.
Fig. 3 is a graph of a relationship between the number of data transmission rounds and the energy balance degree, and is a graph of a relationship between the average transmission energy consumption of data packets and the energy balance degree before a failure node occurs in a network. As can be seen from the figure, in this scenario, after the energy balance algorithm is adopted, the average transmission energy consumption of the data packet is increased by nearly 50% compared with that of the AODV algorithm, because the network node does not preferentially select the shortest path but preferentially selects the route with the largest and lowest electric quantity when selecting the route, so that the data packet can be transmitted through more nodes, and the average transmission energy consumption is increased. When the route updating frequency is increased and the granularity of energy balance is continuously refined, the multiple selectable routes are switched more frequently, and the average energy consumption increase of transmission does not change obviously.
Based on the embodiment shown in fig. 1, there is provided an AODV-based improved routing apparatus, the apparatus including:
a first setting module 201, configured to set an initial route update request parameter for a network center node;
a sending module 202, configured to receive, by a current node, a route update request sent by a network center node, where the route update request includes: updating the number of topological layers of the current node, the hop count of the optimal route from the current node to the network center node, the minimum electric quantity of the optimal route from the current node to the network center node and the electric quantity of the current node, and marking turns;
a first determining module 203, configured to determine whether the current node receives the route update request for the first time;
a second setting module 204, configured to, if the determination result of the first determining module is yes, set the number of topology layers of the current node as a first preset value, set the hop count of the optimal route from the current node to the network center node as a second preset value, set the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value, and empty a route table;
a second determining module 205, configured to, if the determination result of the first determining module is negative, determine that the number of topology layers in the received update request added by 1 is smaller than the number of topology layers of the current node, update the number of topology layers of the current node;
judging whether a routing item of which the next hop is a source node of the broadcast routing update request exists in the routing table, if not, adding the routing item according to the information in the routing update request; if yes, updating the routing item according to the maximum minimum electric quantity of the optimal route and the minimum hop count when the minimum electric quantity of the optimal route is equal, and updating the routing record;
an updating module 206, configured to update the number of topology layers of the current node, and compare the current optimal route with the optimal route before updating
A minimum amount of power to provide a larger optimal route;
or a minimum amount of power to provide the same optimal route, while providing a smaller number of hops;
or the same minimum power for the optimal route and the same hop count, and a larger next hop node power is provided at the same time,
broadcasting the same-round route updating request according to the topology layer number of the current node and the optimal route record, and returning to the step of repeatedly executing the current node to judge whether the route updating request is received for the first time.
It is to be noted that, in the embodiments of the present invention, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Those skilled in the art will appreciate that all or part of the steps in the above method embodiments may be implemented by a program to instruct relevant hardware to perform the steps, and the program may be stored in a computer-readable storage medium, which is referred to herein as a storage medium, such as: ROM/RAM, magnetic disk, optical disk, etc.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, made within the spirit and principle of the present invention.
Claims (4)
1. A route updating method of energy balance is characterized in that a network center node sets an initial route updating request parameter, and the method specifically comprises the following steps
A current node receives a route updating request sent by a network center node, updates the number of topological layers of the current node, the hop count of the optimal route from the current node to the network center node, the minimum electric quantity of the optimal route from the current node to the network center node and the electric quantity of the current node, and marks turns;
the current node judges whether the route updating request is received for the first time;
if so, setting the number of topological layers of the current node as a first preset value, setting the hop count of the optimal route from the current node to the network center node as a second preset value, setting the minimum electric quantity of the optimal route from the current node to the network center node as a third preset value, and emptying a route table, wherein the first preset value adopts a preset maximum value, the second preset value adopts a preset maximum value, and the third preset value adopts a preset minimum value;
if not, a, under the condition that the number of the topology layers in the received updating request is less than the number of the topology layers of the current node after 1 is added, updating the number of the topology layers of the current node;
b. judging whether a routing item of which the next hop is a source node of a broadcast routing update request exists in the routing table, if not, adding the routing item according to the information in the routing update request; if yes, updating the routing item according to the maximum minimum electric quantity of the optimal route and the minimum hop count when the minimum electric quantity of the optimal route is equal, and updating the routing record;
under the conditions that the number of topological layers of the current node is updated, the current optimal route provides the same minimum electric quantity of the optimal route compared with the optimal route before updating, and simultaneously provides smaller hop count, broadcasting a same-round route updating request according to the number of topological layers of the current node and the optimal route record, and simultaneously returning to the step of repeatedly executing the current node to judge whether the route updating request is received for the first time;
the updating the route record comprises:
and after the route item is updated, updating the optimal route record according to the rule that the minimum electric quantity of the optimal route is the maximum, the hop count is the minimum when the minimum electric quantity of the optimal route is equal, and the next hop node electric quantity is the maximum when the minimum electric quantity of the optimal route is equal to the hop count.
2. The energy-balanced route update method according to claim 1, wherein the network central node sets an initial route update request parameter, and includes:
the network center node sets the number of topological layers of a current node to be 0, the hop count of an optimal route from the current node to the network center node to be 0, the minimum electric quantity of the optimal route from the current node to the network center node to be a preset maximum value, and the electric quantity of the current node to be the preset maximum value.
3. The energy-balanced route update method according to claim 1, further comprising:
sending a route acquisition request under the condition that a new node joins the network created by the network center node;
determining neighbor nodes of the new node;
and the neighbor node sends the optimal route of the neighbor node to the new node.
4. The energy-balanced route update method according to claim 3, wherein the determining the neighbor nodes of the new node comprises:
and determining the neighbor nodes of the new node according to a neighbor node searching algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810303883.1A CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810303883.1A CN108521660B (en) | 2017-01-13 | 2017-01-13 | Route updating method with balanced energy |
| CN201710025774.3A CN106792912B (en) | 2017-01-13 | 2017-01-13 | A kind of improvement method for routing and device based on AODV |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710025774.3A Division CN106792912B (en) | 2017-01-13 | 2017-01-13 | A kind of improvement method for routing and device based on AODV |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108521660A CN108521660A (en) | 2018-09-11 |
| CN108521660B true CN108521660B (en) | 2021-07-20 |
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 After (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| 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 |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN108521660B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108521660B (en) * | 2017-01-13 | 2021-07-20 | 国家电网公司 | Route updating method with balanced energy |
| 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 |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| CN102413538A (en) * | 2011-12-02 | 2012-04-11 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| CN103607352A (en) * | 2013-11-22 | 2014-02-26 | 上海电机学院 | Multicast routing method based on network topology |
| CN106792912B (en) * | 2017-01-13 | 2018-06-19 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4535661B2 (en) * | 2002-03-18 | 2010-09-01 | 日本電気株式会社 | Transmission node, relay node and communication system in wireless multi-hop network |
| 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 |
| CN101489293B (en) * | 2009-02-27 | 2011-05-11 | 重庆邮电大学 | Wireless sensor network routing scheduling method based on energy consumption balance policy |
| CN101562862B (en) * | 2009-05-15 | 2010-09-29 | 湖南大学 | Routing method for balancing energy of wireless sensor network |
| CN103582065A (en) * | 2012-07-31 | 2014-02-12 | 中国科学技术大学苏州研究院 | Efficient ad hoc network routing method for wireless sensor network |
| 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 |
| CN105764108B (en) * | 2016-03-25 | 2019-02-15 | 重庆邮电大学 | A kind of weight hop count method for routing of the industry wireless network of balancing 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 |
|---|---|---|---|---|
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| CN102413538A (en) * | 2011-12-02 | 2012-04-11 | 上海交通大学 | Route improving method based on AODV (ad hoc on-demand distance vector) and considering delay energy saving |
| CN103607352A (en) * | 2013-11-22 | 2014-02-26 | 上海电机学院 | Multicast routing method based on network topology |
| CN106792912B (en) * | 2017-01-13 | 2018-06-19 | 国家电网公司 | A kind of improvement method for routing and device based on AODV |
Non-Patent Citations (1)
| Title |
|---|
| 面向工业无线网络WIA-PA的路由技术研究;易秀双;《中国博士学位论文全文数据库信息科技辑2015年第7期》;20150715;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108471628A (en) | 2018-08-31 |
| CN106792912A (en) | 2017-05-31 |
| CN108521660A (en) | 2018-09-11 |
| CN108471628B (en) | 2021-10-26 |
| CN106792912B (en) | 2018-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108521660B (en) | Route updating method with balanced energy | |
| US6990075B2 (en) | Scalable unidirectional routing with zone routing protocol extensions for mobile AD-HOC networks | |
| JP6485671B2 (en) | Resource-aware multitask routing in multi-hop heterogeneous wireless networks | |
| US9325626B2 (en) | Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks | |
| CN107431970B (en) | Method for routing packets, multi-hop wireless network and node for routing packets | |
| CN101133595B (en) | Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network | |
| CN105916183B (en) | Wireless sensor network routing method based on link quality and residual energy | |
| EP2198571B1 (en) | Method and apparatus for network routing between a tactical network and a satellite network | |
| WO2009038877A1 (en) | Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses | |
| CN106161237B (en) | Centralized routing method, device and system | |
| CN103780499A (en) | Routing table updating | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Gnana Prakasi et al. | Decision tree based routing protocol (DTRP) for reliable path in MANET | |
| Jain et al. | A route selection approach for variable data transmission in wireless sensor networks | |
| Ramalakshmi et al. | Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | |
| Abolhasan et al. | LPAR: an adaptive routing strategy for MANETs | |
| CN102573000A (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN106792980B (en) | Joint routing metric and partially overlapping channel allocation method | |
| Zhou et al. | A bidirectional Q-learning routing protocol for UAV networks | |
| CN109104371B (en) | Method for optimizing transmission route of Internet of things based on communication overhead | |
| CN114900255B (en) | Near-surface wireless network link gradient field construction method based on link potential energy | |
| Mhatre et al. | Performance analysis of prediction and priority based routing protocol for MANET's | |
| Kumar et al. | An enhancement of dynamic source routing by efficient load balancing in wireless ad hoc networks | |
| Rahman et al. | An improved position based power aware routing algorithm in mobile ad-hoc networks | |
| KR101689532B1 (en) | Distributed path setup method using load balancing for mobile ad hoc 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 |