CN101414964B - Method for reducing redundant message of delay-tolerant network and intermittently-connected network - Google Patents
Method for reducing redundant message of delay-tolerant network and intermittently-connected network Download PDFInfo
- Publication number
- CN101414964B CN101414964B CN2008101537210A CN200810153721A CN101414964B CN 101414964 B CN101414964 B CN 101414964B CN 2008101537210 A CN2008101537210 A CN 2008101537210A CN 200810153721 A CN200810153721 A CN 200810153721A CN 101414964 B CN101414964 B CN 101414964B
- Authority
- CN
- China
- Prior art keywords
- node
- poslist
- information
- message
- record
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention relates to a method used for reducing redundant messages in a delay tolerant network and an intermittent connection network, belonging to the field of network communication technique; the method comprises the steps as follows: a source node queries a node neighbor list; if no destination node information exists, the message is temporarily memorized in a node buffer; non-empty nodes in the buffer periodically send exploration information and use the exploration information to exchange the message list and the node position list; when the exploration information sending node receives a return information, the carried node position list updates the node position list memorized in the local node; according to the updated local node position list, the message list included in thereturn information is updated; the node which receives the return information sends corresponding messages in the buffer according to the message list sequence included in the updated return information, and deletes the message which is successfully transmitted to the destination node. The method can effectively reduce the quantity of the redundant nodes, improves the performance of the whole network and prolongs the life period.
Description
Technical field
Present invention relates in general to network communications technology field, relate more specifically to utilize on a kind of DTN or the ICN network node geographical location information to reduce the redundancy message method.
Background technology
Delay Tolerant Network (DTN) or intermittently connect network (ICN) network be a kind of fully by mobile node constitute, the node distribution density is sparse, the wireless network of the end-to-end connection that do not continue usually.Mobile node wherein is that main frame possesses routing function again, is responsible for finding and safeguarding the path that leads to other nodes.But it is different with typical A d Hoc network, transfer of data among DTN or the ICN adopts the asynchronous transfer mode of forwarding-buffer memory-forwarding (Forward-Buffer-Forward), promptly when interrupting appears in routed path, intermediate node can temporarily be stored in message to be transmitted (data packet group of being made up of a plurality of packets) in the buffer, it is forwarded up to running into other suitable intermediate nodes or destination node again.This class network has alleviated the dependence of conventional wireless network to node communication scope, node density and end-to-end route, has greatly expanded the application of wireless network.In recent years, DTN and ICN are widely used in interplanetary network (Inter-Planetary
In the communication services such as Network), battlefield communication, nomadic communication (Nomadic Communication), sensor network, data access from far-off regions.
But, mobile node in DTN and the ICN network all is mobile portable equipment mostly, these equipment are all only battery-powered usually, and the energy content of battery is limited, and the charging of battery or change in application scenes be inconvenience or even cannot (as battlefield communication and sensor network).When the node energy content of battery exhausts, can not carry out efficient communication with other nodes.Simultaneously, along with the increase that exhausts charge node, it is more and more sparse that the node in the network just becomes, and transfer of data is also more and more difficult.Therefore, to DTN and ICN network performance decisive role, how research reduces redundancy message has very important significance to DTN and ICN network with the consumption of saving node energy in the transmission that reduces redundancy message.
For the procotol of using in DTN and the ICN network, existing general standard is mostly based on the consideration of delivery rate or time-delay, between source node and destination node, choose the copy that a plurality of intermediate nodes are preserved message to be transmitted, give destination node with message dilivery to be transmitted by moving of source node and intermediate node.Wherein be typically " infectious disease routing algorithm " the most, be that source node duplicates and pass to the node that all enter its communication range with the message that produces, the node of these reservation message copies carries out message secondary again and duplicates and pass to all nodes that they run into, and finally at least one message copy can arrive destination node.Because the massive duplication of message, almost each node all can receive and transmission network in a copy of message arbitrarily.Simultaneously, because the transmission of messages in DTN and the ICN network is asynchronous, when a message copy arrived destination node, a large amount of message copy that exists in the network can not destroyed immediately.These copies can take the nodal cache device quite a long time, even still transmit mutually between node.The message copy of these " redundancies " has not only taken the spatial cache of node, has also caused a large amount of unnecessary communications simultaneously, has wasted lot of energy.Therefore, need control, promptly select suitable intermediate node to transmit redundancy message redundancy message quantity.
Summary of the invention
The purpose of this invention is to provide and utilize the node geographical location information to reduce the redundancy message method on a kind of DTN and the ICN network.This method is by using: Delay Tolerant Network is carried out record with the positional information that intermittently is connected node in the network, adopt the tabulation exchanging mechanism, select suitable intermediate node to carry out forwards in network layer, with the quantity that reduces redundancy message in DTN and the ICN network and the transmission of redundancy message, thereby reduce node energy consumption effectively, prolong working time of node, improve the effect of network performance and life cycle.This method is as a kind of more satisfactory, good energy-conserving effect, practical technical scheme, can effectively reduce the quantity of redundant node, reduce the expense of delivering message, prolong the mobile node operating time, realize that the improvement of whole DTN and ICN network performance and lifetime prolong.
For this reason, the present invention adopts following technical scheme:
A kind of Delay Tolerant Network and method that intermittently is connected redundancy message in the network of reducing is characterized in that: comprise following part:
(1) source node query node neighbor table if having destination node information in the neighbor list, is then transmitted this message to destination node, otherwise this message is temporary in the nodal cache device; The node of all buffer non-NULLs periodically sends detection information, utilizes detection information to exchange messages mutually between the node of communication and tabulates and the node location tabulation, to determine which message need exchange in the buffer;
(2) when the detection information sending node is received a return information, utilize the node location tabulation of carrying in the return information that the node location tabulation of this node preservation is upgraded, according to the local node list of locations after upgrading the messaging list that comprises in the return information is upgraded then;
(3) receive that the node of return information is according to upgrading corresponding message in the messaging list order transmit buffer that comprises in the return information of back, check whether receive the MAC layer confirmation, and the message that successfully be delivered to destination node is deleted from buffer.
As preferred implementation, above-mentioned minimizing Delay Tolerant Network and intermittently be connected the method for redundancy message in the network in the step wherein (1), follows these steps to carry out the transmission of detection information and mutual:
(11) node of buffer non-NULL sends route exploration information HELLO, this information head comprises megList field and PosList field, the megList field record sends the tabulation of all informations in the detection information nodal cache device, and the PosList field record sends the node location tabulation that the detection information node is preserved.
(12) intermediate node is received megList field and the PosList field of extracting behind the HELLO in the header packet information, obtain megList_S tabulation and PosList_S tabulation, simultaneously, the node location tabulation PosList_A that this node is preserved according to PosList_S upgrades, and according to the messaging list megList_A that this node is preserved megList_S is upgraded, remove wherein with megList_A in the part that repeats of record.
(13) receive the intermediate node return information REPLY that HELLO wraps, comprise avimegList field and PosList field in this information, record among the megList_S after the above-mentioned renewal of avimegList field record, the record among the above-mentioned PosList_A of PosList field record.
Above-mentioned minimizing Delay Tolerant Network and the method that intermittently is connected redundancy message in the network, step wherein (2) follows these steps to carry out:
(21) after the node of transmission detection information HELLO is received a return information REPLY, extract avimegList field and PosList field in the header packet information, obtain avimegList tabulation and PosList_A tabulation, the node location tabulation PosList_S that this node is preserved according to PosList_A upgrades, position to part of nodes is revised, and the condition that the list of locations record upgrades is:
● the value of " sequence node number " equates with the value of " sequence node number " during PosList_S writes down in the PosList_A record; And
● the value of " timing position " is less than the value of " timing position " in the PosList_S record in the PosList_A record, and described " timing position " is used for the time sequencing that arbitrary node and other node meet in the network;
(22) the node location tabulation PosList_S that preserves according to this node upgrades the messaging list avimegList that comprises among the return information REPLY, and the condition of a record is in the deletion messaging list:
● the value of " destination node sequence number " equates with the value of " sequence node number " during PosList_S writes down in the avimegList record; And
● by target node position (X_D, Y_D), this node position (X_S, Y_S) and neighbor node position (X_A, Y_A) this node that calculates and destination node and this node and send angle theta between these two position vectors of return information node greater than setting the angle value.
Above-mentioned minimizing Delay Tolerant Network and the method that intermittently is connected redundancy message in the network, the setting angle value in the step wherein (22) is 45 °; Step (22) afterwards, also comprise the following steps: for each the bar record among the messaging list avimegList among the return information REPLY, if the destination node sequence number that should write down is identical with the sequence number that sends the return information node, then will write down article one record as this tabulation.
Current, to with DTN and ICN network in the Routing Protocol of comparative maturity, general standard is mostly based on the consideration of delivery rate or time-delay, between source node and destination node, choose the copy that a plurality of intermediate nodes are preserved message to be transmitted, do not consider to use the node geographical location information to reduce these redundant message.The present invention reduces the redundancy message method, can select suitable intermediate node effectively, reduces the quantity of redundancy message.Reduced node energy consumption effectively, prolonged working time of node, improved the effect of network performance and life cycle by the quantity that reduces redundancy message.
The present invention is based on the tabulation exchanging mechanism and realize, broken through current great majority and reduced the message dilivery rate, bring a large amount of extraneous informations exchanges and calculate the limitation of energy consumption at the research method that DTN and ICN network reduce message copy.Not only use the node geographical location information to select suitable intermediate node, guarantee that the minimizing of redundancy message can not reduce the delivery rate; Use detection information to carry node location tabulation simultaneously, bring the additional transmissions energy consumption and reduce computational complexity avoiding.
The present invention is developed by current Ad Hoc network internal standard Routing Protocol AODV, and in conjunction with the infectious disease routing algorithm in DTN and the ICN network, this advances in addition to its route criterion, and then has realized the minimizing of redundancy message.This mode that combines with the traditional standard Routing Protocol, make the present invention well keep many advantages of existing ripe Routing Protocol, need not simultaneously through change just can be by simple applications in existing network on a large scale, satisfactory for result, application prospect is good.
Description of drawings
Fig. 1 is the schematic diagram of basic boom principle of the present invention.
Fig. 2 is the basic sequential chart of node path finding process of the present invention.
Fig. 3 is the packet format figure of the routing information request (HELLO) that uses in the path finding process of the present invention.
Fig. 4 is the format chart of messaging list.
Fig. 5 is the format chart of node location tabulation.
Fig. 6 is the packet format figure of the route replies information (REPLY) used in the path finding process of the present invention.
Fig. 7 is the employed example topological diagram of the workflow of the embodiment of the invention.(a) be the network topological diagram of period 1; (b) be the network topological diagram of period 2; (c) be the network topological diagram of period 3; (d) be the network topological diagram of period 4.
Embodiment
For making purpose of the present invention, implementation and advantage more clear, the present invention is described in further detail below in conjunction with accompanying drawing.
Referring to Fig. 1, introduce the basic boom principle of the inventive method-utilize the node geographical location information to reduce the method for redundancy message.After node was received the node location tabulation of other node from physical layer and data link layer, the node location tabulation of this node being preserved in network layer was upgraded and is sent to other node by detection information and return information.Simultaneously, the positional information of other node of preserving according to node is screened neighbor node, only gives the approaching neighbours of which and target node position with forwards.By reducing the quantity of intermediate node, reduced the quantity of redundancy message, reduced the transmission of redundancy message effectively, saved the energy of node, improved the utilance of nodal cache device simultaneously.
The positional information of the node of preserving in the list of locations, can mature technique (for example GPS location) obtains by using a lot, for example, pass through GPS, can learn the coordinate (x of each node, y), the coordinate by three points uses basic triangulo operation just can obtain two angle theta between the position vector.
Referring to Fig. 2 to Fig. 6, introduce the method for utilizing the node geographical location information to reduce redundancy message on a kind of DTN of the present invention and the ICN network in detail, this method comprises following several stages:
(1) path finding: when the source node application program need send a message to destination node, application layer sent message to lower floor.When message arrived network layer, the query node neighbor table was in the hope of knowing that destination node is whether in communication context.If do not have destination node information in the neighbor list, then this message be temporary in the nodal cache device.Otherwise transmit this message immediately to destination node.The node of all buffer non-NULLs periodically sends detection information to survey the node of entry communication scope, utilizes exchange messages tabulation and the node location tabulation of this detection information with which message in definite buffer need exchange simultaneously.This basic sequential of seeking process is referring to Fig. 2.This process mainly comprises following step: send detection information HELLO, receive detection information HELLO, send return information REPLY.
(2) selection of intermediate node: when the detection information sending node is received a return information, utilize the node location tabulation of carrying in the return information that the node location tabulation of this node preservation is upgraded, according to the local node list of locations after upgrading the messaging list that comprises in the return information is upgraded then.This process mainly comprises following step: receive return information REPLY and upgrade node location tabulation, the messaging list that comprises in the return information is upgraded and sorts.
(3) data transmission: the node of receiving return information is according to corresponding message in the messaging list order transmit buffer that comprises in the return information after upgrading, and the MAC layer confirmation is received in inspection; And the message that will successfully be delivered to destination node is deleted from buffer.
Described part (1) path finding process mainly comprises following step:
(11) send route exploration information HELLO.When nodal cache device non-NULL, periodically broadcast route exploration information HELLO (the route exploration packets of information of expansion).Packet format is seen Fig. 3.Be characterized as HELLO information head and comprise megList field and PosList field, the form of megList tabulation is referring to Fig. 4, and the form of PosList tabulation is referring to Fig. 5.The megList field record sends the tabulation of all informations in the detection information nodal cache device.The PosList field record sends the node location tabulation that the detection information node is preserved.In addition, " the timing position " of the record of minute book node location is always zero in the PosList tabulation, and in this tabulation, other nodes records " timing position " per second increases by 1, periodically updates " node location " field.Described " timing position " is used for the time sequencing that arbitrary node and other node meet in the network.
(12) receive detection information HELLO.Intermediate node is received megList field and the PosList field of extracting behind the HELLO in the header packet information, obtains megList_S tabulation and PosList_S and tabulates.The messaging list megList_A that preserves according to this node upgrades megList_S, removes wherein with among the megList_A and writes down the part that repeats.Simultaneously, the node location tabulation PosList_A that this node is preserved according to PosList_S upgrades, and the position of part of nodes is revised, and the condition that the node location list records is upgraded is:
● the value of " sequence node number " equates with the value of " sequence node number " during PosList_A writes down in the PosList_S record; And
● the value of " timing position " is less than the value of " timing position " in the PosList_A record in the PosList_S record.
(13) send return information REPLY.Only receive in this method that the intermediate node of HELLO bag can reply REPLY information, the REPLY packet format is referring to Fig. 6.Comprise avimegList field and PosList field among the REPLY.AvimegList writes down the record among the megList_S after the above-mentioned renewal; PosList writes down the record among the above-mentioned PosList_A.
Described part (2) data transmission procedure mainly comprises following step:
(21) receive return information REPLY.The node that sends the HELLO bag is received avimegList field and the PosList field of extracting behind the REPLY in the header packet information, obtains avimegList tabulation and PosList_A and tabulates.The node location tabulation PosList_S that this node is preserved according to PosList_A upgrades, and the position of part of nodes is revised, and the condition that the list of locations record upgrades is:
● the value of " sequence node number " equates with the value of " sequence node number " during PosList_S writes down in the PosList_A record; And
● the value of " timing position " is less than the value of " timing position " in the PosList_S record in the PosList_A record.
(22) the node location tabulation PosList_S that preserves according to this node upgrades the messaging list avimegList that comprises in the return information, and the condition of a record is in the deletion messaging list:
● the value of " destination node sequence number " equates with the value of " sequence node number " during PosList_S writes down in the avimegList record; And
● by target node position (X_D, Y_D) this node position (X_S, Y_S) and (X_A, Y_A) this node that calculates and destination node and this node are spent greater than 45 with the angle theta between these two position vectors of transmission return information node in the neighbor node position.
In addition, to each the bar record in this messaging list,, then will write down article one record as this tabulation if the destination node sequence number that should write down is identical with the sequence number that sends the return information node.
Described part (3) further comprises following content of operation:
(31) after node sends to destination node with message, check the MAC layer confirmation of receiving.After the affirmation information of receiving transmission this time, show the successfully delivery of this message, this node is deleted this message from buffer.
Be example with Fig. 7 below, and, introduce the workflow of major part of the present invention-intermediate node selection course with reference to Fig. 2:
In topological network shown in Figure 7, suppose that node S need send message X to node D, wherein R represents the communication context of each node.Definition D (ij) is the distance between node i and the node j, and B (i) is the message in the node i, θ (x y) is the angle of vector x and vectorial y, and then following condition is satisfied:
a)Timeslot＝1：D(SA)<R，D(SB)>R，D(SC)>R，D(SD)>R；B(S)＝X，B(A)＝NULL，B(B)＝NULL，B(C)＝NULL，B(D)＝NULL；θ(SA，SD)<45
b)Timeslot＝2：D(SA)>R，D(SB)<R，D(CD)<R；B(S)＝X，B(A)＝X，B(B)＝NULL，B(C)＝NULL，B(D)＝NULL；θ(SB，SD)>45
c)Timeslot＝3：D(AB)<R，D(AC)<R，D(DB)>R，D(SC)>R；B(S)＝X，B(A)＝X，B(B)＝NULL，B(C)＝NULL，B(D)＝NULL；θ(AB，AD)>45，θ(AC，AD)<45
d)Timeslot＝4：D(AB)<R，D(SC)<R，D(DB)>R，D(SA)>R；B(S)＝X，B(A)＝X，B(B)＝NULL，B(C)＝X，B(D)＝NULL；
(1) node S need send message X to node D, as shown in Figure 7: in 1 time of Timeslot (period), node A is in the transmission range of S, and D does not exist; Then S is to its neighbor node A broadcasting routing information request bag HELLO.After node A received this bag, echo reply information REPLY also agreed to receive message X.Node S receives that calculating SA behind the REPLY spends less than 45 with the angle of SD, therefore, the copy of message X is sent to node A.
(2) in 2 times of Timeslot (period), along with moving of node, Node B enters the communication context of node S; Simultaneously, Node B enters the communication context of node S.S is to B broadcasting routing information request bag HELLO.After Node B was received this bag, echo reply information REPLY also agreed to receive message X.Node S receives the angle that calculates SB and SD behind the REPLY greater than 45 degree, and therefore, refusal sends to Node B with message X.Simultaneously, node C obtains node D in 2 o'clock positional information of Timeslot (period).
(3) in 3 times of Timeslot (period), along with moving of node, node A enters the communication context of node C, and Node B also enters the communication context of node A simultaneously.At this moment, node A broadcasting HELLO bag.Node B and the equal echo reply information of node C REPLY, and agree to receive message X.After node A received REPLY, at first more the geographical location information of new node D calculated the angle of AB and AD and the angle of AC and AD then respectively.Because the angle of AB and AD is greater than 45 degree, and the angle of AC and AD is spent less than 45, so node A sends to node C with the copy of message X, and can not send to Node B.
(4) in 4 times of Timeslot (period), along with moving of node, node C enters the communication context of node D, and node C sends to node D with message X, finishes the delivery of message X, and message X is deleted from this nodal cache device.
Claims (2)
1. one kind is reduced Delay Tolerant Network and the method that intermittently is connected redundancy message in the network, it is characterized in that: comprise following part:
(1) source node query node neighbor table if having destination node information in the neighbor list, is then transmitted this message to destination node, otherwise this message is temporary in the nodal cache device; The node of all buffer non-NULLs periodically sends detection information, utilize detection information to exchange messages mutually between the node of communication and tabulate and the node location tabulation, to determine which message need exchange in the buffer, wherein, follow these steps to carry out the transmission of detection information and mutual:
(11) node of buffer non-NULL sends route exploration information HELLO, this information head comprises megList field and PosList field, the megList field record sends the tabulation of all informations in the detection information nodal cache device, and the PosList field record sends the node location tabulation that the detection information node is preserved;
(12) intermediate node is received megList field and the PosList field of extracting behind the HELLO in the header packet information, obtain megList_S tabulation and PosList_S tabulation, simultaneously, the node location tabulation PosList_A that this node is preserved according to PosList_S upgrades, and according to the messaging list megList_A that this node is preserved megList_S is upgraded, remove wherein with megList_A in the part that repeats of record;
(13) receive the intermediate node return information REPLY that HELLO wraps, comprise avimegList field and PosList field in this information, record among the megList_S after the above-mentioned renewal of avimegList field record, the record among the above-mentioned PosList_A of PosList field record;
(2) when the detection information sending node is received a return information, utilize the node location tabulation of carrying in the return information that the node location tabulation of this node preservation is upgraded, according to the local node list of locations after upgrading the messaging list that comprises in the return information is upgraded then, its concrete steps are as follows:
(21) after the node of transmission detection information HELLO is received a return information REPLY, extract avimegList field and PosList field in the header packet information, obtain avimegList tabulation and PosList_A tabulation, the node location tabulation PosList_S that this node is preserved according to PosList_A upgrades, position to part of nodes is revised, and the condition that the list of locations record upgrades is:
● the value of " sequence node number " equates with the value of " sequence node number " during PosList_S writes down in the PosList_A record; And
● the value of " timing position " is less than the value of " timing position " in the PosList_S record in the PosList_A record, and described " timing position " is used for the time sequencing that arbitrary node and other node meet in the network;
(22) the node location tabulation PosList_S that preserves according to this node upgrades the messaging list avimegList that comprises among the return information REPLY, and the condition of a record is in the deletion messaging list:
● the value of " destination node sequence number " equates with the value of " sequence node number " during PosList_S writes down in the avimegList record; And
● by target node position (X_D, Y_D), this node position (X_S, Y_S) and neighbor node position (X_A, Y_A) this node that calculates and destination node and this node and send angle theta between these two position vectors of return information node greater than setting 45 ° of angle values;
(3) receive that the node of return information is according to upgrading corresponding message in the messaging list order transmit buffer that comprises in the return information of back, check whether receive the MAC layer confirmation, and the message that successfully be delivered to destination node is deleted from buffer.
2. minimizing Delay Tolerant Network according to claim 1 and the method that intermittently is connected redundancy message in the network, it is characterized in that, step (22) afterwards, also comprise the following steps: for each the bar record among the messaging list avimegList among the return information REPLY, if the destination node sequence number that should write down is identical with the sequence number that sends the return information node, then will write down article one record as this tabulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101537210A CN101414964B (en) | 2008-12-04 | 2008-12-04 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101537210A CN101414964B (en) | 2008-12-04 | 2008-12-04 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101414964A CN101414964A (en) | 2009-04-22 |
| CN101414964B true CN101414964B (en) | 2011-03-30 |
Family
ID=40595287
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101537210A Expired - Fee Related CN101414964B (en) | 2008-12-04 | 2008-12-04 | Method for reducing redundant message of delay-tolerant network and intermittently-connected network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101414964B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014018782A2 (en) * | 2012-07-26 | 2014-01-30 | Qualcomm Incorporated | Delay-tolerant web transaction delegations |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006237B (en) * | 2010-12-13 | 2012-03-07 | 西安电子科技大学 | Routing decision method for delay tolerant network |
| CN102291319B (en) * | 2011-09-25 | 2013-11-06 | 北京理工大学 | Design method of delay tolerant network system structure based on content naming |
| CN102316546B (en) * | 2011-10-02 | 2015-02-18 | 西安电子科技大学 | Multipath routing method based on communication sequence |
| CN102594698A (en) * | 2012-03-12 | 2012-07-18 | 中国人民解放军总参谋部第六十三研究所 | DTN asynchronous routing algorithm based on node position projection |
| WO2017214806A1 (en) * | 2016-06-13 | 2017-12-21 | 深圳天珑无线科技有限公司 | Distributed network message returning method and node |
| CN107911799B (en) * | 2017-05-18 | 2021-03-23 | 北京聚通达科技股份有限公司 | Method for utilizing intelligent route |
| CN108494689B (en) * | 2018-03-20 | 2021-11-12 | 深圳友讯达科技股份有限公司 | Information acquisition method, device and communication system |
| CN109873798B (en) * | 2018-08-03 | 2021-04-13 | 中国有色金属长沙勘察设计研究院有限公司 | Data transmission method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794732A (en) * | 2005-12-26 | 2006-06-28 | 北京交通大学 | IPv6 micro sensing routing appliance protocol stack system structure and implementing method |
| CN101184037A (en) * | 2007-10-31 | 2008-05-21 | 北京航空航天大学 | Probability effective broadcast coefficient based flooding method |
-
2008
- 2008-12-04 CN CN2008101537210A patent/CN101414964B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794732A (en) * | 2005-12-26 | 2006-06-28 | 北京交通大学 | IPv6 micro sensing routing appliance protocol stack system structure and implementing method |
| CN101184037A (en) * | 2007-10-31 | 2008-05-21 | 北京航空航天大学 | Probability effective broadcast coefficient based flooding method |
Non-Patent Citations (1)
| Title |
|---|
| JP特开2007-310460A 2007.11.29 |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014018782A2 (en) * | 2012-07-26 | 2014-01-30 | Qualcomm Incorporated | Delay-tolerant web transaction delegations |
| WO2014018782A3 (en) * | 2012-07-26 | 2014-09-25 | Qualcomm Incorporated | Delay-tolerant web transaction delegations |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101414964A (en) | 2009-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101414964B (en) | Method for reducing redundant message of delay-tolerant network and intermittently-connected network | |
| CN101414965B (en) | Method for saving node energy of delay-tolerant network and intermittently-connected network | |
| US7916666B2 (en) | Reliable broadcast protocol and apparatus for sensor networks | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| US8774051B2 (en) | Path notification | |
| CN103052130B (en) | A kind of wireless multimedia sensor network data fusion method based on rough set | |
| US8811357B2 (en) | Method and apparatus for transferring information on station in wireless mesh network | |
| CN102916889A (en) | Instant route selection based on multi-path communication time and credibility in VANET (Vehicular Ad-Hoc Network) | |
| Huang et al. | Spray and wait routing based on position prediction in opportunistic networks | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| CN109041010B (en) | Vehicle-mounted delay tolerant network data forwarding method based on half-naive Bayes classifier | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN103095572A (en) | Route maintenance method of multiple mobile sink wireless sensor networks (MMS-WSNs) | |
| CN101364945A (en) | Method for realizing unicast energy-saving routing protocol based on cross-layer mechanism on Ad Hoc network | |
| CN101431784A (en) | Optimized data transmission method based on geographical position in vehicle-mounted network | |
| CN101695179A (en) | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability | |
| CN109511151A (en) | The network-building method and communication means of star networking | |
| CN103036783B (en) | A kind of based on DTN deep space sensor network multi-path method for routing | |
| CN101674220A (en) | Forwarding history-based asynchronous rooting algorithm | |
| Peng et al. | Tbm: An efficient trajectory-based multicast routing protocol for sparse UAV networks | |
| CN107995114B (en) | Routing method of delay tolerant network based on density clustering | |
| Cheng et al. | An adaptive cluster-based routing mechanism for energy conservation in mobile ad hoc networks | |
| Yang et al. | A review of UAV ferry algorithms in delay tolerant network | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Kim et al. | A priority forwarding technique for efficient and fast flooding in wireless ad hoc networks |
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: 20110330 Termination date: 20111204 |