CN115348223A - Opportunistic network cache management method based on message grouping - Google Patents
Opportunistic network cache management method based on message grouping Download PDFInfo
- Publication number
- CN115348223A CN115348223A CN202210961618.9A CN202210961618A CN115348223A CN 115348223 A CN115348223 A CN 115348223A CN 202210961618 A CN202210961618 A CN 202210961618A CN 115348223 A CN115348223 A CN 115348223A
- Authority
- CN
- China
- Prior art keywords
- message
- mes
- node
- messages
- original
- 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.)
- Granted
Links
- 238000007726 management method Methods 0.000 title claims abstract description 23
- 238000000034 method Methods 0.000 claims description 25
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 230000000593 degrading effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9063—Intermediate storage in different physical parts of a node or terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9031—Wraparound memory, e.g. overrun or underrun detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9084—Reactions to storage capacity overflow
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
An opportunistic network cache management method based on message grouping belongs to the field of opportunistic networks. The problem that when the existing opportunistic network cache management method carries out single attribute discarding information, the network performance is improved and other performances are reduced is solved; and the single discarding mode can relieve the problem of low buffer overflow efficiency. The invention firstly judges the relationship between the size of all messages in a message set needing to be received and the size of the node idle cache, if the idle cache of the node is not smaller than the size of the message set needing to be received, all the messages to be received are received, otherwise, the number of the messages in the message set needing to be received is continuously judged, and the original messages in the node caches are selected to be discarded according to the number of the messages in the message set needing to be received, thereby achieving the purpose of relieving the cache overflow phenomenon.
Description
Technical Field
The invention belongs to the field of opportunistic networks, and particularly relates to an opportunistic network cache management method based on message grouping.
Background
The opportunistic network is a novel network architecture, in the opportunistic network, a complete transmission path does not exist between a source node and a destination node, and network communication is realized by using meeting opportunities brought by node movement. Compared with the traditional network, the opportunistic network has the characteristics of node mobility, intermittent connectivity, limited resources and the like. To overcome these network characteristics, opportunistic networks use "store-carry-forward" routing for message transmission. Due to the finite node resources, the buffer resources of the nodes are easily and rapidly exhausted in the transmission process of the messages, and buffer overflow is caused. The effective cache management method is an important means for improving the network performance when the cache overflows, so that the design of the efficient cache management method has important significance for improving the performance of the opportunistic network.
Currently, the main method for solving the cache overflow is to discard the message in the node cache when the cache overflow occurs. For example, the DF (Drop Front) method: when the node buffer overflows, the message with the longest queuing time in the buffer space is preferentially discarded. DL (Drop Last) method: and when the node cache overflows, preferentially discarding the message with the shortest storage time in the node cache. DO (Drop Oldest) method: and when the node cache overflows, preferentially discarding the message with the shortest remaining available time in the node cache. Although the methods can alleviate the problem of node cache overflow, in the process of discarding messages, the methods only consider a single attribute discarding mode to discard messages, and do not design a cache management method by comprehensively considering a plurality of attributes in a network, so that the network can cause the problem of other performance reduction while improving certain performance, and the single discarding mode can alleviate the problem of low cache overflow efficiency.
Disclosure of Invention
The invention aims to solve the problem that the existing opportunistic network cache management method discards messages with single attribute, so that the network performance is improved and other performances are reduced; and the single discarding mode can relieve the problem of low buffer overflow efficiency. The invention provides an opportunistic network cache management method based on message grouping.
An opportunistic network cache management method based on message grouping comprises the following steps:
s1, when a Node (j) in a opportunity network has a message set Mes to receive, executing a step 2; the message set Mes comprises s messages, wherein s is an integer; node (j) is the jth Node;
s2, judging whether the storage space size (mtotal) occupied by the message set Mes to be received is larger than or equal to the free cache size (bremin) of the Node (j) node(j) ) If so, step 3 is performed, otherwise step is performedA step S11;
s3, judging whether the number of the messages in the message set Mes to be received is 1, if so, executing the step S4, otherwise, executing the step S8;
s4, sequencing all messages in the original messages in the Node (j) from large to small according to the size of the occupied storage space, and then executing the step S5;
s5, judging whether the size (mes (1)) of the storage space occupied by the message mes (1) to be received is larger than or equal to the storage space of the message occupying the largest storage space in the original message in the Node (j), and if so, executing the step S6; otherwise, executing step S7;
s6, after the message discarding mode 1 is executed, ending;
the specific process of the message discarding mode 1 includes: continuously discarding the message occupying the largest storage space in the original message in the Node (j), and when the idle cache of the Node (j) is larger than or equal to the storage space occupied by the message mes (1) to be received, the Node (j) receives the message mes (1); mes (1) is the 1 st message in the message set Mes;
s7: executing the message discarding mode 2, and ending;
the specific process of the message discarding mode 2 comprises the following steps: extracting all messages which occupy a storage space larger than the message mes (1) from the original messages of the Node (j), and receiving the message mes (1) after selecting the message which occupies the minimum storage space from all the extracted messages to discard;
s8, the Node (j) continuously receives the message with the minimum occupied storage space in the message set Mes until no large enough idle cache receives the message, at the moment, the rest N messages are not received, and the step S9 is executed, wherein N is an integer;
s9, dividing the original messages in the Node (j) into N groups according to the remaining N messages which are not received, and executing the step S10;
s10, after the message discarding mode 3 is executed, ending;
the specific process of the message discarding mode 3 includes:
for the message mes (i) to be received, the Node (j) only selects the original message in the group where the message mes (i) is located to discard, and when the idle cache with enough size receives the message mes (i), the Node (j) receives the message mes (i); mes (i) is the ith message of the remaining N messages not received; i =1,2,3 … … N;
step S11: the Node (j) receives the message set Mes to be received and ends.
Preferably, in the message discarding mode 1, a maximum of messages are discarded in the process of discarding messages
A message is discarded if
If there is not enough idle buffer to receive the message mes (1) after the message, abandoning the message mes (1);
wherein ,
the representation is an upward integer, M is the number of original messages in the Node (j), and ξ is a first adjustment coefficient.
Preferably, ξ is a real number greater than 0 or less than 1.
Preferably, in S9, the principle of dividing the original message in the Node (j) into N groups is as follows:
firstly, calculating the centroid weight W (mes (I)) of each message mes (I) in the remaining N messages which are not received, and simultaneously calculating the centroid weight W (mes '(I)) of each original message mes' (I) in the Node (j);
wherein W (mes (I)) is the centroid weight of the ith message mes (I) in the remaining N messages that have not been received, and W (mes '(I)) is the centroid weight of the ith original message mes' (I) in the Node (j); i and I are integers;
secondly, the centroid weight W (mes '(I)) of each original message in the Node (j) is respectively subtracted from the centroid weights of the remaining N messages which are not received, and the original message mes' (I) and the message mes (I) to be received which correspond to the smallest absolute value of the differences are divided into a group until all the original messages in the Node (j) are grouped.
Preferably, the centroid weight W (mes (i)) of the message mes (i) is expressed as:
wherein, the size (mes (i)) is the size of the occupied storage space of the message mes (i); hop (size (i)) is the number of hops experienced by the message mes (i); dis (mes (i)) is the distance between the position of the node carrying the message mes (i) and the position of the source node when the message mes (i) is generated by the source node; alpha is alpha 1 、α 2 、α 3 Is a second to fourth adjustment coefficient, and α 1 +α 2 +α 3 ＝1。
Preferably, when the source Node generates the message mes (i), the number of hops experienced by the message mes (i) is 0, and if the message mes (i) is transmitted to the Node (j) through n relay nodes, the Node (j) carries the message mes (i), the number of hops experienced by the message mes (i) is n +1; n is an integer.
Preferably, in the message discarding mode 3, for the message mes (i) to be received, the implementation mode that the Node (j) only selects the original message in the group where the message mes (i) is located to discard is as follows:
when discarding the message at the 3T +1 time, selecting the original message with the largest centroid weight in the group of the message mes (i) for discarding;
when discarding the message at the 3T +2 times, selecting the original message occupying the largest storage space in the group of the message mes (i) to discard;
when discarding the message at the 3T +3 times, selecting the original message with the minimum remaining available time in all the original messages in the group of the message mes (i) to discard mes (i);
wherein T is an integer, and the value of T is 0, 1 and 2 … ….
Preferably, in the message discard mode 3,
in discarding messages, if the group of messages mes (i) contains Q original messages, then at most, it is discarded
An original message, if discarded
If the original message has no idle cache with enough size to receive the message Mes (i), abandoning the message Mes (i) and deleting the message Mes (i) from the message set Mes;
wherein ,
represents taking an integer upwards;
as a fifth adjustment factor, the adjustment factor,
is a real number greater than 0 or less than 1, and Q is an integer.
Preferably, the maximum value of T is
The invention has the following beneficial effects:
the invention provides an opportunistic network cache management method based on message grouping, which comprises the steps of firstly judging the relationship between the sizes of all messages in a message set needing to be received and the size of a node idle cache, receiving all messages needing to be received if the size of the node idle cache is not smaller than the size of the message set needing to be received, and otherwise, continuously judging the number of the messages in the message set needing to be received, and selecting to discard the original messages in node caches according to the number of the messages in the message set needing to be received, thereby achieving the purpose of relieving the cache overflow phenomenon.
Furthermore, in the process of selecting and discarding the message, the method considers a plurality of attributes such as the size of the message, the remaining available time, the number of messages to be received, the hop count experienced by the message, the distance between nodes and the like, and avoids the problem that when a single attribute is considered, the network improves certain performance and simultaneously causes other performance to be reduced.
Furthermore, when the messages are discarded, the maximum value of the discarded number of the messages is set, so that the phenomenon that the overall performance of the network is reduced because a plurality of small messages are discarded to receive a certain large message can be avoided.
Drawings
FIG. 1 is a flow chart of a message packet based opportunistic network cache management method of the present invention;
fig. 2 is a schematic diagram of a node when a message set needs to be received, where m, k, and p are integers.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict.
Example 1:
referring to fig. 1 and fig. 2 to illustrate embodiment 1, the opportunistic network cache management method based on message grouping according to this embodiment includes the following steps:
s1, when a Node (j) in a opportunity network has a message set Mes to receive, executing a step 2; the message set Mes comprises s messages, and s is an integer; node (j) is the jth Node;
s2, judging whether the size (mtotal) of the storage space occupied by the message set Mes to be received is larger than or equal to the idle cache of the Node (j)size(bremain node(j) ) If yes, executing step S3, otherwise, executing step S11;
s3, judging whether the number of the messages in the message set Mes to be received is 1, if so, executing the step S4, otherwise, executing the step S8;
s4, sequencing all messages in the original messages in the Node (j) from large to small according to the size of the occupied storage space, and then executing the step S5;
s5, judging whether the size (mes (1)) of the storage space occupied by the message mes (1) to be received is larger than or equal to the storage space of the message occupying the largest storage space in the original message in the Node (j), and executing the step S6 if the result is yes; otherwise, executing step S7;
s6, after the message discarding mode 1 is executed, ending;
the specific process of the message discarding mode 1 comprises the following steps: continuously discarding the message occupying the largest storage space in the original message in the Node (j), and when the idle cache of the Node (j) is larger than or equal to the storage space occupied by the message mes (1) to be received, the Node (j) receives the message mes (1); mes (1) is the 1 st message in the message set Mes;
s7: executing the message discarding mode 2, and ending;
the specific process of the message discarding mode 2 comprises the following steps: extracting all messages which occupy a storage space larger than the message mes (1) from the original messages of the Node (j), and receiving the message mes (1) after selecting the message which occupies the minimum storage space from all the extracted messages to discard;
s8, the Node (j) continuously receives the message with the minimum occupied storage space in the message set Mes until no large enough idle cache receives the message, at the moment, the rest N messages are not received, and the step S9 is executed, wherein N is an integer;
s9, dividing the original messages in the Node (j) into N groups according to the remaining N messages which are not received, and executing the step S10;
s10, after the message discarding mode 3 is executed, ending;
the specific process of the message discarding mode 3 comprises the following steps:
for the message mes (i) to be received, the Node (j) only selects the original message in the group where the message mes (i) is located to discard, and when the idle cache with enough size receives the message mes (i), the Node (j) receives the message mes (i); mes (i) is the ith message of the remaining N messages not received; i =1,2,3 … … N;
step S11: the Node (j) receives the message set Mes to be received and ends.
When the method is applied specifically, the method firstly judges the relationship between the size of all messages in a message set needing to be received and the size of the node idle cache, if the size of the node idle cache is not smaller than the size of the message set needing to be received, all the messages needing to be received are received, otherwise, the number of the messages in the message set needing to be received is continuously judged, and the original messages in the node caches are selected to be discarded according to the number of the messages in the message set needing to be received, so that the aim of relieving the cache overflow phenomenon is fulfilled.
In fig. 2, a schematic diagram of a principle when any node has a message set that needs to be received is given, it can be seen from fig. 2 that there are p messages in the message set Mes, a node has p messages to be received, and a node total cache is given to be composed of two parts, specifically: free buffer + storage space occupied by original message, in fig. 2, k messages in the message set are discarded, which proves that the k messages are k messages discarded from the original message.
Further, in the message discarding mode 1, the maximum discarding is performed in the message discarding process
If the message is discarded
If there is not enough idle buffer to receive the message mes (1) after the message, abandoning the message mes (1);
wherein ,
the representation is an upward integer, M is the number of original messages in the Node (j), and ξ is a first adjustment coefficient.
In the preferred embodiment, by setting the maximum number of discarded messages when discarding messages, it is possible to avoid a phenomenon in which a plurality of small messages are discarded to receive a large message, thereby degrading the overall performance of the network.
Furthermore, ξ is a real number greater than 0 or less than 1.
Further, in S9, the principle of dividing the original message in the Node (j) into N groups is as follows:
firstly, calculating the centroid weight W (mes (I)) of each message mes (I) in the remaining N messages which are not received, and simultaneously calculating the centroid weight W (mes '(I)) of each original message mes' (I) in the Node (j);
wherein W (mes (I)) is a centroid weight of the ith message mes (I) in the remaining N messages that have not been received, and W (mes '(I)) is a centroid weight of the ith original message mes' (I) in the Node (j); i and I are integers;
secondly, the centroid weight W (mes '(I)) of each original message in the Node (j) is respectively differed from the centroid weights of the remaining N messages which are not received, and the original message mes' (I) and the message mes (I) to be received which correspond to the minimum absolute value of the differences are divided into a group until all the original messages in the Node (j) are grouped.
In the preferred mode, the original message mes '(I) and the message mes (I) to be received, which correspond to the smallest absolute value of the difference, are divided into one group, that is, the original message mes' (I) and the message mes (I) to be received, which have the closest centroid weights, are divided into one group, so that when the messages are discarded, the closest centroid weights are selected to discard the messages, and the defect that the overall performance of the network is sharply reduced by the discarded messages is avoided, so that the overall performance of the opportunistic network is improved.
Further, the centroid weight W (mes (i)) of the message mes (i) is expressed as:
wherein, size (mes (i)) is the size of the occupied storage space of the message mes (i); hop (size (i)) is the number of hops experienced by the message mes (i); dis (mes (i)) is the distance between the position of the node carrying the message mes (i) and the position of the source node when the message mes (i) is generated by the source node; alpha is alpha 1 、α 2 、α 3 Is a second to fourth adjustment coefficient, and 1 +α 2 +α 3 ＝1。
furthermore, when the source Node generates the message mes (i), the number of hops experienced by the message mes (i) is 0, and if the message mes (i) is transmitted to the Node (j) through n relay nodes, the Node (j) carries the message mes (i), the number of hops experienced by the message mes (i) is n +1; n is an integer.
Further, in the message discarding mode 3, for the message mes (i) to be received, the implementation mode that the Node (j) only selects the original message in the group where the message mes (i) is located to discard is as follows:
when discarding the message at the 3T +1 time, selecting the original message with the largest centroid weight in the group of the message mes (i) for discarding;
when discarding the message at the 3T +2 times, selecting the original message occupying the largest storage space in the group of the message mes (i) for discarding;
when discarding the message at the 3T +3 times, selecting the original message with the minimum remaining available time in all the original messages in the group of the message mes (i) to discard mes (i);
wherein T is an integer, and the value of T is 0, 1 and 2 … ….
In specific application, when the value of T is 0, in the message discarding mode 3, when the message is discarded for the 1 st time, the original message with the largest mass center weight is selected from the group of the message mes (i) to be discarded; when the message is discarded for the 2 nd time, selecting the original message occupying the largest storage space from the group of the message mes (i) for discarding; when the message is discarded for the 3 rd time, selecting the original message with the minimum residual available time in all the original messages in the group of the message mes (i) to discard the mes (i); the same applies to the above rules when T takes other integers.
In the process of selecting and discarding the message, the invention considers a plurality of attributes such as the size of the message, the remaining available time, the number of messages needing to be received, the hop count experienced by the message, the distance between nodes and the like, and avoids the problem that when a single attribute is considered, the network can cause the reduction of other performances while improving a certain performance.
The original messages in the nodes Node (j) are divided into N groups, and in order to select the original message with the weight value close to that in the group where the message mes (i) is located, the original message with the largest occupied storage space and the original message with the smallest residual available time to be discarded when the messages are discarded, the defect that the overall performance of the network is sharply reduced due to the discarded messages after the messages are discarded is avoided, and therefore the overall performance of the opportunistic network is improved.
Wherein, when the remaining available time is the message generated, an available time is set, for example, 1 hour can be set, and after 1 hour, the message is automatically deleted.
Further, in the message discarding mode 3, in the message discarding process, if the group of the message mes (i) includes Q original messages, at most, the message mes (i) is discarded
An original message, if discarded
If the original message has not enough large idle buffer to receive the message Mes (i), abandoning the message Mes (i) and deleting the message Mes (i) from the message set Mes;
wherein ,
represents taking an integer upwards;
as a fifth adjustment factor, the adjustment factor,
is a real number greater than 0 or less than 1, and Q is an integer.
In the preferred embodiment, by setting the maximum value of the number of discarded messages when discarding messages, it is possible to avoid a phenomenon in which a plurality of small messages are discarded in order to receive a large message, thereby degrading the overall performance of the network.
Further, the maximum value of T is
Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims. It should be understood that various dependent claims and the features described herein may be combined in ways different from those described in the original claims. It is also to be understood that features described in connection with individual embodiments may be used in other described embodiments.
Claims (9)
1. The opportunistic network cache management method based on the message grouping is characterized by comprising the following steps:
s1, when a Node (j) in a opportunity network has a message set Mes to receive, executing a step 2; the message set Mes comprises s messages, wherein s is an integer; node (j) is the jth Node;
s2, judging whether the storage space size (mtotal) occupied by the message set Mes to be received is larger than or equal to the free cache size (bremin) of the Node (j) node(j) ) If yes, go to step 3, otherwise go to step S11;
s3, judging whether the number of the messages in the message set Mes to be received is 1, if so, executing the step S4, otherwise, executing the step S8;
s4, sequencing all messages in the original messages in the Node (j) from large to small according to the size of the occupied storage space, and then executing the step S5;
s5, judging whether the size (mes (1)) of the storage space occupied by the message mes (1) to be received is larger than or equal to the storage space of the message occupying the largest storage space in the original message in the Node (j), and if so, executing the step S6; otherwise, executing step S7;
s6, after the message discarding mode 1 is executed, ending;
the specific process of the message discarding mode 1 comprises the following steps: continuously discarding the message occupying the largest storage space in the original message in the Node (j), and when the idle cache of the Node (j) is larger than or equal to the storage space occupied by the message mes (1) to be received, the Node (j) receives the message mes (1); mes (1) is the 1 st message in the message set Mes;
s7: executing the message discarding mode 2, and ending;
the specific process of the message discarding mode 2 includes: extracting all messages which occupy a storage space larger than the message mes (1) from the original messages of the Node (j), and receiving the message mes (1) after selecting the message which occupies the minimum storage space from all the extracted messages to discard;
s8, the Node (j) continuously receives the message with the minimum occupied storage space in the message set Mes until no large enough idle cache receives the message, at the moment, the rest N messages are not received, and the step S9 is executed, wherein N is an integer;
s9, dividing the original messages in the Node (i) into N groups according to the remaining N messages which are not received, and executing the step S10;
s10, after the message discarding mode 3 is executed, ending;
the specific process of the message discarding mode 3 includes:
for the message mes (i) to be received, the Node (j) only selects the original message in the group where the message mes (i) is located to discard, and when the idle cache with enough size receives the message mes (i), the Node (j) receives the message mes (i); mes (i) is the ith message of the remaining N messages not received; i =1,2,3 … … N;
step S11: the Node (j) receives the message set Mes to be received and ends.
2. The message packet-based opportunistic network cache management method according to claim 1, wherein in message discard mode 1, the maximum discard of messages in the process of discarding messages is performed
A message is discarded if
If there is not enough idle buffer to receive the message mes (1) after the message, abandoning the message mes (1);
wherein ,
the expression is to take an integer upwards, M is the number of original messages in the Node (j), and ξ is a first adjustment coefficient.
3. The message packet-based opportunistic network cache management method of claim 2, wherein ξ takes a real number that is greater than 0 or less than 1.
4. The message grouping-based opportunistic network cache management method according to claim 1, wherein the principle of S9 dividing the original messages in the Node (j) into N groups is:
firstly, calculating the centroid weight W (mes (I)) of each message mes (I) in the remaining N messages which are not received, and simultaneously calculating the centroid weight W (mes '(I)) of each original message mes' (I) in the Node (j);
wherein W (mes (I)) is a centroid weight of the ith message mes (I) in the remaining N messages that have not been received, and W (mes '(I)) is a centroid weight of the ith original message mes' (I) in the Node (j); i and I are integers;
secondly, the centroid weight W (mes '(I)) of each original message in the Node (j) is respectively differed from the centroid weights of the remaining N messages which are not received, and the original message mes' (I) and the message mes (I) to be received which correspond to the minimum absolute value of the differences are divided into a group until all the original messages in the Node (j) are grouped.
5. The message-packet-based opportunistic network cache management method of claim 4, wherein the expression of the centroid weight W (mes (i)) of the message mes (i)) is as follows:
wherein, the size (mes (i)) is the size of the occupied storage space of the message mes (i); hop (size (i)) is the number of hops experienced by the message mes (i); dis (mes (i)) is the distance between the position of the node carrying the message mes (i) and the position of the source node when the message mes (i) is generated by the source node; alpha is alpha 1 、α 2 、α 3 Is a second to fourth adjustment coefficient, and 1 +α 2 +α 3 ＝1。
6. the message grouping-based opportunistic network cache management method according to claim 5, wherein when the source Node generates the message mes (i), the number of hops experienced by the message mes (i) is 0, and if the message mes (i) is transmitted to the Node (j) through n relay nodes, the Node (j) carries the message mes (i), the number of hops experienced by the message mes (i) is n +1; n is an integer.
7. The message grouping-based opportunistic network cache management method according to claim 1, wherein in the message discarding mode 3, for the message mes (i) to be received, the implementation mode that the Node (j) only selects the original message in the group where the message mes (i) is located to discard is as follows:
when discarding the message at the 3T +1 time, selecting the original message with the largest centroid weight in the group of the message mes (i) for discarding;
when discarding the message at the 3T +2 times, selecting the original message occupying the largest storage space in the group of the message mes (i) to discard;
when discarding the message at the 3T +3 times, selecting the original message with the minimum remaining available time in all the original messages in the group of the message mes (i) to discard mes (i);
wherein T is an integer, and the value of T is 0, 1 and 2 … ….
8. The message packet-based opportunistic network cache management method of claim 7 wherein, in message discard mode 3,
in discarding messages, if the group of messages mes (i) contains Q original messages, then at most, it is discarded
An original message, if discarded
If the original message has not enough large idle buffer to receive the message Mes (i), abandoning the message Mes (i) and deleting the message Mes (i) from the message set Mes;
wherein ,
represents taking an integer upwards;
as a fifth adjustment factor, the adjustment factor,
is a real number greater than 0 or less than 1, and Q is an integer.
9. The opportunistic network caching based on message grouping of claim 8The management method is characterized in that the maximum value of T is
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210961618.9A CN115348223B (en) | 2022-08-11 | 2022-08-11 | Opportunistic network cache management method based on message grouping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210961618.9A CN115348223B (en) | 2022-08-11 | 2022-08-11 | Opportunistic network cache management method based on message grouping |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115348223A true CN115348223A (en) | 2022-11-15 |
| CN115348223B CN115348223B (en) | 2023-09-01 |
Family
ID=83951476
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210961618.9A Active CN115348223B (en) | 2022-08-11 | 2022-08-11 | Opportunistic network cache management method based on message grouping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115348223B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026291A (en) * | 2011-01-06 | 2011-04-20 | 西安电子科技大学 | Cache admission control method in wireless multi-hop mesh network |
| KR20110087478A (en) * | 2010-01-26 | 2011-08-03 | 재단법인 광양만권 유아이티연구소 | Method for management of qeue using hop counts in wireless sensor network |
| CN105228196A (en) * | 2015-10-27 | 2016-01-06 | 哈尔滨工程大学 | A kind of delay-tolerant network nodal cache management method being applicable to the Effect-based operation weight of many copies route |
| CN110191486A (en) * | 2019-05-14 | 2019-08-30 | 华中师范大学 | A kind of moving machine meeting method for controlling network congestion based on message coverage rate |
-
2022
- 2022-08-11 CN CN202210961618.9A patent/CN115348223B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110087478A (en) * | 2010-01-26 | 2011-08-03 | 재단법인 광양만권 유아이티연구소 | Method for management of qeue using hop counts in wireless sensor network |
| CN102026291A (en) * | 2011-01-06 | 2011-04-20 | 西安电子科技大学 | Cache admission control method in wireless multi-hop mesh network |
| CN105228196A (en) * | 2015-10-27 | 2016-01-06 | 哈尔滨工程大学 | A kind of delay-tolerant network nodal cache management method being applicable to the Effect-based operation weight of many copies route |
| CN110191486A (en) * | 2019-05-14 | 2019-08-30 | 华中师范大学 | A kind of moving machine meeting method for controlling network congestion based on message coverage rate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115348223B (en) | 2023-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2014522202A (en) | Method, apparatus, and system for reconstructing and reordering packets | |
| CN111400206B (en) | Cache management method based on dynamic virtual threshold | |
| WO2012109910A1 (en) | Routing method and device for link aggregation | |
| CN108667746B (en) | Method for realizing service priority in deep space delay tolerant network | |
| US11502956B2 (en) | Method for content caching in information-centric network virtualization | |
| Luo et al. | A reinforcement learning approach for multipath TCP data scheduling | |
| CN113064738A (en) | Active queue management method based on summary data | |
| CN109672626B (en) | Service aggregation method based on queuing delay utilization | |
| CN108093056B (en) | Node cache replacement method in information center wireless network virtualization network | |
| CN108183867B (en) | Information center network node cache replacement method | |
| CN115348223A (en) | Opportunistic network cache management method based on message grouping | |
| CN114339941B (en) | Opportunistic network routing method based on cluster division | |
| JP2000083055A (en) | Router | |
| CN108076144B (en) | Fair caching algorithm and device for content-centric network | |
| CN111835640B (en) | Shortest time delay routing method based on continuous time aggregation graph | |
| CN115378828A (en) | Power distribution Internet of things service multi-priority data communication bandwidth prediction method | |
| CN110099410B (en) | DTN distributed caching method and device for temporary empty vehicle ground network | |
| CN110430146B (en) | Cell recombination method based on CrossBar switch and switch structure | |
| CN109361928B (en) | Information center network system and video transmission method | |
| CN114500397B (en) | Opportunistic network congestion avoiding method based on node cache space release | |
| CN112055382A (en) | Service access method based on refined differentiation | |
| CN112261690A (en) | Satellite network constrained multipath routing setting method, electronic device and storage medium | |
| CN111585894A (en) | Network routing method and device based on weight calculation | |
| CN110708253A (en) | Message control method, flow table updating method and node equipment | |
| Wu et al. | Traffic dynamics based on dynamic local routing protocol in a finite buffer network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |