CN103079251B - The method and system of data collision are avoided in wireless sense network - Google Patents
The method and system of data collision are avoided in wireless sense network Download PDFInfo
- Publication number
- CN103079251B CN103079251B CN201310040874.5A CN201310040874A CN103079251B CN 103079251 B CN103079251 B CN 103079251B CN 201310040874 A CN201310040874 A CN 201310040874A CN 103079251 B CN103079251 B CN 103079251B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- concealed nodes
- routing
- msg
- 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.)
- Active
Links
Abstract
The present invention proposes the method and system avoiding data collision in a kind of wireless sense network.Wherein, method comprises the following steps: set up routing table to all routing nodes of wireless transmission net; The neighbor table of each routing node is obtained according to routing table; To obtain on data transfer path the routing node set of process; In routing node set, the concealed nodes of sending node is obtained according to neighbor table; Judge the state of concealed nodes; If concealed nodes is transmission state, then latency hiding node send data after sending node carry out data transmission; And if concealed nodes is in idle condition, then sending node carries out data transmission immediately.According to the method for the embodiment of the present invention, by sending to the data of concealed nodes the collision problem controlling to efficiently avoid in data transmission procedure, improve data transmission credibility and efficiency simultaneously.
Description
Technical field
The present invention relates to the technical field of data transmission of wireless transmission net, particularly in a kind of wireless sense network, avoid the method and system of data collision.
Background technology
Wireless sensor network WSN (Wireless Sensor Network) is a kind of network be made up of sensor node, can monitor in real time, various information that perception and acquisition node dispose the perceptive object in district.Node is formed network with self-organizing form, by multi-hop relay mode, detection data is passed to aggregation node.But, be carry out transfer of data in a multi-hop fashion just because of wireless sense network, cause the existence of concealed nodes in wireless sensor network, also result in the collision of packet simultaneously, reduce transmission reliability and efficiency of transmission.
Summary of the invention
Object of the present invention is intended at least solve one of above-mentioned technological deficiency.
For achieving the above object, the embodiment of one aspect of the present invention proposes a kind of method avoiding data collision in wireless sense network, comprises the following steps: S1: set up routing table to all routing nodes of wireless transmission net; S2: the neighbor table obtaining each routing node according to described routing table; S3: to obtain on data transfer path the routing node set of process; S4: the concealed nodes obtaining sending node according to described neighbor table in described routing node set; S5: the state judging described concealed nodes; S6: if described concealed nodes is transmission state, then wait for described concealed nodes send data after described sending node carry out data transmission; And S7: if described concealed nodes is in idle condition, then described sending node carries out data transmission immediately.
According to the method for the embodiment of the present invention, by sending to the data of concealed nodes the collision problem controlling to efficiently avoid in data transmission procedure, improve data transmission credibility and efficiency simultaneously.
In an example of the present invention, the neighbor table of described each routing node comprises the nodal information of the routing node carrying out communication with it.
In an example of the present invention, in the nodal information in described neighbor table, comprise the data transmitting time of concealed nodes.
In an example of the present invention, the data transmitting time T of described concealed nodes
s, drawn by following formulae discovery, T
s=Q* (N+1) * (t
mSG+t
aCK), wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.
In an example of the present invention, described node sends the time t that a message consumes
mSG, drawn by following formulae discovery, t
mSG=(L
mSG+ L
hEAD+ L
fOOT)/V, wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.
For achieving the above object, embodiments of the invention propose the system avoiding data collision in a kind of wireless sense network on the other hand, comprising: set up module, for setting up routing table to all routing nodes of wireless transmission net; First acquisition module, for obtaining the neighbor table of each routing node according to described routing table; Second acquisition module, for obtain on data transfer path the routing node set of process; Search module, for obtaining the concealed nodes of sending node in described routing node set according to described neighbor table; Judge module, for judging whether described concealed nodes sends state for data; Wait for module, for waiting for that described concealed nodes sends data; And sending module, for described sending node is carried out data transmission immediately.
According to the system of the embodiment of the present invention, by sending to the data of concealed nodes the collision problem controlling to efficiently avoid in data transmission procedure, improve data transmission credibility and efficiency simultaneously.
In an example of the present invention, the neighbor table of described each routing node comprises the nodal information of the routing node carrying out communication with it.
In an example of the present invention, in the nodal information in described neighbor table, comprise the data transmitting time of concealed nodes.
In an example of the present invention, the data transmitting time T of described concealed nodes
s, drawn by following formulae discovery, T
s=Q* (N+1) * (t
mSG+ t
aCK), wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.
In an example of the present invention, described node sends the time t that a message consumes
mSG, drawn by following formulae discovery, t
mSG=(L
mSG+ L
hEAD+ L
fOOT)/V, wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.
The aspect that the present invention adds and advantage will part provide in the following description, and part will become obvious from the following description, or be recognized by practice of the present invention.
Accompanying drawing explanation
The present invention above-mentioned and/or additional aspect and advantage will become obvious and easy understand from the following description of the accompanying drawings of embodiments, wherein:
Fig. 1 is the flow chart avoiding the method for data collision according to an embodiment of the invention in wireless sense network;
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention;
Fig. 3 is that data send schematic diagram according to an embodiment of the invention;
Fig. 4 is transfer of data schematic diagram according to an embodiment of the invention; And
Fig. 5 is the frame diagram avoiding the system of data collision according to an embodiment of the invention in wireless sense network.
Embodiment
Be described below in detail embodiments of the invention, the example of embodiment is shown in the drawings, and wherein same or similar label represents same or similar element or has element that is identical or similar functions from start to finish.Being exemplary below by the embodiment be described with reference to the drawings, only for explaining the present invention, and can not limitation of the present invention being interpreted as.
Fig. 1 is the flow chart avoiding the method for data collision according to an embodiment of the invention in wireless sense network.As shown in Figure 1, according to the method avoiding data collision in the wireless sense network of the embodiment of the present invention, comprise the following steps:
Step S101, sets up routing table to all routing nodes of wireless transmission net.
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention.As shown in Figure 2, in three nodes A, B, C, A and B, B and C can intercom respectively mutually, and node A can not communicate with node C.So just cause the concealed nodes that node A is node C, same node C is also node A concealed nodes.When carrying out transfer of data, node A and node C perception less than the existence of the other side, then, when the two carries out transfer of data simultaneously, will cause the collision of data.
Step S102, obtains the neighbor table of each routing node according to routing table.
In one embodiment of the invention, the neighbor table of each routing node comprises the nodal information of the routing node carrying out communication with it, and comprises the data transmitting time of concealed nodes in nodal information in this neighbor table.
Step S103, to obtain on data transfer path the routing node set of process.
In one embodiment of the invention, obtain to the target transmitted according to routing table and data transfer of data the set of routing node of process.
Step S104, obtains the concealed nodes of sending node in routing node set according to neighbor table.
Fig. 3 is that data send schematic diagram according to an embodiment of the invention.As shown in Figure 3, suppose that route direction is A->B->C->D, and only have B in the neighbor table of A, have A, C, D in the neighbor table of B, in the neighbor table of C, have B, D, in the neighbor table of D, have B, C.Due to Route establishment mechanism, although B and D can communicate, the father node of B still have selected C, instead of D.The father node of C is D.Thus, just cause C and D to be all concealed nodes of A.
Step S105, judges the state of concealed nodes.This state is whether the concealed nodes on data transfer path is in data transmission state.
Step S106, if concealed nodes is transmission state, then latency hiding node send data after sending node carry out data transmission.
Particularly, node A has obtained neighbor table C, the D of B as shown in Figure 3; And the route of A is A->B->C->D-Gre atT.GreaT.GT.By more known, C, D are on the path that it has to pass through, if then A will transmit next packet, and must latency hiding node C and D end of transmission.(2) B is transferred to C, and in like manner B also has the neighbor table of C and the routing table of B, then B also must carry out time delay wait.(3) determination of time.
Step S107, if concealed nodes is in idle condition, then sending node carries out data transmission immediately.The data received forward by each data reception node by the way, reach destination until will send data to.
In one embodiment of the invention, a packet is sent to the other side and receives elapsed time approximately: t=t
mSG+ t
aCK.As shown in Figure 4, if need collision free, then A must wait until that all points that can collide with its generation are sent, and could send next packet, this time is T=3t in the diagram, because D also can impact A.It can thus be appreciated that, when a node need send packet time, it need check in the neighbor table of its child node, which node must through path on, suppose that quantity is N, then after it distributes a packet, at least time delay T=(N+1) * (t
mSG+ t
aCK).And t
mSGthe length of a speed V and complete packet that can send according to node is estimated, t
mSG=(L
mSG+ L
hEAD+ L
fOOT)/V, wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.General message part and portion are fixed values, calculate than being easier to, and head part, the bytes such as lead code (preamble) and synchronization character be comprised, be only the header of real wireless transmission like this.In like manner, t can be calculated
aCK=L
aCK/ V, wherein, L
aCKrepresent the length of ACK message.Because the above-mentioned data transmitting time calculated is the time of omiting at the beginning of one, therefore undertaken adjusting the data transmitting time T obtaining final concealed nodes by Dynamic gene Q
s, T
s=Q* (N+1) * (t
mSG+ t
aCK), wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.Such success rate is higher, and Q is less; Otherwise, increase Q, time expand.
According to the method for the embodiment of the present invention, by sending to the data of concealed nodes the collision problem controlling to efficiently avoid in data transmission procedure, improve data transmission credibility and efficiency simultaneously.
Fig. 5 is the frame diagram avoiding the system of data collision according to an embodiment of the invention in wireless sense network.As shown in Figure 5, setting up module 100, first acquisition module 200, second acquisition module 300 according to avoiding the system of data collision to comprise in the wireless sense network of the embodiment of the present invention, searching module 400, judge module 500, wait for module 600 and sending module 700.
Set up module 100 for setting up routing table to all routing nodes of wireless transmission net.
Fig. 2 is the schematic diagram of concealed nodes according to an embodiment of the invention.As shown in Figure 2, in three nodes A, B, C, A and B, B and C can intercom respectively mutually, and node A can not communicate with node C.So just cause the concealed nodes that node A is node C, same node C is also node A concealed nodes.When carrying out transfer of data, node A and node C perception less than the existence of the other side, then, when the two carries out transfer of data simultaneously, will cause the collision of data.
First acquisition module 200 is for obtaining the neighbor table of each routing node according to routing table.
In one embodiment of the invention, the neighbor table of each routing node comprises the nodal information of the routing node carrying out communication with it, and comprises the data transmitting time of concealed nodes in nodal information in this neighbor table.
Second acquisition module 300 for obtain on data transfer path the routing node set of process.In one embodiment of the invention, obtain to the target transmitted according to routing table and data transfer of data the set of routing node of process.
Search module 400 for obtaining the concealed nodes of sending node in routing node set according to neighbor table.
Fig. 3 is that data send schematic diagram according to an embodiment of the invention.As shown in Figure 3, suppose that route direction is A->B->C->D, and only have B in the neighbor table of A, have A, C, D in the neighbor table of B, in the neighbor table of C, have B, D, in the neighbor table of D, have B, C.Due to Route establishment mechanism, although B and D can communicate, the father node of B still have selected C, instead of D.The father node of C is D.Thus, just cause C and D to be all concealed nodes of A.
Judge module 500 is for judging whether concealed nodes sends state for data.This state is whether the concealed nodes on data transfer path is in data transmission state.
Wait for that module 600 sends data for latency hiding node.
Particularly, node A has obtained neighbor table C, the D of B as shown in Figure 3; And the route of A is A->B->C->D-Gre atT.GreaT.GT.By more known, C, D are on the path that it has to pass through, if then A will transmit next packet, and must latency hiding node C and D end of transmission.(2) B is transferred to C, and in like manner B also has the neighbor table of C and the routing table of B, then B also must carry out time delay wait.(3) determination of time.
Sending module 700 is for carrying out data transmission immediately by sending node.The data received forward by each data reception node by the way, reach destination until will send data to.
In one embodiment of the invention, a packet is sent to the other side and receives elapsed time approximately: t=t
mSG+ t
aCK.As shown in Figure 4, if need collision free, then A must wait until that all points that can collide with its generation are sent, and could send next packet, this time is T=3t in the diagram, because D also can impact A.It can thus be appreciated that, when a node need send packet time, it need check in the neighbor table of its child node, which node must through path on, suppose that quantity is N, then after it distributes a packet, at least time delay T=(N+1) * (t
mSG+ t
aCK).And t
mSGthe length of a speed V and complete packet that can send according to node is estimated, t
mSG=(L
mSG+ L
hEAD+ L
fOOT)/V, wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.General message part and portion are fixed values, calculate than being easier to, and head part, the bytes such as lead code (preamble) and synchronization character be comprised, be only the header of real wireless transmission like this.In like manner, t can be calculated
aCK=L
aCK/ V, wherein, L
aCKrepresent the length of ACK message.Because the above-mentioned data transmitting time calculated is the time of omiting at the beginning of one, therefore undertaken adjusting the data transmitting time T obtaining final concealed nodes by Dynamic gene Q
s, T
s=Q* (N+1) * (t
mSG+ t
aCK), wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.Such success rate is higher, and Q is less; Otherwise, increase Q, time expand.
According to the system of the embodiment of the present invention, by sending to the data of concealed nodes the collision problem controlling to efficiently avoid in data transmission procedure, improve data transmission credibility and efficiency simultaneously.
Although illustrate and describe embodiments of the invention above, be understandable that, above-described embodiment is exemplary, can not be interpreted as limitation of the present invention, those of ordinary skill in the art can change above-described embodiment within the scope of the invention when not departing from principle of the present invention and aim, revising, replacing and modification.
Claims (10)
1. avoid a method for data collision in wireless sense network, it is characterized in that, comprise the following steps:
S1: routing table is set up to all routing nodes of wireless transmission net;
S2: the neighbor table obtaining each routing node according to described routing table;
S3: to obtain on data transfer path the routing node set of process;
S4: the concealed nodes obtaining sending node according to described neighbor table in described routing node set;
S5: the state judging described concealed nodes;
S6: if described concealed nodes is transmission state, then wait for described concealed nodes send data after described sending node carry out data transmission; And
S7: if described concealed nodes is in idle condition, then described sending node carries out data transmission immediately.
2. avoid the method for data collision in wireless sense network according to claim 1, it is characterized in that, the neighbor table of described each routing node comprises the nodal information of the routing node carrying out communication with it.
3. avoid the method for data collision in wireless sense network according to claim 1 and 2, it is characterized in that, in the nodal information in described neighbor table, comprise the data transmitting time of concealed nodes.
4. avoid the method for data collision in wireless sense network according to claim 3, it is characterized in that, the data transmitting time T of described concealed nodes
s, drawn by following formulae discovery,
T
S＝Q*(N+1)*(t
MSG+t
ACK)，
Wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.
5. avoid the method for data collision in wireless sense network according to claim 4, it is characterized in that, described node sends the time t that a message consumes
mSG, drawn by following formulae discovery,
t
MSG＝(L
MSG+L
HEAD+L
FOOT)/V，
Wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.
6. avoid a system for data collision in wireless sense network, it is characterized in that, comprising:
Set up module, for setting up routing table to all routing nodes of wireless transmission net;
First acquisition module, for obtaining the neighbor table of each routing node according to described routing table;
Second acquisition module, for obtain on data transfer path the routing node set of process;
Search module, for obtaining the concealed nodes of sending node in described routing node set according to described neighbor table;
Judge module, for judging whether described concealed nodes is in data and sends state;
Wait for module, for waiting for that described concealed nodes sends data; And
Sending module, for described sending node is carried out data transmission immediately,
When described judge module judges that described concealed nodes is transmission state, described wait module waits for that described concealed nodes sends data, when described judge module judges that described concealed nodes is idle condition, described sending module makes described sending node carry out data transmission immediately.
7. avoid the system of data collision in wireless sense network according to claim 6, it is characterized in that, the neighbor table of described each routing node comprises the nodal information of the routing node carrying out communication with it.
8. avoid the system of data collision in the wireless sense network according to claim 6 or 7, it is characterized in that, in the nodal information in described neighbor table, comprise the data transmitting time of concealed nodes.
9. avoid the system of data collision in wireless sense network according to claim 6, it is characterized in that, the data transmitting time T of described concealed nodes
s, drawn by following formulae discovery,
T
S＝Q*(N+1)*(t
MSG+t
ACK)，
Wherein, T
srepresent the data transmitting time of concealed nodes, Q represents that scheduling factor is specially the inverse of Packet Generation success rate, and N represents natural number, t
mSGexpression node sends the time that a message consumes, t
aCKrepresent the time sending ACK message and consume.
10. avoid the system of data collision in wireless sense network according to claim 9, it is characterized in that, described node sends the time t that a message consumes
mSG, drawn by following formulae discovery,
t
MSG＝(L
MSG+L
HEAD+L
FOOT)/V，
Wherein, L
mSGrepresent message part length, L
hEADrepresent head part length, L
fOOTrepresent the length of portion, V represents that node sends the speed of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310040874.5A CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310040874.5A CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103079251A CN103079251A (en) | 2013-05-01 |
| CN103079251B true CN103079251B (en) | 2015-10-28 |
Family
ID=48155632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310040874.5A Active CN103079251B (en) | 2013-01-31 | 2013-01-31 | The method and system of data collision are avoided in wireless sense network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103079251B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104980255B (en) * | 2015-06-12 | 2018-07-24 | 厦门大学 | A kind of method that physical-layer network coding packet synchronizes |
| CN108632795A (en) * | 2018-04-10 | 2018-10-09 | 华南理工大学 | A kind of wireless sense network concealed nodes conflict dissemination method |
| CN115002019A (en) * | 2022-06-22 | 2022-09-02 | 中国电信股份有限公司 | Hidden node determination method and device, nonvolatile storage medium and electronic equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN102571675A (en) * | 2012-02-07 | 2012-07-11 | 广州市香港科大霍英东研究院 | Method for optimizing hidden terminal based on physical layer interference information |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004102888A1 (en) * | 2003-05-15 | 2004-11-25 | Mitsubishi Denki Kabushiki Kaisha | Communication method, radio terminal and base station |
-
2013
- 2013-01-31 CN CN201310040874.5A patent/CN103079251B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101197826A (en) * | 2007-11-30 | 2008-06-11 | 华南理工大学 | Method for solving problems of multi-jumping wireless self-network grouping concealed terminal and exposed terminal |
| CN102571675A (en) * | 2012-02-07 | 2012-07-11 | 广州市香港科大霍英东研究院 | Method for optimizing hidden terminal based on physical layer interference information |
Non-Patent Citations (2)
| Title |
|---|
| Enhancement of Packetised-Preamble Based MAC Protocols: A Solution to Hidden-Node Problem in WSNs;Sabrieh Choobkar,et.al.;《2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications》;20110914;第192-196页 * |
| 无线Ad Hoc网络中MAC协议改进策略的研究;张伟 等;《合肥工业大学学报(自然科学版)》;20080630;第875-879页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103079251A (en) | 2013-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102761931B (en) | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network | |
| US20070233835A1 (en) | Methodology for scheduling data transfers from nodes using path information | |
| US8203981B2 (en) | Wireless sensor network with linear structure being capable of bidirectional communication and method thereof | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| JP4535380B2 (en) | Data transmission method in wireless sensor network | |
| JP2009260911A5 (en) | ||
| US8411648B2 (en) | Double linked wireless sensor network being capable of bidirectional communication and method thereof | |
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| CN106358276B (en) | Communication means based on ID packet | |
| CN102065575A (en) | Method for constructing mesh and star hybrid topological wireless sensor network based on IEEE 802.15.4 | |
| CN103476086A (en) | Dynamic multi-path AODV routing method based on node congestion degree prediction | |
| CN103079251B (en) | The method and system of data collision are avoided in wireless sense network | |
| CN101969406A (en) | Multi-constraint QoS (Quality of Service) routing method based on selective detection | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| WO2013042209A1 (en) | Data transfer method and node device employing same | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| US8300756B2 (en) | Intermittent operative communication apparatus adaptively controlling the timing of waiting data reception and a method therefor | |
| CN105050077B (en) | A kind of sub-clustering chain type wireless sensing network data transmission method | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| Mank et al. | An adaptive TDMA based MAC protocol for mobile wireless sensor networks | |
| CN103619045A (en) | Route establishing method and system of low-consumption lossy network | |
| CN104703296A (en) | Link dormancy method for wireless communication multi-hop network link and tree topology structure | |
| CN104378798A (en) | Optimized distributed collaborative routing method based on Internet of Things | |
| CN105227457B (en) | Towards the protocol Data Unit cross-layer optimizing method under DTN dynamic links |
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 |