CN102594698A - DTN asynchronous routing algorithm based on node position projection - Google Patents
DTN asynchronous routing algorithm based on node position projection Download PDFInfo
- Publication number
- CN102594698A CN102594698A CN2012100631423A CN201210063142A CN102594698A CN 102594698 A CN102594698 A CN 102594698A CN 2012100631423 A CN2012100631423 A CN 2012100631423A CN 201210063142 A CN201210063142 A CN 201210063142A CN 102594698 A CN102594698 A CN 102594698A
- Authority
- CN
- China
- Prior art keywords
- node
- dtn
- network
- destination node
- destination
- 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 relates to a DTN (Delay/Disruption Tolerant Networking) routing method. The DTN is a peculiar network model abstracted from challenged networks such as interstellar networks, satellite networks, AdHoc networks, sensor networks and the like, and is typically characterized in that a link between nodes has long time delay or intermittent distribution exists. Due to the distinct technical advantages in challenged network environments, the DTN becomes a research hotspot in the fields of battle field communication, deep-space communication, emergency communication and the like, and research results are practically applied in some fields. On the basis of studying the DTN asynchronous routing algorithm, analyzing and comparing typical algorithms, and finding the existing problems, a DTN time-varying model and a node position predictive model are built and a routing algorithm based on the node position projection is also proposed, and besides, the rationality and validity of the routing algorithm are verified through simulation.
Description
One technical field
The present invention relates to a kind of delay and hold the routing algorithm of circuit network (DTN), mainly is a kind of network asynchronous routing algorithm of DTN based on the node location prediction, belongs to field of wireless communications networks.
Two background technologies
Circuit network (Delay/Disruption Tolerant Networking is held in time-delay; DTN) be Kevin doctor Fall under the situation that can not bring into play usefulness in 2003 at original communication system (TCP/IP) well and a kind of new thought that proposes is used to solve the network connectivity problem under some constrained environment.In these constrained environments, usually by more or less broken the ring, in the mobile environment of land, link often is interrupted the basic assumption of legacy network end to end; The maximum round trip time of satellite communication/deep space communication reaches several seconds or a few minutes even longer possibly; Military communication can receive strong electromagnetic interference, makes link-quality very poor, system's packet loss several magnitudes that will rise; The energy at terminal under the special screne such as wireless sensor network, Emergency Communications Network, transmitted power, stand-by time are seriously limited in addition.The DTN network be a kind of general tolerance interruption delay, message-oriented, based on the cover type architecture of binding layer, be called for short that the tolerance network is interrupted in time-delay or circuit network is held in time-delay.
Internet network based on ICP/IP protocol has been obtained great success on interconnected global heterogeneous network; For a series of application protocols towards the Internet network provide widely service, comprise data end to end pay, reliably bidirectional traffic and information is paid, based on the gathering route discovery and the data sharing of strategy.But the good operation of these agreements all is based on certain precondition, like stable end-to-end connection, reliable data transmission, lower transmission delay and error rate end to end.And the communication environment of tactical radio set limited network environment such as mountain area, battlefield, city often often receive the influence of factors such as landform, weather and electromagnetic interference.Under these environment, communication usually produces interruption because of the various factors influence, thereby causes loss of data or communication disconnection.Communication between the tactical radio set is to be based upon on the basis that the communication route is arranged between the communication terminal all the time, but for the limited network environment, it is difficult much more difficult that situation is wanted.Route between the communication terminal is also unstable; As under battlefield surroundings; The wireless signal that army or soldier signal post use all compares near ground, and tens meters high clivias or building just possibly impact communication, makes that communication link is unstable or compelled to interrupt; This possibly cause important information to lose even can't communicate by letter, and brings the test of tremendous loss even life and death to army.
No matter the uniqueness of DTN network just is whether have stable end-to-end connection, transceive data reliably.To tactical radio set networking present situation, adopt the DTN technology, make each communication node that memory function all arranged, and can when being communicated with once more, send the information of preserving, this ability possibly become the key of winning victory in fight or major disaster.DTN asynchronous rooting algorithm technology is launched research, when guaranteeing the original communication usefulness of tactical radio set, improve the connection ability and the communication reliability in radio station, strengthen the communication capacity of tactical radio set under the limited network environment.
Three summary of the invention
The object of the present invention is to provide a kind of network asynchronous routing algorithm of DTN, make the DTN network can tackle the communication environment of various complicacies, strengthen the reliability and the validity of Route Selection, improve the communication performance of whole communication network based on the node location prediction.
A kind of network asynchronous routing algorithm of DTN based on the node location prediction, concrete steps comprise:
A) source node S is sent message to destination node D, message acceptance of the bid clear destination node title, source node title, send sequence number, transmitting time and geographical position;
B) if the node in the radiation scope of source node S is received information, verify at first then whether this node is destination node, if just forward step e) to;
C) if this node is not a destination node, judge then whether destination node is in the forwarding scope of this node, if destination node is in the forwarding scope of this node, then transmit to destination node, forward step e) to;
If destination node is not in the forwarding scope of this node, then further judging has intermediate node on the forward-path, if there is not intermediate node, then receives this message and stores forwarding;
D) if destination node not in the forwarding scope, or does not have intermediate node on the forward-path, then receive stored messages, return step b) with predetermined probability p (0＜p＜1);
E) if destination node receives message, then return confirmation, the transfer of data success; If destination node does not receive message, then direct dropping packets.
In the said step c); The judgement of forward-path is to be as the criterion with the geographical position between forward node and the destination node; At this node when the direction of destination node has intermediate node within pitching α (0≤α≤45 °) angular region up and down; Assert on the forward-path has node, if not or exceed this scope, then thinking does not have node on the forward-path.
In the said step d), node carries out moving at random after receiving stored messages, and the routing mode of carrying out " storing-carry-transmit " then is to other node direction motion.
The theoretical foundation of this method is explained as follows:
Asynchronous rooting algorithm
Routing algorithm (Routing Algorithm) is a key technology of network service always, and it is responsible for confirming which bar outlet line a grouping of coming in be sent on, sends to information destination node to realize the route that will divide into groups from the information source warp is selected.The DTN network is compared with legacy network and is had distinctive attribute and a requirement, specifically to such as Fig. 1, shown in Figure 2.
With respect to the routing mode of legacy network, the main feature of DTN network routing mode is:
A) legacy network is based on mode end to end and carries out routing forwarding; In a period of time of link establishment; It is static constant that the whole piece link is thought to keep, and the routing forwarding of DTN network is based on the mode of hop-by-hop, promptly in the transmitting-receiving process, can not guarantee the lasting reliable of whole piece link.
B) routing forwarding of legacy network information is carried out under synchronous or quasi synchronous situation basically, and the distinguishing feature of DTN network is exactly the routing forwarding that allows the information of under asynchronous condition, carrying out.
C) acquisition of legacy network routing iinformation only is based on current network state; Do not consider the historic state and the to-be of network; And the DTN network is owing to can not guarantee synchronously in real time; The acquisition of routing iinformation just not only will also will dope the network state that possibly occur in the future according to historical information and current information according to current state, selects the high path of reliability to transmit.
D) route of legacy network can abstractly be a static synchronization scheme, and the DTN network is owing to will consider the historic state and the to-be of network, change attitude figure when can be regarded as.
E) routing algorithm of legacy network is after the analysis computing is searched; Generally just provide an optimal path under the rule of specialty, then data are transmitted according to this, the DTN network then will be considered the interruption at random and the Variable delay characteristic of network; In conjunction with mechanism such as keeping transmission and storage forwardings; The reliability and stability of each bar link of analysis-by-synthesis provide one group of optional route, reliably transmit.
The DTN network model
How theoretically the DTN network to be described and to portray, be the key issue of DTN network research always.Some scholars have carried out good try and checking in the world, have proposed based on the mobility model of higher-dimension theorem in Euclid space with based on the Mathematical Modeling of probability space.To the abstract simulation of DTN network, maximum problem is that Link State and network state all can constantly change in time, and this makes traditional graph theory be difficult to carry out accurate description, needs extra increase time parameter to describe.Whole DTN network abstract be a continuous space-time diagram of evolution in time, as shown in Figure 3, in traditional Graph Analysis, add a time-parameters, set up Mathematical Modeling, research and analyse checking then.
A) time-varying network.Through joining day parameter in traditional graph theory, characterize the time dependent characteristic of DTN network topology, its topological relation can be expressed as:
G(t)＝(V(t)，E(t)) (1)
Wherein: V---network node;
E---node contact;
T---time-parameters.
If for
G (t is all arranged
1)=G (t
2), then this network is called static network;
If for
G (t is all arranged
1) ≠ G (t
2), then this network is complete dynamic network;
If
Make G (t
1)=G (t
2), T=[t wherein
1, t
2], then G (t) is a time-varying network.In this network, relation is relatively stable between some node in a period of time, can set up a path end to end.
B) dynamical evolution network.For given time-varying network G (t) and time series T=t
0, t
1... T
k, t wherein
i=[t '
i, t "
i] expression discretization time period.Along with the propelling of time, whole network can constantly develop, and the contact between the node also can change, and get in touch E between the node this moment also will be the function about time t, and produce a series of dynamic subgraphs:
G
sub＝G
1，G
2，…，G
k (2)
If these dynamic subgraphs satisfy:
Claim that then this time-varying network G (t) is the dynamical evolution network, promptly whole network is complete and can divides.This means in some time, possibly not exist between the node in the whole DTN network end to end and connect; But propelling along with the time; Through can implementation part by intermediate node interconnect; The asynchronous end-to-end connection of final realization, this also is a kind of common form of expression of DTN network.
C) asynchronous forward-path.In dynamical evolution network G (t), along with the propelling of time, whole network is constantly to develop forward, and the contact in the network between the node is interim sometimes.If but the stage of utilizing node that can be appropriate connects; The mode through taking " storing-carry-transmit " or the mode of " storage-wait-forwarding "; Also might realize the segment transmissions of data, can be described as and found one " temporal asynchronous forward-path ", arbitrary node a; Path p between the b (a b) is expressed as time evolution sequence:
p(a，b)＝((a，x
1，t
1)，(x
1，x
2，t
2)，…，(x
i，b，t
k)) (4)
Wherein: x
i∈ V representes each the middle forward node in the network;
t
i≤t
I+1The constantly evolution forward of forwarding time of expression node;
(x
i, x
I+1, t
I+1) be illustrated in time period t
I+1Within node x
iWith x
I+1Keep in touch.
Node location forecast model based on Markov process
In the DTN network; The motion track of each node generally is uncertain, but can know that through real life long-term observation and existing mathematical theory the motion of node generally is regular governed; The characteristics of motion through analysis node; The movement locus of node is made prediction to a certain degree, can strengthen the specific aim and the purpose of data forwarding, improve data delivery ratio.
This paper with the motion process of node abstract be a Markov random process, utilize the prediction characteristic of Markov process that node location is predicted.Model is provided with as follows:
A) all nodes move in the scope of regulation in the network;
B) geographical space with this regulation is divided into m zone;
C) each node is asked with certain probability in this m zone and is carried out random motion in the network;
D) motion of each node is independent incoherent in the network, and the position transfer matrix of node is:
Wherein: matrix M has reflected the transition probability (can obtain through observation or autonomous learning) between each position;
P
LijThe expression node is from current location Li, and next transfers to the probability of position Lj constantly;
For optional position Li, satisfy the normalizing property of state space:
Hypothesis above utilizing obtains the transfer matrix between the corresponding node in conjunction with network reality and Link State, for the current location of given any one node, through just doping the following position constantly of node with transfer matrix M computing; Utilize these positional informations then,, improve the payment rate of data as the foundation that node E-Packets.
Routing algorithm based on the node location prediction
Because the break feature of DTN network link, the topology of network can often change, and this paper proposes the routing algorithm based on the node location prediction, through the mode of prediction the DTN location of network nodes is judged.
Routing algorithm is based on following supposition:
A) network node moves in the scope of appointment, and the motion state be a discrete process, promptly in an observing time, node is positioned at a position;
B) network node can be to the copies of information reliable memory, supports the DTN network " to store-carry-transmit " and the routing mode of " storage-wait-forwarding ";
C) network node can be through the positional information of outside locate mode acquisition self and destination node;
D) network node sends information towards periphery with the radio broadcasting mode.
Four description of drawings
Fig. 1 is a legacy network route sketch map
Fig. 2 is a DTN network route sketch map
Fig. 3 be in the time-varying network S to the forward-path of D
Fig. 4 is a prediction routing algorithm flow chart
Five embodiments
Below in conjunction with accompanying drawing the present invention is further described.
With Fig. 3 is example, and whole network is made up of 2 mobile nodes and 6 stationary nodes, along with the propelling of time, and the continuous evolution of network topology, whole network is the dynamic network of an evolution in time.
Communication objective: data source nodes S transmission information is given destination node D.
Transmission course: S sends the data to intermediate node NO, and NO oneself has kept a copy when being transmitted to node N2, to the node direction motion, takes the routing mode of " storing-carry-transmit " then; Node NO has run into node N4 in the process of motion, transmit data, continues operation then, until moving within the destination node D scope.Data arrive the N5 node after N4 transmits simultaneously, and N5 takes the routing mode of " storage-wait-forwarding " owing to can not move arbitrarily, and wait is connected with destination node.Destination node D receives the information that N0 and N5 send simultaneously in the process that moves, accomplish whole data transmit-receive process through accepting or rejecting the affirmation back.
Prediction routing algorithm idiographic flow shown in Figure 4 is following:
A) source node S is sent message to destination node D, message acceptance of the bid clear destination node title, source node title, send sequence number, relevant informations such as transmitting time and geographical position;
B) node in the radiation scope is received information, verifies at first whether this node is destination node, if just receive message, returns confirmation, the transfer of data success;
C), then be according to judging whether to store this message, if destination node is on the forward-path or node is arranged on the forward-path then receives this message and store forwarding with the position prediction if this node is not a destination node;
D) if destination node not in the forwarding scope, or does not have node on the forward-path, then receive stored messages with predetermined probability p (0＜p＜1);
E) node carries out moving at random after receiving stored messages, carries out then " storing-carry-transmit ".
Wherein, The judgement of forward-path is to be as the criterion with the geographical position between forward node and the destination node; At this node when the direction of destination node has intermediate node within pitching α (0≤α≤45 °) angular region up and down; Assert on the forward-path has node, if not or exceed this scope and then think do not have node on the forward-path.
Claims (3)
1. network asynchronous routing algorithm of DTN based on node location prediction is characterized in that step comprises:
A) source node S is sent message to destination node D, message acceptance of the bid clear destination node title, source node title, send sequence number, transmitting time and geographical position;
B) if the node in the radiation scope of source node S is received information, verify at first then whether this node is destination node, if just forward step e) to;
C) if this node is not a destination node, judge then whether destination node is in the forwarding scope of this node, if destination node is in the forwarding scope of this node, then transmit to destination node, forward step e) to;
If destination node is not in the forwarding scope of this node, then further judging has intermediate node on the forward-path, if there is not intermediate node, then receives this message and stores forwarding;
D) if destination node not in the forwarding scope, or does not have intermediate node on the forward-path, then receive stored messages, return step b) with predetermined probability p (0＜p＜1);
E) if destination node receives message, then return confirmation, the transfer of data success; If destination node does not receive message, then direct dropping packets.
2. method according to claim 1; It is characterized in that in the said step c); The judgement of forward-path is to be as the criterion with the geographical position between forward node and the destination node, and when the direction of destination node had intermediate node within pitching α (0≤α≤45 °) angular region up and down, assert on the forward-path had node at this node; If not or exceed this scope, then thinking does not have node on the forward-path.
3. method according to claim 1 is characterized in that in the said step d), and node carries out moving at random after receiving stored messages, and the routing mode of carrying out " storing-carry-transmit " then is to other node direction motion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100631423A CN102594698A (en) | 2012-03-12 | 2012-03-12 | DTN asynchronous routing algorithm based on node position projection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100631423A CN102594698A (en) | 2012-03-12 | 2012-03-12 | DTN asynchronous routing algorithm based on node position projection |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102594698A true CN102594698A (en) | 2012-07-18 |
Family
ID=46482914
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100631423A Pending CN102594698A (en) | 2012-03-12 | 2012-03-12 | DTN asynchronous routing algorithm based on node position projection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102594698A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932150A (en) * | 2012-10-25 | 2013-02-13 | 内蒙古大学 | DTN (Delay Tolerant Network)-based security mechanism management method for interactive satellite remote education system |
| CN103095438A (en) * | 2013-01-09 | 2013-05-08 | 哈尔滨工业大学深圳研究生院 | Deep space delay tolerant network (DTN) multiple hop transmission method |
| CN103974372A (en) * | 2014-05-13 | 2014-08-06 | 浪潮电子信息产业股份有限公司 | Delay tolerant network routing method based on fuzzy reasoning |
| CN104009985A (en) * | 2013-11-28 | 2014-08-27 | 内蒙古大学 | Satellite remote education system based on DTN and interactive communication method thereof |
| CN104618981A (en) * | 2014-12-31 | 2015-05-13 | 南京信息工程大学 | Position and direction based priority routing method in delay tolerant network (DTN) environment |
| CN104780216A (en) * | 2015-04-23 | 2015-07-15 | 闪联信息技术工程中心有限公司 | Method and system for Internet-connection-free device to upload data to Internet server |
| CN106656819A (en) * | 2017-02-06 | 2017-05-10 | 中国人民解放军理工大学 | DTN opportunity prediction routing method based on timetable |
| CN107102918A (en) * | 2017-05-26 | 2017-08-29 | 郑州云海信息技术有限公司 | A kind of data processing method and device |
| CN108092707A (en) * | 2017-12-21 | 2018-05-29 | 广东工业大学 | A kind of data transmission method and device based on unmanned plane ad hoc network |
| CN108566614A (en) * | 2017-11-06 | 2018-09-21 | 南京大学 | A kind of end-to-end communication method and system towards time delay tolerant network |
| CN108990128A (en) * | 2018-09-06 | 2018-12-11 | 周口师范学院 | Based on the route designing method of mobile awareness in mobile network |
| CN110247850A (en) * | 2019-06-19 | 2019-09-17 | 中国石油大学(华东) | A kind of ship networking protocol based on dynamic routing table |
| CN116566472A (en) * | 2023-05-30 | 2023-08-08 | 南京航空航天大学 | Dynamic discrete topology-oriented world-wide integrated network wide area routing mechanism |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101414964A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
-
2012
- 2012-03-12 CN CN2012100631423A patent/CN102594698A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101414964A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
| CN101414965A (en) * | 2008-12-04 | 2009-04-22 | 天津大学 | Method for saving node energy of delay-tolerant network and intermittently-connected network |
Non-Patent Citations (1)
| Title |
|---|
| 党斐: "基于上下文的容迟网络路由算法研究", 《中国优秀硕士学位论文全文数据库》, 31 March 2011 (2011-03-31), pages 136 - 456 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932150B (en) * | 2012-10-25 | 2015-06-17 | 内蒙古大学 | DTN (Delay Tolerant Network)-based security mechanism management method for interactive satellite remote education system |
| CN102932150A (en) * | 2012-10-25 | 2013-02-13 | 内蒙古大学 | DTN (Delay Tolerant Network)-based security mechanism management method for interactive satellite remote education system |
| CN103095438A (en) * | 2013-01-09 | 2013-05-08 | 哈尔滨工业大学深圳研究生院 | Deep space delay tolerant network (DTN) multiple hop transmission method |
| CN103095438B (en) * | 2013-01-09 | 2016-02-24 | 哈尔滨工业大学深圳研究生院 | A kind of deep space DTN network multi-hop transmission method |
| CN104009985A (en) * | 2013-11-28 | 2014-08-27 | 内蒙古大学 | Satellite remote education system based on DTN and interactive communication method thereof |
| CN103974372B (en) * | 2014-05-13 | 2018-04-13 | 浪潮电子信息产业股份有限公司 | Delay tolerant network routing method based on fuzzy reasoning |
| CN103974372A (en) * | 2014-05-13 | 2014-08-06 | 浪潮电子信息产业股份有限公司 | Delay tolerant network routing method based on fuzzy reasoning |
| CN104618981A (en) * | 2014-12-31 | 2015-05-13 | 南京信息工程大学 | Position and direction based priority routing method in delay tolerant network (DTN) environment |
| CN104780216B (en) * | 2015-04-23 | 2018-06-26 | 闪联信息技术工程中心有限公司 | A kind of equipment of no internet connection uploads data to the method and system of Internet Server |
| CN104780216A (en) * | 2015-04-23 | 2015-07-15 | 闪联信息技术工程中心有限公司 | Method and system for Internet-connection-free device to upload data to Internet server |
| CN106656819B (en) * | 2017-02-06 | 2019-09-20 | 中国人民解放军理工大学 | A kind of DTN chance prediction method for routing based on timetable |
| CN106656819A (en) * | 2017-02-06 | 2017-05-10 | 中国人民解放军理工大学 | DTN opportunity prediction routing method based on timetable |
| CN107102918A (en) * | 2017-05-26 | 2017-08-29 | 郑州云海信息技术有限公司 | A kind of data processing method and device |
| CN108566614A (en) * | 2017-11-06 | 2018-09-21 | 南京大学 | A kind of end-to-end communication method and system towards time delay tolerant network |
| CN108566614B (en) * | 2017-11-06 | 2020-08-14 | 南京大学 | End-to-end communication method and system for delay tolerant network |
| CN108092707A (en) * | 2017-12-21 | 2018-05-29 | 广东工业大学 | A kind of data transmission method and device based on unmanned plane ad hoc network |
| CN108990128A (en) * | 2018-09-06 | 2018-12-11 | 周口师范学院 | Based on the route designing method of mobile awareness in mobile network |
| CN108990128B (en) * | 2018-09-06 | 2021-06-04 | 周口师范学院 | Route design method based on mobile perception in mobile network |
| CN110247850A (en) * | 2019-06-19 | 2019-09-17 | 中国石油大学(华东) | A kind of ship networking protocol based on dynamic routing table |
| CN110247850B (en) * | 2019-06-19 | 2021-07-09 | 中国石油大学(华东) | Ship networking protocol implementation method based on dynamic routing table |
| CN116566472A (en) * | 2023-05-30 | 2023-08-08 | 南京航空航天大学 | Dynamic discrete topology-oriented world-wide integrated network wide area routing mechanism |
| CN116566472B (en) * | 2023-05-30 | 2024-04-16 | 南京航空航天大学 | Dynamic discrete topology-oriented world-wide integrated network wide area routing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102594698A (en) | DTN asynchronous routing algorithm based on node position projection | |
| Srivastava et al. | Future FANET with application and enabling techniques: Anatomization and sustainability issues | |
| Goudarzi et al. | Data collection using unmanned aerial vehicles for Internet of Things platforms | |
| Oubbati et al. | A survey on position-based routing protocols for Flying Ad hoc Networks (FANETs) | |
| Arafat et al. | Location-aided delay tolerant routing protocol in UAV networks for post-disaster operation | |
| Khelifi et al. | Localization and energy-efficient data routing for unmanned aerial vehicles: Fuzzy-logic-based approach | |
| Shen et al. | A novel routing protocol providing good transmission reliability in underwater sensor networks | |
| Majumdar et al. | An efficient routing algorithm based on ant colony optimisation for VANETs | |
| CN101383768B (en) | Vehicle network data routing method based on digital map and mobile prediction | |
| Tiwari et al. | Mobility aware routing for the airborne network backbone | |
| Nayyar et al. | Opportunistic networks: present scenario-a mirror review | |
| Xie | An enhanced OLSR routing protocol based on node link expiration time and residual energy in ocean FANETS | |
| KR102128946B1 (en) | Network structure for the scene of a fire | |
| Mansoor et al. | A fresh look at routing protocols in unmanned aerial vehicular networks: a survey | |
| Farooq et al. | AMVR: A multicast routing protocol for autonomous military vehicles communication in VANET | |
| Emami et al. | Deep Q-networks for aerial data collection in multi-UAV-assisted wireless sensor networks | |
| Waheed et al. | Laod: Link aware on demand routing in flying ad-hoc networks | |
| Krug et al. | A realistic underlay concept for delay tolerant networks in disaster scenarios | |
| Garg et al. | Accurate link lifetime computation in autonomous airborne UAV networks | |
| Wang et al. | An improved VANET intelligent forward decision-making routing algorithm | |
| Koti et al. | Multi Agent Assisted Safety Information Dissemination Scheme for V2V Communication in VANETs: Intelligent Agent Approach | |
| Will et al. | Wireless sensor networks in emergency scenarios: the Feuerwhere deployment | |
| Li et al. | Network coding with crowdsourcing-based trajectory estimation for vehicular networks | |
| CN102572998A (en) | Heuristic routing method utilizing position information in shipborne adhoc network | |
| Ran et al. | Link availability Prediction based on capacity optimization in MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C05 | Deemed withdrawal (patent law before 1993) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120718 |