CN108401274A - The data transmission method of opportunistic network - Google Patents
The data transmission method of opportunistic network Download PDFInfo
- Publication number
- CN108401274A CN108401274A CN201810083579.0A CN201810083579A CN108401274A CN 108401274 A CN108401274 A CN 108401274A CN 201810083579 A CN201810083579 A CN 201810083579A CN 108401274 A CN108401274 A CN 108401274A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- copies
- data transmission
- transmission
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 80
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000000694 effects Effects 0.000 claims abstract description 19
- 238000004364 calculation method Methods 0.000 claims description 11
- 230000033001 locomotion Effects 0.000 claims description 7
- 230000002452 interceptive effect Effects 0.000 abstract description 2
- 201000004569 Blindness Diseases 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 5
- 230000003993 interaction Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000005265 energy consumption Methods 0.000 description 2
- DSCFFEYYQKSRSV-KLJZZCKASA-N D-pinitol Chemical compound CO[C@@H]1[C@@H](O)[C@@H](O)[C@H](O)[C@H](O)[C@H]1O DSCFFEYYQKSRSV-KLJZZCKASA-N 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of data transmission methods of opportunistic network, including message, and node A as agent node and is carried out message transmission；The property of predicate node B and the message copy number entrained by node B；The priority of calculate node A and B are simultaneously compared；The node activity of calculate node B；Node B is transmitted message M as new agent node；It repeats the above steps until transmission process terminates.The present invention is according to the interactive information between user, the priority and activity of node is calculated, then the number of copies for being selected as agent node according to priority ranking to carry out data transmission, and determining to need to forward according to the active degree of node, to accelerate the transmission rate of whole network；And inventive process ensures that node stability, avoid node from excessively using and failure, and avoid node blindness transmission, ensure that the efficiency of data transmission, and reduce the expense of route transmission.
Description
Technical Field
The invention particularly relates to a data transmission method of an opportunity network.
Background
The opportunistic network is a wireless self-organizing network, a complete path does not exist between nodes in the network for communication, the nodes can only realize communication by using meeting opportunities brought by high-speed movement, and a data transmission mode of 'storage-carrying-forwarding' is adopted. Since an end-to-end complete path does not exist, the traditional wireless network routing algorithm cannot be effectively used in the opportunistic network.
At present, the network is gradually applied to the fields of biological tracking, vehicle-mounted networks, network coverage in remote areas and the like. The problems that the traditional network is in a remote area and low in network coverage rate and the network in a disaster area cannot be used normally are solved. Therefore, how to distribute data in the opportunistic network is a hot spot of domestic and foreign research, and designing an effective routing algorithm has important significance for development of the opportunistic network. Many algorithms in current opportunistic networks distribute data based on the forwarding principle or the flooding principle. In the algorithm based on the flooding principle, when a current node carrying a data packet encounters another node in the communication range of the current node, the data packet is copied, and then the copied data copy is forwarded to a neighbor node in the communication range of the current node. Although the algorithm has a fast propagation speed, a large amount of network resources are consumed in the transmission process, and network congestion is easily caused. The algorithm based on the forwarding principle does not copy data packets in the transmission process, and does not have data copies, so the algorithm has low network cost, low transmission efficiency, low transmission success rate and large delay.
Disclosure of Invention
The invention aims to provide a data transmission method of an opportunistic network, which has low node energy consumption and high data transmission success rate.
The data transmission method of the opportunity network provided by the invention comprises the following steps:
s1, using a node A as a proxy node by a message M and transmitting the message; the effective life cycle of the message M is RTTLA；
S2, if the node A meets the node B in the moving process, judging the property of the node B, and meanwhile, judging the number of copies of the message M carried by the node B;
s3, calculating and comparing the priorities of the node A and the node B according to the judgment result of the step S2;
s4, calculating the node activity of the node B according to the comparison result of the step S3;
s5, according to the calculation result, the node B serves as a new agent node to transmit the message M;
s6, repeating the steps S1-S5 until the message M is transmitted to the destination node, and ending the transmission process.
In the data transmission process, if the life cycle of the message is finished, the transmission process of the message is directly finished.
Step S2, which is to determine the property of the node B and the number of copies of the message M carried by the node B, specifically, the following steps are adopted for determination:
A. determining the properties of the node B:
if the node B is the destination node, the node A transmits the message M to the node B, and the transmission process is finished;
if the node B is a non-destination node, judging the number of copies of the message M which should be transmitted to the node B by the node A;
B. judging the number of copies of the message M carried by the node B:
if the number of the copies of the message M carried by the node A is more than 1, comparing the priorities of the node A and the node B;
if the number of the copies of the message M carried by the node A is not more than 1, the node A waits for the next encounter, and the message M is forwarded to the destination node until the destination node is encountered.
The calculating of the priority of the node in step S3 specifically includes calculating the priority using the following equation:
in the formula dA(k) Priority to node a in the network for message k;in the formula of UA(k) For the energy priority of node A in the transmission of message k, EAFor the energy consumed for transmission, R is the total energy per node, P(A,B)For node A and node B success rate of data transmission when they meet, α1And α2Is a weight value of α1+α21 is ═ 1; wherein,wherein R represents the number of times the node receives the message, F represents the number of times the node sends the message, and Kr(i) Size of message sent for node, Kf(j) E is the size of the message received by the node, and e is the average energy consumed by each bit of data; p(A,B)＝P(A,B)old+[1-P(A,B)old]PinitIn the formula PinitTo initialize constants, P(A,B)For the success rate of data transmission when node A and node B meet, P(A,B)oldThe success rate of data transmission when the node a and the node B meet last time.
Step S4, calculating the node activity of the node, specifically, calculating the node activity by using the following formula:
in the formula FANode activity, S, for node AAIs the moving speed of node A, SBRTTL is the velocity of the node B and the moving speedAFor the remaining lifetime of the message carried by node a,carrying the message movement for node a until the time of encountering node B.
The node B described in step S5 transmits the message M as a new proxy node, specifically, the node B becomes a new proxy node according to the following steps:
1) calculating the number of copies forwarded by the node A to the node B:
LB(t+1)＝LA(t)-LA(t+1)
in the formula LB(t +1) is the number of message copies node B can obtain from node A; l isA(t) is the number of copies of message M carried by the current agent node A, LA(t +1) is the number of copies of message M after current agent node A transmits a number of copies to node B, and
2) and after receiving the message copy transmitted by the node A, the node B serves as a new agent node to transmit the message M.
According to the data transmission method of the opportunity network, the priority and the activity of the nodes are calculated according to the interaction information among users, then the nodes are selected as proxy nodes to carry out data transmission according to the priority sequence, and the number of copies to be forwarded is determined according to the activity degree of the nodes, so that the transmission rate of the whole network is increased; the method ensures the stability of the node, avoids the node from being exhausted due to overuse, avoids the blind transmission of the node, ensures the efficiency of data transmission and reduces the expense of routing transmission.
Drawings
FIG. 1 is a process flow diagram of the process of the present invention.
Fig. 2 is a graph comparing transmission rates of the method of the present invention with other routing strategies.
Fig. 3 is a time delay comparison diagram of the method of the present invention and other routing strategies.
Fig. 4 is a comparison graph of the routing overhead of the method of the present invention with other routing policies.
Fig. 5 is a comparison graph of the average hop count of the method of the present invention with other routing strategies.
Detailed Description
FIG. 1 shows a flow chart of the method of the present invention: the application scene of the multi-node cooperative data transmission mode based on the interactive information is an opportunistic network formed by mobile equipment with a wireless communication function. The application scene of the invention can comprise various mobile devices, such as people who carry mobile phones, tablets and the like in motion; cars equipped with sensing devices and trains moving at high speeds. The devices which are moved by using the movement of people or trains can be regarded as mobile nodes in the opportunity network, and the storage and the forwarding of information can be carried out.
It is assumed that in a public urban area, each passerby carrying a device such as a mobile phone can be regarded as a mobile node, and the passerby can move among streets, offices, entertainment places, communities and the like in the urban area. Each car and high-speed train equipped with sensing devices can also be considered a mobile node. The network scenario may be considered a simulated scenario of human life. In this network, we classify nodes into three categories according to the speed characteristics of the mobile node. The first type is a pedestrian group, the moving speed of the pedestrian group is 0.5-1.5m/s, the storage space of the node for receiving information is 5Mbytes, and the pedestrian group moves in the urban area based on the shortest path of the map. The second kind of nodes are automobile groups, the moving speed is 2.7-13.9m/s, the storage space of the nodes for receiving information is 5Mbytes, and the nodes move by the shortest path based on the map. The third type is a train set, the moving speed is 7-10m/s, the storage space of the node for receiving information is 50Mybtes, and the train moves based on a predetermined path. In the network, a mobile node has a Bluetooth interaction function, Bluetooth scanning is carried out every few minutes, when the interaction distance between the nodes does not exceed 10 meters, the nodes are considered to be capable of communicating, and the nodes can automatically record interaction data. The method comprises the time when two nodes meet, the node ID number of the meeting node and the moving speed of the meeting node, and can count the transmission success rate of the node and the energy consumption value of the node transmitting and receiving information according to the historical information of the mobile node.
The data transmission method of the opportunity network provided by the method comprises the following steps:
s1, using a node A as a proxy node by a message M and transmitting the message; the effective life cycle of the message M is RTTLA；
S2, if the node A meets the node B in the moving process, judging the property of the node B, and then judging the number of copies of the message M carried by the node B:
A. determining the properties of the node B:
if the node B is the destination node, the node A transmits the message M to the node B, and the transmission process is finished;
if the node B is a non-destination node, judging the number of copies of the message M which should be transmitted to the node B by the node A;
B. judging the number of copies of the message M carried by the node B:
if the number of the copies of the message M carried by the node A is more than 1, comparing the priorities of the node A and the node B;
if the number of the copies of the message M carried by the node A is not more than 1, the node A waits for the next encounter and forwards the message M to the destination node until the destination node is encountered;
s3, calculating and comparing the priorities of the node A and the node B according to the judgment result of the step S2;
in an opportunistic network, each mobile node moves at a high speed and dynamically records relevant information of the node, such as time for receiving or forwarding (generating) a data packet, moving speed of the node and the like. Meanwhile, the related information of other encountered mobile nodes is recorded, such as the number of times the two pairs of nodes meet and the time of meeting. Establishing a contact table between node pairs according to the ID of the node, and calculating the transmission success rate between the node pairs according to the contact table;
the method for establishing the contact list comprises the following steps: according to the node encounter history, if the node A and the node B encounter and the duration time exceeds a certain time T (T is a fixed value and can allow the minimum value of information interaction between the nodes), the node A and the node B are marked as an effective encounter, and a one-to-one corresponding relation is established according to the ID numbers between the node A and the node B. The effective number of times of encounter between two node pairs can represent the frequency degree of contact between the two nodes, and the transmission success rate between the two node pairs is calculated according to the value. For example, when node a meets node B, the transmission success rate between the two node pairs is defined by:
P(A,B)＝P(A,B)old+[1-P(A,B)old]Pinit
in the formula PinitTo initialize the constants, 0.75 may be set; p(A,B)For the success rate of data transmission when node A and node B meet, P(A,B)oldThe success rate of data transmission when the node A and the node B meet each other last time is obtained; the calculation of the value is based on a probability strategy, and if the number of times of encounter between two node pairs is more, the transmission success rate value obtained through calculation is larger;
when the nodes begin to transmit information to each other after establishing contact between the nodes, the nodes also consume a certain amount of energy when receiving and transmitting messages, and the more messages are received and transmitted, the more energy is consumed. Therefore, when each node receives and sends messages, the number of times of data transmission and the size of a data packet are counted, and the energy consumed by the transmission is calculated as follows:
wherein R represents the number of times the node receives the message, F represents the number of times the node sends the message, and Kr(i) Is a nodeSize of the transmitted message, Kf(j) E is the size of the message received by the node, and e is the average energy consumed by each bit of data;
the algorithm considers the problems of low transmission rate and large routing overhead in the balanced opportunistic network. Therefore, two values of the transmission success rate and the energy consumed by the node in the transmission process are used as two parameters for calculating the priority calculation. The transmission success rate is considered, so that blind transmission of the message can be avoided, and the transmission efficiency of the message is improved. And the consumed energy is used as a reference condition, so that the premature senility of the nodes caused by excessive consumption of some nodes can be avoided. The priority calculation formula is as follows:
in the formula of UA(k) For the energy priority of node A in the transmission of message k, EAFor the energy consumed for transmission, R is the total energy per node, P(A,B)For node A and node B success rate of data transmission when they meet, α1And α2Is a weight value of α1+α2＝1；
The above formula considers a priority calculation formula between two nodes. However, for a multitasking model, other formulas need to be used for calculation. The spatial distance is set on the basis of the Nash strategy, and the priority of the message is expressed by a spatial distance function. The formula is as follows:
in the formula dA(k) Priority to node a in the network for message k; k is the message in the network, A is the network node, normalize all distances of the same message, thenMeans the sameThe sum of the distance priorities of a message to a plurality of nodes is 1;
and sequencing according to the calculated distance priority function to obtain the transmission priority of a certain specific message to other nodes. The smaller the calculated distance, the higher the priority, and the larger the transmission opportunity is obtained. Thus, it is possible to decide which message to forward to which node according to the calculated distance priority function value;
s4, calculating the node activity of the node B according to the comparison result of the step S3;
when the agent node a decides to forward the message to the next agent node B, we should calculate the activity degree of the node B, and the higher the activity degree is, the more forwarding copies can be carried, and the higher the forwarding efficiency is. The activity of a node B is related to the moving speed of the node and the remaining lifetime of the carrying B.
If a node moves faster in an opportunistic network, it can be assumed that it has a larger potential to encounter more nodes than slower nodes for a certain time interval. If the node with the fast moving speed carries more messages for transmission, the probability that the node with the fast moving speed meets the destination is higher, and the fact that the node with the fast moving speed carries more messages can be obtained to improve the transmission rate. Therefore, the moving speed of the node is taken as one of the parameters of the node activity, and S is usedARepresenting the moving speed of node a.
Another important parameter in deciding node activity is the remaining life cycle of a node that can carry the node motion. If a node carries a message for a long time and cannot forward the message, it is considered that the probability that the node can forward the message will be reduced.
We useRepresenting the time that node A moves with a message until node B is encountered, RTTLAThe remaining lifetime of the message is carried on behalf of node a. RABThe calculation formula of a value for measuring the transmission opportunity is as follows:
wherein, RTTLAThe denominator represents the remaining life cycle of the message that the node a can carry,the larger, i.e. the longer the message time carried by node A, RABThe smaller the probability that node a will forward the message out in the future.
When the moving speed of the node and the residual life cycle of the carried message are obtained, the activity function F of the node can be obtained through public calculationA：
In the formula FANode activity, S, for node AAIs the moving speed of node A, SBRTTL is the velocity of the node B and the moving speedAFor the remaining lifetime of the message carried by node a,time until node B is encountered when node A carries message motion;
s5, according to the calculation result, the node B serves as a new agent node to transmit the message M; specifically, the node B becomes a new proxy node according to the following steps:
1) calculating the number of copies forwarded by the node A to the node B:
LB(t+1)＝LA(t)-LA(t+1)
in the formula LB(t +1) is the number of message copies node B can obtain from node A; l isA(t) is the number of copies of message M carried by the current agent node A, LA(t +1) is the number of copies of message M after current agent node A transmits a number of copies to node B, and
2) and after receiving the message copy transmitted by the node A, the node B serves as a new agent node to transmit the message M.
S6, repeating the steps S1-S5 until the message M is transmitted to the destination node, and ending the transmission process.
In all the data transmission processes, if the life cycle of the message is finished, the transmission process of the message is directly finished.
Fig. 2 to 5 are schematic diagrams showing the comparison between the method of the present invention and four conventional methods. As can be seen from the comparison of fig. 2 to fig. 5, compared with the prior art, the method of the present invention has the obvious advantages of minimum routing overhead, highest transmission success rate, minimum transmission delay, and minimum average hop count for transmission.
Claims (6)
1. A data transmission method of an opportunity network comprises the following steps:
s1, using a node A as a proxy node by a message M and transmitting the message; the effective life cycle of the message M is RTTLA；
S2, if the node A meets the node B in the moving process, judging the property of the node B, and meanwhile, judging the number of copies of the message M carried by the node B;
s3, calculating and comparing the priorities of the node A and the node B according to the judgment result of the step S2;
s4, calculating the node activity of the node B according to the comparison result of the step S3;
s5, according to the calculation result, the node B serves as a new agent node to transmit the message M;
s6, repeating the steps S1-S5 until the message M is transmitted to the destination node, and ending the transmission process.
2. The method according to claim 1, wherein in the data transmission process, if the life cycle of the message is over, the transmission process of the message is directly over.
3. The method according to claim 1 or 2, wherein the step S2 is to determine the property of the node B and determine the number of copies of the message M carried by the node B, specifically, the method includes the following steps:
A. determining the properties of the node B:
if the node B is the destination node, the node A transmits the message M to the node B, and the transmission process is finished;
if the node B is a non-destination node, judging the number of copies of the message M which should be transmitted to the node B by the node A;
B. judging the number of copies of the message M carried by the node B:
if the number of the copies of the message M carried by the node A is more than 1, comparing the priorities of the node A and the node B;
if the number of the copies of the message M carried by the node A is not more than 1, the node A waits for the next encounter, and the message M is forwarded to the destination node until the destination node is encountered.
4. The method for data transmission in an opportunistic network according to claim 3, wherein the priority of the computing node in step S3 is specifically calculated by using the following formula:
in the formula dA(k) Priority to node a in the network for message k;in the formula of UA(k) For the energy priority of node A in the transmission of message k, EAFor the energy consumed for transmission, R is the total energy per node, P(A,B)For node A and node B success rate of data transmission when they meet, α1And α2Is a weight value of α1+α21 is ═ 1; wherein,wherein R represents the number of times the node receives the message, F represents the number of times the node sends the message, and Kr(i) Size of message sent for node, Kf(j) E is the size of the message received by the node, and e is the average energy consumed by each bit of data; p(A,B)＝P(A,B)old+[1-P(A,B)old]PinitIn the formula PinitTo initialize constants, P(A,B)For the success rate of data transmission when node A and node B meet, P(A,B)oldThe success rate of data transmission when the node a and the node B meet last time.
5. The method for data transmission in an opportunistic network according to claim 4, wherein the node activity of the computing node in step S4 is specifically calculated by using the following formula:
in the formula FANode activity, S, for node AAIs the moving speed of node A, SBRTTL is the velocity of the node B and the moving speedAFor the remaining lifetime of the message carried by node a,carrying the message movement for node a until the time of encountering node B.
6. The opportunistic network data transmission method according to claim 5, wherein the node B in step S5 is used as a new proxy node to transmit the message M, and specifically the node B becomes a new proxy node according to the following steps:
1) calculating the number of copies forwarded by the node A to the node B:
LB(t+1)＝LA(t)-LA(t+1)
in the formula LB(t +1) is the number of message copies node B can obtain from node A; l isA(t) is the number of copies of message M carried by the current agent node A, LA(t +1) is the number of copies of message M after current agent node A transmits a number of copies to node B, and
2) and after receiving the message copy transmitted by the node A, the node B serves as a new agent node to transmit the message M.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810083579.0A CN108401274B (en) | 2018-01-29 | 2018-01-29 | Data transmission method of opportunity network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810083579.0A CN108401274B (en) | 2018-01-29 | 2018-01-29 | Data transmission method of opportunity network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108401274A true CN108401274A (en) | 2018-08-14 |
| CN108401274B CN108401274B (en) | 2021-07-13 |
Family
ID=63095072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810083579.0A Active CN108401274B (en) | 2018-01-29 | 2018-01-29 | Data transmission method of opportunity network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108401274B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110491456A (en) * | 2019-08-27 | 2019-11-22 | 中南大学 | A kind of medical data transmission method and equipment |
| CN111478859A (en) * | 2020-04-03 | 2020-07-31 | 北京大学深圳研究生院 | Message transmission method, node and storage medium in DTN (delay tolerant network) |
| CN115225563A (en) * | 2022-06-21 | 2022-10-21 | 中国电信股份有限公司 | Message transmission method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102056233A (en) * | 2010-12-28 | 2011-05-11 | 重庆邮电大学 | Queue management scheduling method of opportunity network based on message importance degree |
| CN103179630A (en) * | 2013-03-29 | 2013-06-26 | 西北工业大学 | Data transmission method under opportunity network |
| CN103634868A (en) * | 2013-11-29 | 2014-03-12 | 北京邮电大学 | Mixed distributing method and device in opportunity network |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN107193945A (en) * | 2017-05-22 | 2017-09-22 | 陕西师范大学 | Method is adaptively recommended based on the interest message related to meeting in opportunistic network |
-
2018
- 2018-01-29 CN CN201810083579.0A patent/CN108401274B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102056233A (en) * | 2010-12-28 | 2011-05-11 | 重庆邮电大学 | Queue management scheduling method of opportunity network based on message importance degree |
| CN103179630A (en) * | 2013-03-29 | 2013-06-26 | 西北工业大学 | Data transmission method under opportunity network |
| CN103634868A (en) * | 2013-11-29 | 2014-03-12 | 北京邮电大学 | Mixed distributing method and device in opportunity network |
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN107193945A (en) * | 2017-05-22 | 2017-09-22 | 陕西师范大学 | Method is adaptively recommended based on the interest message related to meeting in opportunistic network |
Non-Patent Citations (4)
| Title |
|---|
| 刘宣彤: "机会网络中基于节点活跃度的路由技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 刘科征等: "基于相遇频率预测的ＤＴＮ消息传输策略", 《计算机工程与设计》 * |
| 吴大鹏等: "机会网络中消息冗余度动态估计的缓存管理策略", 《电子与信息学报》 * |
| 吴大鹏等: "机会网络中能量有效的副本分布状态感知路由机制", 《通信学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110491456A (en) * | 2019-08-27 | 2019-11-22 | 中南大学 | A kind of medical data transmission method and equipment |
| CN110491456B (en) * | 2019-08-27 | 2023-07-11 | 中南大学 | Medical data transmission method and device |
| CN111478859A (en) * | 2020-04-03 | 2020-07-31 | 北京大学深圳研究生院 | Message transmission method, node and storage medium in DTN (delay tolerant network) |
| CN115225563A (en) * | 2022-06-21 | 2022-10-21 | 中国电信股份有限公司 | Message transmission method and device |
| CN115225563B (en) * | 2022-06-21 | 2024-04-05 | 中国电信股份有限公司 | Message transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108401274B (en) | 2021-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization | |
| Wisitpongphan et al. | Broadcast storm mitigation techniques in vehicular ad hoc networks | |
| Asefi et al. | A mobility-aware and quality-driven retransmission limit adaptation scheme for video streaming over VANETs | |
| Nekovee et al. | Reliable and effcient information dissemination in intermittently connected vehicular adhoc networks | |
| Lakkakorpi et al. | Adaptive routing in mobile opportunistic networks | |
| Magaia et al. | A multi-objective routing algorithm for wireless multimedia sensor networks | |
| Bisnik et al. | Delay and throughput in random access wireless mesh networks | |
| Li et al. | An intersection-based QoS routing in vehicular ad hoc networks | |
| CN108401274B (en) | Data transmission method of opportunity network | |
| Karthikeyan et al. | Performance comparison of broadcasting methods in mobile ad hoc network | |
| Zhao et al. | A vehicle density and load aware routing protocol for VANETs in city scenarios | |
| CN110248392A (en) | Chance retransmission method based on node efficiency in a kind of car networking | |
| Chizari et al. | EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET | |
| Gao et al. | Contention and Queue-aware routing protocol for mobile ad hoc networks | |
| CN110417572A (en) | A method of message transmission node is predicted based on destination node collision probability | |
| Chen et al. | A delay‐bounded routing protocol for vehicular ad hoc networks with traffic lights | |
| Hogie et al. | A heuristic for efficient broadcasting in the metropolitan ad hoc network | |
| Pradhan et al. | A selective forwarding technique for data dissemination in vehicular ad hoc networks based on traffic parameters | |
| Yawan et al. | AODV improvement for vehicular networks with cross layer technique and mobility prediction | |
| HOC | Fuzzy logic technique for gossip based reliable broadcasting in mobile ad hoc networks | |
| CN102202000B (en) | Routing selection method based on node property in social transportation in opportunistic network | |
| Chengetanai et al. | Q-PSO: Hybridisation of Particle Swarm Optimisation with Queuing Theory for Mitigating Congestion on Mobile Ad-hoc Networks While Optimising Network Lifetime. | |
| Karami et al. | BMRTD: Buffer Management policy based on Remaining Time to encounter nodes with the Destination node in delay tolerant networks | |
| Lent et al. | Power control in ad hoc cognitive packet networks | |
| Hu et al. | Stability-based RREQ forwarding game for stability-oriented route discovery in MANETs |
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 |