CN114900567A - DTN network message copying method, robot and robot system - Google Patents

DTN network message copying method, robot and robot system Download PDF

Info

Publication number
CN114900567A
CN114900567A CN202210301804.XA CN202210301804A CN114900567A CN 114900567 A CN114900567 A CN 114900567A CN 202210301804 A CN202210301804 A CN 202210301804A CN 114900567 A CN114900567 A CN 114900567A
Authority
CN
China
Prior art keywords
message
probability
node
delivery delay
encounter
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.)
Pending
Application number
CN202210301804.XA
Other languages
Chinese (zh)
Inventor
刘永广
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Industry Technical College
Original Assignee
Guangdong Industry Technical College
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangdong Industry Technical College filed Critical Guangdong Industry Technical College
Priority to CN202210301804.XA priority Critical patent/CN114900567A/en
Publication of CN114900567A publication Critical patent/CN114900567A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/24—Negotiation of communication capabilities
    • 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 provides a DTN network message copying method, a DTN network node and a storage medium, wherein the DTN network message copying method comprises the following steps: s101: when meeting with a node in the DTN, acquiring a destination node of the message, judging whether the meeting node is the destination node according to the destination node, if so, submitting the message to the meeting node, and executing S102, otherwise, executing S102; s102: acquiring the encounter probability and the delivery delay of the message which is not delivered to the destination node, calculating the replication probability of the message according to the encounter probability and the delivery delay, and switching the messages in the two nodes through the replication probability sequence. The invention obtains the copy probability of the message according to the encounter probability and the delivery delay, copies the message based on the copy probability, uniformly and effectively improves the copy efficiency of the message through the association of the encounter probability and the delivery delay, and increases the delivery success rate of the message.

Description

