CN102045809B - Routing method of opportunistic network based on wireless radio frequencies - Google Patents
Routing method of opportunistic network based on wireless radio frequencies Download PDFInfo
- Publication number
- CN102045809B CN102045809B CN 200910036100 CN200910036100A CN102045809B CN 102045809 B CN102045809 B CN 102045809B CN 200910036100 CN200910036100 CN 200910036100 CN 200910036100 A CN200910036100 A CN 200910036100A CN 102045809 B CN102045809 B CN 102045809B
- Authority
- CN
- China
- Prior art keywords
- node
- write line
- read write
- packet
- read
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a routing method of an opportunistic network based on wireless radio frequencies, which mainly aims at the opportunistic network consisting of a plurality of mobile nodes and is mainly applied to environments such as a school network, a small town network and the like. The routing method includes the following steps of: firstly selecting application scenes of the opportunistic network; then setting a plurality of wireless radio frequency reader-writers in the application scenes; thirdly, setting a communication terminal on the mobile nodes; and finally performing data transmission among the mobile nodes, dividing the network load into two parts, wherein one part of the network load is stored and transferred by relay nodes, the other part of the network load transmits data via wireless radio frequency signals, and the two parts are performed in parallel. The routing method has the advantages of small end to end delay, low network resource requirement, little influence caused by environment factors and the like on the basis of guaranteeing the successful transmission rate of the data.
Description
Technical field
The present invention relates to a kind of method for routing, particularly a kind of opportunistic network routing method based on less radio-frequency.
Background technology
Wireless radio-frequency is utilize radiofrequency signal automatically to identify destination object and obtain a kind of technology of relevant information.As far back as during the Second World War, just represented its blank in " enemy and we's identification " system of distinguishing allied forces and Nazi's aircraft.Comprise that at present the large software and hardware of each of IBM, Motorola, Oracle etc. manufacturer all studies this technology, and released a series of software and hardware product, use in the various aspects of people's daily lifes such as logistics management, warehousing system, freeway toll station.
The research of opportunistic network derives from the interplanetary Internet plan (IPN) of the DARPA of the Plan Bureau supports such as U.S. Department of Defense's height, and this is in most of the cases a kind of, and there are not the mobile wireless network of fullpath in source node and destination node.Progressively be applied at present the fields such as biological tracking, campus network, home automation network, city and rural network.Have the characteristics such as intermittent connections, high-transmission time-delay, inhomogeneous connection due to opportunistic network, make the ICP/IP protocol of script to set up to connect end to end and cause a large amount of packet losses.
People have carried out various analyses to opportunistic network in recent years, many different Routing Protocols have also been proposed, but these agreements, part all comes with some shortcomings, if any agreement taken too much Internet resources, it is not ideal enough that some agreements show on the successful transfer rate of packet or average delay, and the movement of some protocol requirement nodes must be followed specific mode.
Summary of the invention
Technical problem solved by the invention is to provide a kind of transfer rate and the delay constraint requirement that can satisfy the net environment of dynamic change, and can rationally utilize the opportunistic network routing method based on less radio-frequency of the resources such as buffer memory in network and bandwidth.
The technical solution that realizes the object of the invention is: a kind of opportunistic network routing method based on less radio-frequency comprises the following steps:
Step 1: the application scenarios to opportunistic network is selected, and this application scenarios is the environment of a relative closure, has some entities that move in this scene, needs to carry out the transmission of some data between each mobile entity with shared;
Step 2: several radio frequency read/writes are set in above-mentioned application scenarios, and these read write lines are positioned at mobile node intensive place, and its coverage can not be overlapping;
Step 3: communicating terminal is set on mobile node, and this communicating terminal comprises two interfaces, and one is the less radio-frequency read-write interface, and another is the read-write interface of conventional wireless network;
Step 4: carry out transfer of data between mobile node, offered load is divided into two parts, a part of offered load carries out storage forwarding by via node, and another part offered load carries out the data transmission by radio frequency signal, both parallel carrying out.
The present invention compared with prior art, its remarkable advantage is: the mode that has adopted radio frequency signal and legacy network signal parallel the transmission of data, improved the performance of opportunistic network, carry out the Routing Protocol of data transmission compares with traditional simple use wireless network, when having improved transfer rate, reduced end to end time-delay, and within the use of Internet resources is controlled at rational scope.
Below in conjunction with accompanying drawing, the present invention is described in further detail.
Description of drawings
Fig. 1 is application scenarios of the present invention.
Fig. 2 is the flow chart of a kind of opportunistic network routing method based on less radio-frequency of the present invention.
Fig. 3 transmits the method flow diagram of packet by wireless network in the present invention.
Fig. 4 is the flow chart of communicating by letter between mobile node in the present invention.
Fig. 5 is the mode of packet that transmits by less radio-frequency in the present invention.
Fig. 6 is the flow chart that in the present invention, mobile node is communicated by letter with read write line.
Fig. 7 is that the transfer rate of routing policy of the present invention and other routing policies compares.
Fig. 8 is that the time-delay of routing policy of the present invention and other routing policies is compared.
Fig. 9 is the comparison that takies resource of routing policy of the present invention and other routing policies.
Figure 10 is the comparison of the flow altogether of routing policy of the present invention and other routing policies.
Embodiment
In conjunction with Fig. 1, Fig. 2, a kind of opportunistic network routing method based on less radio-frequency of the present invention comprises the following steps:
Step 1: the application scenarios to opportunistic network is selected, this application scenarios is the environment of a relative closure, as a campus, has some entities that move in this scene, as people or vehicle, need to carry out the transmission of some data between them with shared.Usually, be there is no directly path end to end between entity, and the real-time of the data demand that transmits not is very high;
Step 2: in above-mentioned application scenarios, radio frequency read/write is set, this read write line is positioned at mobile node intensive place, and its coverage can not be overlapping;
Step 3: communicating terminal is set on mobile node, and this communicating terminal comprises two interfaces, and one is the less radio-frequency read-write interface, and another is the read-write interface of conventional wireless network;
Step 4: carry out transfer of data between mobile node, offered load is divided into two parts, a part of offered load carries out storage forwarding another part offered load by via node and carries out the data transmission by radio frequency signal, both parallel carrying out.
The concrete grammar that offered load is divided is: originally in opportunistic network, certain node can form a plurality of copies after producing packet, and these copies are sent to several different via nodes, then no longer copy this packet, all these are storing the node of copy after running into destination node, this Packet Generation to destination node, is completed the transmission of data, and this is a kind of limited inundation Routing Protocol.Set the quantity q of flooded copy on the basis of limited inundation Routing Protocol, after source node produces packet, q is divided into wherein q=m+n of n, m two parts, q＞m＞0, q＞n＞0, in biography point process afterwards, n copy forwards by via node, and m copy transmits by radio frequency signal.
In conjunction with Fig. 3, a part of offered load of the present invention by the concrete steps that via node carries out storage forwarding is:
(1) source node sends to n-1 copy according to a predefined n copy n-1 the different mobile node that runs at first, and oneself keeps one; Source node also can adopt the binary distribution policy to distribute, be specially: source node is when distributing copy for the first time, half of number of copies passed to via node, each carries number of copies more than or equal to 2 node afterwards, in distribution, half of number of copies passed to other via node, the distribution that will complete copy that this point-score strategy can be the fastest;
(2) via node is judged, if certain via node is exactly destination node, complete the transmission of this packet; To no longer carry out copying of packet otherwise this n carries the node of copy, thereby wherein any one node runs into destination node and is about to data packet delivery and completes the transmission of data to destination node.
In conjunction with Fig. 4, in the environment of reality, in the process of once meeting between any two nodes, may exist a plurality of packets to transmit, because the time of contact of node is limited, and the transmission bandwidth of data is also limited, just is necessary that the packet that sends to needs arranges priority.At first two nodes are reciprocity, any one party begins to transmit the packet take the other side as destination node so, the opposing party begins to transmit the packet take the other side as destination node afterwards, can the transmittance process of some packets will be completed as soon as possible like this, subsequently, any one party begins to transmit to the other side the packet that needs forwarding, and the opposing party begins to transmit to the other side the packet that needs forwarding afterwards, so far completes whole communication process.If node in this process causes internodal communication disruption because move, finish so communication process, the packet that is transmitting will be dropped.
In conjunction with Fig. 5, another part offered load of the present invention by the concrete steps that radio frequency signal carries out the data transmission is:
(a) mobile node regularly initiates a session request to read write line, if read write line is busy, mobile node postpones again to initiate a session request after 3 ~ 5s; If the read write line free time is execution in step (b), and read write line self enters busy condition;
(b) read write line sends answer signal and connects with mobile node;
(c) copy of the mobile node packet that will transmit by radio frequency signal is placed on buffering area and indicates the read write line read-write;
(d) read write line reads and writes data from mobile node, completes the read-write of a packet; Read write line writes destination node with this packet in the session of follow-up and destination node;
(e) read write line and mobile node disconnect after complete in read-write, and read write line enters idle condition, regularly carries out communication between read write line, and m copy of packet is distributed on the individual different read write line of m.
In conjunction with Fig. 6, communication process between node and radio frequency read/write is described.At first mobile node initiates a session request to read write line.If read write line is idle condition, this request is responded, connect between read write line and this node, read write line enters busy condition.If node is not received the answer signal of read write line, after delaying time 3 to 5 seconds, again initiate a session request, until connect.Read write line is write the packet successively take this node as destination node the particular buffer of ingress afterwards, and the instructs node reception, completes the transmittance process of some packet.What then node will produce need to put into corresponding buffering area successively by the packet that radiofrequency signal is transmitted, and the indication read write line reads.Complete after the reading of node content at read write line, node sends the request of end session, and sign off, read write line enter again idle condition.
In said process, read write line should be evenly distributed in regional in whole network, to guarantee that mobile node can enter the coverage of read write line fast in the optional position of network.The covering radius of read write line should avoid overlapping in addition, and the situation that can occur conflicting between read write line so also causes simultaneously the waste of resource.Only needing in whole network that a small amount of read write line is installed and get final product, is the consideration for cost so on the one hand, and in addition, too much read write line is very little to the raising of performance.
The movement of node is to carry out according to certain mobility model, and usually, node has a destination, and this node moves to the destination afterwards, can do the stop of certain hour in the destination, then selects new destination, continues mobile.
Mobile node can carry out the transmission of data by radiofrequency signal and read write line, and this data transmission is two-way, that is to say, read write line can from the mobile node reading out data, also can image drift move the node data writing.In the communication process of mobile node and read write line, read write line reads the data of its new generation from mobile node, and the data take it as purpose are sent to this node like this.
Can carry out mutual communication between mobile node, when two nodes in each other the covering radius of distance less than wireless network, just can carry out the data transmission by wireless network between them in moving process.
Also can intercom mutually between read write line.Read write line can be regarded fixing infrastructure as, therefore can carry out sharing of data between them, but this is not necessary.Can arrange a central control system, can be taken on by some read write lines yet, being responsible for regular collection does not have the new packet that receives of read write line, and it is arranged, the packet that deletion repeats, then the result after arranging returns to each read write line.Data sharing between read write line can be transmitted by cable network, like this can be fast, timely with the regional of the whole network of data scatter.
Any one node can by less radio-frequency and wireless network dual mode, independently carry out the transmission of data separately when producing the new data that will send.In the transmittance process of less radio-frequency, node is responsible for a copy with this packet, pass to the read write line that runs at first, no longer carry out afterwards the transmission of unnecessary copy by radiofrequency signal, destination node is in the coverage of read write line, just can obtain corresponding packet from read write line, complete the transmission of data.In the transmittance process of wireless network, node passes to the individual copy of packet n-1 (scale of n and whole network is relevant) n-1 the different node that runs at first, and oneself keeps one.If do not run into destination node in this process, this packet no longer copies and forwards.Until carry the destination node that certain node of this packet runs into and send it to destination node, the transmission of packet is completed.
What node was regular carries out with read write line alternately.If when the node motion of not within the coverage of any one read write line, waiting until node arrived within the coverage of certain read write line, node sent the request of communicating by letter with read write line.If read write line is this moment idle, give response of node, between is just set up a session connection, and read write line enters busy condition.If this moment, read write line was busy, node can't be received the response of read write line, sends the session request after node can be delayed time several seconds again, until obtain the response of read write line.Only account for the full-time very little part of node due to time of the session between each node and read write line, so a plurality of node is very little to the probability that read write line carries out the session request simultaneously.
After node and read write line connected, read write line first was placed on the packet take this node as destination node in the buffering area of this node, and instructs node receives.If read write line does not have to send to the data of node, perhaps data receive, and node can not obtain the acceptance indication of read write line, just the own new data that produce can be sent out and treat that read write line reads buffering area is medium.After the read write line reading out data, can these data of instructs node receive, node can be put into buffering area with next packet.By the time after read write line had read all data that node will transmit, node sent one and disconnects request to read write line, and session between end and read write line.Read write line receives the request of disconnecting, and enters idle condition.
If read write line is in carrying out the process of session with node, node motion has arrived outside the coverage of read write line, perhaps occur any abnormal in the read-write process of data, read write line and node all interrupt the session with the other side, and node can reattempt in time-delay the session with read write line after several seconds.
Distance between any two nodes within the transmission range of wireless network in, just can carry out radio communication between node.If plural node within same scope, so only can connect between any two.The beginning of session can be initiated by any one node, connection between node is two-way, can carry out two-way transfer of data after a side connects, but only there is unidirectional communication constantly in any one, when two nodes have packet to send to the other side, must send successively.
During the session of two nodes, first send the packet take the other side as the destination, because these packets mail to destination node, so can abandon, so also can complete as early as possible the transmission of data after sending end.Afterwards, transmission needs the packet of forwarding.Status between node equates, so the order of two node transmitting-receivings is random.When a node is attempted sending packet to another node, see first whether the other side agrees to receive this packet, if this packet the other side received (by less radio-frequency or other nodes), abandon the transmission to this packet, reattempt the transmission of other packet, otherwise begin the transmission of this packet.After a packet end of transmission, can be carried out by any one party the transmission of new packet, if both sides do not have the transmission of packet, can end session.After the exchange of completing data between node, the conversation end between node is by the node end session of initiating to connect.If in transmitting procedure, the distance between two nodes is due to the relative motion of node, greater than the distance of wireless transmission, and the disconnecting between node, the packet that is transmitting will be dropped.
Each node has a certain size local buffer, has deposited the packet of own generation or other nodes for the packet that forwards.When having new packet to produce, when perhaps receiving new packet, if local buffering area is full, node can will enter the data packet discarding of buffering area the earliest, deposits new packet to seek enough spaces.For the packet take oneself as purpose that receives, node can not put into local buffering area to it, but directly is further processed.If received same packet, directly it abandoned.
Below in conjunction with embodiment, the present invention is done further detailed description:
Embodiment:
Below in conjunction with a small towns simulated environment, the present invention is described in further detail.The area size of this scene is 4km*4km.Formed by mobile node, read write line facility, road, fixation means in the zone.Mobile node is divided into 3 kinds: the node of b beginning represents bus, and this node moves along fixing road, and can carry out at terminal point the stop of a period of time; The node of c beginning represents car, and this node can move on turnpike road, selects certain fixing facility as the destination, does certain stop at facility behind the destination; Node with the p beginning represents person, and this node can move on turnpike road and secondary road, selects equally certain fixing facility as the destination, and after arriving the destination, can enter the facility internal motion.Three kinds of various parameter settings of node such as following table:
The parameter setting of three kinds of nodes of table 1
As can be seen from Table 1, always have 100 nodes in whole scene.The total time of emulation is designed to 12 hours, wherein can produce according to probability by packet in front 10 hours.In theory, in simulation process packet add up to 4000.The size of packet is 5-100k, basically is designed to the size of an envelope Email.Our source determines that the copy amount that mist is waited for and the binary spraying is waited for is set to 12, and the quantity based on the copy that forwards by wireless network in the Routing Protocol of less radio-frequency is exactly 6 so, and other 6 copies are from the less radio-frequency transmission.6 fixing read write lines are set, and the covering radius of each read write line is set to 150 meters, and the communication speed between read write line and node is 10 read or writes of per second.Simultaneously, we have realized that in above-mentioned scene present popular infection route (EpidemicRouter, ER), source determine mist wait (Spray﹠amp; Wait SW), the source determines binary spraying wait (Binary Spray﹠amp; Wait, BSW), single copy directly transmits route (DirectRouter DR), carries out the comparison of performance each other.
Under above-mentioned environment, emulated data shows, the successful transfer rate of packet is at (Fig. 7) more than 95%, average delay at 50 minutes with interior (Fig. 8), the Internet resources that altogether take are (Fig. 9) below 800M, the data total amount of transmission below 1800M (Figure 10).Above result demonstration, the strategy that the present invention proposes has very high feasibility and reasonability.
Claims (1)
1. the opportunistic network routing method based on less radio-frequency, is characterized in that, comprises the following steps:
Step 1: the application scenarios to opportunistic network is selected, and this application scenarios is the environment of a relative closure, has some entities that move in this scene, needs to carry out the transmission of some data between each mobile entity with shared;
Step 2: several radio frequency read/writes are set in above-mentioned application scenarios, and these read write lines are positioned at mobile node intensive place, and its coverage can not be overlapping;
Step 3: communicating terminal is set on mobile node, and this communicating terminal comprises two interfaces, and one is the less radio-frequency read-write interface, and another is the read-write interface of conventional wireless network;
Step 4: carry out transfer of data between mobile node, offered load is divided into two parts, a part of offered load carries out storage forwarding by via node, and another part offered load carries out the data transmission by radio frequency signal, both parallel carrying out; The concrete grammar of wherein offered load being divided is: the quantity q that sets flooded copy on the basis of limited inundation Routing Protocol, after source node produces packet, q is divided into wherein q=m+n of n, m two parts, 0＜m＜q, 0＜n＜q, in transmittance process afterwards, n copy forwards by via node, and m copy transmits by radio frequency signal; Described a part of offered load by the concrete steps that via node carries out storage forwarding is:
(1) source node sends to n-1 copy according to a predefined n copy n-1 the different mobile node that runs at first, and oneself keeps one, and perhaps source node adopts the binary distribution policy to distribute;
(2) via node is judged, if certain via node is exactly destination node, complete the transmission of this packet; Otherwise the node that this n carries copy will no longer carry out copying of packet, thereby wherein any one node runs into destination node and is about to data packet delivery and completes the transmission of data to destination node;
Described another part offered load by the concrete steps that radio frequency signal carries out the data transmission is:
(a) mobile node regularly initiates a session request to read write line, if read write line is busy, mobile node postpones again to initiate a session request after 3～5s; If the read write line free time is execution in step (b), and read write line self enters busy condition;
(b) read write line sends answer signal and connects with mobile node;
(c) copy of the mobile node packet that will transmit by radio frequency signal is placed on buffering area and indicates the read write line read-write;
(d) read write line reads and writes data from mobile node, completes the read-write of a packet; Read write line writes destination node with this packet in the session of follow-up and destination node;
(e) read write line and mobile node disconnect after read-write is complete, read write line enters idle condition, regularly carry out communication between read write line, m copy of packet is distributed on m different read write line, thereby this m read write line can write destination node with this packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910036100 CN102045809B (en) | 2009-10-16 | 2009-10-16 | Routing method of opportunistic network based on wireless radio frequencies |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910036100 CN102045809B (en) | 2009-10-16 | 2009-10-16 | Routing method of opportunistic network based on wireless radio frequencies |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102045809A CN102045809A (en) | 2011-05-04 |
| CN102045809B true CN102045809B (en) | 2013-06-05 |
Family
ID=43911444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910036100 Expired - Fee Related CN102045809B (en) | 2009-10-16 | 2009-10-16 | Routing method of opportunistic network based on wireless radio frequencies |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102045809B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102201989B (en) * | 2011-05-19 | 2013-08-28 | 北京工商大学 | Wait and epidemic routing algorithm |
| CN102185783B (en) * | 2011-05-25 | 2013-06-19 | 重庆邮电大学 | Routing design method for multi-ferry direct communication in opportunistic network |
| CN102202000B (en) * | 2011-06-14 | 2013-07-17 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN103763193B (en) * | 2014-02-21 | 2017-02-15 | 重庆邮电大学 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
| CN105530678B (en) * | 2015-12-14 | 2019-01-25 | 北京邮电大学 | A kind of wireless backhaul route selection method in super-intensive network based on load and time delay |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222438A (en) * | 2008-01-28 | 2008-07-16 | 北京航空航天大学 | Data transmission method in opportunity network |
| CN101232463A (en) * | 2008-02-27 | 2008-07-30 | 北京航空航天大学 | Method for distributing data under opportunity network |
| CN101521955A (en) * | 2009-04-08 | 2009-09-02 | 北京航空航天大学 | Method for collecting data under opportunity network |
-
2009
- 2009-10-16 CN CN 200910036100 patent/CN102045809B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222438A (en) * | 2008-01-28 | 2008-07-16 | 北京航空航天大学 | Data transmission method in opportunity network |
| CN101232463A (en) * | 2008-02-27 | 2008-07-30 | 北京航空航天大学 | Method for distributing data under opportunity network |
| CN101521955A (en) * | 2009-04-08 | 2009-09-02 | 北京航空航天大学 | Method for collecting data under opportunity network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102045809A (en) | 2011-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Whitbeck et al. | Push-and-track: Saving infrastructure bandwidth through opportunistic forwarding | |
| CN102045809B (en) | Routing method of opportunistic network based on wireless radio frequencies | |
| TWI324004B (en) | ||
| CN102098113B (en) | Method for realizing water sound sensor network MAC (Media Access Control) protocol based on ALOHA and TDMA (Time Division Multiple Access) | |
| CN103929377B (en) | Wired network and wireless network combined dispatching method and system and related devices | |
| CN107040878A (en) | A kind of many chain wireless sensor networks without layered communication method | |
| CN103095605A (en) | Data transmission method and system capable of fusing router in mobile internet of things | |
| CN103873523A (en) | Client cluster access method and device | |
| CN103533584A (en) | Multichannel media access control method of hydroacoustic sensor network | |
| CN103546258A (en) | Method and device for data transmission | |
| CN107154948A (en) | A kind of multi-protocol data exchange method applied to car launcher information control system | |
| CN107508648A (en) | Time triggered Ethernet substep time synchronized strategy based on functions of the equipments classification | |
| CN101765227B (en) | Method for optimizing 802.11 centralized coordination function | |
| CN101883047B (en) | Data concurrency transmission method of multi-network interface device | |
| CN103634879A (en) | Method for receiving data from common nodes by mobile sinks in wireless sensing network | |
| CN104038557B (en) | Device software batch upgrading method in a kind of tree network structure of optical fiber connection | |
| CN106851685B (en) | Method and system for controlling bandwidth of mobile terminal | |
| CN105682199A (en) | Wireless synchronization method and system | |
| CN102802200A (en) | Data message sending method and equipment | |
| CN104486187A (en) | Dynamic condition synchronizing CAN communication device and method | |
| CN105338654A (en) | Network sharing method, apparatus and system | |
| CN110365790A (en) | Method for message transmission, device, cascade network equipment and readable storage medium storing program for executing | |
| CN101686562B (en) | Network system, information transmission method, access point device and base station | |
| CN102299937A (en) | Method and system for distributing clock server based on network | |
| CN102195856B (en) | Time delay tolerance routing method for assisting radio frequency identification technology |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130605 Termination date: 20151016 |
|
| EXPY | Termination of patent right or utility model |