CN104244423A - Wireless sensor network based multi-path transmission time slot scheduling algorithm - Google Patents
Wireless sensor network based multi-path transmission time slot scheduling algorithm Download PDFInfo
- Publication number
- CN104244423A CN104244423A CN201410519888.XA CN201410519888A CN104244423A CN 104244423 A CN104244423 A CN 104244423A CN 201410519888 A CN201410519888 A CN 201410519888A CN 104244423 A CN104244423 A CN 104244423A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- entry
- path
- time slot
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 claims abstract description 16
- 238000010586 diagram Methods 0.000 claims description 26
- 238000000034 method Methods 0.000 claims description 11
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 239000002699 waste material Substances 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 230000009191 jumping Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless sensor network based multi-path transmission time slot scheduling algorithm. The wireless sensor network based multi-path transmission time slot scheduling algorithm includes: for primary network communication, generating a corresponding routing map Gg (Vg, Eg) according to network topology G, and setting a topological tree T according to the routing map, wherein each node in the topological tree includes one entry; traversing the topological tree T from a root node of the topological tree to generate a routing tree Ts; traversing the routing tree Ts to calculate and store layer numbers for each entry; optimizing the routing tree Ts to obtain an optimized routing tree To; traversing the routing tree To for time slot allocation; performing limited time slot scheduling if scheduling time slots are limited. According to the scheme, non-conflicted links in different routes are scheduled in a same time slot, and optimal scheduling of time slots is realized through virtual sharing of the same time slot by the non-conflicted links. Timeliness and validity in time slot scheduling are guaranteed while the problem of interference in transmission is avoided.
Description
Technical field
The present invention relates to field of wireless communication, particularly relate to the timeslot scheduling algorithm based on wireless sensor network multi-path transmission.
Background technology
WSNs (Wireless Sensor Networks, wireless sensor network) be the important component part of computer network, be made up of the microsensor node of a large amount of low costs, low-power consumption, formed the self-organizing network of a multi-hop by communication.Terminal node is responsible for the object information (as: temperature, humidity, light intensity etc.) gathering physical world, then convergence is sent to server.
TDMA (Time Division Multiple Access, time division multiple access) agreement is the technical protocol that in wireless sensor network, access control layer is important, and time slot allocation plays vital effect in TDMA agreement.The distribution of time slot determines the order transmitted in multihop network, and this will directly affect the time delay of transfer of data.Meanwhile, the transmission of multipath makes timeslot scheduling problem become more complicated, for every paths distributes the waste that corresponding time interval resource can cause the communication resource, has a strong impact on the time delay of transfer of data.
Therefore, need to provide a kind of timeslot scheduling method, to overcome communication resource waste in prior art, the problem of data transmission delay.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of timeslot scheduling algorithm being applicable to the wireless sensor network multi-path transmission of centralized management, for the multi-path transmission mechanism based on TDMA access protocal and network layer of centralized management, real-time time slot Optimization scheduling algorithm is proposed, thus saving Internet resources, improve the real-time of Internet Transmission.
For solving the problems of the technologies described above, the present invention adopts following technical proposals.
Based on the timeslot scheduling algorithm of wireless sensor network multi-path transmission, the method comprises:
For wireless sensor network G (V, E), node in network is by destination node (being generally gateway), add network gradually, each new node is chosen one or more node and is added network as oneself father node, thus ensure the redundancy of data transfer path, the support of multi-path transmission is provided.Sensor selection problem has added the neighbor node of routing diagram as father node, and the number of father node can be one or more.The selection of father node can be carried out in conjunction with practical communication demand and link circuit condition, such as, select according to the parameter such as jumping figure, link reliability.For multi-path transmission, in actual transmissions process, packet actual transmissions only can adopt a paths, and the link in different paths can not produce transmission collision.Therefore, according to link transmission order, the link that do not conflict in different path can share same time slot, in transmitting procedure, also can not produce link conflict.The step of the method comprises:
The first step, the routing diagram G in Network Based
g(V
g, E
g), first a topological tree T is set up, wherein each tree node comprises an entry, and this entry is by Level, Lchild, Ldata, Rdata and Rchild forms, and wherein Lchild points to left child node, and Ldata records the node number of this node, Rchild points to right child node, and Rdata records the node number of this node.In topological tree, it is identical with Rdata that Level is defaulted as 0, Ldata acquiescence.
Second step, travels through whole topological tree, travels through first child node from root node.In ergodic process, if tree dry contact has other child node, then the Rdata being pointed to node changes this trunk node into, and Rchild points to other child nodes, thus obtains path tree T
s.
3rd step, traverse path tree T
s, store the number of plies for each node calculate.
4th step, path optimizing is set, from the entry that the number of plies is the highest, travel through every one deck, search for each entry, if the entry that the number of plies is low follows Ldata with Rdata of the entry that the number of plies is high identical, then this entry can be placed in the identical one deck of the entry high with the number of plies, thus obtains path optimizing tree T
o.
5th step, traverse tree T
ofrom the entry that the number of plies is low, the entry for the identical number of plies distributes same time slot; In same time slot, receiving node is the Ldata in entry, and corresponding sending node is for pointing to this destination node; In same time slot, transmission and reception limit not having number.
6th step, the timeslot scheduling that time slot is limited.If this transmitting and scheduling can number of time slot be limited, the number of plies so higher than timeslot number will be cut out, and obtains limited path tree T
m.Then from the entry traverse tree T that the number of plies is high
mif this entry is leaf node and Ldata is not destination node, then this entry will be deleted.
Beneficial effect of the present invention is as follows:
Technical scheme of the present invention adopts centralized managerial structure, based on the figure routing plan supporting multipath, by setting up and successive optimization path tree, thus obtain corresponding timeslot scheduling scheme, improve the utilance of Internet resources, multi-path transmission is provided support simultaneously.
Accompanying drawing explanation
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described in further detail;
Fig. 1 illustrates the schematic diagram of time slot allocation in prior art;
Fig. 2 illustrates the schematic diagram of network topology in the embodiment of the present invention;
Fig. 3 illustrates the schematic diagram based on the figure route of this network topology in the embodiment of the present invention;
Fig. 4 illustrates path tree T schematic diagram in the embodiment of the present invention;
Fig. 5 illustrates path tree T in the embodiment of the present invention
sschematic diagram;
Fig. 6 illustrates in the embodiment of the present invention path tree T with the number of plies
sschematic diagram;
Fig. 7 illustrates path optimizing tree T in the embodiment of the present invention
oschematic diagram;
Fig. 8 illustrate dispatching algorithm in the embodiment of the present invention optimize after schematic diagram;
Fig. 9 illustrates the limited path tree T described in the embodiment of the present invention
mschematic diagram;
Figure 10 illustrates the schematic diagram of the timeslot scheduling algorithm based on wireless sensor network multi-path transmission described in the embodiment of the present invention.
Embodiment
Below in conjunction with one group of embodiment and accompanying drawing, the present invention is described further.
Time interval resource scheduling problem needs network layer and data link layer jointly to determine, concrete enforcement needs succession.First network layer is by figure route for a pair communication node, source node or destination node provide routing diagram, and this routing diagram specifies the available neighbor node of down hop, and data link layer is jumped for each and dispatched corresponding time interval resource afterwards.In the network supporting multihop routing, time interval resource scheduling need consider routing order problem, otherwise can affect its real-time.In radio sensing network, multipath is the important technology improving network reliability.But, if for source node data transmission every paths all distribute corresponding time interval resource, due to packet end to end actual transmissions only adopt a paths, most Internet resources will be wasted.Such resource scheduling scheme not only increases the time delay of transfer of data, and reduces the extensibility of network, limits network size.
As shown in Figure 1, network support multi-path transmission, the node in path has one or more next-hop node.When node sends unsuccessfully to next-hop node, redundancy down hop is selected to retransmit; If after node sends all failures to all down hops, then data packet transmission failure; If data link layer distributes corresponding time interval resource to all communication links can cause a large amount of wastes.In actual transmissions process, packet actual transmissions only can adopt a paths, and the link in different paths can not produce transmission collision.Therefore, according to link transmission order, the link that do not conflict in different path can share same time slot, in transmitting procedure, also can not produce link conflict.
The present invention adopts centralized network configuration, is optimized scheduling by the webserver to the whole network resource, reduces the amount of calculation of node self.Network topology is represented by G (V, E), and wherein V is the set of nodes, and E is the set of communication link in network.Server, according to network topology and link performance, generates routing diagram G
g(V
g, E
g).The one or more father node of node selection in routing diagram adds network, therefore supports multi-path transmission.The present invention is according to routing diagram G
ggenerate corresponding timeslot scheduling, be different from tradition for the corresponding time slot of every bar link assignment.In the present invention, can to distribute to multiple communication that can not produce conflict right simultaneously for time slot, thus improve the utilance of time slot.
As shown in Figure 2, be the network topology example that the embodiment of the present invention provides, embodiment provides the dispatching algorithm process of source node S to destination node D.
Step 1, as shown in Figure 3, generates the routing diagram of node S to node D according to network topology.With node D for start node, the node in network successively adds network.First, C adds the node of network as first, and selection D is father node; F adds the node of network as second, selects C, D to be father node, by that analogy.Sensor selection problem has added the neighbor node of routing diagram as father node, and the number of father node can be one or more.The selection of father node can be carried out in conjunction with practical communication demand and link circuit condition, such as, select according to the parameter such as jumping figure, link reliability.As shown in Figure 3, in embodiment, network topology generates corresponding routing diagram G
g(V
g, E
g).
Step 2, as shown in Figure 4, based on routing diagram G
g, corresponding network topology can generate topological tree T.Each entry in topological tree has five parts: (Level, Lchild, Ldata, Rchild, Rdata), wherein Lchild points to left child node, Ldata records the node number of this node, and Rchild points to right child node, and Rdata records the node number of this node.As shown in Figure 3, in entry, Ldata with Rdata acquiescence is identical, and Level is defaulted as 0.The root entry of topological tree is communication source node, and in next entry pointed by entry, Ldata is the next-hop node of this entry interior joint, and multi-path transmission support has one or more next-hop node.
Step 3, as shown in Figure 5, traversal topological tree T, generation pass tree T
s.From root node, travel through first next-hop node, its Lchild points to this node, and next-hop node continues its first next-hop node of traversal, and now this path is defaulted as optimal path.In ergodic process, Lchild points to comparatively shortest path, and Rchild points to redundant path.Therefore, when node has redundancy down hop, the Rdata of its entry pointed to still saves as this node number, and Rchild points to redundancy down hop, until all down hops are all traversed, as shown in Figure 4.S has B, E two next-hop nodes, and wherein B is more excellent node, and therefore the Lchild of S points to Node B, and the Rdata still memory node S simultaneously in B entry, its Rchild points to node E.Because node E is last next-hop node of S, therefore Rdata and Ldata is all E.If S still has redundancy down hop, then the Rdata of E is still S, and Rchild points to redundancy down hop.
Step 4, as shown in Figure 6, traverse path tree T
sstore the number of plies for each node calculate.
Step 5, as shown in Figure 7, path optimizing is set, and obtains path optimizing tree T
o.From the entry that the number of plies is the highest, travel through every one deck, search for each entry.If the entry that the number of plies is low follows Ldata with Rdata of the entry that the number of plies is high identical, then this entry can be placed in the identical one deck of the entry high with the number of plies, thus obtains path optimizing tree T
o.In figure, the transmission of C to D has at third layer, layer 5, layer 6, and in practical communication, packet only can select a link.Unnecessary scheduling meeting waste Internet resources, and increase communication contention aware.Therefore, the transmission of C to D can merge and is placed on layer 6.
Step 6, as shown in Figure 8, traverse tree T
o, carry out time slot allocation.From the entry that the number of plies is low, the entry for the identical number of plies distributes same time slot.In same time slot, receiving node is the Ldata in entry, and corresponding sending node is for pointing to this destination node.In same time slot, transmission and reception limit not having number.In time slot 1, receiving node is the Node B in Level1, and sending node is the node S that the Lchild of this entry of sensing is corresponding.Same in time slot 5, receiving node is the node C in Level5, and sending node is node F, E that the Lchild of these entries of sensing is corresponding, therefore has two pairs of transmission and reception pair in time slot 5, F to C and E to C.
The scheduling that step 7, time slot are limited.If this transmitting and scheduling can number of time slot be limited, the number of plies so higher than timeslot number will be cut out, and obtains limited path tree T
m.Then from the entry path tree T that the number of plies is high
mif this entry is leaf node and Ldata is not destination node, then this entry will be deleted.In figure, this transmission is limited only to complete scheduling with 5 time slots, in topological tree T layer 6 entry will be deleted.Then travel through from layer 5, wherein four entries are leaf entry, and the Ldata of two entries is not D, deleted.Traversal the 4th layer thereupon, only has two entries to be leaf entry and Ldata is D, does not therefore need to delete.By that analogy, as shown in Figure 9, entry qualified in path tree is deleted, then repeats step 5, optimize limited path tree T
m, then according to step 6, carry out time slot allocation.
In sum, technical scheme of the present invention adopts centralized managerial structure, based on the figure routing plan supporting multipath, by setting up and successive optimization path tree, thus obtain corresponding timeslot scheduling scheme, improve the utilance of Internet resources, multi-path transmission is provided support simultaneously; The scheduling of multi-path transmission is optimized, improves its real-time and extensibility, support multi-path transmission well simultaneously.
Obviously; the above embodiment of the present invention is only for example of the present invention is clearly described; and be not the restriction to embodiments of the present invention; for those of ordinary skill in the field; can also make other changes in different forms on the basis of the above description; here cannot give exhaustive to all execution modes, every belong to technical scheme of the present invention the apparent change of extending out or variation be still in the row of protection scope of the present invention.
Claims (8)
1., based on the timeslot scheduling algorithm of wireless sensor network multi-path transmission, the step of this algorithm comprises
The corresponding routing diagram of Topology g eneration Network Based;
According to described routing diagram, building topology tree T;
Topological tree T is traveled through, generation pass tree T from the root node of topological tree
s, and utilize path tree T
sstore the number of plies for each node calculate;
Path optimizing tree T
s, obtain path optimizing tree T
o;
Path optimizing tree T
ofrom the entry that the number of plies is low, the entry for the identical number of plies distributes same time slot.
2. timeslot scheduling algorithm according to claim 1, is characterized in that, the step of the corresponding routing diagram of described Topology g eneration Network Based comprises
Server generates routing diagram according to network topology;
Be start node with destination node, the node in network adds network successively;
New node selects the neighbor node having added routing diagram as father node, and the number of father node can be one or more.
3. timeslot scheduling algorithm according to claim 2, is characterized in that, the selection of described father node is selected by practical communication demand and link circuit condition.
4. timeslot scheduling algorithm according to claim 1, it is characterized in that, each entry of described topological tree T comprises Level, Lchild, Ldata, Rchild and Rdata, wherein, Lchild points to left child node, and Ldata records the node number of node, and Rchild points to right child node, Rdata records the node number of node, the root entry of described topological tree T is communication source node, and in next entry pointed by entry, Ldata is the next-hop node of this entry interior joint, and multi-path transmission support has one or more next-hop node.
5. timeslot scheduling algorithm according to claim 4, is characterized in that, described generation pass tree T
sstep comprise
From root node, travel through optimum next-hop node, the Lchild of node points to optimum next-hop node, and giving tacit consent to this path is optimal path, and optimum next-hop node continues its optimum next-hop node of traversal;
In ergodic process, the Lchild in each topological tree T points to optimal path, and Rchild points to redundant path;
When node has redundancy down hop, its Rdata pointing to optimum down hop still saves as this node number, and Rchild points to redundancy down hop, until all down hops are all traversed; In like manner, if node has the 3rd redundant node, then the Rdata of redundancy down hop also saves as this node number, and Rchild points to the 3rd redundant node.
6. timeslot scheduling algorithm according to claim 4, is characterized in that, described path optimizing tree T
s, obtain path optimizing tree T
ostep comprise
From the entry that the number of plies is the highest, travel through every one deck, search for each entry;
If the entry that the number of plies is low follows Ldata with Rdata of the entry that the number of plies is high identical, then this entry can be placed in the identical one deck of the entry high with the number of plies, thus obtains path optimizing tree T
o.
7. timeslot scheduling algorithm according to claim 4, is characterized in that, in described same time slot, the Ldata in entry is receiving node, and corresponding sending node is for pointing to this destination node.
8. timeslot scheduling algorithm according to claim 1, is characterized in that, this algorithm comprises time slot further by scheduling in limited time, and this step comprises
If this transmitting and scheduling can number of time slot be limited, the number of plies so higher than timeslot number will be cut out, and obtains limited path tree T
m;
From the entry path tree T that the number of plies is high
mif this entry is leaf node and Ldata is not destination node, then this entry will be deleted;
Entry qualified in path tree is deleted, then optimizes limited path tree T
m, carry out time slot allocation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410519888.XA CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410519888.XA CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104244423A true CN104244423A (en) | 2014-12-24 |
| CN104244423B CN104244423B (en) | 2018-01-30 |
Family
ID=52231541
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410519888.XA Expired - Fee Related CN104244423B (en) | 2014-09-30 | 2014-09-30 | Timeslot scheduling algorithm based on wireless sensor network multi-path transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104244423B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107873126A (en) * | 2015-04-15 | 2018-04-03 | 诺基亚通信公司 | Self-organizing network concept for cell backhaul |
| CN108092732A (en) * | 2017-12-30 | 2018-05-29 | 迈锐数据（北京）有限公司 | A kind of slot allocation method and device |
| CN114374647A (en) * | 2021-11-30 | 2022-04-19 | 北京交通大学 | Planning method and device for time-sensitive service flow and route combined scheduling |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030214969A1 (en) * | 2002-01-10 | 2003-11-20 | Harris Corporation, Corporation Of The State Of Delaware | Method and device for establishing communication links and providing reliable confirm messages in a communication system |
| CN1984001A (en) * | 2006-05-01 | 2007-06-20 | 华为技术有限公司 | Method for sharing group-broadcasting tree time gap in automatic-exchange light network |
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
-
2014
- 2014-09-30 CN CN201410519888.XA patent/CN104244423B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030214969A1 (en) * | 2002-01-10 | 2003-11-20 | Harris Corporation, Corporation Of The State Of Delaware | Method and device for establishing communication links and providing reliable confirm messages in a communication system |
| CN1984001A (en) * | 2006-05-01 | 2007-06-20 | 华为技术有限公司 | Method for sharing group-broadcasting tree time gap in automatic-exchange light network |
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
| CN101977414A (en) * | 2010-11-11 | 2011-02-16 | 聂菊根 | Simultaneous transmission slot time distribution method of wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| JING ZHAO, YAJUAN QIN, DONG YANG, YING RAO: "A source Aware Scheduling Algorithm for Time-Optimal Convergecast", 《INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS》 * |
| 杨彦红，张晓彤，张学颖: "基于路由树的多信道多跳无线传感器网络资源分配算法", 《北京邮电大学学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107873126A (en) * | 2015-04-15 | 2018-04-03 | 诺基亚通信公司 | Self-organizing network concept for cell backhaul |
| US11758421B2 (en) | 2015-04-15 | 2023-09-12 | Nokia Solutions And Networks Oy | Self-organizing network concepts for small cells backhauling |
| CN108092732A (en) * | 2017-12-30 | 2018-05-29 | 迈锐数据（北京）有限公司 | A kind of slot allocation method and device |
| CN108092732B (en) * | 2017-12-30 | 2019-07-30 | 迈锐数据（北京）有限公司 | A kind of slot allocation method and device |
| CN114374647A (en) * | 2021-11-30 | 2022-04-19 | 北京交通大学 | Planning method and device for time-sensitive service flow and route combined scheduling |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104244423B (en) | 2018-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| Pavkovic et al. | Efficient topology construction for RPL over IEEE 802.15. 4 in wireless sensor networks | |
| CN101401360A (en) | Tree-guided distributed link state routing method | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN107318146B (en) | Topology control method of mobile cluster ad hoc network | |
| CN102572994B (en) | Wireless self-organizing network fusing routing generation method based on node characteristics | |
| Mao et al. | S4: Small state and small stretch compact routing protocol for large static wireless networks | |
| CN104602302A (en) | ZigBee network energy balance routing method based on cluster structure | |
| CN108684063A (en) | A kind of on-demand routing protocol improved method based on network topology change | |
| CN106231646A (en) | A kind of wireless chain multi-hop cross-layer method of timeslot multiplex | |
| CN103476081B (en) | Method for routing in wireless sensor network | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| Zhang et al. | A highly reliable link scheduling strategy for WirelessHART networks | |
| Anns et al. | Delay-aware data collection network structure for WSN | |
| CN104244423A (en) | Wireless sensor network based multi-path transmission time slot scheduling algorithm | |
| Mahajan et al. | A novel chain based wireless data sensor network (ECBSN) technique | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| JP5868551B2 (en) | Wireless communication system and wireless communication method | |
| CN103874159A (en) | Wireless sensor network | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Arshad et al. | Data fusion in mobile wireless sensor networks | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| Hahm et al. | A case for time slotted channel hopping for ICN in the IoT | |
| CN110121185A (en) | A kind of power distribution communication network route optimization method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20141224 Assignee: BEIJING SHEENLINE TECHNOLOGY Co.,Ltd. Assignor: Beijing Jiaotong University Contract record no.: 2016990000185 Denomination of invention: Wireless sensor network based multi-path transmission time slot scheduling algorithm License type: Common License Record date: 20160505 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180130 |