DTN network message copying method, robot and robot system
Technical Field
The present invention relates to the field of network communications, and in particular, to a DTN network packet replication method, a DTN network node, and a storage medium.
Background
A DTN (Delay/dispersion Tolerant Network) is a special wireless Network that often has some or all of the following features: the network node moves violently, the communication link bandwidth is limited, the communication environment condition is severe, the communication process is easy to be shielded and interfered, and heterogeneous subnets of various communication modes exist. The DTN has wide application in practice, and is mainly applied to the fields of military tactical internet, urban vehicle networks, sensor networks in various complex environments and the like.
The DTN is finally characterized in that the whole network can not maintain stable communication based on TCP/IP, the network topology changes frequently, the performance of the traditional IP routing protocol and Ad hoc network routing protocol based on route discovery and routing table maintenance is reduced, and the topology maintenance and networking requirements can not be finished. Aiming at the characteristics of the DTN, in order to solve the DTN networking problem under the complex condition, researchers provide a store-and-forward technology, and the essence of the store-and-forward technology is that an intermediate node stores a received message copy and forwards the message copy at a proper time. The research of the algorithm focuses on that each node receiving the message determines whether to store or not by predicting the relationship between the node and the destination node, if the prediction is contacted with the destination node with low probability in the future, the message is not required to be stored in a copy, and otherwise, the message is stored and forwarded.
At present, the probability of meeting of two nodes in the future is calculated, and then the message is always forwarded to the node with larger meeting probability with the destination node in the routing process. However, the encounter probability between nodes calculated by the encounter records is not stable enough, and the efficiency difference in different environments is large, so that the message replication efficiency is poor, and the message delivery success rate is difficult to increase effectively.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a DTN network message copying method, a DTN network node and a storage medium, after two nodes meet, the meeting probability and the delivery delay of the message in the node are obtained, the copying probability of the message is obtained according to the meeting probability and the delivery delay, the message is copied based on the copying probability, the copying efficiency of the message is uniformly and effectively improved through the association of the meeting probability and the delivery delay, and the delivery success rate of the message is increased.
In order to solve the above problems, the present invention adopts a technical solution as follows: a DTN network message copying method is applied to a DTN network node and comprises the following steps: s101: when meeting with a node in the DTN, acquiring a destination node of a message, judging whether the meeting node is the destination node according to the destination node, if so, submitting the message to the meeting node, and executing S102, otherwise, executing S102; s102: acquiring the encounter probability and the delivery delay of the message which is not delivered to the destination node, calculating the replication probability of the message according to the encounter probability and the delivery delay, and exchanging the messages in the two nodes according to the replication probability in a sequencing mode.
Further, the step of acquiring the destination node of the packet specifically includes: and acquiring the messages in the cache, and acquiring the destination node of each message according to the information of the messages.
Further, the step of determining whether the encountered node is the destination node according to the destination node specifically includes: acquiring node information of the encountered nodes, and judging whether the node information is matched with the information of the destination node; if yes, determining the encountered node as the destination node of the message; if not, determining that the destination node of the message is not the encountered node.
Further, the step of calculating the duplication probability of the packet according to the encounter probability and the delivery delay specifically includes: and acquiring the information entropy of the encounter probability and the delivery delay, calculating the weight of the information entropy, and calculating the copy probability of each message according to the weight.
Further, the step of obtaining the information entropy of the encounter probability and the delivery delay specifically includes: and standardizing the encounter probability and the delivery delay, and calculating the information entropy of the encounter probability and the delivery delay by using the standardized encounter probability and the delivery delay.
Further, by
Figure BDA0003563212430000031
Standardizing the encounter probability by
Figure BDA0003563212430000032
The delivery delay is normalized, wherein,
Figure BDA0003563212430000033
the encounter probability after normalization for the ith packet,
Figure BDA0003563212430000034
delivery delay after normalization for ith message, X i Is the encounter probability of the ith packet, Y i Delay of delivery, alpha, for the ith message 1 ，α 2 Is an influencing factor, and alpha 1 +α 2 ＝1。
Further, the step of calculating the information entropy of the encounter probability and the delivery delay by using the normalized encounter probability and the delivery delay specifically includes: by passing
Figure BDA0003563212430000035
Calculating the information entropy of the encounter probability by
Figure BDA0003563212430000036
Calculating the information entropy of the delivery delay, wherein EN (X) is the information entropy of the encounter probability, n is the number of messages in the cache of the node,
Figure BDA0003563212430000037
Figure BDA0003563212430000038
Figure BDA0003563212430000039
the encounter probability after normalization for the ith packet,
Figure BDA00035632124300000310
and (4) the delivery delay after the ith message is standardized.
Further, the step of exchanging packets in the two nodes through the replication probability ranking specifically includes: and sorting the messages in the nodes in a descending order according to the replication probability, sequentially replicating the messages based on the descending order, and sending the replicated messages to the meeting nodes.
Based on the same inventive concept, the invention further provides a DTN network node, where the DTN network node includes a processor and a memory, the processor is connected to the memory in a communication manner, and the memory stores a computer program, and the computer program is used to execute the DTN network message copying method described above.
Based on the same inventive concept, the present invention further provides a computer-readable storage medium storing program data for executing the DTN network message copying method as described above.
The invention has the beneficial effects that: after two nodes meet, the meeting probability and the delivery delay of the message in the nodes are obtained, the replication probability of the message is obtained according to the meeting probability and the delivery delay, the message is replicated based on the replication probability, the replication efficiency of the message is uniformly and effectively improved through the association of the meeting probability and the delivery delay, and the delivery success rate of the message is increased.
Drawings
Fig. 1 is a flowchart of an embodiment of a DTN network message copying method according to the present invention;
fig. 2 is a flowchart of another embodiment of a DTN network message copying method according to the present invention;
fig. 3 is a processing flow chart of the DTN network message copying method of the present invention after two nodes meet each other;
FIG. 4 is a diagram of a DTN network node according to an embodiment of the present invention;
fig. 5 is a block diagram of an embodiment of a computer-readable storage medium of the present invention.
Detailed Description
The following description of the embodiments of the present application is provided by way of specific examples, and other advantages and effects of the present application will be readily apparent to those skilled in the art from the disclosure herein. The present application is capable of other and different embodiments and its several details are capable of modifications and/or changes in various respects, all without departing from the spirit of the present application. It should be noted that the various embodiments of the present disclosure, described and illustrated in the figures herein generally, may be combined with one another without conflict, and that the structural components or functional modules therein may be arranged and designed in a variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure, presented in the figures, is not intended to limit the scope of the claimed disclosure, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
Referring to fig. 1 to fig. 3, fig. 1 is a flowchart illustrating a DTN network message replication method according to an embodiment of the present invention; fig. 2 is a flowchart of another embodiment of a DTN network message copying method according to the present invention; fig. 3 is a flowchart illustrating a process after two nodes meet in an embodiment of a DTN network message replication method according to the present invention. The DTN network message copying method of the present invention is described in detail with reference to fig. 1 to 3.
In this embodiment, the DTN network packet replication method is applied to a DTN network node, where the DTN network node may be a router, a mobile phone, a wireless sensor, or other devices that can be used in a component DTN network. The DTN network message copying method executed by the DTN network node comprises the following steps:
s101: when the node meets the node in the DTN, the destination node of the message is obtained, whether the meeting node is the destination node or not is judged according to the destination node, if yes, the message is delivered to the meeting node, S102 is executed, and if not, S102 is executed.
In this embodiment, the step of acquiring the destination node of the packet specifically includes: and acquiring the messages in the cache, and acquiring the destination node of each message according to the information of the messages.
The step of judging whether the encountered nodes are the destination nodes according to the destination nodes specifically comprises the following steps: acquiring node information of the encountered nodes, and judging whether the node information is matched with the information of the target node; if yes, determining the encountered node as the destination node of the message; if not, determining that the destination node of the message is not the encountered node.
S102: acquiring the encounter probability and the delivery delay of the message which is not delivered to the destination node, calculating the replication probability of the message according to the encounter probability and the delivery delay, and switching the messages in the two nodes through the replication probability sequence.
In this embodiment, the method for calculating the encounter probability and the delivery delay of the packet is the prior art and will not be described in detail herein.
The step of calculating the replication probability of the message according to the encounter probability and the delivery delay specifically comprises the following steps: acquiring the encounter probability and the information entropy of the delivery delay, calculating the weight of the information entropy, and calculating the copy probability of each message through the weight.
The step of obtaining the information entropy of the encounter probability and the delivery delay specifically comprises the following steps: and standardizing the encounter probability and the delivery delay, and calculating the information entropy of the encounter probability and the delivery delay by utilizing the standardized encounter probability and the delivery delay.
In the present embodiment, by
Figure BDA0003563212430000061
Standardizing the encounter probability by
Figure BDA0003563212430000062
The delivery delay is normalized, wherein,
Figure BDA0003563212430000063
the encounter probability after normalization for the ith packet,
Figure BDA0003563212430000064
delivery delay after normalization for ith message, X i Is the encounter probability of the ith packet, Y i Delay of delivery, alpha, for the ith message 1 ，α 2 Is an influencing factor, and alpha 1 +α 2 ＝1。
In a specific embodiment, take α 1 ＝α 2 ＝0.5。
In one embodiment, the step of calculating the information entropy of the encounter probability and the delivery delay by using the normalized encounter probability and the delivery delay specifically includes: by passing
Figure BDA0003563212430000065
Computing encounter summaryEntropy of rate by
Figure BDA0003563212430000066
Calculating the information entropy of the delivery delay, wherein EN (X) is the information entropy of the encounter probability, n is the number of messages in the cache of the node,
Figure BDA0003563212430000067
Figure BDA0003563212430000068
Figure BDA0003563212430000069
the encounter probability after normalization for the ith packet,
Figure BDA00035632124300000610
the delivery delay after the ith message is standardized.
After the information entropy of the encounter probability and the submission delay is obtained, the weight of the information entropy is calculated, wherein the weight is obtained through
Figure BDA00035632124300000611
Calculating information entropy weight w (X) of encounter probability, and passing information entropy weight w (Y) of submission delay
Figure BDA00035632124300000612
And (4) calculating. EN (X) is the information entropy of the encounter probability, EN (Y) is the information entropy of the delivery delay.
After the weight of the information entropy is obtained, the replication probability is calculated based on the weight, the normalized encounter probability and the delivery delay. Wherein, the duplication probability of the message i
Figure BDA0003563212430000071
Wherein the content of the first and second substances,
Figure BDA0003563212430000072
Figure BDA0003563212430000073
n is the number of messages in the buffer,
Figure BDA0003563212430000074
w (X) is the information entropy weight of the encounter probability, w (Y) is the information entropy weight of the delivery delay,
Figure BDA0003563212430000075
in order to normalize the probability of an encounter after normalization,
Figure BDA0003563212430000076
is the normalized delivery delay.
The step of exchanging packets in the two nodes by means of the replication probability ordering specifically comprises: and sorting the messages in the nodes in a descending order according to the copying probability, copying the messages in sequence based on the sorting in the descending order, and sending the copied messages to the meeting nodes. Specifically, according to the calculated duplication probability of each message, the messages with high duplication probability are preferentially duplicated in a limited time and space according to descending order from large to small.
The invention designs a DTN network message replication algorithm comprehensively considering the encounter probability and the delivery delay influence, wherein a node A encounters a node B, the node A judges whether a message of the node B exists or not, if so, the message is directly delivered to the node B, if not, before the message is sequenced, a comprehensive measurement index is firstly calculated according to the encounter probability and the delivery delay, and then the message is sequenced and replicated according to the comprehensive index, so that the message replication efficiency can be effectively improved, and the message delivery success rate is increased.
Based on the same inventive concept, the present invention further provides a DTN network node, please refer to fig. 4, fig. 4 is a structural diagram of an embodiment of the DTN network node of the present invention, and the DTN network node of the present invention is described with reference to fig. 4.
In this embodiment, the DTN network node includes a processor and a memory, where the processor is connected to the memory in a communication manner, and the memory stores a computer program, and the computer program is used to execute the DTN network packet replication method according to the foregoing embodiment.
In some embodiments, memory may include, but is not limited to, high speed random access memory, non-volatile memory. Such as one or more magnetic disk storage devices, flash memory devices, or other non-volatile solid-state storage devices. The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the device can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable functional device, a discrete Gate or transistor functional device, or a discrete hardware component.
Based on the same inventive concept, the present invention further provides a computer-readable storage medium, please refer to fig. 5, fig. 5 is a structural diagram of an embodiment of the computer-readable storage medium of the present invention, and the computer-readable storage medium of the present invention is described with reference to fig. 5.
In the present embodiment, a computer-readable storage medium stores program data used to execute the DTN network message copy method according to the above-described embodiment.
The computer-readable storage medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs (compact disc-read only memories), magneto-optical disks, ROMs (read only memories), RAMs (random access memories), EPROMs (erasable programmable read only memories), EEPROMs (electrically erasable programmable read only memories), magnetic or optical cards, flash memory, or other type of media/machine-readable medium suitable for storing machine-executable instructions. The computer readable storage medium may be an article of manufacture that is not accessible to the computer device or may be a component that is used by an accessed computer device.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A DTN network message copying method is characterized in that the DTN network message copying method is applied to a DTN network node and comprises the following steps:
s101: when meeting with a node in the DTN, acquiring a destination node of a message, judging whether the meeting node is the destination node according to the destination node, if so, submitting the message to the meeting node, and executing S102, otherwise, executing S102;
s102: acquiring the encounter probability and the delivery delay of the message which is not delivered to the destination node, calculating the replication probability of the message according to the encounter probability and the delivery delay, and exchanging the messages in the two nodes according to the replication probability in a sequencing mode.
2. The DTN network packet replication method of claim 1, wherein the step of obtaining the destination node of the packet specifically comprises:
and acquiring messages in the cache, and acquiring a destination node of each message according to the information of the messages.
3. The DTN network packet replication method of claim 1, wherein the step of determining whether the encountered node is the destination node according to the destination node specifically comprises:
acquiring node information of the encountered nodes, and judging whether the node information is matched with the information of the destination node;
if yes, determining the encountered node as the destination node of the message;
if not, determining that the destination node of the message is not the encountered node.
4. The DTN network packet replication method according to claim 1, wherein the step of calculating the packet replication probability according to the encounter probability and the delivery delay specifically comprises:
and acquiring the information entropy of the encounter probability and the delivery delay, calculating the weight of the information entropy, and calculating the copy probability of each message according to the weight.
5. The DTN network packet replication method according to claim 4, wherein the step of obtaining the information entropy of the encounter probability and the delivery delay specifically comprises:
and standardizing the encounter probability and the delivery delay, and calculating the information entropy of the encounter probability and the delivery delay by using the standardized encounter probability and the delivery delay.
6. The DTN network message replication method of claim 5, wherein the message replication method is achieved by
Figure FDA0003563212420000021
Standardizing the encounter probability by
Figure FDA0003563212420000022
Figure FDA0003563212420000023
The delivery delay is normalized, wherein,
Figure FDA0003563212420000024
for the encounter probability, Y, after normalization of the ith message i * Delivery delay after normalization for ith message, X i Is the encounter probability of the ith packet, Y i Delay of delivery, alpha, for the ith message 1 ，α 2 Is an influencing factor, and alpha 1 +α 2 ＝1。
7. The DTN network packet replication method according to claim 5, wherein the step of calculating the information entropy of the encounter probability and the delivery delay by using the normalized encounter probability and the delivery delay specifically includes:
by passing
Figure FDA0003563212420000025
Calculating the information entropy of the encounter probability by
Figure FDA0003563212420000026
Figure FDA0003563212420000027
Calculating the information entropy of the delivery delay, wherein EN (X) is the information entropy of the encounter probability, n is the number of messages in the cache of the node,
Figure FDA0003563212420000028
Figure FDA0003563212420000029
for the encounter probability, Y, after normalization of the ith message i * The delivery delay after the ith message is standardized.
8. The DTN network packet replication method of claim 6, wherein the step of exchanging packets in two nodes through the replication probability ordering specifically comprises:
and sorting the messages in the nodes in a descending order according to the replication probability, sequentially replicating the messages based on the descending order, and sending the replicated messages to the meeting nodes.
9. A DTN network node, comprising a processor, a memory, the processor communicatively coupled to the memory, the memory storing a computer program, the computer program adapted to perform the DTN network message copying method of any of claims 1-8.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores program data for executing the DTN network message copying method according to any one of claims 1-8.
CN202210301804.XA 2022-03-24 2022-03-24 DTN network message copying method, robot and robot system Pending CN114900567A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210301804.XA CN114900567A (en) 2022-03-24 2022-03-24 DTN network message copying method, robot and robot system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210301804.XA CN114900567A (en) 2022-03-24 2022-03-24 DTN network message copying method, robot and robot system

