CN110601976B - Self-adaptive deflection routing control method for electromagnetic nano network - Google Patents
Self-adaptive deflection routing control method for electromagnetic nano network Download PDFInfo
- Publication number
- CN110601976B CN110601976B CN201910741790.1A CN201910741790A CN110601976B CN 110601976 B CN110601976 B CN 110601976B CN 201910741790 A CN201910741790 A CN 201910741790A CN 110601976 B CN110601976 B CN 110601976B
- Authority
- CN
- China
- Prior art keywords
- nano
- node
- next hop
- data packet
- nano node
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/06—Deflection routing, e.g. hot-potato routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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/20—Hop count for routing purposes, e.g. TTL
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to an electromagnetic nano network-oriented adaptive deflection routing control method.A nano node selects a next hop nano node according to routing table information, deflects a data packet to other nano nodes according to a deflection routing table under the unreachable condition, increases the successful transmission probability of the data packet, predicts the energy state of the next hop nano node by the nano node, and forwards the data packet when the energy is enough, thereby improving the successful transmission probability of the data packet; the nano node obtains information from the confirmation frame fed back by the next hop nano node to update the routing table and the deflection routing table of the nano node, thereby achieving the purpose of dynamically adapting to the network load and the node energy change and improving the network performance. The invention is simple, can adaptively control the routing, reduces the packet loss rate of the data packet, and the node can adaptively update the routing table of the node according to the received feedback information, thereby achieving the purpose of adapting to the network load and the energy change of the nano node and effectively improving the performance of the nano network.
Description
Technical Field
The invention relates to the technical field of communication routing or communication path searching, in particular to an electromagnetic nano network-oriented adaptive deflection routing control method.
Background
With the development of nanotechnology, nanosensors having more characteristics, such as a nanobiosensor used to detect pathogens, a nanobiotensor used for living organism detection, and the like, have been increasingly developed, and due to their size, the nanosensors have higher accuracy than conventional sensors. The extremely small size of a single nanosensor makes its computation, storage, and energy resources very limited, so these problems are generally overcome by forming a large number of nanosensors into a network, and new systems and applications are formed, such as targeted drug delivery systems, agricultural crop monitoring systems, food safety control systems, etc. to work.
At present, the communication modes between the nano sensors are mainly two, one is molecular communication, and the other is electromagnetic communication. In recent years, the application of graphene-based plasma transceivers and antennas makes electromagnetic nano-networks based on Terahertz (THz, 0.1-10THz) communication more and more popular with researchers, and on the other hand, the development of carbon-based electronic components opens a new door for nano-batteries, nano-memories and nano-circuits, which all promote the development and use of electromagnetic nano-networks.
In the past few years, researchers all over the world have done a lot of work, and from the design of nano nodes to the design of network link layers, various challenges faced in nano networks are overcome, however, at present, there are not many effective algorithms in network routing layers, and for the routing design in electromagnetic nano networks, the following design difficulties mainly exist:
(1) a limited transmission distance; on one hand, the path loss and the molecular absorption of the terahertz frequency band have great influence on transmission, and on the other hand, because the battery capacity of the nano node is limited and the signal power sent by the nano node is small, the transmission distance of the nano node is very limited, so that a multi-hop routing algorithm needs to be designed;
(2) extremely limited memory; the nano nodes can only cache limited data packets generally, and when a cache region of one nano node is full, the nano node cannot process more new data packets, namely, the data packets are lost, so that the overall network performance is influenced;
(3) the energy of the nano node has fluctuation; because the battery capacity of the nano node is small, the survival time of the node needs to be ensured through an energy capture technology, which can cause the energy of the nano node to be greatly different at different times, and a designed routing protocol needs to adapt to the change.
Based on the particularity of the nano-network, the traditional routing protocol cannot be applied to the electromagnetic nano-network.
Disclosure of Invention
The invention solves the problem that the traditional routing protocol can not be applied to the electromagnetic nano network due to the design difficulties of limited transmission distance, extremely limited memory and fluctuant nano node energy existing in the routing design in the electromagnetic nano network in the prior art, and provides an optimized adaptive deflection routing control method facing the electromagnetic nano network.
The invention adopts the technical scheme that an electromagnetic nano network-oriented adaptive deflection routing control method comprises the following steps:
step 1: any one nano node S receives or generates a data packet to be sent to a target nano node;
step 2: the nano node S judges whether the current energy is enough for sending and receiving feedback information of the current data packet, if the energy is not enough, the step 2 is repeated after waiting for the time T and actively capturing the energy, and if not, the next step is carried out;
and step 3: the nano node S judges whether the deflection times of the current data packet exceed the maximum deflection times or not, if so, the data packet is discarded, and if not, the next step is carried out;
and 4, step 4: the nano node S searches a routing table to find a next hop nano node, if the next hop nano node is found, the data packet is sent, the step 7 is carried out, and if the next hop nano node meeting the requirement cannot be found or no routing record exists, the next step is carried out;
and 5: the nano node S searches a deflection routing table to find a next-hop nano node, if the next-hop nano node is found, a data packet is sent, the deflection frequency is increased by 1, the step 7 is carried out, and if the next-hop nano node meeting the requirement cannot be found or no deflection routing record exists, the next step is carried out;
step 6: if no neighbor nano node exists around the nano node S, discarding the data packet, otherwise, selecting any neighbor nano node as a next hop nano node to send the data packet, and carrying out the next step;
and 7: if the next hop of nano node completely receives the current data packet, the updating information is obtained by self information calculation, the updating information is written into the acknowledgement feedback confirmation frame, and the acknowledgement feedback confirmation frame is sent to the nano node S; if the next hop of nano node does not completely receive the current data packet, returning a negative response feedback confirmation frame without update information of the nano node S;
and 8: if the nano node S receives the acknowledgement feedback confirmation frame, updating the routing table of the nano node S by using the updating information in the current acknowledgement feedback confirmation frame, and carrying out the next step; if a negative response feedback confirmation frame is received or no feedback information of any next hop of nano node is received after overtime, judging whether the deflection times exceed the maximum deflection times, if so, discarding the data packet, otherwise, returning to the step 5;
and step 9: if the current next hop node is the target nano node, the routing control is finished, otherwise, the current next hop node is used as a new nano node S, the target nano node is unchanged, and the step 2 is returned.
Preferably, the step 4 comprises the steps of:
step 4.1: the nano node S searches a routing table to find a next hop nano node;
step 4.2: if available route records exist, an energy prediction algorithm is used for predicting whether the current next hop nano node has energy for receiving and sending a data packet and sending a feedback confirmation frame, and the next step is carried out; if no available route record exists, performing step 5;
step 4.3: and if the energy is enough, sending a data packet to the current next hop nano node, and performing the step 7, otherwise, performing the step 5.
Preferably, in the step 4.2, the predicted energy of the next-hop nano node
Wherein x is the next hop nano node, EmaxIs the maximum energy of the nanonode, ω ═ harvx-cx)(tc-t)，harvxEnergy capture rate for next hop nano-node, cxIs the energy consumption rate of the next hop nano-node, tcIs the current time, and t is the route update time.
Preferably, let EpFor the energy of receiving, sending a data packet and sending a feedback confirmation frame by the nano node, when E'x≥EpAnd then the nano node S sends a data packet to the next hop nano node.
Preferably, the step 5 comprises the steps of:
step 5.1: the nano node S searches a deflection routing table to find a next hop nano node;
step 5.2: if available deflection routing exists, selecting a next hop nano node with the minimum path weight which is not sent by the current data packet, predicting whether the current next hop nano node has energy for receiving, sending a data packet and sending a feedback confirmation frame by using an energy prediction algorithm, and carrying out the next step; if no available deflection route exists, performing step 6;
step 5.3: and if the energy is enough, sending a data packet to the current next hop of nano node, adding 1 to the deflection times, and performing the step 7, otherwise, performing the step 6.
Preferably, in step 5.2, the next-hop nano node x with the smallest path weight is argminQs(d, z), where d is the address of the destination nano-node, z is the collection of all deflected nano-nodes, Qs(d, z) is the weight of the different routes in the nano-node S, and a larger weight indicates that the route consumes more resources.
Preferably, in the step 7, the information is updated
Wherein x is a next hop nano node, y is a next hop nano node selected by the next hop nano node, and Qx(d, y) is the routing weight of the nano node x to the destination nano node d through the nano node y, hyFor the next-hop nano node to pass through the nano node y to the target nano nodeThe number of hops of d is such that,
the deflection rate of the next hop nano-node,
is the packet loss rate of the next hop of nano-node.
Preferably, the deflection rate of the next-hop nano-node
Wherein the content of the first and second substances,
the number of packets deflected for the next hop nano-node,
the number of data packets sent for the next hop of nano-nodes; packet loss rate of the next hop nano node
Wherein the content of the first and second substances,
the number of packets lost for the next hop nano-node.
Preferably, in step 7, the update information includes a path weight, a hop count, a nano node energy state, a packet loss rate, and a deflection rate.
Preferably, the path weights in the update information
Where α is the update coefficient, hxRepresenting the hop count of the nano node S from the next-hop nano node x to the destination nano node d.
The invention provides an optimized electromagnetic nano network-oriented adaptive deflection routing control method, wherein a nano node goes through a routing selection stage and a feedback updating stage when sending a data packet to a destination node; in the routing selection stage, the nano node selects a next hop nano node according to the information of the routing table, deflects a data packet to other nano nodes according to the information in the deflection routing table under the condition that the next hop nano node in the routing table is inaccessible, increases the successful transmission probability of the data packet, and meanwhile, the nano node can predict the energy state of the next hop nano node through an energy prediction algorithm, and forwards the data packet only when the predicted energy of the next hop nano node is greater than the energy required for receiving and sending one data packet and receiving a confirmation frame, so that the successful transmission probability of the data packet is improved; in the feedback updating stage, the nano node obtains information from the confirmation frame fed back by the next hop of nano node, and updates the routing table and the deflection routing table, thereby achieving the purpose of dynamically adapting to the network load and the node energy change and improving the network performance.
The method is simple, can perform routing control in a self-adaptive manner, avoids the situation that the next hop of nano node cannot receive the data packet due to the problems of cache and energy, can deflect the data packet to other nano nodes capable of receiving the data packet through deflection by the nano node, reduces the packet loss rate of the data packet, and can update the routing table of the node in a self-adaptive manner according to the received feedback information, thereby achieving the purpose of adapting to the network load and the energy change of the nano node and effectively improving the performance of the nano network.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is an adaptive routing table oriented to electromagnetic nano-networks of the present invention;
FIG. 3 is an adaptive deflection routing table for an electromagnetic nano-network according to the present invention;
FIG. 4 is a frame format of an electromagnetic nano-network oriented acknowledgement frame data packet according to the present invention;
fig. 5 is a frame format of the electromagnetic nano-network oriented negative acknowledgement frame data packet according to the present invention.
Detailed Description
The present invention is described in further detail with reference to the following examples, but the scope of the present invention is not limited thereto.
The invention relates to an electromagnetic nano network-oriented adaptive deflection routing control method, which helps nano nodes to select a better route for data transmission, thereby improving the data transmission performance of a nano network.
The method comprises the following steps.
Step 1: any one of the nano-nodes S receives or generates a data packet to be transmitted to the destination nano-node.
Step 2: and (3) the nano node S judges whether the current energy is enough for sending and receiving feedback information of the current data packet, if the energy is not enough, the step 2 is repeated after waiting for the time T and actively capturing the energy, and if not, the next step is carried out.
In the present invention, insufficient energy means energy E of the nano node SsLess than the energy E required to send the current data packet and receive the feedback informationtransThen, the energy needs to be continuously and actively captured, for example, the energy is obtained from the surrounding environment through the nano piezoelectric device; the calculation of energy is conventional in the art and can be calculated by one skilled in the art.
In the present invention, the time T is generally 500 ms.
In the invention, the nano node is generally provided with an energy capture device, so that energy can be captured from the environment.
And step 3: and the nano node S judges whether the deflection times of the current data packet exceed the maximum deflection times or not, if so, the data packet is discarded, and if not, the next step is carried out.
In the invention, the maximum deflection times are generally 5 times, and the person skilled in the art can set the maximum deflection times according to the requirement, which means that the node from the sending node to the next hop node which is not necessarily the destination node can not deflect more than 5 times
And 4, step 4: and (4) searching the routing table by the nano node S to find the next hop nano node, if the next hop nano node is found, sending a data packet, and performing the step 7, and if the next hop nano node meeting the requirement cannot be found or no routing record exists, performing the next step.
The step 4 comprises the following steps:
step 4.1: the nano node S searches a routing table to find a next hop nano node;
step 4.2: if available route records exist, an energy prediction algorithm is used for predicting whether the current next hop nano node has energy for receiving and sending a data packet and sending a feedback confirmation frame, and the next step is carried out; if no available route record exists, performing step 5;
in the step 4.2, the predicted energy of the next hop nano node
Wherein x is the next hop nano node, EmaxIs the maximum energy of the nanonode, ω ═ harvx-cx)(tc-t)，harvxEnergy capture rate for next hop nano-node, cxIs the energy consumption rate of the next hop nano-node, tcIs the current time, and t is the route update time.
Let EpFor the energy of receiving, sending a data packet and sending a feedback confirmation frame by the nano node, when E'x≥EpAnd then the nano node S sends a data packet to the next hop nano node.
Step 4.3: and if the energy is enough, sending a data packet to the current next hop nano node, and performing the step 7, otherwise, performing the step 5.
In the present invention, when Ex'<EpOr the route record does not exist, directly performing the step 5.
In the invention, the routing table is not preset, and is increased and updated due to operation.
And 5: and (4) searching a deflection routing table by the nano node S to find a next-hop nano node, if the next-hop nano node is found, sending a data packet, adding 1 to the deflection frequency, carrying out the step 7, and if the next-hop nano node meeting the requirement cannot be found or no deflection routing record exists, carrying out the next step.
The step 5 comprises the following steps:
step 5.1: the nano node S searches a deflection routing table to find a next hop nano node;
step 5.2: if available deflection routing exists, selecting a next hop nano node with the minimum path weight which is not sent by the current data packet, predicting whether the current next hop nano node has energy for receiving, sending a data packet and sending a feedback confirmation frame by using an energy prediction algorithm, and carrying out the next step; if no available deflection route exists, performing step 6;
in step 5.2, the next-hop nano node x with the smallest path weight is argminQs(d, z), where d is the address of the destination nano-node, z is the collection of all deflected nano-nodes, Qs(d, z) is the weight of the different routes in the nano-node S, and a larger weight indicates that the route consumes more resources.
Step 5.3: and if the energy is enough, sending a data packet to the current next hop of nano node, adding 1 to the deflection times, and performing the step 7, otherwise, performing the step 6.
In the invention, in general, an adaptive routing table for an electromagnetic nano network comprises information such as a destination address, a next hop nano node address, routing weight, hop count, a next hop nano node energy state, a next hop nano node energy capture rate, a next hop nano node energy consumption rate, routing update time, a flag bit, routing survival time and the like, and compared with the routing table, the deflection routing table has one more deflection routing mark bit for marking whether the routing is a deflection routing record or not.
In the invention, the weight of the route represents the weight of the resource consumption of the route, and the larger the weight is, the more the resource consumption of the route is represented; the flag bit indicates that the route record is in an available or unavailable state, generally, the flag bit is Enable to indicate that the route record is available, and disable to indicate that the route record is unavailable; the nano node can update the routing table by using the feedback information of the acknowledgement frame clock.
In the present invention, the argmin function of step 5.2 is used to obtain the minimum value therein.
In the present invention, the energy prediction algorithm of step 5.2 is the same as step 4.2.
Step 6: and if the neighbor nano nodes do not exist around the nano node S, discarding the data packet, otherwise, selecting any neighbor nano node as the next hop nano node to send the data packet, and carrying out the next step.
And 7: if the next hop of nano node completely receives the current data packet, the updating information is obtained by self information calculation, the updating information is written into the acknowledgement feedback confirmation frame, and the acknowledgement feedback confirmation frame is sent to the nano node S; and if the next hop of nano node does not completely receive the current data packet, returning a negative response feedback confirmation frame without the updating information to the nano node S.
In said step 7, the information is updated
Wherein x is a next hop nano node, y is a next hop nano node selected by the next hop nano node, and Qx(d, y) is the routing weight of the nano node x to the destination nano node d through the nano node y, hyThe hop count from the next-hop nano node to the destination nano node d through the nano node y,
the deflection rate of the next hop nano-node,
is the packet loss rate of the next hop of nano-node.
Deflection rate of the next hop nano-node
Wherein the content of the first and second substances,
the number of packets deflected for the next hop nano-node,
the number of data packets sent for the next hop of nano-nodes; packet loss rate of the next hop nano node
Wherein the content of the first and second substances,
the number of packets lost for the next hop nano-node.
In step 7, the update information includes a path weight, a hop count, a nano node energy state, a packet loss rate, and a deflection rate.
Path weights in the update information
Where α is the update coefficient, hxRepresenting the hop count of the nano node S from the next-hop nano node x to the destination nano node d.
In the invention, y represents the next-hop nano node selected by the next-hop nano node x, the selection method is consistent with the steps from step 2 to step 6, namely two hops after the nano node s is selected, the information fed back by x is the information of x, and the subsequent information can not be acquired any more.
In the present invention, rxIs the update information described in step 7.
In the invention, the frame of the acknowledgement feedback confirmation frame comprises a receiving address, a type, an acknowledgement confirmation frame, a protocol, a data packet length, updating information, an energy state, an energy capture rate and an energy consumption rate; wherein, the receiving address occupies 16 bits to represent the nano node receiving the acknowledgement frame, the type occupies 2 bits to represent the type of the acknowledgement frame, the value of the acknowledgement frame is '11', which represents that the data packet has been completely received, the protocol occupies 2 bits to represent the routing protocol executed by the nano node, the length of the data packet occupies 12 bits to represent the length of the whole acknowledgement frame, the updating information occupies 16 bits to represent the calculated information for updating the routing, the energy state occupies 16 bits to represent the energy state of the nano node sending the acknowledgement frame, the energy capturing rate occupies 16 bits to represent the rate of capturing energy from the environment by the nano node sending the acknowledgement frame, and the energy consuming rate occupies 16 bits to represent the rate of consuming energy by the nano node sending the acknowledgement frame.
In the invention, in the frame of the negative acknowledgement feedback confirmation frame, the data format is similar to that of the positive acknowledgement feedback confirmation frame, but no updating information, energy state, energy capture rate and energy consumption rate exist, and the value of the negative acknowledgement confirmation frame is '00', which indicates that the data packet is not completely received or the node energy is not enough to help to forward the corresponding data packet.
In the present invention, the update coefficient α is generally set to 0.1.
And 8: if the nano node S receives the acknowledgement feedback confirmation frame, updating the routing table of the nano node S by using the updating information in the current acknowledgement feedback confirmation frame, and carrying out the next step; if a negative response feedback confirmation frame is received or no feedback information of any next hop nano node is received after overtime, judging whether the deflection times exceed the maximum deflection times, if so, discarding the data packet, otherwise, returning to the step 5.
And step 9: if the current next hop node is the target nano node, the routing control is finished, otherwise, the current next hop node is used as a new nano node S, the target nano node is unchanged, and the step 2 is returned.
In the invention, the nano node goes through a routing selection stage and a feedback updating stage when sending a data packet to a destination node; in the routing selection stage, the nano node selects a next hop nano node according to the information of the routing table, deflects a data packet to other nano nodes according to the information in the deflection routing table under the condition that the next hop nano node in the routing table is inaccessible, increases the successful transmission probability of the data packet, and meanwhile, the nano node can predict the energy state of the next hop nano node through an energy prediction algorithm, and forwards the data packet only when the predicted energy of the next hop nano node is greater than the energy required for receiving and sending one data packet and receiving a confirmation frame, so that the successful transmission probability of the data packet is improved; in the feedback updating stage, the nano node obtains information from the confirmation frame fed back by the next hop of nano node, and updates the routing table and the deflection routing table, thereby achieving the purpose of dynamically adapting to the network load and the node energy change and improving the network performance.
The method is simple, can perform routing control in a self-adaptive manner, avoids the situation that the next hop of nano node cannot receive the data packet due to the problems of cache and energy, can deflect the data packet to other nano nodes capable of receiving the data packet through deflection by the nano node, reduces the packet loss rate of the data packet, and can update the routing table of the node in a self-adaptive manner according to the received feedback information, thereby achieving the purpose of adapting to the network load and the energy change of the nano node and effectively improving the performance of the nano network.
Claims (8)
1. An adaptive deflection routing control method facing an electromagnetic nano network is characterized in that: the method comprises the following steps:
step 1: any one nano node S receives or generates a data packet to be sent to a target nano node;
step 2: the nano node S judges whether the current energy is enough for sending and receiving feedback information of the current data packet, if the energy is not enough, the step 2 is repeated after waiting for the time T and actively capturing the energy, and if not, the next step is carried out;
and step 3: the nano node S judges whether the deflection times of the current data packet exceed the maximum deflection times or not, if so, the data packet is discarded, and if not, the next step is carried out;
and 4, step 4: the nano node S searches a routing table to find a next hop nano node, if the next hop nano node is found, a data packet is sent, the step 7 is carried out, and if the next hop nano node meeting the requirement cannot be found or no routing record exists, the step 5 is carried out; the step 4 comprises the following steps:
step 4.1: the nano node S searches a routing table to find a next hop nano node;
step 4.2: if available route records exist, an energy prediction algorithm is used for predicting whether the current next hop nano node has energy for receiving and sending a data packet and sending a feedback confirmation frame, and the next step is carried out; if no available route record exists, performing step 5; predicted energy of next hop nano-node
Wherein x is the next hop nano node, EmaxIs the maximum energy of the nanonode, ω ═ harvx-cx)(tc-t)，harvxEnergy capture rate for next hop nano-node, cxIs the energy consumption rate of the next hop nano-node, tcIs the current time, t is the route update time;
step 4.3: if the energy is enough, sending a data packet to the current next hop nano node, and performing the step 7, otherwise, performing the step 5;
and 5: the nano node S searches a deflection routing table to find a next-hop nano node, if the next-hop nano node is found, a data packet is sent, the deflection frequency is increased by 1, the step 7 is carried out, and if the next-hop nano node meeting the requirement cannot be found or no deflection routing record exists, the next step is carried out;
step 6: if no neighbor nano node exists around the nano node S, discarding the data packet, otherwise, selecting any neighbor nano node as a next hop nano node to send the data packet, and carrying out the next step;
and 7: if the next hop of nano node completely receives the current data packet, the updating information is obtained by self information calculation, the updating information is written into the acknowledgement feedback confirmation frame, and the acknowledgement feedback confirmation frame is sent to the nano node S; if the next hop of nano node does not completely receive the current data packet, returning a negative response feedback confirmation frame without update information of the nano node S;
and 8: if the nano node S receives the acknowledgement feedback confirmation frame, updating the routing table of the nano node S by using the updating information in the current acknowledgement feedback confirmation frame, and carrying out the next step; if a negative response feedback confirmation frame is received or no feedback information of any next hop of nano node is received after overtime, judging whether the deflection times exceed the maximum deflection times, if so, discarding the data packet, otherwise, returning to the step 5;
and step 9: if the current next hop node is the target nano node, the routing control is finished, otherwise, the current next hop node is used as a new nano node S, the target nano node is unchanged, and the step 2 is returned.
2. The adaptive deflection routing control method for the electromagnetic nano network according to claim 1, characterized in that: let EpFor the energy of receiving, sending a data packet and sending a feedback confirmation frame by the nano node, when E'x≥EpAnd then the nano node S sends a data packet to the next hop nano node.
3. The adaptive deflection routing control method for the electromagnetic nano network according to claim 1, characterized in that: the step 5 comprises the following steps:
step 5.1: the nano node S searches a deflection routing table to find a next hop nano node;
step 5.2: if available deflection routing exists, selecting a next hop nano node with the minimum path weight which is not sent by the current data packet, predicting whether the current next hop nano node has energy for receiving, sending a data packet and sending a feedback confirmation frame by using an energy prediction algorithm, and carrying out the next step; if no available deflection route exists, performing step 6; the energy prediction algorithm of step 5.2 is the same as that of step 4.2;
step 5.3: and if the energy is enough, sending a data packet to the current next hop of nano node, adding 1 to the deflection times, and performing the step 7, otherwise, performing the step 6.
4. The adaptive deflection routing control method for the electromagnetic nano network according to claim 3, characterized in that: in step 5.2, the next-hop nano node x with the smallest path weight is arg min Qs(d, z), where d is the address of the destination nano-node, z is the collection of all deflected nano-nodes, Qs(d, z) is the weight of the different routes in the nano-node S, and a larger weight indicates that the route consumes more resources.
5. An electromagnetic nano-oriented device as claimed in claim 1The self-adaptive deflection routing control method of the network is characterized in that: in said step 7, the information is updated
Wherein x is a next hop nano node, y is a next hop nano node selected by the next hop nano node, and Qx(d, y) is the routing weight of the nano node x to the destination nano node d through the nano node y, hyThe hop count from the next-hop nano node to the destination nano node d through the nano node y,
the deflection rate of the next hop nano-node,
is the packet loss rate of the next hop of nano-node.
6. The adaptive deflection routing control method for the electromagnetic nano network according to claim 5, wherein: deflection rate of the next hop nano-node
Wherein the content of the first and second substances,
the number of packets deflected for the next hop nano-node,
the number of data packets sent for the next hop of nano-nodes; packet loss rate of the next hop nano node
Wherein the content of the first and second substances,
missing for next hop nano-nodeThe number of data packets.
7. The adaptive deflection routing control method for the electromagnetic nano network according to claim 1, characterized in that: in step 7, the update information includes a path weight, a hop count, a nano node energy state, a packet loss rate, and a deflection rate.
8. The adaptive deflection routing control method for the electromagnetic nano network according to claim 7, wherein: path weights in the update information
Where α is the update coefficient, hxRepresenting the hop count of the nano node S from the next-hop nano node x to the destination nano node d.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910741790.1A CN110601976B (en) | 2019-08-12 | 2019-08-12 | Self-adaptive deflection routing control method for electromagnetic nano network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910741790.1A CN110601976B (en) | 2019-08-12 | 2019-08-12 | Self-adaptive deflection routing control method for electromagnetic nano network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110601976A CN110601976A (en) | 2019-12-20 |
| CN110601976B true CN110601976B (en) | 2021-07-20 |
Family
ID=68854255
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910741790.1A Active CN110601976B (en) | 2019-08-12 | 2019-08-12 | Self-adaptive deflection routing control method for electromagnetic nano network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110601976B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114286415B (en) * | 2021-12-06 | 2024-04-23 | 浙江工业大学 | Opportunistic routing method oriented to flow guiding nano network circulation sensing |
Citations (6)
| 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 |
| WO2009057884A1 (en) * | 2007-11-01 | 2009-05-07 | Electronics And Telecommunications Research Institute | Multi-path routing method in wireless sensor network |
| CN101645829A (en) * | 2008-08-07 | 2010-02-10 | 中国科学院计算技术研究所 | Method and system for forwarding network data by wireless sensor |
| US7924728B2 (en) * | 2006-08-25 | 2011-04-12 | Raytheon Bbn Technologies Corp | Systems and methods for energy-conscious communication in wireless ad-hoc networks |
| CN103260264A (en) * | 2013-05-09 | 2013-08-21 | 哈尔滨工程大学 | Wireless sensor network data fusion method based on double-fusion node ant colony optimization |
| CN109874147A (en) * | 2019-03-06 | 2019-06-11 | 天津理工大学 | A kind of method for routing of the mobile ad-hoc network based on greedy repeating optimizing strategy |
-
2019
- 2019-08-12 CN CN201910741790.1A patent/CN110601976B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7924728B2 (en) * | 2006-08-25 | 2011-04-12 | Raytheon Bbn Technologies Corp | Systems and methods for energy-conscious communication in wireless ad-hoc networks |
| CN101083616A (en) * | 2007-07-05 | 2007-12-05 | 上海交通大学 | Ant algorithm based wireless self-organized network energy-saving routing method on demand |
| WO2009057884A1 (en) * | 2007-11-01 | 2009-05-07 | Electronics And Telecommunications Research Institute | Multi-path routing method in wireless sensor network |
| CN101645829A (en) * | 2008-08-07 | 2010-02-10 | 中国科学院计算技术研究所 | Method and system for forwarding network data by wireless sensor |
| CN103260264A (en) * | 2013-05-09 | 2013-08-21 | 哈尔滨工程大学 | Wireless sensor network data fusion method based on double-fusion node ant colony optimization |
| CN109874147A (en) * | 2019-03-06 | 2019-06-11 | 天津理工大学 | A kind of method for routing of the mobile ad-hoc network based on greedy repeating optimizing strategy |
Non-Patent Citations (2)
| Title |
|---|
| "Multi-hop Deflection Routing algorithm based on Q-learning for Energy-harvesting Nanonetworks";ChaochaoWang等;《IEEE》;20181210;正文第I节，第II节 * |
| "基于链路生存时间及贪婪转发改进策略的路由方法研究";汤雅梦;《万方数据库》;20190603;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110601976A (en) | 2019-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Multi-hop deflection routing algorithm based on reinforcement learning for energy-harvesting nanonetworks | |
| Darabkh et al. | An improved cluster head selection algorithm for wireless sensor networks | |
| 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 | |
| CN104754687A (en) | Information sending method and device | |
| Ghaleb et al. | Energy efficient multipath routing using multi-objective grey wolf optimizer based dynamic source routing algorithm for manet | |
| Hamrioui et al. | Load balancing algorithm for efficient and reliable IoT communications within E-health environment | |
| Liu et al. | Balance energy-efficient and real-time with reliable communication protocol for wireless sensor network | |
| CN108462983B (en) | Multi-robot communication networking method based on improved ant colony AODV protocol | |
| CN114339661A (en) | Aircraft self-organizing network multipath routing mechanism based on whale optimization | |
| EP1580941B1 (en) | Method of operating sensor net and sensor apparatus | |
| CN110601976B (en) | Self-adaptive deflection routing control method for electromagnetic nano network | |
| Impett et al. | A receiver-oriented approach to reliable broadcast in ad hoc networks | |
| Sharma et al. | Ant based cluster head election algorithm in wireless sensor network to avoid redundancy | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| JP5716836B2 (en) | Wireless multi-hop network monitoring method | |
| CN108337711B (en) | Mobile sensing data routing method of mobile wireless sensor network | |
| Joshi et al. | A Novel golden eagle optimizer based trusted ad hoc on-demand distance vector (GEO-TAODV) routing protocol | |
| WO2015077940A1 (en) | Sink node routing method and node device | |
| JP2007267281A (en) | Wireless access point and control apparatus for management the same | |
| Harikishore et al. | “Ant colony optimization based energy efficiency for improving opportunistic routing in multimedia wireless mesh network | |
| CN116113008A (en) | Multi-agent routing algorithm for unmanned aerial vehicle self-organizing network | |
| CN110602755B (en) | Energy perception opportunity routing control method facing mobile nano network | |
| EP3051919B1 (en) | Device and method for wireless communication used in wireless ad hoc network | |
| Wu et al. | Energy-aware routing for wireless sensor networks by AHP | |
| Uddin | A novel data aggregation mechanism using reinforcement learning for cluster heads in wireless multimedia sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |