CN101729230A - Multiplexing route method for delay tolerant network - Google Patents
Multiplexing route method for delay tolerant network Download PDFInfo
- Publication number
- CN101729230A CN101729230A CN200910227060A CN200910227060A CN101729230A CN 101729230 A CN101729230 A CN 101729230A CN 200910227060 A CN200910227060 A CN 200910227060A CN 200910227060 A CN200910227060 A CN 200910227060A CN 101729230 A CN101729230 A CN 101729230A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- network
- copy
- message copy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a multiplexing route method for a delay tolerant network, comprising the following steps: a source node generates a message and spreads the message to the peripheral adjacent nodes by taking the source node as a center, a redundancy message copy is generated in a plurality of the middle nodes in the network, and the middle node with the redundancy message copy transmits the message copy to a destination node respectively, and the destination node informs other nodes to clean up the redundancy message copy in the network after receiving the message copy which reaches firstly. The multiplexing route method has the advantages of high reliability of the message transmission, high message transmission efficiency, good destruction resisting capacity, intelligent and high-efficiency method, high message transmission ratio, low average delay, low network overhead ratio and high network resource utilization rate, can meet practical requirements of the delay tolerant network.
Description
Technical field
The present invention relates to network communication field, be specifically related to a kind of multiplex method for routing that is used for delay-tolerant network.
Background technology
The development of technique of internet and application bring great convenience for the human lives.But because the restriction of all kinds of factors, in certain areas, for example undeveloped country and area, the two poles of the earth, earth north and south and even earth outer space, in some cases, under the emergency case such as for example earthquake, tsunami, fire, the attack of terrorism, military confrontation, network service often shows as link and frequently disconnects, the node irregular movement, the message transmission time-delay is big, the error rate is high, and existing technique of internet can't works fine.And originate from the delay-tolerant network (DTN of interplanetary research, Delay Tolerant Networks) at message transmission high latency, high bit-error, but can works fine under the frequent environment that disconnects of communication link, therefore, the research of delay-tolerant network obtains more and more research institutions and scholar's concern, and route is the major issue that influences the actual application deployment of network, and the routing issue research of this delay-tolerant network progressively deeply.
Divide from the angle that copy uses and network knowledge uses, can be four classes with the cutting of delay-tolerant network method for routing: based on the multicopy inundation, knowledge Network Based, based on coding techniques, mixed type, but at present these method for routing all launch at node motion and network topology change wireless network, the sensor network without any rule.Ask by each node in network that at random the inundation message reaches based on the multicopy flooding method message is sent to destination node, the advantage of its maximum do not need to be the network information, do not need routing table maintenance, can in having no the governed network of rule, E-Packet, increasing the prerequisite decline harmonic(-)mean delay that message transmits ratio, but it can bring huge network resources waste; The method of knowledge Network Based is partly to have used the retrievable network information, obtain the performance balance between network overhead and the resource occupation, network knowledge can be a positional information, it also can be statistical information, can also utilize periodicity or regular connection time sequence information, on this basis, select proper weight or appropriate index parameter is set, calculate forward-path and routing forwarding data in view of the above, these class methods have reduced bandwidth and storage overhead, flexibility is more intense, have certain intelligent, more approaching traditional method for routing, but for delay-tolerant network, the acquiring and maintaining of the accurate network information all compares difficulty, so this method can only apply to the network of particular type; Method based on coding techniques is to have utilized coding techniques, before transmitting, message is carried out special processing, form a group coding piece, destination only need receive the part of encoding block, can utilize decoding technique to recover, and erasure codes and network code scheme are studied, these class methods are with when reducing resources costs, the benefit that has kept multiple copy is of value to when network performance is relatively poor and communicates, but has increased the complexity that message routing is transmitted; The mixed type method for routing combines the benefit of above method, has both made full use of the rapidity of flooding method, makes full use of network knowledge as can be known again, reaches optimal effect with this.And at the stronger network of regularity that in real world, extensively exists, as bus network, spatial network etc., because it is periodically strong that it connects sequential, the sequential of network needs precognition in advance, and for delay-tolerant network, the acquiring and maintaining of the accurate network information all compare difficulty, so mixes routing method equally also and be not suitable for delay-tolerant network.
Summary of the invention
The present invention is directed to the shortcoming of above-mentioned prior art, provide a kind of message transmissions reliability height, message transmission efficiency height, survivability can be good, method intelligent and high-efficiency, high message transmit the multiplex method for routing that is used for delay-tolerant network than the advantage that, harmonic(-)mean postpones, low network overhead is higher than, network resource usage.
In order to solve the problems of the technologies described above, the technical solution used in the present invention is: a kind of sequential anti-method for routing of ruining of multiplex of delay-tolerant network as can be known that is used for, it comprises the steps: that source node produces message and is that the peritropous adjacent node diffusion in center is propagated with the source node, generate the redundant message copy in a plurality of intermediate nodes in network, respectively hold message copy that the intermediate node of redundant message copy holds it respectively to the destination node transmission, destination node is received and is notified behind the message copy that reaches at first other nodes to remove redundant message copy in networks.
As a further improvement on the present invention:
Described source node produces this message forwarding token of initial number in the lump when producing message, each node is propagated message in the adjacent node diffusion that never received this message to it, and the transmission message is held the forwarding token of half quantity with it when diffusion is propagated, when certain node was received message and only held this message forwarding token, this node was the intermediate node of holding a redundant message copy; It is 1/3 of the total node number of network that described source node produces the initial number of transmitting token;
Described intermediate node is when the destination node message transmission copies, and adopts dynamic Di Jiesitela algorithm to search destination node and transmit, and wherein dynamically the expression formula of the weights function of Di Jiesitela algorithm is:
Wherein,
" the size of data that can move via limit e in the time interval; c (e; the x) capacity of expression link e; m refers to the size that need E-Packet, Q (e, t; s) the expression present node waits in line to transmit total size of data in the next-hop node s buffering that limit e connects; d (e, t ') expression limit e is at the propagation delay in t ' moment, the time of t representative calculating shortest path that is illustrated in t～t;
After destination node is received the message copy that reaches at first, send removing redundant message copy message to adjacent node, receive the node of removing redundant message copy message with this forwards other adjacent nodes to the network, and if have corresponding message copy in the nodal cache then delete; Perhaps, after destination node is received the message copy that reaches at first, send the information of waiting to delete the redundant message copy to a dedicated node, the message that described dedicated node sends according to each node generates one and waits to delete the tabulation of redundant message copy, each node regularly reads treating on the dedicated node and deletes redundant message copy tabulation, if having corresponding message copy in the nodal cache then delete.
The present invention has following advantage: the present invention is by spreading message the redundant message copy that generates dispersed and distributed on the many parts of regions earlier in network, walk abreast then and transmit to destination node, strengthen network greatly and tackled the transmittability that single message transmissions is failed, improved the reliability of message transmissions greatly, survivability can be good, the method intelligent and high-efficiency can satisfy the actual demand of delay-tolerant network, has the advantage that high message transmits ratio, harmonic(-)mean delay, low network overhead ratio.Utilize the method that token reduces by half step by step of transmitting in diffusion process, the loss of Internet resources province is low, copy distribution speed is fast; When searching is sent to the path of destination node, adopt dynamic Di Jiasitela algorithm, method is quick and efficient; After message arrives destination node, remove the unnecessary redundant message copy of whole network, therefore Internet resources can be reclaimed fast, reduced the waste of bandwidth, message transmission efficiency height.
Description of drawings
Fig. 1 is the implementing procedure figure that is used for the multiplex method for routing of delay-tolerant network of the present invention;
Fig. 2 generates the schematic flow sheet of redundant message copy for the diffusion that reduces by half of the hop-by-hop of the embodiment of the invention;
Fig. 3 is that schematic diagram is transmitted in the diffusion of the message of the embodiment of the invention;
Fig. 4 is the schematic flow sheet of intermediate node message transmission copy in the embodiment of the invention;
Fig. 5 is the schematic flow sheet of the unnecessary redundant message copy of the removing in the embodiment of the invention.
Embodiment
As shown in Figure 1, the multiplex method for routing that is used for delay-tolerant network of the present invention, implementation step is as follows: source node produces message and is that the peritropous adjacent node diffusion in center is propagated with the source node, generate the redundant message copy in a plurality of intermediate nodes in network, respectively hold message copy that the intermediate node of redundant message copy holds it respectively to the destination node transmission, destination node is received and is notified behind the message copy that reaches at first other nodes to remove redundant message copy in networks.
As shown in Figure 2, the authority of token as node diffusion generation redundant message copy is transmitted in employing in the present embodiment: the nodes of holding message and at least two forwarding tokens only allow message was never received adjacent node diffusion message copy of this message to it; Only holding the message copy that the node of a message and a token just can hold it transmits to destination node.In the present embodiment, each node in the network has a buffer memory to store data, in order to raise the efficiency, each message that injects network all has a global identifier, each network node then with this identifier as key assignments, for the message that all generations in the buffer memory, storage, relaying are transmitted is set up a hash index table.Simultaneously, node safeguards that also (Summary Vector SV), is used for identifying Hash table each " having " or " nothing " in each to an one dimension bit array, when two nodes produce communication opportunity, they will exchange SV information, if there is the SV record of waiting to spread message in the present node, then reject this message to be spread, otherwise receive this message to be spread, and continue diffusion to its adjacent node and transmit this message to be spread, after being sent completely, upgrade the SV information of oneself respectively.Source node produces this message forwarding token in the lump when producing message, the forwarding token is to exist as a base attribute of message, source node E-Packets and holds half forwarding token of quantity to its adjacent node then, each receives this message and holds the forwarding token of half quantity with the node of transmitting token transmission message when message is propagated in its adjacent node diffusion that never receives this message with it, constantly spreads propagation from source node to periphery.Transmit the quantity of token and specify,, then may cause message still to be in when hop-by-hop reduces by half the diffusion propagation stage and can reach destination node, thereby cause network utilization low excessively if token quantity is too much according to network node quantity; If token quantity is very few, then message copies not reduce by half by hop-by-hop as yet and is diffused in the network, may not reach the reliability requirement of delay-tolerant network, in the present embodiment, each message forwarding token initial number is 1/3 of a node total quantity, so just neither can be owing to the message number of copies too much to the unnecessary loss that Internet resources cause, can improve the ratio that message is successfully transmitted again simultaneously preferably.
In the present embodiment, the initial quantity of transmitting token is 8 in the source node 1, as shown in Figure 3.
1) source node 1 is held message and 8 forwarding tokens, and source node 1 is transmitted to adjacent node 2 and node 4 with message and 4 forwarding tokens, and node 2 and node 4 are all held 4 and transmitted tokens;
2) node 4 is transmitted to node 7 with message and 2 forwarding tokens, and node 7 is held 2 and transmitted tokens, and node 7 does not have other adjacent nodes except that node 4, and diffusion is herein transmitted and stopped.Node 2 is transmitted to node 3 and node 6 with message and 2 forwarding tokens, and node 3 and node 6 are held 2 and transmitted tokens, and node 6 does not have other adjacent nodes except that node 2, and diffusion is herein transmitted and stopped;
3) node 3 is transmitted to node 5 with message and 1 forwarding token, and node 5 is held 1 and transmitted token, becomes and holds 1 intermediate node of transmitting token, and node 5 begins to copy to destination node transmitting redundancy message immediately.
As shown in Figure 4, hold an intermediate node of transmitting token and according to dynamic Di Jiasitela (dijkstra) algorithm computation it is held message transmissions to the minimum path of the delay of destination node: intermediate node is the snoop queue information bank at first, the link information storehouse, for message calculates the forward delay time that each transfers to each adjacent node, find out then and postpone minimum adjacent node, add minimum time-delay vertex set to, extend to destination node one by one, finally find out the minimum path of the delay of leading to destination node, send message along this path then according to minimum time-delay vertex set.
In sequential delay-tolerant network as can be known, the motion of network node has certain rules or predictability, dynamic network topology can be thought and is made up of static Topological Mapping one by one, delay-tolerant network is in a certain enough little time period, network topology can be thought static, problems such as the bandwidth of connection generation or the time that disconnects, communication link, node storage capacity all can directly or indirectly be calculated acquisition between node, but this is not absolute accurate as can be known, in some cases, may run into the failure of contingency.Intermediate node needs the link information of storage networking, if information such as the movement locus of this information spinner by node in the switching network, messaging parameter, obtain the position of each node in arbitrary moment network and the link information that can produce, be equivalent to draw network topological diagram, this information is upgraded by inundation link-state information in network; In addition, node need store buffer queue size on each node, take information such as situation, when node produces communication opportunity, upgrades in time by sending response message.
Therefore among the present invention delay is divided into queue delay, transmission delay and propagation delay, the weights delay function that dynamically calculates the lowest latency path in Di Jiasitela (dijkstra) algorithm is:
w(e，t)＝t′(e，t，m，s)-t+d(e，t′)
Wherein, the limit that the e representative E-Packets, i.e. an available communication link.(m s) represents on the node s that is connected with present node through limit e t ' for e, t, and the message data of waiting in line to transmit can be injected into the earliest time of transmitting in the network; T represents calculation cost, and d (e, t ') is the propagation delay of limit e in the t ' moment.
Wherein t ' (m s) comprises queue delay, transmission delay, can be expressed as for e, t:
Wherein,
Be illustrated in time t～t " size of data that can move via the limit at interval, (its size changes c in time for e, x) expression limit e capacity; M refers to the size that need E-Packet; Q (e, t, s) refer to present node on the next-hop node s that limit e is connected, wait in line to transmit total size of data in the buffering, Q (s) function is only relevant with the operating position of adjacent node buffering in jumps for e, t, and its computing formula is:
Therefore, dynamically the expression formula of the weights function of Di Jiesitela algorithm is:
After intermediate node obtained corresponding optimal path routing table, intermediate node can be according to routing table information with message copy forwarded hop-by-hop in network, till the message copy is forwarded to destination node.When destination node transmitted message, a plurality of redundant message copies of this message are independent to be transmitted to destination node by other intermediate node in network at this intermediate node.
As shown in Figure 5, after the message copy is sent to destination node, cause a large amount of Internet resources to expend for fear of other redundant copies, destination node is after receiving first part of message copy, send to other node immediately and confirm deletion confirmation (DeleteAcknowledge is called for short D-ACK).Consider that the information space that D-ACK message takies is smaller, can be in network inundation, this record sheet sends with independent message, perhaps is additional on other the message.
In the present embodiment, intermediate node is received after the D-ACK message, at first will check in the SV record of this node and have or not this message copy, if there is this message copy in the buffer memory, then will remove this message copy information in the buffer memory, and continue to utilize self available connection to transmit D-ACK message then to other node; Otherwise will directly utilize self available connection to transmit D-ACK message, be forwarded in the whole network by the inundation formula, thereby this D-ACK message corresponding redundant message copy will be eliminated from whole network until D-ACK message to other adjacent node.
In addition, can set up communication capacity stronger in the network, server that coverage is bigger or gateway are used as special-purpose node, each node sends a special message to server that enters communication range or gateway node at set intervals, this message will be listed from last and communicate by letter the time up till now with server or network node, it thinks the copy information that can remove in network, server or gateway node will be put in order the same category information of receiving, regularly one of inundation is removed information list in network, the time interval of notice can reasonably be set according to network reality.
In addition, when propagating generation redundant message copy to the adjacent node diffusion, also can adopt a calculator that jumps to come the generation of control redundancy message copy: it is a subsidiary counter that jumps of this message of initialization that source node produces message, each node E-Packets and the subsidiary counter that jumps of this message to the adjacent node that never receives this message, whenever, then increase progressively automatically or successively decrease through a node counter that jumps, when a counter that jumps reaches a designation number, node becomes the intermediate node of holding the redundant message copy, and begins immediately this message is transmitted to destination node.
Claims (8)
1. multiplex method for routing that is used for delay-tolerant network, it is characterized in that it comprises the steps: that source node produces message and is that the peritropous adjacent node diffusion in center is propagated with the source node, generate the redundant message copy in a plurality of intermediate nodes in network, respectively hold message copy that the intermediate node of redundant message copy holds it respectively to the destination node transmission, destination node is received and is notified behind the message copy that reaches at first other nodes to remove redundant message copy in networks.
2. the multiplex method for routing that is used for delay-tolerant network according to claim 1, it is characterized in that: described source node produces this message forwarding token of initial number in the lump when producing message, each receives the node of this message and forwarding token and propagates message to adjacent node diffusion that it never received this message, and the transmission message is held the forwarding token of half quantity with it when diffusion is propagated, when certain node was received message and only held this message forwarding token, this node was the intermediate node of holding a redundant message copy.
3. the multiplex method for routing that is used for delay-tolerant network according to claim 2 is characterized in that: it is 1/3 of the total node number of network that described source node produces the initial number of transmitting token.
4. according to claim 1, the 2 or 3 described multiplex method for routing that are used for delay-tolerant network, it is characterized in that: described intermediate node is when the destination node message transmission copies, adopt dynamic Di Jiesitela algorithm to search destination node and transmit, wherein dynamically the expression formula of the weights function of Di Jiesitela algorithm is:
Wherein, ∫
X=t T "" the size of data that can move via limit e in the time interval; c (e; the x) capacity of expression link e; m refers to the size that need E-Packet, Q (e, t; s) the expression present node waits in line to transmit total size of data in the next-hop node s buffering that limit e connects; the time that shortest path is calculated in the t representative, and d (e, t ') expression limit e is at the propagation delay in the t ' moment that c (e.x) dx is illustrated in t～t.
5. according to claim 1, the 2 or 3 described multiplex method for routing that are used for delay-tolerant network, it is characterized in that: after destination node is received the message copy that reaches at first, send removing redundant message copy message to adjacent node, receive the node of removing redundant message copy message with this forwards other adjacent nodes to the network, and if have corresponding message copy in the nodal cache then delete.
6. the multiplex method for routing that is used for delay-tolerant network according to claim 4, it is characterized in that: after destination node is received the message copy that reaches at first, send removing redundant message copy message to adjacent node, receive the node of removing redundant message copy message with this forwards other adjacent nodes to the network, and if have corresponding message copy in the nodal cache then delete.
7. according to claim 1, the 2 or 3 described multiplex method for routing that are used for delay-tolerant network, it is characterized in that: after destination node is received the message copy that reaches at first, send the information of waiting to delete the redundant message copy to a dedicated node, the message that described dedicated node sends according to each node generates one and waits to delete the tabulation of redundant message copy, each node regularly reads treating on the dedicated node and deletes redundant message copy tabulation, if having corresponding message copy in the nodal cache then delete.
8. the multiplex method for routing that is used for delay-tolerant network according to claim 4, it is characterized in that: after destination node is received the message copy that reaches at first, send the information of waiting to delete the redundant message copy to a dedicated node, the message that described dedicated node sends according to each node generates one and waits to delete the tabulation of redundant message copy, each node regularly reads treating on the dedicated node and deletes redundant message copy tabulation, if having corresponding message copy in the nodal cache then delete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910227060A CN101729230A (en) | 2009-11-30 | 2009-11-30 | Multiplexing route method for delay tolerant network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910227060A CN101729230A (en) | 2009-11-30 | 2009-11-30 | Multiplexing route method for delay tolerant network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101729230A true CN101729230A (en) | 2010-06-09 |
Family
ID=42449521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910227060A Pending CN101729230A (en) | 2009-11-30 | 2009-11-30 | Multiplexing route method for delay tolerant network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101729230A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102377801A (en) * | 2010-08-19 | 2012-03-14 | 中国科学院计算技术研究所 | Sensor network for environmental monitoring and data transmission method |
| CN102547809A (en) * | 2010-12-24 | 2012-07-04 | 中国移动通信集团公司 | Data sending method and system |
| CN102739517A (en) * | 2012-05-25 | 2012-10-17 | 中国人民解放军国防科学技术大学 | Overlay network-based route selection method and system |
| WO2015062418A1 (en) * | 2013-11-04 | 2015-05-07 | 腾讯科技（深圳）有限公司 | Method, apparatus and equipment for sending data packet |
| CN105164981A (en) * | 2013-03-15 | 2015-12-16 | 谷歌公司 | System and method for choosing lowest latency path |
| CN105407047A (en) * | 2015-10-23 | 2016-03-16 | 中国联合网络通信集团有限公司 | Opportunity network data distribution method based on centrality degree and opportunity network system |
| CN106899505A (en) * | 2017-04-19 | 2017-06-27 | 天津微梦无界科技有限公司 | A kind of controllable software self-replication transmission method |
| CN110719186A (en) * | 2018-07-13 | 2020-01-21 | 中航通用电气民用航电系统有限责任公司 | Data transmission with high availability |
| CN110943917A (en) * | 2019-11-26 | 2020-03-31 | 中国电子科技集团公司第五十四研究所 | Method for reducing redundant messages in multi-route network |
| CN111447142A (en) * | 2020-04-08 | 2020-07-24 | 东北大学 | Parallel multi-path transmission method based on Overlay network and coding technology |
| WO2023221911A1 (en) * | 2022-05-16 | 2023-11-23 | 华为技术有限公司 | Message transmission method, and device, system and storage medium |
-
2009
- 2009-11-30 CN CN200910227060A patent/CN101729230A/en active Pending
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102377801B (en) * | 2010-08-19 | 2014-05-07 | 中国科学院计算技术研究所 | Sensor network for environmental monitoring and data transmission method |
| CN102377801A (en) * | 2010-08-19 | 2012-03-14 | 中国科学院计算技术研究所 | Sensor network for environmental monitoring and data transmission method |
| CN102547809A (en) * | 2010-12-24 | 2012-07-04 | 中国移动通信集团公司 | Data sending method and system |
| CN102547809B (en) * | 2010-12-24 | 2015-07-29 | 中国移动通信集团公司 | A kind of data transmission method for uplink and system |
| CN102739517A (en) * | 2012-05-25 | 2012-10-17 | 中国人民解放军国防科学技术大学 | Overlay network-based route selection method and system |
| CN105164981A (en) * | 2013-03-15 | 2015-12-16 | 谷歌公司 | System and method for choosing lowest latency path |
| WO2015062418A1 (en) * | 2013-11-04 | 2015-05-07 | 腾讯科技（深圳）有限公司 | Method, apparatus and equipment for sending data packet |
| CN105407047B (en) * | 2015-10-23 | 2018-09-07 | 中国联合网络通信集团有限公司 | Opportunistic network data distributing method based on centrad and opportunistic network system |
| CN105407047A (en) * | 2015-10-23 | 2016-03-16 | 中国联合网络通信集团有限公司 | Opportunity network data distribution method based on centrality degree and opportunity network system |
| CN106899505A (en) * | 2017-04-19 | 2017-06-27 | 天津微梦无界科技有限公司 | A kind of controllable software self-replication transmission method |
| CN110719186A (en) * | 2018-07-13 | 2020-01-21 | 中航通用电气民用航电系统有限责任公司 | Data transmission with high availability |
| CN110943917A (en) * | 2019-11-26 | 2020-03-31 | 中国电子科技集团公司第五十四研究所 | Method for reducing redundant messages in multi-route network |
| CN110943917B (en) * | 2019-11-26 | 2021-09-24 | 中国电子科技集团公司第五十四研究所 | Method for reducing redundant messages in multi-route network |
| CN111447142A (en) * | 2020-04-08 | 2020-07-24 | 东北大学 | Parallel multi-path transmission method based on Overlay network and coding technology |
| CN111447142B (en) * | 2020-04-08 | 2021-09-28 | 东北大学 | Parallel multi-path transmission method based on Overlay network and coding technology |
| WO2023221911A1 (en) * | 2022-05-16 | 2023-11-23 | 华为技术有限公司 | Message transmission method, and device, system and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101729230A (en) | Multiplexing route method for delay tolerant network | |
| CN101222438B (en) | Data transmission method in opportunity network | |
| CN109818993B (en) | Efficient block chain consensus and exchange system | |
| Yu et al. | Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network | |
| Hammood et al. | An effective transmit packet coding with trust-based relay nodes in VANETs | |
| CN103561445A (en) | Wireless sensor network multi-path routing method based on network coding | |
| CN103124420A (en) | Wireless on-chip network structuring method | |
| CN103634232A (en) | Vehicle message routing method based on delay tolerant network technology | |
| Guidec et al. | Opportunistic content-based dissemination in disconnected mobile ad hoc networks | |
| CN105307231A (en) | Routing implementation method for delay tolerant network based on encounter probability and social analysis | |
| CN101207552A (en) | Method for scheduling of data block and network node | |
| Lu et al. | Geographic information and node selfish-based routing algorithm for delay tolerant networks | |
| Lambrinos et al. | Applying delay tolerant networking routing algorithms in maritime communications | |
| Li et al. | A community-driven hierarchical message transmission scheme in opportunistic networks | |
| CN103200468A (en) | Method and device of route wavelength allocation of electric power optical fiber communication network | |
| CN105634947A (en) | Message forwarding method based on hotspot in opportunistic mobile social network | |
| Wang et al. | DCAR: DTN congestion avoidance routing algorithm based on tokens in an urban environment | |
| Peng et al. | Delivery probability prediction based efficient routing in DTN | |
| Bujari et al. | Opportunistic communication for the internet of everything | |
| Wang et al. | Research on routing protocols and simulation analysis for opportunistic networks | |
| Cui et al. | An Improved Spray And Wait Algorithm Based on the Node Social Tree | |
| CN103716880B (en) | Mobile delay tolerant network rapid message notification method based on shortcut and mobile delay tolerant network rapid message notification device based on shortcut | |
| CN103346966B (en) | A kind of network data routing method and network node improving optimum forwarding probability | |
| CN102201989A (en) | Wait and epidemic routing algorithm | |
| CN115102605B (en) | Low-orbit satellite networking method combining equipartition and non-orthogonalization of coding domain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100609 |