Publications (1)

Publication Number Publication Date
CN114900567A true CN114900567A (en) 2022-08-12

Family

ID=82715119

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210301804.XA Pending CN114900567A (en) 2022-03-24 2022-03-24 DTN network message copying method, robot and robot system

Country Status (1)

Country Link
CN (1) CN114900567A (en)

Similar Documents

Publication Publication Date Title
Zhao et al. Cooperative caching in wireless p2p networks: Design, implementation, and evaluation
Artail et al. COACS: A cooperative and adaptive caching system for MANETs
Gao et al. Supporting cooperative caching in disruption tolerant networks
CN107404530B (en) Social network cooperation caching method and device based on user interest similarity
Tyson et al. Towards an information-centric delay-tolerant network
KR102160494B1 (en) Network nodes, endpoint nodes, and how to receive messages of interest
CN107135268B (en) Distributed task computing method based on information center network
US20100177680A1 (en) System and method of delivering content using networked wireless communication units
FR2910761A1 (en) ROUTING PROCESS IN AN INTERMITTENT CONNECTIVITY NETWORK.
US20160156733A1 (en) Content placement in hierarchical networks of caches
Sourlas et al. Mobility support through caching in content-based publish/subscribe networks
KR101231857B1 (en) Social-community based DTN routing method
Woodrow et al. SPIN-IT: a data centric routing protocol for image retrieval in wireless networks
Magaia et al. Selfish and malicious behavior in delay-tolerant networks
US11645255B2 (en) Method, electronic device, and computer program product for storing and searching for data
CN117278628B (en) Data transmission method, device, system, computer equipment and storage medium
CN114900567A (en) DTN network message copying method, robot and robot system
CN108076144B (en) Fair caching algorithm and device for content-centric network
Fan et al. Web access patterns enhancing data access performance of cooperative caching in IMANETs
US11006310B2 (en) Node-density aware interest packet forwarding in ad hoc network
CN110048948B (en) DTN network data prediction forwarding method, device and medium based on initial social relationship
Bao et al. Ins and outs: Optimal caching and re-caching policies in mobile networks
Chang et al. A probabilistic Spray-and-Wait routing algorithm based on node interest preference in delay tolerant networks
CN102449979B (en) System, method and device for improving performences of content sharing system including content sharing client terminal
Kong et al. Link congestion and lifetime based in-network caching scheme in Information Centric Networking

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication