CN114286415B - Opportunistic routing method oriented to flow guiding nano network circulation sensing - Google Patents
Opportunistic routing method oriented to flow guiding nano network circulation sensing Download PDFInfo
- Publication number
- CN114286415B CN114286415B CN202111475640.4A CN202111475640A CN114286415B CN 114286415 B CN114286415 B CN 114286415B CN 202111475640 A CN202111475640 A CN 202111475640A CN 114286415 B CN114286415 B CN 114286415B
- Authority
- CN
- China
- Prior art keywords
- nano
- node
- common
- candidate
- index
- 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 39
- 230000005540 biological transmission Effects 0.000 claims abstract description 20
- 230000033001 locomotion Effects 0.000 claims abstract description 13
- 230000008569 process Effects 0.000 claims abstract description 11
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 125000004122 cyclic group Chemical group 0.000 claims description 4
- 239000003550 marker Substances 0.000 claims description 3
- 230000008447 perception Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 9
- 238000005516 engineering process Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000010521 absorption reaction Methods 0.000 description 1
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000012377 drug delivery Methods 0.000 description 1
- 238000004146 energy storage Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 238000001727 in vivo Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Classifications
-
- 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
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a flow-guided nano network circulation perception-oriented opportunistic routing method, which uses nano gateway nodes to collect and control data, uses nano routing nodes to forward and control data, uses opportunistic routing protocols for common nano nodes, dynamically perceives data in a flow-guided nano network environment in a moving process, caches the data and forwards the data at proper time. The invention can effectively solve the problem of data transmission when the common nano node circularly moves in the flow guiding environment, improves the data transmission speed and accuracy under the complex conditions of limited node energy and unpredictable movement track, realizes the efficient forwarding of the data through the wireless communication between the common nano node and the common nano node, ensures that the data is more quickly transmitted to the nano gateway node, and improves the performance of the whole nano network system; and the opportunity route is introduced, so that the common nano node can dynamically find opportunities to forward data in the moving process, and the problem of unstable communication links is solved.
Description
Technical Field
The invention relates to the technical field of communication routing or communication path searching, in particular to an opportunity routing method oriented to flow guiding nano network circulation sensing in the nano network routing communication field.
Background
The nano network, the information technology and the biotechnology are all accepted as three technologies for the social development of the 21 st century, and the nano network has very wide application prospect in the fields of biology, medicine, materials, military and environment; for example, health monitoring systems and in-vivo drug delivery systems in the medical field can achieve accuracy and speed in microscopic conditions that are not available with conventional macroscopic sensor devices.
However, how to introduce the nano-network into the circulatory system similar to the human body for practical application also faces a number of difficulties and challenges. The single node has a large limit on the sensing range, the energy storage and the computing capacity due to the small size; in addition, the environment in the human body is complex, the signals and mobility of the nodes are not affected little, and the cyclic structure of the system needs to be considered, which also causes new problems. In particular, the nano-network uses the terahertz frequency band, and besides the transmission loss, the nano-network has very high molecular absorption loss, which is particularly obvious in a human body; in addition, the nano-node in the human body can change the position along with the flow of blood, so that the dynamic change of the node distribution position is caused, and a corresponding routing transmission protocol is required to be redesigned to adapt to the data transmission of the nano-node in the flow guiding environment.
Disclosure of Invention
In view of the background and the technology provided above, the present invention aims to provide an opportunistic routing method for flow-guided nano network circulation awareness, which mainly solves the problem of how to perform more efficient data transmission of a common nano node in a flow-guided circulation environment; the invention fully utilizes the characteristic advantages of wireless broadcasting, enables the common nano node with better selection performance and relative position to forward data, and can effectively improve the data transmission performance of the common nano node in the flow guiding environment.
The invention adopts the technical scheme that the opportunistic routing method for circularly sensing the flow guiding nano network comprises a nano gateway node, a nano routing node and a common nano node;
The method comprises the steps of collecting and controlling data by using a nano gateway node, forwarding and controlling the data by using a nano routing node, wherein a common nano node uses an opportunistic routing protocol and is used for dynamically sensing data in a flow-guided nano network environment in a moving process, caching the data and finding a proper time to forward the data in the moving process.
Preferably, the flow-directed nanonetwork comprises a nanonetwork circulation link; the nano network node is fixed at a certain position of the nano network circulating link, the nano gateway node is used as a starting point and an end point of the nano network circulating link, the nano routing node is fixed at the middle position of the whole nano network circulating link, and the common nano nodes move in the same direction in the nano network circulating link and are uniformly distributed in the circulating link.
Preferably, the method comprises the steps of:
Step 1: initializing Index values Index of all the common nano nodes to be 0, and adjusting the Index values Index based on a preset standard when each common nano node circularly moves in the flow guiding nano network;
Step 2: any common nano node s receives or senses a data packet which needs to be forwarded to the nano gateway node;
Step 3: the common nano node s judges whether the self energy is enough to send or forward the data packet, if the energy is insufficient, the energy capturing is carried out and the step 2 is repeated, otherwise, the step 4 is carried out;
Step 4: the common nano node s selects a candidate node set according to the current Index value Index;
Step 5: the common nano nodes s sort the result calculated by the priority calculation formula of the candidate common nano nodes in the candidate node set from high to low, and select the common nano node with the best forwarding according to the sorting to forward the data packet; here, the node s actively selects appropriate surrounding nodes as the candidate node set by sending the broadcast packet, and the gateway and the route may not be nearby, so that the overall mechanism cannot be adopted for judgment.
Step 6: and (3) the common nano node receiving the forwarded data packet becomes a new common nano node s and returns to the step (3) until the data packet is forwarded to the target nano gateway node.
Preferably, in the step 1, the circulating motion of the ordinary nano-node in the flow guiding nano-network includes the following steps:
step 1.1: if the life cycle of the nano network is finished, the control is exited, otherwise, the next step is carried out;
Step 1.2: when the common nano node circularly moves in the flow guiding nano network, the common nano node continuously captures energy, the Index value Index of the common nano node is added with 1 in each energy capturing time slot, and the Index value is used for identifying the position of the common nano node relative to the nano gateway node in the nano network circulation link; wherein, the energy capture time slot generally refers to the time between two energy captures;
Step 1.3: e tag bit carried by the common nano node is used as a marker bit of the common nano node relative to the nano routing node in the flow guiding nano network; e tag bit is 0 in the path range from the nano gateway node to the nano routing node, and E tag bit is 1 in the path range from the nano routing node to the nano gateway node; the nano routing node periodically broadcasts a broadcast packet with TTL of 1, receives the broadcast packet through a common nano node of the nano routing node and sets the E tag position of the common nano node to be 1; in the nano-network, E tag has only two states of 0 and 1;
Step 1.4: the nano gateway node periodically broadcasts a broadcast packet with TTL of 1, when any common nano node completes a circle of circulating motion in the flow guiding nano network and passes through the broadcast range of the nano gateway node again, the broadcast packet is received, index values Index and E tag positions 0 of the common nano node are received, and then the Index values Index are counted again from 0.
Preferably, in the step 3, the energy consumed by the common nanonode s for transmitting or receiving a pulse is E pul-t and E pul-r respectively, the length of the transmitted data packet is N t, the length of the received data packet is N r, the energy required for transmitting the data packet is E T＝γNtEpul-t, and the energy required for receiving the data packet is E R＝NrEpul-r, wherein γ is the coding weight;
If the current residual energy E re＜ET+ER of the common nano node s indicates that the residual energy of the common nano node s is insufficient to send a data packet, the energy capture needs to be continued, otherwise, the self energy is sufficient to send or forward the data packet.
Preferably, in the step 4, the selecting the candidate node set by the common nano node s includes the following steps:
Step 4.1: the common nano node s sends a broadcast packet with Index value Index, E tag bit and TTL of 1 of the common nano node s to the surrounding by taking the time period T as an interval;
Step 4.2: other common nano nodes judge whether the self residual energy E re can receive and forward the data packet or not; if the energy is insufficient, the data packet is not received, if the energy is sufficient, the Index value Index in the broadcast packet is compared with the Index value Index of the data packet according to E tag bit in the broadcast packet, and whether an ACK message is returned is judged;
Step 4.3: the common nano node s takes the common nano node which sends the ACK message as a candidate node, and establishes a candidate node set.
Preferably, in the step 4.2, the Index value Index comparison rule is:
When E tag bit in the broadcast packet is 0, if the Index value Index of the common nano node which receives the broadcast packet is smaller than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message;
When E tag bit in the broadcast packet is 1, if the Index value Index of the common nano node which receives the broadcast packet is larger than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message; the ACK message includes the Index value Index of this common nanonode, and the remaining energy E re.
Preferably, the step 5 includes the steps of:
Step 5.1: the common nano nodes s sort the candidate common nano nodes in the candidate node set according to the result of the priority calculation formula from high to low; if the candidate node set is empty, not forwarding the data packet;
Step 5.2: the common nanometer node s broadcasts the ordering information of n candidate common nanometer nodes together with the data packet to be forwarded, wherein the ordering information comprises all candidate node IDs and corresponding priority sequence numbers, the broadcasting power is P=max { P 1,P2,P3,...,Pn }, wherein P i is the transmission power required from the common nanometer node s to each common nanometer node i, and i is an integer between 1 and n;
step 5.3: the candidate common nano node i receiving the data packet confirms the forwarding priority of the node i through the ordering information;
Step 5.4: if the forwarding priority of any candidate common nano node is highest, immediately returning an ACK message to the common nano node s, broadcasting the ACK message to other candidate nodes by the common nano node s, and calculating the broadcasting power in the same step 5.2, otherwise, waiting for a back-off time slot; in order to prevent all candidate nodes from synchronously processing and forwarding data packets to cause data collision, a back-off time slot is set for waiting;
For any candidate ordinary nanonode with the highest forwarding priority, if the back-off time slot is finished and the broadcast ACK message of the ordinary nanonode s is not received yet (the ACK message is transmitted to the ordinary nanonode s and is broadcast by the node s), the front candidate ordinary nanonode is considered to fail to receive the data packet, the candidate ordinary nanonode which is finished by the back-off time slot returns the ACK message to the ordinary nanonode s, and so on;
and if any candidate common nano node receives the ACK message of the common nano node s, discarding the data packet and not carrying out forwarding operation.
Preferably, in the step 5.1, the priority calculation formula for the candidate ordinary nano-node is:
V(i)＝λ1|Indexi-Indexs|+λ2Ere-i
Wherein Index i is Index value Index of the candidate ordinary nano node i, index s is Index value Index of the ordinary nano node s, E re-i is residual energy of the candidate ordinary nano node i, λ 1、λ2 is a preset parameter, λ 1,λ2 E [0,1] and λ 1+λ2 =1.
In the invention, under ideal conditions, the energy capture rates of all the common nano nodes are equal, and if the common nano nodes are in a special environment, the energy capture rates are required to be set for the common nano nodes based on state factors, so that the calculation accuracy is ensured.
Preferably, in the step 5.4, the backoff time slot of the candidate common nanonode i is:
And sequencing all the priority calculation results of the candidate common nano nodes from high to low, sequentially numbering the priority calculation results with 0 to n-1, wherein PRI (i) corresponds to the sequence number of any candidate common nano node i in the sequencing result, PRI (i) is a positive integer from 0 to n-1, R node is the transmission radius of the common nano node, and c is the light speed.
The invention provides a flow guiding nano network circulation perception oriented opportunistic routing method, which can effectively solve the problem of data transmission during the circulation movement of common nano nodes in a flow guiding environment and improve the data transmission speed and accuracy under the complex conditions of limited node energy and unpredictable movement track. The high-efficiency forwarding of data is realized through the wireless communication between the common nano nodes, so that the data is more quickly transmitted to the nano gateway node, and the performance of the whole nano network system is improved; by introducing the opportunistic routing method, the common nano node can dynamically find opportunities to forward data in the moving process, so that the problem of unstable communication links of the traditional nano node is solved.
According to the method, the relative position of the common nano node in the flow guiding environment is marked through the Index value Index of the periodic increment of the common nano node, the position of the common nano node in the flow guiding environment relative to the nano gateway node can be approximately determined according to the Index value Index, and the appropriate surrounding common nano node is selected as a candidate node according to the Index value Index and E tag bits to forward the data packet of the common nano node, so that the data packet is forwarded to the nano gateway node step by step, the time from the data packet to the nano gateway node is shortened, and the utilization rate of the common nano node is improved.
Drawings
FIG. 1 is a logic flow diagram of the present invention;
FIG. 2 is a node model diagram of the present invention, where the Index value of a common nano node in a cyclic link starts to show an increasing trend from the right side of the nano gateway node, and sets 0 when returning to the nano gateway node again; the strategy of the common nano node in selecting the candidate forwarding node is opposite to that of the nano routing node.
Detailed Description
The present invention will be described in further detail with reference to examples, but the scope of the present invention is not limited thereto.
The invention relates to a flow-guided nano network circulation-aware opportunistic routing method, which adopts a nano network structure comprising a nano gateway node, a nano routing node and a common nano node, wherein the nano gateway node is responsible for collecting and controlling data, the nano routing node is responsible for forwarding and controlling data, and the common nano node uses an opportunistic routing protocol for dynamically perceiving data in a flow-guided nano network environment in a moving process, caching the data and finding a proper time for forwarding the data in the moving process.
The flow guiding nano network comprises a nano network circulation link, generally, the nano network joint point is fixed at a certain position of the nano network circulation link, the nano gateway node is used as a starting point and an end point of the nano network circulation link, the nano routing node is fixed at the middle position of the whole nano network circulation link, and the common nano nodes move in the same direction in the nano network circulation link and are uniformly distributed or basically uniformly distributed in the circulation link.
In the invention, the data perceived by all the common nano nodes are finally transmitted to the nano gateway node for unified processing, the data transmission is carried out in a broadcast mode, the transmission is assisted by surrounding candidate nodes, the perceived data can be more quickly transmitted to the gateway node by the assistance of the candidate nodes, and meanwhile, more common nano nodes participate in the transmission, so that the utilization rate of the common nano nodes is improved.
The method comprises the following steps:
Step 1: initializing Index values Index of all the common nano nodes to be 0, and adjusting the Index values Index based on a preset standard when each common nano node circularly moves in the flow guiding nano network;
in the step 1, the cyclic motion of the common nano node in the flow guiding nano network comprises the following steps:
step 1.1: if the life cycle of the nano network is finished, the control is exited, otherwise, the next step is carried out;
Step 1.2: when the common nano node circularly moves in the flow guiding nano network, the common nano node continuously captures energy, the Index value Index of the common nano node is added with 1 in each energy capturing time slot, and the Index value is used for identifying the position of the common nano node relative to the nano gateway node in the nano network circulation link;
Step 1.3: e tag bit carried by the common nano node is used as a marker bit of the common nano node relative to the nano routing node in the flow guiding nano network; e tag bit is 0 in the path range from the nano gateway node to the nano routing node, and E tag bit is 1 in the path range from the nano routing node to the nano gateway node; the nano routing node broadcasts a broadcasting packet with TTL of 1 by taking T router as a period, wherein T router =0.01 s, receives the broadcasting packet through a common nano node of the nano routing node and sets the E tag position of the common nano node to be 1;
Step 1.4: the nano gateway node broadcasts a broadcast packet with TTL of 1 by taking T gateway as a period, T gateway =0.01 s, when any common nano node completes a circle of circulating motion in the flow guiding nano network and passes through the broadcast range of the nano gateway node again, the broadcast packet is received, index values Index and E tag position 0 of the common nano node are counted from 0 again.
Step 2: any common nano node s receives or senses a data packet which needs to be forwarded to the nano gateway node;
In the invention, when the common nano node performs circulating motion in the flow guiding environment, the data information in the flow guiding environment can be perceived, and the data can not be analyzed and processed due to the limited energy and computing capacity of the common nano node, and the data needs to be forwarded to the gateway node for unified processing.
Step 3: the common nano node s judges whether the self energy is enough to send or forward the data packet, if the energy is insufficient, the energy capturing is carried out and the step 2 is repeated, otherwise, the step 4 is carried out;
the energy judging method in the step 3 is as follows:
The energy consumed by the common nano node s for sending or receiving a pulse is E pul-t and E pul-r respectively, the length of a sending data packet is N t, the length of a receiving data packet is N r, the energy required for sending the data packet is E T＝γNtEpul-t, and the energy required for receiving the data packet is E R＝NrEpul-r, wherein gamma is the coding weight;
If the current residual energy E re＜ET+ER of the common nano node s indicates that the residual energy of the common nano node s is insufficient to send a data packet, the energy capture needs to be continued, otherwise, the self energy is sufficient to send or forward the data packet.
Step 4: the common nano node s selects a candidate node set according to the current Index value Index;
In the step 4, the selecting the candidate node set by the common nano node s includes the following steps:
Step 4.1: the common nano node s takes a period of T node as an interval, T node =0.01s, and a broadcast packet with Index value Index of the common nano node s, E tag bits and TTL of 1 is sent to the periphery;
Step 4.2: other common nano nodes judge whether the self residual energy E re can receive and forward the data packet or not; if the energy is insufficient, the data packet is not received, if the energy is sufficient, the Index value Index in the broadcast packet is compared with the Index value Index of the data packet according to E tag bit in the broadcast packet, and whether an ACK message is returned is judged;
Step 4.3: the common nano node s takes the common nano node which sends the ACK message as a candidate node, and establishes a candidate node set.
Preferably, in the step 4.2, the Index value Index comparison rule is:
When E tag bit in the broadcast packet is 0, if the Index value Index of the common nano node which receives the broadcast packet is smaller than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message;
When E tag bit in the broadcast packet is 1, if the Index value Index of the common nano node which receives the broadcast packet is larger than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message; the ACK message includes the Index value Index of this common nanonode, and the remaining energy E re.
In the invention, because the flow guiding nano network is a circulating structure, the common nano node s needs to select the nearest route to forward the data packet to the gateway, and because the nano routing node is arranged at the central point of the circulating link of the nano network, when E tag bit is 0, the common nano node is in the path range from the nano gateway node to the nano routing node, the smaller the Index value of the common nano node is, the closer the node is to the nano gateway node, so that the common nano node with the Index value smaller than the Index value of the common nano node is selected as a candidate node in the path range; when E tag bit is 1, the ordinary nano node is in the path range from the nano gateway node to the nano routing node, the larger the Index value of the ordinary nano node is, the closer the node is to the nano gateway node, so that the ordinary nano node with the Index value larger than the Index value of the ordinary nano node is selected as a candidate node in the path range.
Step 5: the common nano nodes s sort the result calculated by the priority calculation formula of the candidate common nano nodes in the candidate node set from high to low, and select the common nano node with the best forwarding according to the sorting to forward the data packet;
the step 5 comprises the following steps:
Step 5.1: the common nano nodes s sort the candidate common nano nodes in the candidate node set according to the result of the priority calculation formula from high to low; if the candidate node set is empty, not forwarding the data packet;
In the step 5.1, the calculation formula of the priority of the candidate common nano node is as follows:
V(i)＝λ1|Indexi-Indexs|+λ2Ere-i
Wherein Index i is Index value Index of the candidate ordinary nano node i, index s is Index value Index of the ordinary nano node s, E re-i is residual energy of the candidate ordinary nano node i, λ 1、λ2 is a preset parameter, λ 1,λ2 E [0,1] and λ 1+λ2 =1.
Step 5.2: the common nanometer node s broadcasts the ordering information of n candidate common nanometer nodes together with the data packet to be forwarded, wherein the ordering information comprises all candidate node IDs and corresponding priority sequence numbers, the broadcasting power is P=max { P 1,P2,P3,...,Pn }, wherein P i is the transmission power required from the common nanometer node s to each common nanometer node i, and i is an integer between 1 and n;
step 5.3: the candidate common nano node i receiving the data packet confirms the forwarding priority of the node i through the ordering information;
step 5.4: if the forwarding priority of any candidate common nano node is highest, immediately returning an ACK message to the common nano node s, broadcasting the ACK message to other candidate nodes by the common nano node s, and calculating the broadcasting power in the same step 5.2, otherwise, waiting for a back-off time slot;
For any candidate common nano node with the non-highest forwarding priority, if the back-off time slot is finished and the broadcast ACK message of the common nano node s is not received, the front candidate common nano node is considered to fail to receive the data packet, the candidate common nano node which is finished by the back-off time slot returns the ACK message to the common nano node s, and so on;
and if any candidate common nano node receives the ACK message of the common nano node s, discarding the data packet and not carrying out forwarding operation.
In the step 5.4, the backoff time slots of the candidate common nano node i are:
And sequencing all the priority calculation results of the candidate common nano nodes from high to low, sequentially numbering the priority calculation results with 0 to n-1, wherein PRI (i) corresponds to the sequence number of any candidate common nano node i in the sequencing result, PRI (i) is a positive integer from 0 to n-1, R node is the transmission radius of the common nano node, and c is the light speed.
In the practical application process, there are
PRI(i)＝sortmax-min({V(1)，V(2)，...，V(n)}).index(i)
Wherein V (i) corresponds to a priority calculation result of the candidate ordinary nano-node i, sort max-min () is a sorting function for sorting all priority calculation results V (i) from large to small, and index () function is a sequence number of the query candidate ordinary nano-node i in the sorting result, that is, PRI (i) is a priority sequence number of the candidate node.
Step 6: and (3) the common nano node receiving the forwarded data packet becomes a new common nano node s and returns to the step (3) until the data packet is forwarded to the target nano gateway node.
In the invention, if a common nano node receives a periodical broadcast signal of a nano gateway, candidate nodes are not selected any more, a data packet is directly forwarded to the nano gateway node, the forwarding of the data is finished, the Index and E tag positions of the common nano node are positioned at 0, and then a new round of circulating motion is restarted.
The invention provides a flow guiding nano network circulation perception oriented opportunistic routing method, which can effectively solve the problem of data transmission during the circulation movement of common nano nodes in a flow guiding environment and improve the data transmission speed and accuracy under the complex conditions of limited node energy and unpredictable movement track. The high-efficiency forwarding of data is realized through the wireless communication between the common nano nodes, so that the data is more quickly transmitted to the nano gateway node, and the performance of the whole nano network system is improved; by introducing the opportunistic routing method, the common nano node can dynamically find opportunities to forward data in the moving process, so that the problem of unstable communication links of the traditional nano node is solved.
According to the method, the relative position of the common nano node in the flow guiding environment is marked through the Index value Index of the periodic increment of the common nano node, the position of the common nano node in the flow guiding environment relative to the nano gateway node can be approximately determined according to the Index value Index, and the appropriate surrounding common nano node is selected as a candidate node according to the Index value Index and E tag bits to forward the data packet of the common nano node, so that the data packet is forwarded to the nano gateway node step by step, the time from the data packet to the nano gateway node is shortened, and the utilization rate of the common nano node is improved.
Claims (8)
1. The opportunistic routing method for flow-guided nano network circulation perception is characterized by comprising the following steps of: the flow guiding nano network comprises a nano gateway node, a nano routing node and a common nano node; the method comprises the steps of collecting and controlling data by using a nano gateway node, forwarding and controlling the data by using a nano routing node, wherein a common nano node uses an opportunistic routing protocol and is used for dynamically sensing data in a flow-guided nano network environment in a moving process, caching the data and finding a proper time to forward the data in the moving process;
The method comprises the following steps:
Step 1: initializing Index values Index of all the common nano nodes to be 0, and adjusting the Index values Index based on a preset standard when each common nano node circularly moves in the flow guiding nano network; the cyclic motion of the common nano-node in the flow-guided nano-network comprises the following steps:
step 1.1: if the life cycle of the nano network is finished, the control is exited, otherwise, the next step is carried out;
Step 1.2: when the common nano node circularly moves in the flow guiding nano network, the common nano node continuously captures energy, the Index value Index of the common nano node is added with 1 in each energy capturing time slot, and the Index value is used for identifying the position of the common nano node relative to the nano gateway node in the nano network circulation link;
Step 1.3: e tag bit carried by the common nano node is used as a marker bit of the common nano node relative to the nano routing node in the flow guiding nano network; e tag bit is 0 in the path range from the nano gateway node to the nano routing node, and E tag bit is 1 in the path range from the nano routing node to the nano gateway node; the nano routing node periodically broadcasts a broadcast packet with TTL of 1, receives the broadcast packet through a common nano node of the nano routing node and sets the E tag position of the common nano node to be 1;
Step 1.4: the method comprises the steps that a nano gateway node periodically broadcasts a broadcast packet with TTL of 1, when any common nano node completes one-circle circulation movement in a flow guiding nano network and passes through the broadcast range of the nano gateway node again, the broadcast packet is received, index values Index and E tag positions 0 of the common nano node are received, and then the Index values Index are counted again from 0;
Step 2: any common nano node s receives or senses a data packet which needs to be forwarded to the nano gateway node;
Step 3: the common nano node s judges whether the self energy is enough to send or forward the data packet, if the energy is insufficient, the energy capturing is carried out and the step 2 is repeated, otherwise, the step 4 is carried out;
Step 4: the common nano node s selects a candidate node set according to the current Index value Index;
Step 5: the common nano nodes s sort the result calculated by the priority calculation formula of the candidate common nano nodes in the candidate node set from high to low, and select the common nano node with the best forwarding according to the sorting to forward the data packet;
step 6: and (3) the common nano node receiving the forwarded data packet becomes a new common nano node s and returns to the step (3) until the data packet is forwarded to the target nano gateway node.
2. The opportunistic routing method for flow-directed nano network loop awareness of claim 1, wherein: the flow-directed nanonetwork includes a nanonetwork circulation link; the nano network node is fixed at a certain position of the nano network circulating link, the nano gateway node is used as a starting point and an end point of the nano network circulating link, the nano routing node is fixed at the middle position of the whole nano network circulating link, and the common nano nodes move in the same direction in the nano network circulating link and are uniformly distributed in the circulating link.
3. The opportunistic routing method for flow-directed nano network loop awareness of claim 1, wherein: in the step 3, the energy consumed by the common nano node s for transmitting or receiving a pulse is E pul-t and E pul-r respectively, the length of a transmitted data packet is N t, the length of a received data packet is N r, the energy required for transmitting the data packet is E T＝γNtEpul-t, and the energy required for receiving the data packet is E R＝NrEpul-r, wherein γ is the coding weight;
If the current residual energy E re＜ET+ER of the common nano node s indicates that the residual energy of the common nano node s is insufficient to send a data packet, the energy capture needs to be continued, otherwise, the self energy is sufficient to send or forward the data packet.
4. The opportunistic routing method for flow-directed nano network loop awareness of claim 1, wherein: in the step 4, the selecting the candidate node set by the common nano node s includes the following steps:
Step 4.1: the common nano node s sends a broadcast packet with Index value Index, E tag bit and TTL of 1 of the common nano node s to the surrounding by taking the time period T as an interval;
Step 4.2: other common nano nodes judge whether the self residual energy E re can receive and forward the data packet or not; if the energy is insufficient, the data packet is not received, if the energy is sufficient, the Index value Index in the broadcast packet is compared with the Index value Index of the data packet according to E tag bit in the broadcast packet, and whether an ACK message is returned is judged;
Step 4.3: the common nano node s takes the common nano node which sends the ACK message as a candidate node, and establishes a candidate node set.
5. The opportunistic routing method for flow-directed nano network loop awareness of claim 4, wherein: in the step 4.2, the Index value Index comparison rule is:
When E tag bit in the broadcast packet is 0, if the Index value Index of the common nano node which receives the broadcast packet is smaller than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message; when E tag bit in the broadcast packet is 1, if the Index value Index of the common nano node which receives the broadcast packet is larger than the Index value Index in the broadcast packet of the common nano node s, returning an ACK message; the ACK message includes the Index value Index of this common nanonode, and the remaining energy E re.
6. The opportunistic routing method for flow-directed nano network loop awareness of claim 1, wherein: said step 5 comprises the steps of:
Step 5.1: the common nano nodes s sort the candidate common nano nodes in the candidate node set according to the result of the priority calculation formula from high to low; if the candidate node set is empty, not forwarding the data packet;
Step 5.2: the common nanometer node s broadcasts the ordering information of n candidate common nanometer nodes together with the data packet to be forwarded, wherein the ordering information comprises all candidate node IDs and corresponding priority sequence numbers, the broadcasting power is P=max { P 1,P2,P3,...,Pn }, wherein P i is the transmission power required from the common nanometer node s to each common nanometer node i, and i is an integer between 1 and n;
step 5.3: the candidate common nano node i receiving the data packet confirms the forwarding priority of the node i through the ordering information;
step 5.4: if the forwarding priority of any candidate common nano node is highest, immediately returning an ACK message to the common nano node s, broadcasting the ACK message to other candidate nodes by the common nano node s, and calculating the broadcasting power in the same step 5.2, otherwise, waiting for a back-off time slot; for any candidate common nano node with the non-highest forwarding priority, if the back-off time slot is finished and the broadcast ACK message of the common nano node s is not received, the front candidate common nano node is considered to fail to receive the data packet, the candidate common nano node which is finished by the back-off time slot returns the ACK message to the common nano node s, and so on;
and if any candidate common nano node receives the ACK message of the common nano node s, discarding the data packet and not carrying out forwarding operation.
7. The flow-directed nano-network loop aware opportunistic routing method of claim 6, wherein: in the step 5.1, the calculation formula of the priority of the candidate common nano node is as follows:
V(i)＝λ1|Indexi-Indexs|+λ2Ere-i
Wherein Index i is Index value Index of the candidate ordinary nano node i, index s is Index value Index of the ordinary nano node s, E re-i is residual energy of the candidate ordinary nano node i, λ 1、λ2 is a preset parameter, λ 1,λ2 E [0,1] and λ 1+λ2 =1.
8. The flow-directed nano-network loop aware opportunistic routing method of claim 7, wherein: in the step 5.4, the backoff time slots of the candidate common nano node i are:
And sequencing all the priority calculation results of the candidate common nano nodes from high to low, sequentially numbering the priority calculation results with 0 to n-1, wherein PRI (i) corresponds to the sequence number of any candidate common nano node i in the sequencing result, PRI (i) is a positive integer from 0 to n-1, R node is the transmission radius of the common nano node, and c is the light speed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111475640.4A CN114286415B (en) | 2021-12-06 | 2021-12-06 | Opportunistic routing method oriented to flow guiding nano network circulation sensing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111475640.4A CN114286415B (en) | 2021-12-06 | 2021-12-06 | Opportunistic routing method oriented to flow guiding nano network circulation sensing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114286415A CN114286415A (en) | 2022-04-05 |
| CN114286415B true CN114286415B (en) | 2024-04-23 |
Family
ID=80870870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111475640.4A Active CN114286415B (en) | 2021-12-06 | 2021-12-06 | Opportunistic routing method oriented to flow guiding nano network circulation sensing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114286415B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110601976A (en) * | 2019-08-12 | 2019-12-20 | 浙江工业大学 | Self-adaptive deflection routing control method for electromagnetic nano network |
| CN110602755A (en) * | 2019-08-12 | 2019-12-20 | 浙江工业大学 | Energy perception opportunity routing control method facing mobile nano network |
-
2021
- 2021-12-06 CN CN202111475640.4A patent/CN114286415B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110601976A (en) * | 2019-08-12 | 2019-12-20 | 浙江工业大学 | Self-adaptive deflection routing control method for electromagnetic nano network |
| CN110602755A (en) * | 2019-08-12 | 2019-12-20 | 浙江工业大学 | Energy perception opportunity routing control method facing mobile nano network |
Non-Patent Citations (2)
| Title |
|---|
| 分子纳米网络中地理机会路由算法设计与实现;董彤;洪永发;;软件导刊;20171115(第11期);全文 * |
| 纳米物联网中的机会路由机制研究;陈卓雅;《中国优秀硕士学位论文全文数据库 基础科技辑》;20210215;摘要以及正文第三章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114286415A (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Alam et al. | TAD-MAC: traffic-aware dynamic MAC protocol for wireless body area sensor networks | |
| US9936479B2 (en) | Traffic advertisement and scheduling in a neighbor aware network data link | |
| TWI420950B (en) | Improvements to short-range wireless networks | |
| CN101232518B (en) | Low-power dissipation media access control method of node dynamic state resting | |
| US9955421B2 (en) | Traffic advertisement and scheduling in a neighbor aware network data link | |
| US9756603B2 (en) | Traffic advertisement and scheduling in a neighbor aware network data link | |
| US9936452B2 (en) | Traffic advertisement and scheduling in a neighbor aware network data link | |
| EP2496046A1 (en) | Two-stage adaptive frequency hopping method facing clustered wireless sensor network | |
| Lamprinos et al. | Energy-efficient MAC protocol for patient personal area networks | |
| CN106973419A (en) | A kind of innovatory algorithm of LEACH agreements | |
| US20200045636A1 (en) | Communication apparatus and communication method | |
| CN109951834A (en) | Bluetooth mesh method for routing based on the improved algorithm that floods | |
| Wu et al. | Named data networking enabled power saving mode design for WLAN | |
| WO2015184854A1 (en) | Method for implementing mac layer access, and sensor node | |
| TWI473522B (en) | Method and system for hierarchical clustering of wireless sensor networks | |
| CN114286415B (en) | Opportunistic routing method oriented to flow guiding nano network circulation sensing | |
| CN108135020A (en) | A kind of wireless sensor network opportunistic routing protocol design method based on network code | |
| Lee et al. | A Novel Energy-Conscious Access Point (eAP) System With Cross-Layer Design in Wi-Fi Networks for Reliable IoT Services | |
| CN104010339B (en) | A kind of WSN cluster-dividing methods based on packet loss rate measurement | |
| CN111770516A (en) | Frame structure design and use method for ad hoc network communication | |
| CN104486043B (en) | A kind of adaptive cooperation network coding method of differentiated service | |
| Zhihui et al. | EEFA: Energy efciency frame aggregation scheduling algorithm for IEEE 802.11 n wireless network | |
| Onwuegbuzie et al. | Performance evaluation for ContikiMAC, XMAC, CXMAC and NullMAC protocols for energy efficient wireless sensor networks | |
| CN110324876B (en) | Clustering routing method based on nano network node energy perception | |
| CN105188152A (en) | Network time slot allocation method based on media access control layer drive |
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 |