CN114302473B - Energy perception routing method oriented to delay tolerant network - Google Patents
Energy perception routing method oriented to delay tolerant network Download PDFInfo
- Publication number
- CN114302473B CN114302473B CN202210048620.7A CN202210048620A CN114302473B CN 114302473 B CN114302473 B CN 114302473B CN 202210048620 A CN202210048620 A CN 202210048620A CN 114302473 B CN114302473 B CN 114302473B
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- energy
- data
- forwarding
- 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 18
- 230000008447 perception Effects 0.000 title claims abstract description 7
- 230000005540 biological transmission Effects 0.000 claims abstract description 44
- 238000004891 communication Methods 0.000 claims abstract description 12
- 238000005265 energy consumption Methods 0.000 claims abstract description 6
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 9
- 238000013461 design Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 4
- 230000003044 adaptive effect Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 claims 1
- 238000012790 confirmation Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000003139 buffering effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- JJWKPURADFRFRB-UHFFFAOYSA-N carbonyl sulfide Chemical compound O=C=S JJWKPURADFRFRB-UHFFFAOYSA-N 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000004083 survival effect Effects 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
Abstract
The invention discloses an energy perception routing method facing a delay tolerant network, which comprises the steps of firstly, carrying out data packet priority ordering, firstly, generating a data packet by a source node, and then carrying out rule ordering in data transmission on the priority of the data packet in an internal storage area of the node; secondly, before forwarding the message, the current node needs to find other neighbor nodes in a communicable range, and if found, the current node forwards the data; when two nodes enter the communication range of each other, the data packets are forwarded respectively. The invention can effectively select the next hop node according to the energy relation of the node, reduces the node energy consumption, reduces the network overhead, improves the transmission rate of the data packet, and has great significance for improving the characteristics of the DTN.
Description
Technical Field
The invention relates to an energy perception routing method oriented to a delay tolerant network, and belongs to the technical field of wireless communication networks.
Background
Delay Tolerant Networks (DTNs) are mobile wireless networks characterized by radio waves as carriers, limited node capabilities, frequent node movement, and poor communication environments. Its earliest concept starts with an interplanetary network in which nodes are typically deployed on different stars, the basic purpose of which is to enable message transmission between planets. However, because the distance between the planets is long and the complex environment of the cosmic space causes a large transmission delay of the message, the connection between the nodes is frequently interrupted, and the existing end-to-end based TCP/IP network architecture is not suitable for the network architecture. In such networks, where there is no end-to-end path available between the source node and the destination node, network disruption may occur frequently, and the presence of DTNs can effectively solve these problems. Meanwhile, the node in the DTN is dynamic, and according to the mobility of the node, the message can be transmitted to any other node in the communication range of the node for the opportunity of transmitting the message between the source node and the destination node. The mobile node then transmits the message to the destination in a "carry-store-forward" mode, effectively solving the communication problem in the restricted network. With the development of related technologies, the field to which the DTN is applied at present is wild animal tracking, rural communication network, laser communication, post-disaster reconstruction network and the like.
Compared with the traditional network, various resources such as cache, bandwidth, processing capacity of the node and the like of the DTN are very limited, and in order to improve the message delivery rate, the DTN usually replicates a plurality of message copies of a message and sends the message through a plurality of paths respectively, so that the reliability of message delivery is ensured, and the load pressure of the node in the DTN becomes very high. Conventional routing protocols are not capable of delivering messages in a challenging environment, and delay tolerant networks help overcome the difficulty of providing network access in a challenging environment, requiring a different routing protocol than conventional routing protocols.
The MaxProp protocol is one of the more classical routing methods in DTN, and the routing algorithm is developed based on the pro protocol, so that not only is a formula redefined, but also some additional mechanisms are utilized to improve the probability of successful transmission of the message and reduce the transmission delay. It is also essentially a routing protocol based on probability statistics. The MaxProp protocol estimates the transmission probability of each message according to the past meeting condition of the nodes, then uses the transmission probability and the hop count of the data packets to sequence the data packets inside the nodes, and then forwards the data packets most likely to reach the destination node preferentially. However, the MaxProp protocol does not consider the influence of node energy, and for each mobile node, its energy resource is limited, and it takes a lot of energy to send, receive and process information, and the exhaustion of node energy will cause that it cannot normally perform message transmission, resulting in reduced network performance.
Disclosure of Invention
In view of the problems of the prior art and the material selection, the invention provides an energy-aware routing method for a delay tolerant network, which has great significance for improving the characteristics of a DTN.
The technical scheme of the invention is as follows: an energy-aware routing method for a delay tolerant network comprises the following steps:
step 1, data packet priority ordering, namely firstly, generating a data packet by a source node, and then, carrying out rule ordering in data transmission on the priority of the data packet in an internal storage area of the node;
step 2, neighbor discovery, before forwarding the message, the current node needs to discover other neighbor nodes in a communicable range, and if so, data forwarding is performed; the communicable range is: for each node, there is a communication range, which is a circle with the node as a circle point and R as a radius. The node with the distance smaller than R from the circle center belongs to the neighbor node, and can normally communicate. R can be specifically set during simulation.
And 3, forwarding the data, namely forwarding the data packets of the two nodes respectively after the two nodes enter the mutual communication range.
In step 3, before the neighbor discovery and data forwarding, the priority ordering is performed on the data packets in the nodes, and for the nodes, a proper next hop is selected for forwarding according to energy perception. The concrete contents are as follows: forwarding the data packet in the previous step to a neighbor node, and forwarding the data packet to a next hop node according to the priority when the energy of the current node is smaller than that of the neighbor node; when the energy of the current node is larger than that of the neighbor node, forwarding is not performed, the current node continues to generate or accept the data packet, and then the priority ordering is performed on the data packet again.
Further, the message caching mode in the node is as follows: the storage area is divided into left and right parts by a threshold value, and in the network, a data packet with a smaller forwarding hop count is defined as a higher priority, i.e. a data packet with a forwarding hop count smaller than the threshold value is defined as a high priority. If the hop count of a certain data packet is smaller than the threshold value, the priority of the certain data packet is larger than the threshold value; for the case that the hop count of the data packet forwarding is smaller than the threshold value, the responding data packets are arranged according to the hop count, and if the hop count of the data packet is larger, the priority is lower; in the case that the hop count of the data packet is greater than the threshold value, the route adopts an adaptive method to adjust the threshold value, and the formula is as follows:
wherein x is the average byte number transmitted when the message is transmitted, b is the capacity size of the storage area, p is a part of the size of the storage area, and the size of the threshold t is equal to the number of hops passed by a data packet corresponding to the p-th byte contained in the message buffer area; if x < b/2, the data packet with smaller hop count is defined to have higher priority; as x becomes larger, the threshold t is mainly determined by the minimum value of x and b-x; when x is greater than p, the threshold value is defined as 0.
Further, when the hop count of the data packet is larger than the threshold value, the data packet is ordered according to the transmission probability, and the higher the transmission probability value is, the higher the priority is; the probability of transmission estimate is defined as follows:
assuming that the set of network nodes is s, for any node i e s, the probability of meeting the node j is calculatedWhere i εs, j+.i, the initial value is 1/(|s| -1), when node i and node j meet, the +.>The value of (1) will be automatically incremented by 1 and then all associated probability values in node i will be normalized again. These probability values are exchanged with each other whenever nodes meet; the local node can save the probability estimated value of other nodes after obtaining the probability estimated value of other nodes, so that the transmission cost c (i, i+1, …, d) from different paths to the destination node d can be obtained, and the probability estimated value is defined as the sum of the probability estimated value of each link as shown in a formula (2);
further, the problem of selecting the next hop node is completed by judging the energy among the nodes, each node resource of the DTN is limited, and a large amount of energy is consumed for ensuring the transmission of information, including the consumption of energy E for transmission t Energy consumption E is received r Scan information energy E s The specific calculation modes are shown in formulas (3), (4) and (5):
E t ＝(P e +P a R n )T t (3)
E r ＝(P e +P p )T r (4)
E s ＝P s T s (5)
wherein P is e Is the energy consumed by the transceiver per second, P a Is the energy consumed by the transmitter radio frequency amplifier per second; p (P) p Is the energy consumed for processing in the receiver, P s Is the energy consumed by scanning to the radio environment, P s ＝P e These parameters are determined by the design characteristics of the transceiver; r is the transmission range and n is the power index of the channel path loss; t (T) t Is the time consumed for transmitting data, T r Is the time spent receiving the data packet, T s Is the time spent scanning messages; if the energy of the node in the network does not become zero, when the node receives the data packet, comparing the current energy level with the energy level of the neighbor node, judging whether to forward the message to the neighbor node, and when the energy of the current node is smaller than the energy of the neighbor node, forwarding the data packet to the next hop node according to the priority; when the energy of the current node is larger than that of the neighbor node, forwarding is not performed, the current node continuously generates or receives the data packet, and then the priority ordering is performed on the data packet again.
Furthermore, in addition to ordering and forwarding the data packets in the node, the memory of the node is limited, and the corresponding data packets need to be deleted in the buffer space, so that the data packets can not be transmitted after the deletion. Without reducing the packet transmission rate of the delay tolerant network, the node needs to complete one of the following three conditions to delete the packet: first, a copy of the packet has been transmitted to the destination node; secondly, in the time stamp range of the data packet, the residual bandwidth between the current node and the destination node is smaller than the required bandwidth for data packet transmission so as to ensure that the data packet can be transmitted; third, if none of the copies of the current packet is transmitted to the destination node, the copies of the packet that exist in the other nodes may still be transmitted to the destination node after the current node deletes its stored corresponding packet.
Compared with the prior art, the invention has the beneficial effects that: the energy sensing MaxProp routing strategy EA-MaxProp provided by the invention can effectively select the next hop node according to the energy relation of the node on the basis of the MaxProp, thereby reducing the node energy consumption, reducing the network overhead, improving the transmission rate of the data packet and having great significance for improving the characteristics of the DTN.
Drawings
Fig. 1 is a flow chart of the present invention.
Fig. 2 is a schematic diagram of a message buffering mode of a node in the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary only for explaining the present invention and are not to be construed as limiting the present invention.
The energy sensing routing method for the delay tolerant network is provided for the MaxProp protocol without considering the problem of node energy, so that the energy sensing MaxProp routing strategy EA-MaxProp (Energy Aware MaxProp) is provided. The DTN node replicates each message copy and consumes a significant amount of energy to ensure transmission. The network deployment of the energy-aware MaxProp routing strategy in the DTN mainly comprises three steps of data packet priority ordering, neighbor discovery and data forwarding, as shown in fig. 1, firstly, a source node generates a data packet, then, the priority of the data packet is ordered in a certain rule in an internal storage area of the node, then, the data packet is forwarded to a neighbor node, and when the energy of the current node is smaller than that of the neighbor node, the data packet is forwarded to a next hop node according to the priority; when the energy of the current node is larger than that of the neighbor node, forwarding is not performed, the current node continues to generate or receive the data packet, and then the priority ordering is performed on the data packet again.
The neighbor discovery means that the current node needs to discover other neighbor nodes within a communication range before forwarding the message, so that data forwarding can be performed.
The data forwarding refers to forwarding the data packets of two nodes respectively when the two nodes enter the mutual communication range. Before neighbor discovery and data forwarding, the priority ordering is carried out on the data packets in the nodes, and the appropriate next hop is selected for forwarding according to energy perception among the nodes. The message buffering mode in the node is shown in fig. 2, and the storage area is divided into a left part and a right part by a threshold value. In a network, a packet forwarding hop count is defined as a higher priority, and if the hop count of a certain packet is smaller than a threshold value, the packet forwarding hop count is higher than the packet forwarding hop count of a packet greater than the threshold value. When the number of hops of the data packet is smaller than the threshold value, the responding data packet is mainly arranged according to the number of hops, and if the number of hops of the data packet is larger, the priority of the data packet is lower; when the hop count of the data packet is larger than the threshold value, the route adopts an adaptive method to adjust the threshold value, and the method is shown in a formula (1).
Where x is the average number of bytes transmitted when there is an opportunity to transmit a message, b is the capacity size of the storage area, p is a part of the size of the storage area, and the size of the threshold t is equal to the number of hops traversed by a packet corresponding to the p-th byte contained in the message buffer. If x is much smaller than b, packets with a smaller number of hops already forwarded will be defined with a higher priority; as x becomes larger, the threshold t is mainly determined by the minimum value of x and b-x; when x is greater than p, the threshold value is not necessary and can be defined as 0. For the case in fig. 1 where the number of hops of the packets is greater than the threshold value, they are ordered according to transmission probability, the greater the transmission probability value, the higher the priority will be. The probability of transmission estimate is defined as follows:
assuming that the set of network nodes is s, for any node i e s, the probability of encountering node j can be calculatedWhere i εs, j+.i, the initial value is 1/(|s| -1), when node i and node j meet, the +.>The value of (1) will be automatically incremented by 1 and then all associated probability values in node i will be normalized again. The nodes exchange these probability values each time they meet. For example, in a DTN network with only six nodes, the probability estimate of node i for the other five nodes to begin with is +.> After first encounter with node 1 +.>Becomes 1.2 and thenAnd then re-normalizing the writing probability to obtain a new probability: />The local node will save the probability estimates of other nodes after obtaining them, and then can calculate the transmission cost c (i, i+1, …, d) from different paths to the destination node d, and define the sum of the probability estimates for each link as shown in the formula (2). So in case the number of hops of the data packet is larger than the threshold value, the smaller the transmission cost is, the higher the priority thereof is.
And finishing the selection problem of the next hop node by judging the energy among the nodes. Each node resource of the DTN is limited, and a lot of energy is consumed in order to guarantee the transmission of information. Mainly comprises the transmission of consumed energy E t Energy consumption E is received r Scan information energy E s The specific calculation modes are shown in formulas (3), (4) and (5). Wherein P is e Is transceiver per second
E t ＝(P e +P a R n )T t (3)
E r ＝(P e +P p )T r (4)
E s ＝P s T s (5)
Consumed energy, P a Is the energy consumed by the transmitter radio frequency amplifier per second; p (P) p Is the energy consumed for processing in the receiver, P s Is the energy consumed by scanning to the radio environment, P s ＝P e These parameters are determined by the design characteristics of the transceiver. R is the transmission range and n is the power index of the channel path loss. T (T) t Is the time it takes to transmit data. T (T) r Is the time spent receiving the data packet, T s Is the time it takes to scan for messages. If the energy of the node in the network does not become zero, the node will receive the data packetIts current energy level is compared with the energy level of the neighbors to determine whether to forward the message to its neighbor nodes. When the energy of the current node is smaller than that of the neighbor node, forwarding the data packet to the next hop node according to the priority; when the energy of the current node is larger than that of the neighbor node, forwarding is not performed, the current node continuously generates or receives the data packet, and then the priority ordering is performed on the data packet again.
In addition to ordering and forwarding packets within a node, since the memory of the node is also limited, the corresponding packet needs to be deleted in the buffer space, after which it will not be transmitted any more. The node needs to complete one of the following three cases to delete the packet without reducing the packet transmission rate of the delay tolerant network. First, a copy of the packet has been transmitted to the destination node; secondly, in the time stamp range of the data packet, no enough bandwidth exists between the current node and the destination node to ensure that the data packet can be transmitted; third, if none of the copies of the current packet is transmitted to the destination node, the copies of the packet that exist in the other nodes may still be transmitted to the destination node after the current node deletes its stored corresponding packet. These criteria can be verified, they are necessary and sufficient. Firstly, the three conditions are mutually exclusive, and two or three conditions can not be met simultaneously for any data packet; second, the only unaccounted for is that the packet is not transmitted to the destination node, but only if the current node holds a copy of the packet, the message can be transmitted to the destination node. In summary, for deleting a packet, the copy of the packet that has been transmitted to the destination node is deleted first; then, the data packet with low priority is selected to be deleted, and the lower the priority is, the earlier the data packet is deleted.
There are other mechanisms for facilitating packet transmission and reducing message transmission delay that improve the routing strategy. First, if a neighbor node is a destination node that a certain packet needs to reach, the corresponding packet is sent preferentially. Second, the estimates of the probability of meeting between nodes are exchanged between nodes. Third, for data packets that have been successfully transmitted, a confirmation message is forwarded, each of which is 128 bits in length, and the confirmation message includes the source node identifier, destination node identifier, and hash value of the encrypted specific content of the corresponding message, which can help eliminate messages that have been time-consuming and useless in the network according to the confirmation mechanism. Fourth, the remaining packets that are not forwarded need to be ordered according to priority. Fifth, there is a node list in each copy of the data packet for recording all nodes that have passed, and the node list also includes the nodes that currently forward the copy of the data packet. If a node has received a packet, it will not receive the node repeatedly.
After the EA-MaxProp route is adopted, as the node with high node energy is selected as the next hop, the survival time is long, the opportunity for transmitting the message to the destination node is higher, the transmission times are reduced, the network overhead is reduced, and the energy consumption of the node is correspondingly reduced. For nodes with smaller energy, the probability of receiving the data packet is reduced, the energy is not used up prematurely, the node dies prematurely, the service life of the network is prolonged sufficiently, and the transmission rate of the data packet is increased
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims.
Claims (4)
1. An energy-aware routing method for a delay tolerant network is characterized in that: the method comprises the following steps:
step 1, data packet priority ordering, namely firstly, generating a data packet by a source node, and then, carrying out rule ordering in data transmission on the priority of the data packet in an internal storage area of the node;
step 2, neighbor discovery, before forwarding the message, the current node needs to discover other neighbor nodes in a communicable range, and if so, data forwarding is performed;
step 3, data forwarding, namely after two nodes enter the mutual communication range, forwarding data packets of the two nodes respectively, and before neighbor discovery and data forwarding, sequencing the priority of the data packets in the nodes, and selecting a proper next hop for forwarding according to energy perception among the nodes; forwarding the data packet in the previous step to a neighbor node, and forwarding the data packet to a next hop node according to the priority when the energy of the current node is smaller than that of the neighbor node; when the energy of the current node is larger than that of the neighbor node, forwarding is not performed, the current node continuously generates or receives the data packet, and then the priority ordering is performed on the data packet again;
in addition to ordering and forwarding the data packets in the node, the memory of the node is limited, and the corresponding data packets need to be deleted in the buffer space, so that the data packets can not be transmitted after the deletion; without reducing the packet transmission rate of the delay tolerant network, the node needs to complete one of the following three conditions to delete the packet: first, a copy of the packet has been transmitted to the destination node; secondly, in the time stamp range of the data packet, the residual bandwidth between the current node and the destination node is smaller than the required bandwidth for data packet transmission so as to ensure that the data packet can be transmitted; third, if none of the copies of the current packet is transmitted to the destination node, the copies of the packet that exist in the other nodes may still be transmitted to the destination node after the current node deletes its stored corresponding packet.
2. The delay tolerant network-oriented energy aware routing method of claim 1, wherein: the message caching mode in the node is as follows: the storage area is divided into a left part and a right part by a threshold value, in a network, a data packet with the hop count smaller than the threshold value is defined as a data packet with higher priority, and if the hop count of a certain data packet is smaller than the threshold value, the priority of the certain data packet is larger than the threshold value; for the case that the hop count of the data packet forwarding is smaller than the threshold value, the responding data packets are arranged according to the hop count, and if the hop count of the data packet is larger, the priority is lower; in the case that the hop count of the data packet is greater than the threshold value, the route adopts an adaptive method to adjust the threshold value, and the formula is as follows:
wherein x is the average byte number transmitted when the message is transmitted, b is the capacity size of the storage area, p is a part of the size of the storage area, and the size of the threshold t is equal to the number of hops passed by a data packet corresponding to the p-th byte contained in the message buffer area; if x < b/2, the data packet with smaller hop count is defined to have higher priority; as x becomes larger, the threshold t is mainly determined by the minimum value of x and b-x; when x is greater than p, the threshold value is defined as 0.
3. The delay tolerant network-oriented energy aware routing method of claim 2, wherein: when the hop count of the data packet is larger than the threshold value, sorting the data packets according to the transmission probability, wherein the higher the transmission probability value is, the higher the priority is; the probability of transmission estimate is defined as follows:
assuming that the set of network nodes is s, for any node i e s, the probability f of meeting the node j is calculated j i Where i εs, j+.i, the initial value is 1/(|s| -1), f when node i and node j meet j i Automatically adding 1 to the value of (1), and then normalizing again all associated probability values in node i; these probability values are exchanged with each other whenever nodes meet; the local node can save the probability estimated value of other nodes after obtaining the probability estimated value, and then can calculateDefining the transmission cost c (i, i+1, …, d) from the different paths to the destination node d as shown in the formula (2), which is the sum of the probability estimates for each link not occurring;
。
4. the delay tolerant network-oriented energy aware routing method of claim 1, wherein: the problem of selecting the next hop node is completed by judging the energy among the nodes, each node resource of the DTN is limited, and a large amount of energy is consumed for ensuring the transmission of information, including the consumption of energy E for transmission t Energy consumption E is received r Scan information energy E s The specific calculation modes are shown in formulas (3), (4) and (5):
E t ＝(P e +P a R n )T t (3)
E r ＝(P e +P p )T r (4)
E s ＝P s T s (5)
wherein P is e Is the energy consumed by the transceiver per second, P a Is the energy consumed by the transmitter radio frequency amplifier per second; p (P) p Is the energy consumed for processing in the receiver, P s Is the energy consumed by scanning to the radio environment, P s ＝P e These parameters are determined by the design characteristics of the transceiver; r is the transmission range and n is the power index of the channel path loss; t (T) t Is the time consumed for transmitting data, T r Is the time spent receiving the data packet, T s Is the time spent scanning messages; if the energy of the node in the network does not become zero, when the node receives the data packet, comparing the current energy level with the energy level of the neighbor node, judging whether to forward the message to the neighbor node, and when the energy of the current node is smaller than the energy of the neighbor node, forwarding the data packet to the next hop node according to the priority; when the energy of the current node is larger than that of the neighbor nodeAnd when the current node receives the data packet, the current node judges the energy of the current node and the energy of the neighbor node and selects to forward the data packet until the data packet is delivered to the destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210048620.7A CN114302473B (en) | 2022-01-17 | 2022-01-17 | Energy perception routing method oriented to delay tolerant network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210048620.7A CN114302473B (en) | 2022-01-17 | 2022-01-17 | Energy perception routing method oriented to delay tolerant network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114302473A CN114302473A (en) | 2022-04-08 |
| CN114302473B true CN114302473B (en) | 2023-11-24 |
Family
ID=80977634
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210048620.7A Active CN114302473B (en) | 2022-01-17 | 2022-01-17 | Energy perception routing method oriented to delay tolerant network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114302473B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843301A (en) * | 2012-09-12 | 2012-12-26 | 北京航空航天大学 | Routing method for mobile delay tolerant network based on contact predication |
| KR101618545B1 (en) * | 2015-04-24 | 2016-05-10 | 군산대학교산학협력단 | An energy-efficient message transmission method for a community-based Delay Tolerant Network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11146479B2 (en) * | 2019-10-10 | 2021-10-12 | United States Of America As Represented By The Secretary Of The Navy | Reinforcement learning-based intelligent control of packet transmissions within ad-hoc networks |
-
2022
- 2022-01-17 CN CN202210048620.7A patent/CN114302473B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102843301A (en) * | 2012-09-12 | 2012-12-26 | 北京航空航天大学 | Routing method for mobile delay tolerant network based on contact predication |
| KR101618545B1 (en) * | 2015-04-24 | 2016-05-10 | 군산대학교산학협력단 | An energy-efficient message transmission method for a community-based Delay Tolerant Network |
Non-Patent Citations (2)
| Title |
|---|
| A location aided controlled spraying routing algorithm for Delay Tolerant Networks;Guo Hang;《Ad Hoc Networks》;全文 * |
| 面向DTN的网络模型与路由策略研究;李陈浩;《中国优秀硕士学位论文全文数据库 信息科技辑》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114302473A (en) | 2022-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6535498B1 (en) | Route updating in ad-hoc networks | |
| Marwaha et al. | Mobile agents based routing protocol for mobile ad hoc networks | |
| Tran et al. | Congestion adaptive routing in mobile ad hoc networks | |
| US5987011A (en) | Routing method for Ad-Hoc mobile networks | |
| US7330694B2 (en) | Method for setting up route path through route discovery in a mobile ad hoc network using partial route discovery | |
| US8213352B2 (en) | Wireless communication system, wireless communication device, wireless communication method, and program | |
| Li et al. | A multipath routing protocol with load balancing and energy constraining based on AOMDV in ad hoc network | |
| Chakrabarti et al. | Load balancing and resource reservation in mobile ad hoc networks | |
| WO2020156340A1 (en) | Data transmission method and apparatus | |
| CN104009913A (en) | Broadcasting method based on distance and energy balance in mobile Ad Hoc network | |
| US11070467B1 (en) | Expedited route recovery and load balancing in a multi-radio mesh network | |
| CN114302473B (en) | Energy perception routing method oriented to delay tolerant network | |
| Chen et al. | Two hops backup routing protocol in mobile ad hoc networks | |
| Yu et al. | Distributed packet-aware routing scheme based on dynamic network coding | |
| CN114339933B (en) | Opportunistic routing method, device and system based on energy efficiency | |
| Tien et al. | A local/global strategy based on signal strength for message routing in wireless mobile ad-hoc networks | |
| Thamalaka et al. | Novel caching mechanism to improve performance in mobile ad-hoc networks (MANETs) | |
| CN113207155B (en) | Copy self-adaptive forwarding routing method based on network connectivity in flight ad hoc network | |
| CN111585898B (en) | Routing information increment transmission method facing wireless self-organizing network | |
| Agarwal et al. | Enhanced AODV routing protocol for ad hoc networks | |
| Abbas et al. | Delay and energy based message delivery in delay tolerant networks | |
| Nieminen et al. | Algorithms for real time trend detection | |
| Modani et al. | Adaptivity of arod routing protocol in sparse and dense Ad-hoc networks | |
| Prakash et al. | A Comprehensive Review on Key Routing Protocols in Mobile Ad Hoc Networks | |
| Vaithiyanathan et al. | Robust Fault Tolerant AOMDV Routing Mechanism in MANET |
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 |