CN101674220A - Forwarding history-based asynchronous rooting algorithm - Google Patents
Forwarding history-based asynchronous rooting algorithm Download PDFInfo
- Publication number
- CN101674220A CN101674220A CN200810105927A CN200810105927A CN101674220A CN 101674220 A CN101674220 A CN 101674220A CN 200810105927 A CN200810105927 A CN 200810105927A CN 200810105927 A CN200810105927 A CN 200810105927A CN 101674220 A CN101674220 A CN 101674220A
- Authority
- CN
- China
- Prior art keywords
- node
- algorithm
- message
- routing
- grouping
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a forwarding history-based asynchronous rooting algorithm, which belongs to technical field of wireless networks and routing. The routing algorithm comprises the following threeparts: (1) a relay selection algorithm; (2) a packet transmission algorithm; and (3) a routing information updating algorithm. The relay selection algorithm is executed when a node is ready for sending packets or serves as a relay node which receives messages, and the relay selection algorithm selects a better next hop relay for the packets. The packet transmission algorithm is executed when twonodes obtain a communication opportunity, and is used for transmitting the packets. The routing information updating algorithm is executed after the node receives feedback information and is used forupdating a routing information list. The asynchronous rooting algorithm completely solves the routing problems in a wireless self-organization network from an asynchronous point, makes a routing decision intelligently by using history information forwarded in packets, uses part of better nodes as relay nodes carrying the packets, improves the reliability and the validity of the information transfer in a limited network, and greatly reduces the information loss rate and unnecessary information retransmissions.
Description
Technical field
The present invention relates to field of wireless and route technology field, particularly asynchronous rooting algorithm, be applicable to the information transmission in the wireless network of interrupted connection.
Background technology
Mobile Ad hoc network (MANET, Mobile Ad-hoc Network) is a kind of typical distribution formula network schemer, and this has proposed a lot of challenges to internodal intercommunication mutually.Big quantity algorithm at the routing issue of mobile Ad hoc network is suggested.For the simplification that studies a question, the research of Most scholars is all based on such hypothesis: only the internodal communication in interconnective same cloud atlas be only significant, promptly communication all be synchronous.Yet this hypothesis is more and more broken in the application of reality, may in different connection cloud atlas, communicate by letter in practice, or a certain area for some reason, more sparse such as node, node energy management or node motion are more frequent, make to be difficult to keep the stable network topological structure in the network.In addition, in the more and more important what is called of a present class " limited network (Challenged network) ", because bigger network delay, frequent network disconnects and intermittently is connected and makes and be difficult to keep the lasting connectedness of node.The basic demand of " limited network " is exactly that the success that guarantees grouping under the little delay of trying one's best is sent to, the present invention uses and to carry out routing decision based on packet forward history, and selects node preferably to satisfy the particularity of " limited network " as the carrier's of grouping method.
We often use Internet in daily life and in time communicate by letter or file transfer other far users of potential range.Under the situation of these synchronous communications, source node and destination node are set up a path end to end, send the message grouping on this paths.If for some reason, unusual as network, some groupings send failure, and source node can send this grouping to destination node again.But under some particular surroundings, node between different clans may be owing to there be such path end to end, uses existing synchronous routing algorithm clearly can not satisfy end-to-end communication under these situations.The network environment that is applicable to these parts connections that asynchronous communication is very natural.
What propose at present has some achievements about the asynchronous rooting algorithm in the mobile Ad hoc network.The simplest a kind of method is that source node will divide into groups inundation to all nodes in the zone, receives this message up to destination node, and this algorithm is called as popular algorithm (Epidemic algorithm).Though this algorithm guarantees message and guarantees very high transmission success rate simultaneously for destination node with the delayed delivery of minimum that this algorithm produces too much network traffics.Because the energy that the node in the wireless network does not have to continue is supplied with, the stored energy of node and computing capability all are limited, particularly are being used for the special occasions sensing network, and node can not be changed battery again, so we wish that battery can be with trying one's best the long time.Like this, the time that makes node be in activity because popular algorithm produces too many network traffics can increase greatly, and node will be handled more grouping simultaneously, and excessive amount of calculation can consume a lot of energy equally.On the other hand, because the node stored energy is limited in the network, if the grouping that node receives has surpassed the scope of the buffer memory of node, node will discard the low or longer grouping of time of some priority, and this finally has influence on the success rate that grouping sends.So actual routing algorithm should be to select the better node of part to transmit grouping, to reduce unnecessary network traffic.Existing a large amount of routing algorithm all is to transmit grouping round how choosing preferably node, how still can reach laser propagation effect preferably duplicating under the situation of less grouping.
People such as Kevin Fall have proposed several dependence network knowledges and have transmitted the algorithm of grouping.These algorithms use a kind of link that is similar to the legacy network Routing Protocol to measure, each node is all set up a global network topology diagram, finally operation minimal path algorithm calculates a minimal path on this figure, uses the node on this paths to transmit grouping.A kind of measuring wherein is Earliest Delivery, and the queuing time of this method hypothesis message is zero, and the transmission time is accurately known.This algorithm selects a path the fastest to transmit grouping, requires all nodes to know the timetable that the global communication chance arrives like this.Yet, be difficult under the actual conditions accurately know network knowledge, even under the more accurate scene of some node moving laws, also there is the problem of network design difficulty and expansion difficulty.The routing algorithm that we need should be able to guarantee that network design is simple, is applicable to the algorithm of different network environments.
People such as Mirco Musolesi have proposed a kind of Context-Aware Routing routing algorithm.Node carries out routing decision from utilizing the synthetic transmission of environmental information possibility information in this algorithm.These environmental informations comprise the ratio (possibility of ratio big more it and other node communication is big more) and the current energy levels of node of node connectivity changes.Synchronous dot cycle in route time property the potential information that needs of the synchronous route of transmission and it is to the tabulation of other node transmission possibility.Node is received the routing table of upgrading oneself after these message.All keep a tabulation for each node of asynchronous route, preserve (destination node, preferably node transmits possibility) such group in this tabulation.After a node was chosen as the message carrier and receives message, node deposited message in the buffering area in.This node that carries message is carried out same operation, sends to destination node up to message.
People such as Kevin Fall have proposed the communication issue that Delay Tolerant Network (Delay tolerant network) architecture is handled the node between difference " limited network " type.Simultaneously, they have proposed several routing algorithms that need network knowledge, these algorithms define a kind of measuring between node, node and internodal communication opportunity form a weighted graph like this, utilize then the minimal path algorithm seek one preferably the path transmit message.
People such as Wang Yong propose to improve simple message copy algorithm based on the forwards algorithm of erasure codes (Erasure-Coding).In algorithm based on erasure codes, at first message is encoded and produce a large amount of encoding blocks at source node, the average relay well that has arrived in top n of these encoding blocks distributes then, allows them be responsible for transmitting encoding block.Can use them to recover message again as partial code piece incoming terminal node.Except effective route, this method also can be tackled the packet loss that poor channel quality or network congestion cause.
These methods are considered asynchronous routing issue the wireless self-networking from different angles, but all there is certain problem in some aspects in these methods.The method that we propose can have been carried out certain fusion with these methods, finally forms a kind of method for routing of mixing, and this method needs less network knowledge, duplicates less message, and can consider most of factor that influences route in the network.
Summary of the invention
The present invention proposes a kind of intelligent routing algorithm (abbreviating FH as) based on forwarding history, the target of this algorithm be allow node can intelligence make routing decision, select some that similar message is successfully sent to the destination node success rate and transmit grouping as relay point than higher node.The FH algorithm uses few network knowledge of trying one's best simultaneously, is convenient to the deployment and the expansion of network.The information that the FH algorithm is used for making routing decision is based on the statistics of forwards history is in the past obtained, in algorithm initial operating stage and the popular class of algorithms seemingly, set up the forwarding information table at this stage node, in case the forwarding information table is set up and successfully just begun the selected part node rather than all nodes are transmitted message.
In " limited network " such such as DTN, some nodes may not in same connection cloud atlas or because some factor is difficult to mutual instant messaging, this situation is called have communication opportunity.In case because variation has taken place the state mobile or network of node, two nodes are had ready conditions and have been communicated, and then are called communication opportunity and have arrived.
The routing algorithm based on forwarding history that the present invention proposes can be divided into three parts: 1. relay selection algorithm (RELAY_SELECT); 2. transmitted in packets algorithm (PACKET_TRANSFER); 3. updating route information (RINFO_UPDATE).The relay selection algorithm is performed when receiving message when node is ready for sending grouping or as relay point, and next jumps relaying preferably for minute group selection.The transmitted in packets algorithm is carried out when the communication opportunity of two nodes arrives, and carries out transmission packets.The routing update algorithm is carried out after node is received feedback information, upgrades route information table.
(1) relay selection algorithm
Because the node most of the time is in off-state in intermittence connection network, the communication opportunity of different nodes arrives not at one time, so must make routing decision before sending message, selecting preferably, node obtains duplicating of message.Each node all needs to safeguard the historical information that a route information table comes recording messages to transmit in network, and utilizes the routing decision of making of information intelligent in this table.We have write down the transmission number of times that sends the employed different relayings of message to the terminal node of each grouping in route information table, successfully send number of times, the information such as average time of waiting for to this relaying forwards in the historical process of transmitting.We make the routing decision of this grouping by the identical clauses and subclauses of destination node of terminal node in the routing table and grouping.The node that we only are chosen on the message transmit path for the affirmation grouping is a relaying in addition.The specific implementation step of this relay selection algorithm is as shown in table 2, and the concrete expression meaning of some parameters of wherein using is shown in Table 1.
Table 1: some parameter declarations
| ??D | The destination node of grouping |
| ??Tm | Terminal point is average time maximum in the clauses and subclauses of D |
| ??Ta | The average time that relaying R communication opportunity arrives |
| ??Sc | Relaying R success quantity forwarded |
| ??Dc | Relaying R sends message number |
| ??N | Select the number of better relaying |
| ??M | Routing iinformation is set up the message number of being sent out |
Table 2: the specific implementation step of relay selection algorithm
| RELAY_SELECT (D) 1 inquires the clauses and subclauses that terminal node is D from routing table.2 utilize formula t=1-Ta/Tm that be mapped in the 0-1 scope average time in each clauses and subclauses.Calculate the forwarding success rate r=Sc/Dc of each clauses and subclauses.3 synthetic routing metric P=K1*t+K2*r, respectively be endowed different weights K1 and K2 with the forwarding success rate average time.Select the bigger N of a P value node as relay point, the relaying of Dc＜M is obtained duplicating of message equally set up routing iinformation. |
| 4 relay points with selection carry out record, wait for the arrival of the communication opportunity of these nodes. |
(2) transmitted in packets algorithm
When the communication opportunity of two nodes arrived, the transmitted in packets algorithm was performed.Two nodes that meet are carried out same method and are given the other side with transmitted in packets.We transmit various message by different orders in order to make full use of communication opportunity, and acknowledge message at first obtains transmission, secondly are that destination node is the opposing party's of communication a message, send other message at last.Guarantee that like this acknowledge message obtains transmission as early as possible and makes and can upgrade route information table in time, preferential in addition send the node that directly arrives make relay point as early as possible the shared memory space of release message and avoid message by new grouping to covering, improve the transmitted in packets success rate.Table 3 is the execution in step of transmitted in packets algorithm.
Table 3: the execution in step of transmitted in packets algorithm
| (X, Y) the 1X node sends to the Y node and be transmitted or be mail to the tabulation L of keyword of the grouping of Y by Y PACKET_TRANSFER.Wait for the answer of Y.2 node Y send to X to the tabulation L2 of the keyword of the message that does not receive among the L.Affirmation message among the 3 transmission L2 is to Y.4 to send terminal points be that the grouping of Y is to Y.5 send other grouping to Y.6 routing algorithms finish or finish all transmission of messages back that finishes at communication opportunity. |
(3) updating route information
The node that sends the node of grouping or obtain packet copies in the time will divide into groups the adding memory block in message header the sign keyword and the current time of flag node.The terminal node of grouping calculates the employed time T s of every jumping receiving the time that the grouping back node listing Ns that taking-up participation grouping sends from packets headers and each node are received message.Create acknowledge message with Ns and Ts data, be transmitted to the node that participates in this packet forward and the source node of grouping by reverse path as acknowledge message.
In message transmitting process, we utilize the rightabout in this path to send out acknowledge message to the node on the path when terminal node successfully receives message in the path that the recording messages transmission of message header the inside is walked.Node upgrades route information table after receiving the confirmation message.Such as the path of a piece of news in the experiment scene figure (see figure 1) along A-＞B-＞E-＞G a piece of news is successfully sent, then G sends acknowledge message by G-＞E-＞B-＞A path.Suppose that node A has received acknowledge message, this shows that not only it uses Node B successfully to send a piece of news to G as relaying, show also simultaneously that it uses Node B successfully to send a piece of news to E as relaying and it has successfully sent a piece of news to B, then will upgrade with B in the routing iinformation standard of A is relaying, and G, E, B are the information of three clauses and subclauses of destination node.
Description of drawings
Fig. 1-experiment scene figure;
Fig. 2-buffer size VS packet transmission rate figure;
Fig. 3-buffer size VS transmits total spirogram;
Fig. 4-buffer size VS average delay figure
Embodiment
The present invention will be further described below in conjunction with drawings and Examples.
The intermittent network that disconnects is modeled as a series of mobility node usually, and each node can be searched for other node in the communication range and connect, and node has certain message buffering ability and limited bandwidth.After two nodes enter each other communication range, connect and send blocking message mutually.In transmission, transmit leg is not deleted the grouping copy of self after sending a grouping to the recipient.Node can directly or by other intermediate node send to destination node with grouping.The message that the hypothetical target node has the storage of enough space to receive then has only grouping in the transmission to be subjected to the restriction of limited memory space.The time that communication opportunity in the intermittent disconnection network between the node continues is much smaller than the separated time of node.
Our research experiment is based on model shown in Figure 1, and model is a directed graph structure, and the node among the figure is represented network node, the communication opportunity that the limit among the figure is represented between node to be had (communication opportunity is two-way, and arrives according to certain rules).The target of asynchronous rooting algorithm is utilized these communication opportunities exactly, and as much as possible message is sent to destination node from source node.
Each node all needs to safeguard the historical information that a route information table comes recording messages to transmit in network, and utilizes the routing decision of making of information intelligent in this table.We have write down the transmission number of times (Send Count) of terminal node (Dest Node) the transmission employed different relayings of message (Relay Node) to each grouping in route information table, success sends number of times (Success delivery count), the average time (Average time) of waiting for to this relaying forwards in the historical process of transmitting.We set the message count that a constant M represents that routing iinformation foundation needs send, and are set at 8 such as us; Set another constant value N and represent to select the number of relaying preferably, such as being made as 2.Reach M time when node S uses a certain relaying R to transmit message for a certain terminal node D, represent that routing iinformation is set up here.If S will send message to D before this routing iinformation is set up, relaying R always obtains duplicating of message.To set up back R the same with other relaying of having set up routing iinformation when routing iinformation, and utilization forwarding is in the past write down and selected preferably that node carries message.For example, in the scene of Fig. 1, A node and D node have the route information table shown in following table 4 and table 5 respectively.
The forwarding information table of table 4:A node
| ??Dest ??Node | ??Relay ??Node | ??Send?Count | ??Success?delivery ??count | ??Average?time |
| ??G | ??B | ??10 | ??5 | ??20 |
| ??G | ??C | ??9 | ??4 | ??30 |
| ??G | ??E | ??3 | ??1 | ??25 |
The forwarding information table of table 5:D node
| ??Dest ??Node | ??Relay ??Node | ??Send?Count | ??Success?delivery ??count | ??Average?time |
| ??G | ??G | ??10 | ??2 | ??40 |
| ??G | ??J | ??9 | ??5 | ??26 |
As shown in Figure 1, suppose that the A node sends message for the G node and node A has the node of communication opportunity that B, E, C node are arranged, then in A, will keep the information of transmitting as shown in table 4.Then B and C set up as the forwarding information that relaying forwarding A sends to the message of G in table 4, and node E may enter network than later, and routing iinformation is set up as yet.If this moment, node A will send a new message to node G, then B and C are chosen as relaying as two nodes preferably, and E equally also is chosen as relaying because routing iinformation is not set up successfully as yet.Other nodes in the network are kept same route information table.Communication opportunity is arranged for D node and destination node but he also can transmit message by node J, route information table such as table 5 that D is ordered simultaneously.
The routing algorithm based on forwarding history that the present invention proposes is realized by three part algorithms:
1. relay selection algorithm (RELAY_SELECT): the relay selection algorithm is performed when receiving message when node is ready for sending grouping or as relaying, and next jumps relaying preferably for minute group selection;
2. transmitted in packets algorithm (PACKET_TRANSFER): the transmitted in packets algorithm is carried out when the communication opportunity of two nodes arrives, and carries out transmission packets;
3. updating route information (RINFO_UPDATE): the routing update algorithm is carried out after node is received feedback information, upgrades route information table.
We are set at 8 to the message bar number of setting up of routing iinformation when the routing algorithm of realizing based on forwarding history, promptly represent that to same node routing iinformation sets up when node uses a relaying to send four message; We are made as 4 to the number of selecting better relaying on the other hand, when routing iinformation is set up after two of each selections preferably relaying transmit message.The message circulation that causes for fear of there being loop in realization in addition sends, we also send the tabulation of the sign of the message that the other side's relaying be arranged to the other side as popular algorithm when the communication opportunity of two nodes arrives, the sign of the message that the other side's selection does not have sends request list, then the message of request is sent to the other side.We have also realized popular algorithm (Epidemic Protocol simultaneously, EP), direct communication chance (Simple Contact, SC), global knowledge route (Earliest Delivery, ED) scheduling algorithm uses the simulation result of the FH algorithm that simulation result that these algorithms obtain and this paper proposes to compare.All algorithm simulatings are all based on the same parameter shown in the table 6.
Table 6: simulation parameter
| The node number | ?16 |
| Message size | ?400 |
| Bandwidth | ?800 |
| The emulation duration | 5 days |
| Set up routing iinformation and send message count | ?8 |
| Select better relaying number | ?4 |
Under equivalent environment, we carry out volume relatively to the routing algorithm based on forwarding history that the present invention proposes with direct transmission algorithm, global knowledge algorithm and popular algorithm in emulation experiment, analyzed their some performance parameter indexs.
Fig. 2 is under the situation that bandwidth and node number are determined, comes the curve chart of the data transmission rate that emulation obtains by setting different buffer values.It is poorer slightly than popular algorithm and global knowledge algorithm on performance to see from figure based on the method for routing of forwarding history, and better than direct transmission method.Fig. 3 is under the situation that different buffer size is set, the quantity of the message that is sent in the network.We can see no matter how many sizes of buffer memory is, the data volume that popular algorithm sent is greater than the method for routing based on forwarding history.Fig. 4 is under different buffer size, the variation diagram of message average delay.The average delay of FH algorithm message is than EP algorithm height as we can see from the figure, and the ratio that increases along with the increase of buffering area is very fast.
Claims (4)
1. asynchronous rooting algorithm based on forwarding history is characterized in that: described algorithm is made up of following three parts:
1. relay selection algorithm;
2. transmitted in packets algorithm;
3. updating route information;
The relay selection algorithm is performed when receiving message when node is ready for sending grouping or as relay point, and next jumps relaying preferably for minute group selection; The transmitted in packets algorithm is carried out when the communication opportunity of two nodes arrives, and carries out transmission packets; The routing update algorithm is carried out after node is received feedback information, upgrades route information table.
2. asynchronous rooting algorithm according to claim 1 is characterized in that: the step of described relay selection algorithm is:
1) from routing table, inquires the clauses and subclauses that terminal node is D;
2) utilize formula t=1-Ta/Tm that be mapped in the 0-1 scope average time in each clauses and subclauses.Calculate the forwarding success rate r=Sc/Dc of each clauses and subclauses;
3) synthetic routing metric P=K1*t+K2*r, respectively be endowed different weights K1 and K2 with the forwarding success rate average time.Select the bigger N of a P value node as relay point, the relaying of Dc＜M is obtained duplicating of message equally set up routing iinformation;
4) relay point of selecting is carried out record, wait for the arrival of the communication opportunity of these nodes;
Wherein D represents the destination node that divides into groups; Tm represents that terminal point is average time maximum in the clauses and subclauses of D; Ta represents the average time that relaying R communication opportunity arrives; Sc represents relaying R success quantity forwarded; Dc represents that relaying R sends message number; N represents to select the number of better relaying; M represents the message number that routing iinformation foundation is sent out.
3. asynchronous rooting algorithm according to claim 1 is characterized in that: the step of described transmitted in packets algorithm is:
1) the X node sends to the Y node and be transmitted or be mail to the tabulation L of keyword of the grouping of Y by Y, waits for the answer of Y;
2) node Y sends to X to the tabulation L2 of the keyword of the message that does not receive among the L;
3) the affirmation message among the transmission L2 is to Y;
4) sending terminal point is that the grouping of Y is to Y;
5) send other grouping to Y;
6) routing algorithm finishes or finish all transmission of messages back that finishes at communication opportunity.
4. asynchronous rooting algorithm according to claim 1 is characterized in that the step of described updating route information is:
The node that sends the node of grouping or obtain packet copies in the time will divide into groups the adding memory block in message header the sign keyword and the current time of flag node; The terminal node of grouping takes out from packets headers and participates in the time that node listing Ns that grouping sends and each node are received message receiving grouping back, calculates the employed time T s of every jumping, creates acknowledge message with Ns and the Ts data as acknowledge message; In message transmitting process, in the path that the recording messages transmission of message header the inside is walked, when terminal node successfully receives message, utilize the rightabout in this path to send out acknowledge message, be transmitted to the node of this packet forward of participation and the source node of grouping by reverse path to the node on the path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101059276A CN101674220B (en) | 2008-05-07 | 2008-05-07 | Forwarding history-based asynchronous rooting algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101059276A CN101674220B (en) | 2008-05-07 | 2008-05-07 | Forwarding history-based asynchronous rooting algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101674220A true CN101674220A (en) | 2010-03-17 |
| CN101674220B CN101674220B (en) | 2011-10-19 |
Family
ID=42021222
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101059276A Expired - Fee Related CN101674220B (en) | 2008-05-07 | 2008-05-07 | Forwarding history-based asynchronous rooting algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101674220B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102300161A (en) * | 2011-08-23 | 2011-12-28 | 哈尔滨工业大学 | Delay-tolerant VANET broadcasting method at disconnecting state of network |
| CN102469017A (en) * | 2010-11-17 | 2012-05-23 | 中兴通讯股份有限公司 | Relay selection method and relay control system |
| CN102752799A (en) * | 2012-06-29 | 2012-10-24 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN103200528A (en) * | 2013-04-03 | 2013-07-10 | 电子科技大学 | Cooperative relaying selection method applicable to broadband cluster system |
| CN105490940A (en) * | 2015-12-04 | 2016-04-13 | 天津维晟微科技有限公司 | Selection method and apparatus for switching node, and base node and terminal nodes |
| CN105516009A (en) * | 2015-12-04 | 2016-04-20 | 天津维晟微科技有限公司 | Method and device for asking for access to network by access point, network architecture |
| CN110166510A (en) * | 2018-02-13 | 2019-08-23 | 贵州白山云科技股份有限公司 | A kind of method and its information gateway of information gateway dispatch messages |
-
2008
- 2008-05-07 CN CN2008101059276A patent/CN101674220B/en not_active Expired - Fee Related
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102469017A (en) * | 2010-11-17 | 2012-05-23 | 中兴通讯股份有限公司 | Relay selection method and relay control system |
| WO2012065506A1 (en) * | 2010-11-17 | 2012-05-24 | 中兴通讯股份有限公司 | Relay selection method and relay control system |
| CN102300161A (en) * | 2011-08-23 | 2011-12-28 | 哈尔滨工业大学 | Delay-tolerant VANET broadcasting method at disconnecting state of network |
| CN102752799A (en) * | 2012-06-29 | 2012-10-24 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN102752799B (en) * | 2012-06-29 | 2015-07-22 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN103200528A (en) * | 2013-04-03 | 2013-07-10 | 电子科技大学 | Cooperative relaying selection method applicable to broadband cluster system |
| CN103200528B (en) * | 2013-04-03 | 2015-07-29 | 电子科技大学 | A kind of cooperating relay system of selection being applicable to broadband cluster system |
| CN105490940A (en) * | 2015-12-04 | 2016-04-13 | 天津维晟微科技有限公司 | Selection method and apparatus for switching node, and base node and terminal nodes |
| CN105516009A (en) * | 2015-12-04 | 2016-04-20 | 天津维晟微科技有限公司 | Method and device for asking for access to network by access point, network architecture |
| CN105490940B (en) * | 2015-12-04 | 2018-10-26 | 天津维晟微科技有限公司 | The selection method and device of switching node, base node, terminal node |
| CN110166510A (en) * | 2018-02-13 | 2019-08-23 | 贵州白山云科技股份有限公司 | A kind of method and its information gateway of information gateway dispatch messages |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101674220B (en) | 2011-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Practical opportunistic data collection in wireless sensor networks with mobile sinks | |
| Narra et al. | Destination-sequenced distance vector (DSDV) routing protocol implementation in ns-3. | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| Patil | Efficient AODV Routing Protocol for MANET with enhanced packet delivery ratio and minimized end to end delay | |
| CN110191053B (en) | Wireless ad hoc network multipath routing method based on cognitive learning | |
| CN105163354A (en) | Data flow delay guarantee strategy based on chance of pairwise inter-flow network coding | |
| Wen et al. | Delay‐Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks | |
| CN102098729B (en) | Construction method and related packet forwarding method for tree backbone structure in wireless network | |
| Ma | Coupling degree seeking based routing strategy for delay tolerant networks | |
| CN103024813A (en) | Bundle layer improvement algorithm based on DTN (delay tolerant networks) sensor network | |
| Chung et al. | Exploiting network coding for data forwarding in delay tolerant networks | |
| El Mougy et al. | Reliable data transfer for collecting data from BLE sensors using smartphones as relays to the cloud | |
| Vijayalakshmi et al. | Energy Aware Multicast Clustering (EAMC) with increased Quality of Service (QoS) in MANETs | |
| Bruno et al. | 6lowdtn: Ipv6-enabled delay-tolerant wsns for contiki | |
| Shekhar et al. | Mobile agents aided multicast routing in mobile ad hoc networks | |
| Wang et al. | A routing strategy with energy optimisation based on community in mobile social networks | |
| Yasmin et al. | A multi-attribute routing protocol for opportunistic network environments | |
| Karimzadeh | Efficient routing protocol in delay tolerant networks (DTNs) | |
| Ziane et al. | Inductive routing based on dynamic end-to-end delay for mobile networks | |
| De Oliveira et al. | A predicted-contact routing scheme for Brazilian rural networks | |
| Chinara et al. | Modeling of a topology adaptive clustering algorithm for mobile ad hoc networks using coloured petri nets | |
| Lu et al. | OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology | |
| Jaimini et al. | Efficient routing using bubble rap in delay tolerant network | |
| Ren et al. | An effective hybrid routing algorithm for opportunistic networks | |
| Hassan et al. | The Recent Variants of OLSR Routing Protocol in MANET: A Review |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111019 Termination date: 20120507 |