CN101448281A - Fault-tolerance method in wireless sensor network - Google Patents
Fault-tolerance method in wireless sensor network Download PDFInfo
- Publication number
- CN101448281A CN101448281A CNA2008101637543A CN200810163754A CN101448281A CN 101448281 A CN101448281 A CN 101448281A CN A2008101637543 A CNA2008101637543 A CN A2008101637543A CN 200810163754 A CN200810163754 A CN 200810163754A CN 101448281 A CN101448281 A CN 101448281A
- Authority
- CN
- China
- Prior art keywords
- transmission
- node
- code
- source node
- sensor network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000005540 biological transmission Effects 0.000 claims abstract description 67
- 238000013459 approach Methods 0.000 claims description 8
- 230000008447 perception Effects 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 5
- 238000012937 correction Methods 0.000 abstract description 3
- 238000012935 Averaging Methods 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 8
- 238000011160 research Methods 0.000 description 3
- 230000007123 defense Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 241000408659 Darpa Species 0.000 description 1
- 238000003339 best practice Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 231100001261 hazardous Toxicity 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005096 rolling process Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a fault-tolerance method in a wireless sensor network. The fault-tolerance method has the advantages that a source node transmits original data through a plurality of transmission paths with mutually disjoint nodes, so that, in case of transmission failure of a certain middle sensor node or the single transmission path, the impact on the successful transmission of the original data is very small, thereby ensuring the accurate transmission of the original data; the source node carries out the erasure correction encoding of information codes at a source node end, then as long as the lost information is in the error-correcting range of erasure codes, a base station node end can recover the original data, thereby being more conductive to the data transmission. The method dynamically changes the number of the transmission paths needed by transmission by utilizing the index weighted averaging method according to the link state of the wireless sensor network environment, thereby improving the fault-tolerance ability of a system while improving the success rate of code element transmission, reducing the total communication traffic during the transmission and further achieving the maximum transmission success rate by utilizing the minimum transmission paths.
Description
Technical field
The present invention relates to a kind of sensor network technique, especially relate to the fault-tolerance approach in a kind of wireless sensor network.
Background technology
The research of wireless sensor network (WSN, Wireless Sensor Networks) originates from the seventies in 20th century, is applied to military field the earliest.1980, (the DARPA of advanced studies office of U.S. Department of Defense, Defense AdvancedResearch Projects Agency) distributed sensor networks project (DSN, Distributed Sensor Networks) has been opened the beginning of modern sensor network research.Subsequently, handle along with transducer, embedded computing system, distributed information and the develop rapidly of multiple technologies such as cordless communication network makes wireless sensor network become a kind of brand-new information to obtain and treatment technology.Wireless sensor network is the wireless network of the oriented mission that is made of in the mode of wireless self-organization network one group of a plurality of sensor node that are distributed in desired location, its application has spreaded all over fields such as aviation electronics, environmental monitoring, target following, is considered to one of technology of power that 21st century had an immense impact on.But because the restriction of resource, wireless sensor network very easily breaks down, and when the increasing application and service of the network carrying, the influence of network failure will be more obvious also, and the fault-tolerant ability that therefore promotes wireless sensor network becomes very real and important.
Fault-tolerant design technique has become a special field through long-term development.In this field, all had good theory support at large scale integrated circuit, distributed system, cable network, yet the appearance of wireless sensor network has brought new challenge to fault-tolerant design technique, because will rethink the situation of following each side:
1, technology and realization factor.Different with the encapsulation of integrated circuit, sensor node in the wireless sensor network need be directly exposed in the environment usually, be easy to be subjected to damage of external force such as physics, chemistry, biology, so the reliability of sensor node own is far short of what is expected, and hundreds of sensor node is formed a distributed wireless sensor network, when being subjected to cost and energy limited, need finish a series of task, as perception, communication, signal processing, numerical computations etc., this itself also is a challenge.
2, the application model of wireless sensor network.On the one hand, the sensor node in the wireless sensor network usually is deployed in the unserviced abominable or hazardous environment, and therefore, sensor node is as easy as rolling off a log to suffer environment damage and lost efficacy; On the other hand, the volume of sensor node own is less, and the energy that is equipped with is also very limited, and exhausting of the energy also can cause sensor node to lose efficacy.Because sensor node is widely distributed and have a randomness, physically the sensor node of maintenance or replacement inefficacy is very difficult or impossible often, so soft, the hardware of wireless sensor network must have very strong fault-tolerance, have high credibility and high robustness to guarantee communication system.
3, wireless sensor network still is emerging research and engineering field, and the best practice of handling particular problem is also indeterminate.Because the technology of wireless sensor network and expection are used and also developed apace, specific fault-tolerant processing technology also is difficult to prediction in wireless sensor network.
Summary of the invention
Technical problem to be solved by this invention provides a kind of fault-tolerance approach that can guarantee that the source node in the wireless sensor network is correctly transmitted to the information of base-station node.
The present invention solves the problems of the technologies described above the technical scheme that is adopted: the fault-tolerance approach in a kind of wireless sensor network may further comprise the steps:
1), the definition sensor node that is used for perception data in the wireless sensor network is source node, utilizes existing multipath routing algorithm, sets up the disjoint transmission path of 2N bar node between source node and base-station node;
2), at the source node end, the initial data that source node is perceived is divided into K information code, use then (N ', K) RS (Reed-Solomon) correcting and eleting codes carries out RS to K information code and entangles that deleting encodes obtains the individual code element of N ', the individual code element of N ' comprises R
pAn individual redundant code and K information code, any N ' bar in the disjoint transmission path of 2N bar node that the individual code element of N ' is set up by step 1) is transferred to base-station node respectively, wherein, R
p=N '-K, N '≤2N, p represent the number of times of source node to the base-station node transmitted symbol;
3), at the base-station node end, after the information code or redundant code end of transmission of source node end the p time, base-station node carries out total number statistics to the code element that receives, the total number of code element that statistics is obtained is designated as L
p, judge L
pWhether more than or equal to the number K of information code, if L
pMore than or equal to K, then determine this time transmission success, the code element that receives can successfully be decoded obtains initial data; Otherwise, determine this time bust this;
4), utilization index moves weighted average (EWMA, Exponentially Weighted Moving Average) method R
P+1=(1-λ) R
p+ λ (K-L
p) adjust the number of next redundant code waiting for transmission, the bar number that the transmission path of transmission next time needs is set according to the redundant code number of adjusting is
Return step 2 then) carry out the transmission of initial data next time, wherein, R
P+1Be the p+1 time source node number to the redundant code of base-station node transmission, λ is the constant that index moves the weighted average memory depth, 0＜λ＜1, symbol
Be the symbol that rounds up.
Any two transmission paths between the disjoint transmission path of described node refers to from the source node to the base-station node all do not have crossing sensor node.
λ in the described step 4)=0.25.
Compared with prior art, the invention has the advantages that source node transmits initial data by many disjoint transmission paths of node, when making bust this when the sensor node of certain centre or wall scroll transmission path, influence to the transmission success of initial data is also very little, has guaranteed the correct transmission of initial data; At the source node end, source node entangles information code deletes coding, as long as the information of losing like this in the error correction scope of correcting and eleting codes the time, the base-station node end all can recover initial data, also is more conducive to the transmission of data; The inventive method is according to the Link State of wireless sensor network environment, change the needed transmission path bar number of transmission dynamically by the utilization index weighted average method, improved Fault Tolerance, improved the success rate of code element transmission simultaneously, the total traffic when having reduced transmission so just can reach the transmission success rate of utilizing minimum transmission path to reach maximum.
Description of drawings
Fig. 1 is transferred to the schematic diagram of base-station node by different transmission path for K information code in the specific embodiment.
Embodiment
Embodiment describes in further detail the present invention below in conjunction with accompanying drawing.
Fault-tolerance approach in a kind of wireless sensor network may further comprise the steps:
1) after, the sensor node deployment in wireless sensor network finishes, the sensor node that is used for perception data in the definition wireless sensor network is a source node, utilize existing multipath routing algorithm, between source node and base-station node, set up the disjoint transmission path of 2N bar node.In the present embodiment, any two transmission paths between the disjoint transmission path of node is meant from the source node to the base-station node all do not have crossing sensor node.N is the integer greater than 0.
2), at the source node end, the initial data that source node is perceived is divided into K information code, use then (N ', K) the RS correcting and eleting codes carries out RS to K information code and entangles that deleting encodes obtains the individual code element of N ', the individual code element of N ' comprises R
pAn individual redundant code and K information code, any N ' bar in the disjoint transmission path of 2N bar node that the individual code element of N ' is set up by step 1) is transferred to base-station node respectively, wherein, R
p=N '-K, K＜N '≤2N, p represent the number of times of source node to the base-station node transmitted symbol.During initialization, N '=N, during p=0, R
0=N '-K.Herein, be on the basis of step 1), to carry out step 2 step 2)) in the number of redundant code be to depend on index in the step 4) to move weighted average method and dynamically adjust and obtain.
RS entangles to delete and is encoded to a kind of of chnnel coding.The errors present at the error code place that forward error correction is corrected in communication system generally is ignorant in advance, and the Frame abandoned of mistake in erasure channel, the position of the data of losing in data flow known, like this RS correcting and eleting codes deal with than error correcting code more easy, one (N ', K) the RS correcting and eleting codes is that K information code is encoded to the individual code element of N ', N '〉K, make with K the original information code of any K the equal restructural of code element in the individual code element of this N '.
3), at the base-station node end, after the information code or redundant code end of transmission of source node end the p time, base-station node is assessed the total number statistics of the code element that promptly receives to the code element that receives, the total number of code element that statistics is obtained is designated as L
p, judge L
pWhether more than or equal to the number K of information code, if L
pMore than or equal to K, then determine this time transmission success, the code element that receives can successfully be decoded obtains initial data; Otherwise, determine this time bust this;
4), utilization index moves weighted average (EWMA, Exponentially Weighted Moving Average) method R
P+1=(1-λ) R
p+ λ (K-L
p) adjust the number of next redundant code waiting for transmission, if current transmission is successful, then can reduce next redundant code number waiting for transmission, if current transmission is failed, then can increase next redundant code number waiting for transmission, the bar number that the transmission path of transmission next time needs is set according to the redundant code number of adjusting is
Return step 2 then) carry out the transmission of initial data next time, wherein, R
P+1Be the p+1 time source node number to the redundant code of base-station node transmission, λ is the constant that index moves the weighted average memory depth, 0＜λ＜1, symbol
Be the symbol that rounds up.The value of λ can be carried out reasonable configuration according to actual needs in the present embodiment, as gets λ=0.25.
Provide a simple example below in conjunction with Fig. 1 specific implementation of the present invention is described.At this, adopt (7,3) RS correcting and eleting codes that information code is carried out RS and entangle and delete coding, promptly the number of the information code that is divided into of initial data is 3, and 3 information codes coding backs are being produced 7-3=4 redundant code, i.e. the number K of information code=3, the number R of redundant code
pWhen changing at the beginning R
0=4.
1,, between source node and base-station node, sets up 14 mutually disjoint transmission paths of node by the multipath routing algorithm;
2, at the source node end initial data that perceives is divided into 3 information codes, use (7 then, 3) the RS correcting and eleting codes carries out RS to 3 information codes and entangles and deleting coding and obtain 7 code elements, 7 code elements comprise 4 redundant codes, and any 7 in 14 mutually disjoint transmission paths of node that 7 code elements are set up by step 1) are transferred to base-station node respectively;
3, the number of the code element that statistics is received on base-station node when the p time transmission is designated as L
p, if the number L of the code element that receives
pBe not less than 3, promptly initial data can successfully be recovered; Otherwise can not recover initial data is this bust this;
4), the method for utilization index weighted moving average is adjusted the number R of redundant code
p, promptly according to the statistics of step 3), if the number of the redundant code when this bust this will increase the next time transmission so, otherwise the number of the redundant code in the time of should reducing the next time transmission calculates that needed redundant code number is when transmitting for the p+1 time: R
P+1=(1-λ) R
p+ λ (3-L
p), λ gets 0.25; And the needed transmission path bar number of next time communicating by letter is set is
Jump to step 2 then) continue to carry out next time and transmit.
Claims (3)
1, the fault-tolerance approach in a kind of wireless sensor network is characterized in that may further comprise the steps:
1), the definition sensor node that is used for perception data in the wireless sensor network is source node, utilizes existing multipath routing algorithm, sets up the disjoint transmission path of 2N bar node between source node and base-station node;
2), at the source node end, the initial data that source node is perceived is divided into K information code, use then (N ', K) the RS correcting and eleting codes carries out RS to K information code and entangles that deleting encodes obtains the individual code element of N ', the individual code element of N ' comprises R
pAn individual redundant code and K information code, any N ' bar in the disjoint transmission path of 2N bar node that the individual code element of N ' is set up by step 1) is transferred to base-station node respectively, wherein, R
p=N '-K, N '≤2N, p represent the number of times of source node to the base-station node transmitted symbol;
3), at the base-station node end, after the information code or redundant code end of transmission of source node end the p time, base-station node carries out total number statistics to the code element that receives, the total number of code element that statistics is obtained is designated as L
p, judge L
pWhether more than or equal to the number K of information code, if L
pMore than or equal to K, then determine this time transmission success, the code element that receives can successfully be decoded obtains initial data; Otherwise, determine this time bust this;
4), utilization index moves weighted average method R
P+1=(1-λ) R
p+ λ (K-L
p) adjust the number of next redundant code waiting for transmission, the bar number that the transmission path of transmission next time needs is set according to the redundant code number of adjusting is K+ " R
P+1 
, return step 2 then) and carry out the transmission of initial data next time, wherein, R
P+1Be the p+1 time source node number to the redundant code of base-station node transmission, λ is the constant that index moves the weighted average memory depth, 0＜λ＜1, symbol "
" be the symbol that rounds up.
2, the fault-tolerance approach in a kind of wireless sensor network according to claim 1 is characterized in that any two transmission paths of the disjoint transmission path of described node between referring to from the source node to the base-station node all do not have the sensor node that intersects.
3, the fault-tolerance approach in a kind of wireless sensor network according to claim 1 is characterized in that λ in the described step 4)=0.25.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101637543A CN101448281B (en) | 2008-12-31 | 2008-12-31 | Fault-tolerance method in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101637543A CN101448281B (en) | 2008-12-31 | 2008-12-31 | Fault-tolerance method in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101448281A true CN101448281A (en) | 2009-06-03 |
| CN101448281B CN101448281B (en) | 2010-09-29 |
Family
ID=40743608
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101637543A Expired - Fee Related CN101448281B (en) | 2008-12-31 | 2008-12-31 | Fault-tolerance method in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101448281B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101840377A (en) * | 2010-05-13 | 2010-09-22 | 上海交通大学 | Data storage method based on RS (Reed-Solomon) erasure codes |
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN102740394A (en) * | 2012-07-19 | 2012-10-17 | 济南普赛通信技术有限公司 | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm |
| CN102740355A (en) * | 2011-04-04 | 2012-10-17 | 三星电机株式会社 | Method of reducing retransmission of data frame and receiving node therefor |
| CN103838605A (en) * | 2013-12-18 | 2014-06-04 | 浙江工商大学 | Wireless sensor network code distribution method with packet loss tolerance and confidentiality protection |
| CN111901088A (en) * | 2020-06-29 | 2020-11-06 | 浙江大学 | Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor |
-
2008
- 2008-12-31 CN CN2008101637543A patent/CN101448281B/en not_active Expired - Fee Related
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101840377A (en) * | 2010-05-13 | 2010-09-22 | 上海交通大学 | Data storage method based on RS (Reed-Solomon) erasure codes |
| CN101883330A (en) * | 2010-07-02 | 2010-11-10 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN101883330B (en) * | 2010-07-02 | 2012-07-11 | 湖南大学 | Network coding-based multicast routing method applied to vehicular ad hoc network |
| CN102740355A (en) * | 2011-04-04 | 2012-10-17 | 三星电机株式会社 | Method of reducing retransmission of data frame and receiving node therefor |
| CN102740394A (en) * | 2012-07-19 | 2012-10-17 | 济南普赛通信技术有限公司 | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm |
| CN102740394B (en) * | 2012-07-19 | 2014-11-12 | 济南普赛通信技术有限公司 | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm |
| CN103838605A (en) * | 2013-12-18 | 2014-06-04 | 浙江工商大学 | Wireless sensor network code distribution method with packet loss tolerance and confidentiality protection |
| CN103838605B (en) * | 2013-12-18 | 2017-07-28 | 浙江工商大学 | Tolerate with packet loss and the secret wireless sensor network code distribution method ensured |
| CN111901088A (en) * | 2020-06-29 | 2020-11-06 | 浙江大学 | Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor |
| CN111901088B (en) * | 2020-06-29 | 2021-10-01 | 浙江大学 | Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor |
| WO2022000435A1 (en) * | 2020-06-29 | 2022-01-06 | 浙江大学 | Method and device for allocating multipath transmission erasure coding block in underwater sensor self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101448281B (en) | 2010-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101448281B (en) | Fault-tolerance method in wireless sensor network | |
| CN101938334B (en) | Adaptive error control method combining random network coding and automatic repeat request | |
| CN101779378A (en) | Protected communication link with improved protection indication | |
| CN111835462B (en) | Wireless sensor network packet loss recovery method based on erasure codes | |
| CN108513701B (en) | Data transmission method, device, machine readable storage medium and system | |
| Singh et al. | An efficient forward error correction scheme for wireless sensor network | |
| CN102724021A (en) | Collaborative transmission method based on distributed interweaved and group encoding | |
| CN104539387A (en) | Hop-by-hop reliable transmission control method for underwater wireless sensor network | |
| CN101442314A (en) | Encoding/decoding method suitable for distribution synergic system element-changing self-adapting multiple LDPC code | |
| Dong et al. | Exploiting error estimating codes for packet length adaptation in low-power wireless networks | |
| CN102801495B (en) | Fountain-code-based telemetry data frame synchronization method | |
| CN100433614C (en) | A data packet recovery method | |
| KR101562309B1 (en) | Unidirectional data transmitting/receiving device capable of re-transmitting data through plurality of communication lines, and method of transferring data using the same | |
| KR20150074896A (en) | Methods for optimizing degree distribution of fountain code in broadcasting environment | |
| Alaoui et al. | Energy consumption in wireless sensor networks for network coding structure and ARQ protocol | |
| CN102638629A (en) | Shortwave modulator/demodulator and modulation/demodulation method thereof | |
| Schulz et al. | Efficient and reliable wireless communications through multi-connectivity and rateless coding | |
| KR101192201B1 (en) | Blind convolutional deinterleaving method using interleaving period | |
| CN101764668A (en) | Coding method of network low-density checking codes and coder thereof | |
| KR101048244B1 (en) | Data transmission method using Nakagami-n fading channel model and LCP protocol in wireless sensor network | |
| CN103346862A (en) | On-chip network data transmission device and method with cascade protection function | |
| Lechner et al. | Methods for analysing and improving the fault resilience of delay-insensitive codes | |
| Sulieman et al. | Enhanced diversity and network coded 5G wireless fog-based-fronthaul networks | |
| CN109417432A (en) | Data encoding and decoding | |
| Nikolic et al. | Reliable data transfer Rendezvous protocol in wireless sensor networks using 2D-SEC-DED encoding technique |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: LIN MINGANG Free format text: FORMER OWNER: NINGBO ZHONGKE IC DESIGN CENTER CO., LTD. Effective date: 20131030 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 315040 NINGBO, ZHEJIANG PROVINCE TO: 315600 NINGBO, ZHEJIANG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20131030 Address after: 315600 Zhejiang city of Ningbo province Ninghai Meilin Industrial Zone No. 11 Mei Yi Lu Patentee after: Lin Mingang Address before: 315040, Zhejiang province Ningbo science and Technology Park, academician Road, building 603 Patentee before: Ningbo Zhongke IC Design Center Co., Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: NINGBO ZHONGKE ZHIYUAN ELECTRONIC TECHNOLOGY CO., Free format text: FORMER OWNER: LIN MINGANG Effective date: 20140228 |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20140228 Address after: 315600 6, Lane 299, Guanghua Road, Ningbo hi tech Development Zone, Zhejiang, Ningbo Patentee after: Ningbo Zhongke Zhiyuan electronic Polytron Technologies Inc Address before: 315600 Zhejiang city of Ningbo province Ninghai Meilin Industrial Zone No. 11 Mei Yi Lu Patentee before: Lin Mingang |
|
| ASS | Succession or assignment of patent right |
Owner name: ZHEJIANG ZHONGKE ZHIYUAN VENTURE INVESTMENT CO., L Free format text: FORMER OWNER: NINGBO ZHONGKE ZHIYUAN ELECTRONIC TECHNOLOGY CO., LTD. Effective date: 20150216 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 315600 NINGBO, ZHEJIANG PROVINCE TO: 315103 NINGBO, ZHEJIANG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20150216 Address after: 315103, No. 299, Guanghua Road, Guanghua District, Ningbo hi tech Zone, Zhejiang, 11, 12, 15, 008, 6, 3-1, 3-2 Patentee after: Zhejiang Zhongke Zhiyuan Venture Capital Co., Ltd. Address before: 315600 6, Lane 299, Guanghua Road, Ningbo hi tech Development Zone, Zhejiang, Ningbo Patentee before: Ningbo Zhongke Zhiyuan electronic Polytron Technologies Inc |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100929 Termination date: 20161231 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |