CN111970373A - Message confirmation method based on similarity - Google Patents
Message confirmation method based on similarity Download PDFInfo
- Publication number
- CN111970373A CN111970373A CN202010876305.4A CN202010876305A CN111970373A CN 111970373 A CN111970373 A CN 111970373A CN 202010876305 A CN202010876305 A CN 202010876305A CN 111970373 A CN111970373 A CN 111970373A
- Authority
- CN
- China
- Prior art keywords
- node
- similarity
- message
- nodes
- circle
- 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
- 238000012790 confirmation Methods 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 claims abstract description 32
- 230000005540 biological transmission Effects 0.000 claims abstract description 5
- 230000008569 process Effects 0.000 claims description 9
- XHEFDIBZLJXQHF-UHFFFAOYSA-N fisetin Chemical compound C=1C(O)=CC=C(C(C=2O)=O)C=1OC=2C1=CC=C(O)C(O)=C1 XHEFDIBZLJXQHF-UHFFFAOYSA-N 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000000694 effects Effects 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 3
- 238000002474 experimental method Methods 0.000 claims description 2
- 239000002699 waste material Substances 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000009792 diffusion process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message confirmation method based on similarity, which comprises the following steps: s1, defining similarity of nodes, and calculating similarity with the node viNode v and node in meeting node setiThe node whose similarity exceeds a given threshold is divided into nodes viThe inter-circle of (2); s2, node v carrying message miAnd node vjWhen meeting, updating the communication circle of the node, and calculating the node viSimilarity with the encountered node, if the similarity is greater than a given threshold, adding the encountered node to the node viIf node v in the inter-circle of (1)jAt node viWithin the communication circle, the message m is forwarded to the node vj(ii) a If node vjIs not at node viRefusing to forward the message m to the node vj. The invention controls the quantity and the transmission range of the confirmation messages according to the size of the communication circle, avoids generating excessive confirmation messages to waste resources, and removes redundant message copies in the network in time under the condition of not generating excessive additional expenses, thereby improving the success rate of message delivery.
Description
Technical Field
The invention relates to the field of opportunistic networks, in particular to a message confirmation method based on similarity.
Background
The opportunity network does not require full communication of the network, and can better meet the actual demand of the ad hoc network. The opportunistic network is mostly used in a challenging environment, and is different from a traditional wireless network which needs facilities such as a base station and the like for assistance, for example, in a mountainous area, due to environmental limitation, infrastructure is not set up, and network collection information can be set up by using equipment such as a mobile phone and the like. In an opportunistic network, due to the reasons of movement of network nodes, wireless communication interference, limitation of resources (such as cache, battery energy and the like) of the nodes, and the like, network topology is variable, data rates are asymmetric, and the network is frequently divided, so that common end-to-end communication cannot be completed or communication performance cannot meet application requirements easily.
In an opportunistic network environment, after a message successfully reaches a destination node, some relay nodes which participate in forwarding in the middle may not know that the message has been successfully sent, and still perform store-and-forward operation on the message. If these relay nodes are not notified in time, network resources may be wasted. For any node, after receiving the message, the node judges whether the message reaches the destination node, if so, the node indicates that the message is successfully sent, and then the node generates an ACK message of the message. In the process of forwarding messages in the opportunistic network, the messages need to reach a destination node through multiple hops, and pass through multiple relay nodes during the period, after the messages successfully reach the destination node, a plurality of redundant copies of the messages still can be stored in the network, the redundant copies occupy a cache space, and when the cache is insufficient, node packet loss is caused, so that the routing performance is influenced. The acknowledgement mechanism of TCP is used in the traditional network to realize the reliable transmission of data messages, while the ACK message is used in the opportunistic network to quickly delete the redundant message copies in the network, so as to prevent the redundant message copies from continuously executing the forwarding process, waste network resources and achieve the purpose of improving the utilization rate of the network resources.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a message confirmation method based on similarity to overcome the defects in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows:
the invention provides a message confirmation method based on similarity, in an opportunity network, the distribution of confirmation messages among nodes is controlled by the message confirmation method based on the similarity, the similarity is defined by common neighbor node information among the nodes and connection strength information of encountering nodes, an intersegmental circle of the nodes is divided according to the similarity, and the quantity and the propagation range of the confirmation messages are controlled according to the size of the intersegmental circle, the method comprises the following steps:
s1, defining similarity of nodes, and calculating similarity with the node viNode v and node in meeting node setiThe node whose similarity exceeds a given threshold is divided into nodes viThe inter-circle of (2);
s2, node v carrying message miAnd node vjWhen meeting, updating the communication circle of the node, and calculating the node viSimilarity with the encountering node, if the similarity with the encountering node is greater than a given threshold, adding the encountering node into the node viIn the inter-circle of (1); and according to whether the encountering node is at the node viDifferent acknowledgement message forwarding strategies are adopted within the inter-circleA little: if node vjAt node viWithin the communication circle, the message m is forwarded to the node vj(ii) a If node vjIs not at node viRefusing to forward the message m to the node vj。
Further, the method for calculating the similarity in the method of the present invention comprises:
similarity SD (v)i，vj) Representing a node viNode vjThe calculation formula of the comprehensive value of the overlapping degree of the neighbor weight sum and the activity range of the node which are commonly owned by two nodes in the encountered nodes is as follows:
wherein k isvzFor node pair vi，vjDegree of common neighbor node, lnkvzIs e as the base kvzIs the node pair vi，vjIntersection area of communication ranges, (v)i) Representing a node viSet of nodes that have met, (v)j) Representing a node vjSet of nodes that have been encountered in history, vz∈(vi)∩(vj) Representing a node vzIs node viAnd node vjThe neighboring nodes that have met together.
Further, in step S2, the method for updating the inter-circle of the node based on the similarity includes:
node viThe circle of communication CSvi represents the node v in the networkiEncountered node viExceeds a given threshold CSthresholdThe construction process of the node set of (2) is as follows:
node viAnd node vjWhen meeting, judging the node v firstjWhether or not at node viSet of encountering nodesiIf not, the node v is connectedjAdding to a set of encountering nodesiPerforming the following steps; if yes, directly calculating the similarity;
then judging the node vjWhether or not it is already at node viIf the node v is not in the intersegmental circle CSvi, the node v is calculatediAnd node vjDegree of similarity between SD (v)i，vj) Then, the SD (v) is judgedi，vj) Whether greater than a given threshold CSthresholdIf yes, then connect node vjAdding to node viThe intersegmental circle CSvi of (1).
Further, in the step S2, the threshold is used to control the size of the inter-circle, and if the value of the threshold is larger, the divided inter-circle is smaller, the chance of message diffusion is smaller, and the number of deleted message copies is smaller, so that the cache pressure cannot be effectively relieved; if the value of the threshold value is larger, the divided inter-circle is larger, the transmission of the confirmation message is more, the cache is occupied, and the cache occupation ratio is larger.
Further, in step S2 of the present invention, the confirmation message forwarding policy is:
for nodes in the same interstation circle, directly sending a confirmation message m to the encountering node in an active mode, informing the encountering node to delete redundant messages in time and releasing a cache space; and for nodes in different communication circles, refusing to send the message m when receiving the request of the meeting node for sending the message m.
Further, the method for setting the given threshold in the method of the present invention specifically includes: dividing nodes with similarity exceeding given threshold into nodes viThe size of the threshold is determined by experiments; when the threshold value is reached<1.2, the confirmation message is spread too much, and the cache is occupied; when the threshold value is reached>1.2, the number of deleted message copies is too small, and the cache pressure cannot be relieved.
The invention has the following beneficial effects: the message confirmation method based on the similarity divides the communication circle of the nodes in the network by defining the similarity of the nodes, so that the nodes with high similarity are in the same communication circle. When two nodes meet, judging whether the meeting node is in the intersegmental circle of the node, if so, forwarding the confirmation message to the meeting node; if the meeting node is not in the intersegmental circle of the node, the meeting node refuses to receive the message when receiving the request of sending the message m from the meeting node. The number and the propagation range of the confirmation messages are controlled according to the size of the communication circle, the resource waste caused by excessive confirmation messages is avoided, redundant message copies in a network can be cleared in time under the condition of not generating excessive additional expenses, and the message delivery success rate is improved.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is an algorithm flow diagram of a message validation method based on similarity according to an embodiment of the present invention;
FIG. 2 is a process diagram of an algorithm for constructing an interface circle of a node according to an embodiment of the present invention;
fig. 3 is a process diagram of a message confirmation method forwarding policy based on similarity according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, in an opportunistic network, the message confirmation method based on the similarity according to the embodiment of the present invention controls distribution of confirmation messages between nodes by using the message confirmation method based on the similarity, defines the similarity by using common neighbor node information between nodes and meeting node connection strength information, divides an intersegmental circle of the nodes according to the similarity, and controls the number and propagation range of confirmation messages according to the size of the intersegmental circle, and includes the following steps:
s1, defining similarity of nodes, and calculating similarity with the node viNode v and node in meeting node setiThe node whose similarity exceeds a given threshold is divided into nodes viThe inter-circle of (2);
the similarity in step S1 is used to estimate the closeness of the social relationship between the nodes, and if the historical meeting node sets of the two nodes are almost overlapped and the connection strength of the two nodes is high, it means that the activity ranges of the two nodes are similar, and the two nodes should be divided into the same social circle.
S2, node v when carrying ACK (m) of confirmation messageiAnd node vjWhen meeting, the communication circle of the node is updated, and the updating process is shown in fig. 2, and the specific process is as follows:
node viThe circle of communication CSvi represents the node v in the networkiEncountered node viExceeds a given threshold CSthresholdThe construction process of the node set of (2) is as follows:
node viAnd node vjWhen meeting, judging the node v firstjWhether or not at node viSet of encountering nodesiIf not, the node v is connectedjAdding to a set of encountering nodesiPerforming the following steps; if yes, directly calculating the similarity;
then judging the node vjWhether or not it is already at node viIf the node v is not in the intersegmental circle CSvi, the node v is calculatediAnd node vjDegree of similarity between SD (v)i，vj) Then, the SD (v) is judgedi，vj) Whether greater than a given threshold CSthresholdIf yes, then connect node vjAdding to node viThe intersegmental circle CSvi of (1).
Compute node viSimilarity with meeting node SD (v)i，vj) The method comprises the following steps:
determining whether to add the encountering node into the node v according to whether the similarity of the encountering nodes is greater than a given threshold valueiAnd according to whether the encountering node is in the node viDifferent acknowledgement message forwarding strategies are adopted within the intersegmental circle: if node vjAt node viWithin the communication circle, the message m is forwarded to the node vj(ii) a If node vjIs not at node viRefusing to forward the message m to the node vj。
The similarity is calculated by the following formula:
similarity SD (v)i，vj) Representing a node viNode vjThe calculation formula of the comprehensive value of the overlapping degree of the neighbor weight sum and the activity range of the node which are commonly owned by two nodes in the encountered nodes is as follows:
wherein k isvzFor node pair vi，vjDegree of common neighbor node, lnkvzIs e as the base kvzIs the node pair vi，vjIntersection area of communication ranges, (v)i) Representing a node viSet of nodes that have met, (v)j) Representing a node vjSet of nodes that have been encountered in history, vz∈(vi)∩(vj) Representing a node vzIs node viAnd node vjThe neighboring nodes that have met together.
The threshold value in the step S2 is used to control the size of the communication circle, and if the value of the threshold value is larger, the divided communication circle is smaller, the chance of message diffusion is smaller, and the deleted message copy is smaller, so that the cache pressure cannot be effectively relieved; if the value of the threshold value is larger, the divided inter-circle is larger, the transmission of the confirmation message is more, the cache is occupied, and the cache occupation ratio is larger.
In step S2, the message forwarding policy is determined as follows:
for nodes in the same interstation circle, directly sending a confirmation message m to the encountering node in an active mode, informing the encountering node to delete redundant messages in time and releasing a cache space; and for nodes in different communication circles, refusing to send the message m when receiving the request of the meeting node for sending the message m.
In summary, the invention discloses a message confirmation method based on similarity, which defines the node similarity by researching the meeting history information and the connection strength among nodes. And dividing the communication circle of the nodes in the network through the similarity, so that the nodes with high similarity are in the same communication circle. When two nodes meet, judging whether the meeting node is in the intersegmental circle of the node, if so, forwarding the confirmation message to the meeting node; if the meeting node is not in the intersegmental circle of the node, the meeting node refuses to receive the message when receiving the request of sending the message m from the meeting node. Compared with the traditional active confirmation mechanism and the passive confirmation mechanism, the overall performance of the algorithm in terms of delivery success rate, network overhead and average time delay is optimal.
Under the scenes that the number of nodes is 180, the message survival time is 300s, and the cache sizes are respectively set to be 1M, 2M, 3M, 4M, 5M, 6M, 7M, 8M, 9M and 10M, compared with the traditional Active deletion mode and Passive deletion mode, the method provided by the invention has the advantages that the delivery rate is averagely improved by 3.97% compared with an Active algorithm and is averagely improved by 20.94% compared with a Pasive algorithm. Compared with the Active algorithm, the network overhead is averagely reduced by 26.96%, and compared with the Passive algorithm, the network overhead is averagely reduced by 65.4%. The average delay is 8.94% higher than that of the Active algorithm, and is reduced by 11.67% on average compared with that of the Passive algorithm. Therefore, the method of the invention has the best overall performance on delivery rate, average time delay and network overhead.
It will be understood that modifications and variations can be made by persons skilled in the art in light of the above teachings and all such modifications and variations are intended to be included within the scope of the invention as defined in the appended claims.
Claims (6)
1. A message confirmation method based on similarity is characterized in that in an opportunity network, distribution of confirmation messages among nodes is controlled through the message confirmation method based on the similarity, the similarity is defined through common neighbor node information among the nodes and connection strength information of encountering nodes, an intersegmental circle of the nodes is divided according to the similarity, and the number and the propagation range of the confirmation messages are controlled according to the size of the intersegmental circle, and the method comprises the following steps:
s1, defining similarity of nodes, and calculating similarity with the node viNode v and node in meeting node setiThe similarity of (2) is divided into nodes with the similarity exceeding a given threshold valueviThe inter-circle of (2);
s2, node v carrying message miAnd node vjWhen meeting, updating the communication circle of the node, and calculating the node viSimilarity with the encountering node, if the similarity with the encountering node is greater than a given threshold, adding the encountering node into the node viIn the inter-circle of (1); and according to whether the encountering node is at the node viDifferent acknowledgement message forwarding strategies are adopted within the intersegmental circle: if node vjAt node viWithin the communication circle, the message m is forwarded to the node vj(ii) a If node vjIs not at node viRefusing to forward the message m to the node vj。
2. The message confirmation method based on the similarity according to claim 1, wherein the similarity calculation method in the method is as follows:
similarity SD (v)i，vj) Representing a node viNode vjThe calculation formula of the comprehensive value of the overlapping degree of the neighbor weight sum and the activity range of the node which are commonly owned by two nodes in the encountered nodes is as follows:
wherein k isvzFor node pair vi，vjDegree of common neighbor node, lnkvzIs e as the base kvzIs the node pair vi，vjIntersection area of communication ranges, (v)i) Representing a node viSet of nodes that have met, (v)j) Representing a node vjSet of nodes that have been encountered in history, vz∈(vi)∩(vj) Representing a node vzIs node viAnd node vjThe neighboring nodes that have met together.
3. The method for confirming message based on similarity according to claim 1, wherein the method for updating the communication circle of the node based on similarity in step S2 is as follows:
node viThe circle of communication CSvi represents the node v in the networkiEncountered node viExceeds a given threshold CSthresholdThe construction process of the node set of (2) is as follows:
node viAnd node vjWhen meeting, judging the node v firstjWhether or not at node viSet of encountering nodesiIf not, the node v is connectedjAdding to a set of encountering nodesiPerforming the following steps; if yes, directly calculating the similarity;
then judging the node vjWhether or not it is already at node viIf the node v is not in the intersegmental circle CSvi, the node v is calculatediAnd node vjDegree of similarity between SD (v)i，vj) Then, the SD (v) is judgedi，vj) Whether greater than a given threshold CSthresholdIf yes, then connect node vjAdding to node viThe intersegmental circle CSvi of (1).
4. The message confirmation method based on the similarity according to claim 1, wherein the threshold in step S2 is used to control the size of the communication circle, and if the value of the threshold is larger, the divided communication circle is smaller, the confirmation message has a smaller chance of being diffused, and the deleted message copy is smaller, which cannot effectively relieve the cache pressure; if the value of the threshold value is larger, the divided inter-circle is larger, the transmission of the confirmation message is more, the cache is occupied, and the cache occupation ratio is larger.
5. The method for message acknowledgement based on similarity according to claim 1, wherein the message forwarding policy of step S2 is:
for nodes in the same interstation circle, directly sending a confirmation message m to the encountering node in an active mode, informing the encountering node to delete redundant messages in time and releasing a cache space; and for nodes in different communication circles, refusing to send the message m when receiving the request of the meeting node for sending the message m.
6. The message confirmation method based on the similarity as claimed in claim 1, wherein the method for setting the given threshold specifically comprises: dividing nodes with similarity exceeding given threshold into nodes viThe size of the threshold is determined by experiments; when the threshold value is reached<1.2, the confirmation message is spread too much, and the cache is occupied; when the threshold value is reached>1.2, the number of deleted message copies is too small, and the cache pressure cannot be relieved.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010876305.4A CN111970373B (en) | 2020-08-27 | 2020-08-27 | Message confirmation method based on similarity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010876305.4A CN111970373B (en) | 2020-08-27 | 2020-08-27 | Message confirmation method based on similarity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111970373A true CN111970373A (en) | 2020-11-20 |
| CN111970373B CN111970373B (en) | 2022-06-10 |
Family
ID=73399352
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010876305.4A Active CN111970373B (en) | 2020-08-27 | 2020-08-27 | Message confirmation method based on similarity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111970373B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112738862A (en) * | 2020-12-28 | 2021-04-30 | 河南师范大学 | Data forwarding method in opportunity network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222438A (en) * | 2008-01-28 | 2008-07-16 | 北京航空航天大学 | Data transmission method in opportunity network |
| CN101771964A (en) * | 2010-01-06 | 2010-07-07 | 北京航空航天大学 | Information correlation based opportunistic network data distributing method |
| US20130137469A1 (en) * | 2011-11-30 | 2013-05-30 | Intel Mobile Communications GmbH | Method for transmitting an opportunistic network related message |
| CN105791120A (en) * | 2016-05-03 | 2016-07-20 | 哈尔滨工业大学深圳研究生院 | Efficient routing algorithm in opportunistic network |
| CN106102116A (en) * | 2016-05-30 | 2016-11-09 | 重庆邮电大学 | Self adaptation retransmission method based on node-node transmission performance in opportunistic network |
| CN110809302A (en) * | 2019-11-11 | 2020-02-18 | 华中师范大学 | Self-adaptive multi-injection waiting routing method based on social circle |
-
2020
- 2020-08-27 CN CN202010876305.4A patent/CN111970373B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222438A (en) * | 2008-01-28 | 2008-07-16 | 北京航空航天大学 | Data transmission method in opportunity network |
| CN101771964A (en) * | 2010-01-06 | 2010-07-07 | 北京航空航天大学 | Information correlation based opportunistic network data distributing method |
| US20130137469A1 (en) * | 2011-11-30 | 2013-05-30 | Intel Mobile Communications GmbH | Method for transmitting an opportunistic network related message |
| CN105791120A (en) * | 2016-05-03 | 2016-07-20 | 哈尔滨工业大学深圳研究生院 | Efficient routing algorithm in opportunistic network |
| CN106102116A (en) * | 2016-05-30 | 2016-11-09 | 重庆邮电大学 | Self adaptation retransmission method based on node-node transmission performance in opportunistic network |
| CN110809302A (en) * | 2019-11-11 | 2020-02-18 | 华中师范大学 | Self-adaptive multi-injection waiting routing method based on social circle |
Non-Patent Citations (3)
| Title |
|---|
| JIANQUN CUI等: "An Adaptive Spray and Wait Routing Algorithm Based on Quality of Node in Delay Tolerant Network", 《IEEE ACCESS》 * |
| 曹书琴: "DTN中基于社交圈的自适应多次喷射等待路由算法研宄", 《中国优秀硕士学位论文电子期刊》 * |
| 范为仁: "移动机会网络中的路由算法与拥塞控制策略研究", 《中国优秀硕士学位论文电子期刊》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112738862A (en) * | 2020-12-28 | 2021-04-30 | 河南师范大学 | Data forwarding method in opportunity network |
| CN112738862B (en) * | 2020-12-28 | 2022-09-23 | 河南师范大学 | Data forwarding method in opportunity network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111970373B (en) | 2022-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101222438B (en) | Data transmission method in opportunity network | |
| CN111970200B (en) | Probability routing method based on utility value | |
| WO2019169874A1 (en) | Wireless mesh network opportunistic routing algorithm based on quality of service assurance | |
| KR100586233B1 (en) | An optimal direction-based flooding method for mobile ad-hoc networks | |
| CN106412820B (en) | Method and device for determining cluster head of mobile ad hoc network | |
| CN110809302B (en) | Self-adaptive multi-injection waiting routing method based on social circle | |
| CN107249202B (en) | Distributed wireless backhaul routing algorithm | |
| CN105792309A (en) | Energy conservation oriented game theory QoS based routing method for sensing UAV cluster communications | |
| CN106686679B (en) | Energy-efficiency-based multi-hop D2D routing hop number limiting method in content-centric network | |
| EP4035447A1 (en) | Method and system for enhanced steering and traffic load balancing in wireless mesh networks | |
| CN111970373B (en) | Message confirmation method based on similarity | |
| CN105407048A (en) | Delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing | |
| CN110248392B (en) | Opportunity forwarding method based on node efficiency in Internet of vehicles | |
| CN105049347A (en) | Routing method of DTN (Delay Tolerant Network) based on social network task distribution model | |
| CN113660710B (en) | Mobile self-organizing network routing method based on reinforcement learning | |
| CN104469874A (en) | Message forwarding method of opportunistic network based on probability centrality | |
| Valera et al. | CHAMP: a highly-resilient and energy-efficient routing protocol for mobile ad hoc networks | |
| CN103312619B (en) | A kind of deletion simultaneously and the jamming control method of Transfer Message | |
| Pushpalatha et al. | Efficient Multicast Algorithm for Dynamic Intra Cluster Device-to-Device communication for small world model paper | |
| CN111405489A (en) | Multicast tree construction method applied to wireless network | |
| JP2004007457A (en) | Communication system, communication controller and communication control method, communication equipment and communication method, and computer program | |
| CN110139304B (en) | MPR set selection method based on isolation degree and non-MPR nodes | |
| Gupta et al. | Cored-based tree with forwarding regions (cbt-fr); a protocol for reliable multicasting in mobile ad hoc networks | |
| Özkasap et al. | Epidemic-based approaches for reliable multicast in mobile ad hoc networks | |
| CN108848534B (en) | Routing method for adaptively reducing node load in mobile ad hoc 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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20201120 Assignee: Hubei Yanchu Heyi Network Technology Co.,Ltd. Assignor: CENTRAL CHINA NORMAL University Contract record no.: X2023980042875 Denomination of invention: A Message Confirmation Method Based on Similarity Granted publication date: 20220610 License type: Common License Record date: 20231007 |
|
| EE01 | Entry into force of recordation of patent licensing contract |