CN102256268B - Based on the fault-tolerance approach of random walk in wireless sense network - Google Patents
Based on the fault-tolerance approach of random walk in wireless sense network Download PDFInfo
- Publication number
- CN102256268B CN102256268B CN201010176659.4A CN201010176659A CN102256268B CN 102256268 B CN102256268 B CN 102256268B CN 201010176659 A CN201010176659 A CN 201010176659A CN 102256268 B CN102256268 B CN 102256268B
- Authority
- CN
- China
- Prior art keywords
- leader cluster
- node
- cluster node
- neighbours
- 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.)
- Active
Links
- 238000005295 random walk Methods 0.000 title claims abstract description 28
- 238000013459 approach Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 23
- 230000008569 process Effects 0.000 claims abstract description 14
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 5
- 230000005540 biological transmission Effects 0.000 abstract description 5
- 238000013480 data collection Methods 0.000 abstract description 2
- 230000007246 mechanism Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- KSOGRLJDZWTTBM-UHFFFAOYSA-N 1-[2-(4-methoxyphenyl)phenyl]-2-[4-(2-pyrrolidin-1-ylethoxy)phenyl]ethanone Chemical compound C1=CC(OC)=CC=C1C1=CC=CC=C1C(=O)CC(C=C1)=CC=C1OCCN1CCCC1 KSOGRLJDZWTTBM-UHFFFAOYSA-N 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 238000006116 polymerization reaction Methods 0.000 description 2
- 238000012552 review Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 241000196324 Embryophyta Species 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000009365 direct transmission Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- CCEKAJIANROZEO-UHFFFAOYSA-N sulfluramid Chemical group CCNS(=O)(=O)C(F)(F)C(F)(F)C(F)(F)C(F)(F)C(F)(F)C(F)(F)C(F)(F)C(F)(F)F CCEKAJIANROZEO-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the fault-tolerance approach based on random walk in a kind of wireless sense network, comprise the following steps: the m formed with base station and its neighbours' leader cluster node
0individual node respectively as initial point, and makes base station be connected between two with them; Stochastic choice leader cluster node j is as the starting point of random walk; Walker is according to probability ∏ (i) of energy of neighbours' leader cluster node i depending on current cluster head node j, run to described neighbours' leader cluster node i, and described neighbours' leader cluster node i is marked, then repeat described walking process, until m < m
0individual different leader cluster node is labeled; If random walk person reaches marked leader cluster node, then new walking is from described marked leader cluster node.The present invention can make the network topology formed when communicating between bunch head have the feature of the very strong scales-free network of fault-tolerance, thus improves the reliability of Data Collection and transmission.
Description
Technical field
The present invention relates to wireless sensor network technology, particularly in a kind of wireless sense network based on the fault-tolerance approach of random walk.
Background technology
The self-organization distribution network system that wireless sensor network is made up of minute sense device node that is ubiquitous, that have radio communication and computing capability in a large number.The development of the communication technology makes people no longer be satisfied with single-sensor independently to carry out perception to environment, but wish by the mutual cooperation between transducer and the monitoring task having communicated more extensive Yu meticulous, and the result of the data of monitoring and part process is sent to corresponding user by network, completes more complicated calculating, analysis and process.Because wireless sensor network supports without the need to permanent plant, can rapid deployment, have simultaneously be easy to networking, not by the advantage such as constraint of cable network, will be widely used in that disaster is saved oneself, medical aid, environment measuring, risk of forest fire warning, volcano monitoring and military field.
In the world, wireless sensor network causes the very big concern of academia, military circles and industrial quarters, the R&D organization of many important computers and radio communication has profoundly recognized this problem, has carried out the basic theory of wireless sensor network and the research of key technology.The wireless sensor network be made up of microsensor node at present has developed into an important computing platform.Complex network is the new branch of science developed rapidly, the achievement in research of large amount of complex network is published on the physics journals such as " Physical Review Letters ", " Physical Review E ", " Physica A " and " PANS " and the comprehensive journals such as " Nature " and " Science " in recent years, reflect that from a side complex network has become the new study hotspot of of physics circle, its theoretical foundation is statistical physics.
The main task of wireless sensor network sends the data that sensor node in network is collected to base station, and a kind of most straightforward procedure realizing this task is direct transmission, and each node namely in network directly sends base station to the data of collecting.But for the wireless sensor node away from base station, this makes node very fast dead by making the energy cost of node transmission data consumes too high.For addressing this problem, some algorithms for the purpose of conserve energy are suggested in succession, at present compared with main flow is LEACH algorithm, first it select operative sensor node as a bunch head at random in the mode of self-organizing, then bunch head selected is broadcasted, ordinary node selects a nearest bunch head to add according to the power of acknowledge(ment) signal, and with this bunch first formation bunch.Bunch then the member node in sends a bunch head to the data of collecting, bunch head by bunch in all member node data of collecting be polymerized with the data that this section point is collected after issue base station.
Separately it is worth mentioning that PEGASIS agreement.This agreement forms a chain wireless sensor node greedy algorithms all in system, in each is taken turns, arbitrary node receives data and the data aggregate of the data received with this node from the adjacent contact be positioned at chain, then the data after being polymerized is sent to another the adjacent contact on chain.This transmission and polymerization are from the end node on chain, along link until specified node, then by specified node, the data of last polymerization are sent to base station.Compared with LEACH agreement, the node of PEGASIS agreement and base station direct communication is less and data aggregate ability is stronger, thus decreases each energy loss of taking turns.But PEGASIS algorithm is that the whole joint structures in network are become a chain, if a certain node on chain is dead, make all loss of datas from the end of the chain to this node, therefore the poor fault tolerance of PEGASIS.PEDAP agreement has further developed PEGASIS agreement, its core concept is that all joint structures of wireless sensor network are become a minimum sink tree (Minimum Spanning Tree), after often crossing certain wheel number, PEDAP agreement need base station recalculate routing iinformation be used for get rid of death nodes.But for this centralized algorithm of PEDAP, if when node is dead because non-energy exhausts, then base station cannot be got rid of this kind of fault and still calculate minimum sink tree according to original information, thus have impact on the reliability of network topology.In actual applications, wireless sensor network is often deployed in the area that people are difficult to safeguard, under the impact of adverse circumstances factor, sensor node generally has higher failure rate, when one or more node failure in network, the data of collection will be lost.Therefore people wish that wireless sensor network topology has good robustness, and when part of nodes can be subject to energy and harsh environmental effects and lose efficacy, partial failure should not cause the ability losing global network transmission information.
Research at present for wireless sensor network structural fault tolerance relates to less.Existing document and patent all concentrate on and construct the heavy overlay network of k or increase working node to carry out, although these redundancy schemes meet the requirement of fault-tolerance, but owing to adding the node number participating in communication, thus reduce the performance of system, have impact on the life-span of network.The result of study of Complex Networks Theory shows, the fault-tolerant ability of complication system is not only present in the system that these have redundant component, and be present in too there is uncalibrated visual servo feature network among.
Summary of the invention
The object of this invention is to provide the fault-tolerance approach based on random walk in a kind of wireless sense network, to solve the defect of the fault-tolerant ability difference of prior art.
Fault-tolerance approach based on random walk in wireless sense network provided by the invention comprises the following steps:
1) with the m that base station and its neighbours' leader cluster node form
0individual node respectively as initial point, and makes base station be connected between two with them;
2) Stochastic choice leader cluster node j is as the starting point of random walk;
3) walker is according to probability Π (i) of energy of neighbours' leader cluster node i depending on current cluster head node j, run to described neighbours' leader cluster node i, and described neighbours' leader cluster node i is marked, then repeat described walking process, until m < m
0individual different leader cluster node is labeled;
4) if random walk person reaches marked leader cluster node, then new walking is from described marked leader cluster node.
Wherein, m
0positive integer is respectively with m.
Wherein, when a new leader cluster node add and be connected to m be labeled leader cluster node time, whole process is from step 2) repetition, until all leader cluster nodes in wireless sensor network are all interconnected.
Wherein, in step 3) in, described probability Π (i) is:
Wherein k
jfor the degree of leader cluster node j, E
ifor the energy of neighbours' leader cluster node, Ek
jfor the energy of leader cluster node j.
Wherein, at the m formed with base station and its neighbours' leader cluster node
0individual node, respectively as before initial point, forms the leader cluster node be evenly distributed in the wireless sensor network of large scale deployment.
Compared with prior art, this patent, by means of Complex Networks Theory, proposes a kind of fault tolerant mechanism of brand-new wireless sensor network structure.First in the wireless sensor network in large scale deployment, form the leader cluster node be evenly distributed, then adopt random walk bunch between mechanism of Evolution, make the network topology formed when communicating between bunch head have the feature of the very strong scales-free network of fault-tolerance, thus improve the reliability of Data Collection and transmission.
Accompanying drawing explanation
Fig. 1 is the schematic diagram based on the fault-tolerance approach of random walk in display wireless sense network of the present invention.
Embodiment
Below in conjunction with accompanying drawing to a preferred embodiment of the present invention will be described in detail, should be appreciated that following illustrated preferred embodiment is only for instruction and explanation of the present invention, is not intended to limit the present invention.
Fig. 1 shows the fault-tolerance approach based on random walk in wireless sense network of the present invention, and as shown in Figure 1, the fault-tolerance approach based on random walk in wireless sense network of the present invention comprises the following steps:
1) with the m that base station and its neighbours' leader cluster node form
0individual node respectively as initial point, and makes base station be connected between two with them;
2) Stochastic choice leader cluster node j is as the starting point of random walk;
3) walker is according to probability Π (i) of energy of neighbours' leader cluster node i depending on current cluster head node j, run to described neighbours' leader cluster node i, and described neighbours' leader cluster node i is marked, then repeat described walking process, until m < m
0individual different leader cluster node is labeled;
4) if random walk person reaches marked leader cluster node, then new walking is from described marked leader cluster node.
When a new leader cluster node add and be connected to m be labeled leader cluster node time, whole process is from step 2) repetition, until all leader cluster nodes in wireless sensor network are all interconnected.
In step 3) in, described probability Π (i) is:
Wherein k
jfor the degree of leader cluster node j, E
ifor the energy of neighbours' leader cluster node, Ek
jfor the energy of leader cluster node j.
Wireless sensor network cluster intermediate node of the present invention initiatively outwards can connect by adding new node, and when selecting the next node of new bunch of intermediate node, and the probability that new node is connected to next node should depend on the preference dependency of node energy.The network topology be evolved into like this has good stability and reliability, enhances the fault-tolerant and anti-attack ability of topology between network cluster.
The present invention relates to the mechanism of following generation scales-free network---Barabasi-Albert scale-free model and random walk method, be described in detail to the fault-tolerance approach based on random walk in wireless sense network of the present invention below in conjunction with scale-free model and random walk method.
(1) Barabasi-Albert uncalibrated visual servo (scale-f ree) model
In the research of complex network, it is found that the distribution p (k) of the many network node degree of occurring in nature meets power law distribution, people usually call scales-free network (scale-freenetworks) this kind of network.It is a good Forming Mechanism that the formation of scales-free network thinks that preference depends at present, is defined as following two steps:
1. grow.With a small amount of m
0individual node starts, and in each time step, in the network existed, adds a new node, adds m (the < m that from then on node sets out simultaneously
0) bar limit, form new network;
2. preference depends on.Selection newly added node with exist node be connected time, suppose that probability Π (ki) that new node is connected with node i depends on the degree k of node i
i, and this probability obeys following rule:
Π(k
i)＝k
i/∑k
j
∑ k in formula
jall summations that there is the degree of node.After t time step, formation one is had N=t+m by this model
0individual node, the random network on mt bar limit, the degree of nodes meets power law distribution, i.e. p (k) ~ 2m
2/ k
3.
(2) scales-free network of random walk generation
The evolution of network is the process of the father's node selecting newly added node of being come up by a series of random row, and it is a kind of evolution method of subrange obviously.This mechanism can produce scales-free network, and distribution and the famous Barabasi-Albert model of its degree have identical form, i.e. p (k) ~ 2m
2/ k
3.Its algorithm is as follows:
1. initial phase, network has m
0individual node, and be connected with each other.
2. Stochastic choice node is as the starting point of random walk.
3. each walking is walked, and walker runs to a neighbor node be selected at random, and after random walk length is 1 step, the node that walking arrives is labeled, and walking process is repeated until m < m
0individual different node is labeled.
4. a new node adds network and is connected to m the node be labeled by different limits.From step 2., whole process is constantly repeated until that network growth is to N number of node.
The present invention realizes evolution topological between wireless sensor network cluster by means of the mechanism of random walk, consider the current energy value of node, when selecting newly to add the father node of leader cluster node, preference dependency now depends on the current energy value of node and is no longer the degree of node.Dynamic analysis shows, such network has the feature of scales-free network.Between of the present invention bunch, the mechanism of Evolution of topology is as follows:
1. initialization: the m formed with base station and its neighbours' leader cluster node
0individual node as initial point, and makes base station be connected between two with them.
2. Stochastic choice leader cluster node is as the starting point of random walk.
3. each walking is walked, and probability Π (i) that walker runs to the neighbor node i of current cluster head node j depends on the energy value E that it is current
i
K in formula
jfor the degree of leader cluster node j, node i is labeled subsequently, and walking process is repeated until m < m
0individual different leader cluster node is labeled.
If 4. random walk person reaches marked leader cluster node, then new walking is from this leader cluster node.
5. a new leader cluster node adds and is connected to m the leader cluster node be labeled, whole process from step 2. be repeated until that all leader cluster nodes in wireless sensor network are all interconnected.
Validity due to energy of wireless sensor network is one of the key issue that should pay close attention to of researcher all the time, therefore this present invention propose bunch between the mechanism of Evolution of topology when selecting the interconnection of bunch head, using the current energy value of leader cluster node as the basis for estimation when connecting, according to bunch between topology mechanism of Evolution, for the node with higher-energy value, greatly increased by the possibility of discretionary interconnections.Because choosing of leader cluster node is dynamic change, therefore the method can maintain the equilibrium of whole nodes energy, the phenomenon that can effectively avoid part of nodes to wither away too early because of exhausting of energy.
Although above to invention has been detailed description, the present invention is not limited thereto, those skilled in the art of the present technique can carry out various amendment according to principle of the present invention.Therefore, all amendments done according to the principle of the invention, all should be understood to fall into protection scope of the present invention.
Claims (4)
1. in wireless sense network based on a fault-tolerance approach for random walk, comprise the following steps:
1) m0 the node formed using base station and its neighbours' leader cluster node as initial point, and makes base station be connected between two with them;
2) Stochastic choice leader cluster node j is as the starting point of random walk;
3) walker is according to probability Π (i) of energy of neighbours' leader cluster node i depending on current cluster head node j, run to described neighbours' leader cluster node i, and described neighbours' leader cluster node i is marked, then described walking process is repeated, until m < m0 different leader cluster node is labeled;
Described probability Π (i) is:
Wherein kj is the degree of leader cluster node j, and Ei is the energy of neighbours' leader cluster node, and Ekj is the energy of leader cluster node j.
2. method according to claim 1, wherein, when random walk person reaches marked leader cluster node, new walking is from described marked leader cluster node.
3. method according to claim 1, when one of them new leader cluster node adds and is connected to the leader cluster node that m is labeled, whole process is from step 2) repetition, until all leader cluster nodes in wireless sensor network are all interconnected.
4. method according to claim 1, wherein, before using m0 node of base station and its neighbours' leader cluster node composition as initial point, forms the leader cluster node be evenly distributed in the wireless sensor network of large scale deployment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010176659.4A CN102256268B (en) | 2010-05-19 | 2010-05-19 | Based on the fault-tolerance approach of random walk in wireless sense network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010176659.4A CN102256268B (en) | 2010-05-19 | 2010-05-19 | Based on the fault-tolerance approach of random walk in wireless sense network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102256268A CN102256268A (en) | 2011-11-23 |
| CN102256268B true CN102256268B (en) | 2015-08-05 |
Family
ID=44983197
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010176659.4A Active CN102256268B (en) | 2010-05-19 | 2010-05-19 | Based on the fault-tolerance approach of random walk in wireless sense network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102256268B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103780459B (en) * | 2014-01-13 | 2017-07-11 | 哈尔滨工程大学 | With the network evolution method of Connection Density in class between a kind of invariance class |
| CN107426000B (en) * | 2017-04-24 | 2019-08-16 | 北京航空航天大学 | A kind of network robustness appraisal procedure and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039321A (en) * | 2007-02-02 | 2007-09-19 | 南京邮电大学 | Mixed mobile agent-based wireless sensor network data transmission method |
| CN101635975A (en) * | 2009-08-04 | 2010-01-27 | 西北大学 | Method for collecting and routing data in wireless sensor network and device thereof |
| WO2010045954A1 (en) * | 2008-10-22 | 2010-04-29 | Telecom Italia S.P.A. | Method for setting the operation of a routing node of an asynchronous wireless communication network, network node and communication network implementing the method |
-
2010
- 2010-05-19 CN CN201010176659.4A patent/CN102256268B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039321A (en) * | 2007-02-02 | 2007-09-19 | 南京邮电大学 | Mixed mobile agent-based wireless sensor network data transmission method |
| WO2010045954A1 (en) * | 2008-10-22 | 2010-04-29 | Telecom Italia S.P.A. | Method for setting the operation of a routing node of an asynchronous wireless communication network, network node and communication network implementing the method |
| CN101635975A (en) * | 2009-08-04 | 2010-01-27 | 西北大学 | Method for collecting and routing data in wireless sensor network and device thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102256268A (en) | 2011-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101848529B (en) | Method for compressing multiple principle component analysis data of wireless sensor network | |
| CN105554844B (en) | A kind of wireless sensor network topology construction method | |
| CN103906164B (en) | Maritime search and rescue wireless sensor network topology and topology control method | |
| CN112615365B (en) | Smart power grid vulnerability key point identification method and device | |
| CN109145428A (en) | A kind of information physical emerging system vulnerability assessment method under cascading failure mode | |
| CN103298009B (en) | The modeling of complicated wireless network control system and fault propagation method | |
| CN105242156B (en) | A kind of performance reliability assessment method towards electric power networks | |
| Tang et al. | A novel data retrieving mechanism in wireless sensor networks with path-limited mobile sink | |
| CN104010329B (en) | Based on the distributed load equalizing method for quantifying unbiased broadcast Gossip algorithm | |
| CN103260170B (en) | A kind of Internet of things node dispositions method | |
| CN103152817A (en) | Distributed clock synchronizing method based on broadcast Gossip algorithm | |
| CN101414952A (en) | Expandable parallel calculation interconnection network topological structure based on hypercube | |
| CN102740394B (en) | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm | |
| CN102256268B (en) | Based on the fault-tolerance approach of random walk in wireless sense network | |
| CN102355752B (en) | Wireless sensor network compressed sensing measurement matrix based on expander graph and reconfiguring method | |
| CN103037467B (en) | Method and device for fusing data of wireless sensor network | |
| CN109361556A (en) | A kind of key node cognitive method based on node entropy and structural hole | |
| Dong et al. | Constructing core backbone network based on survivability of power grid | |
| Abedi et al. | Fault tolerance analysis of heterogeneous wireless sensor network | |
| CN103533674B (en) | The method of the data acquisition of a kind of sub-clustering water sound sensor network and transmission | |
| Nidhya et al. | Conniving energy and time delay factor to model reliability for wireless sensor networks | |
| Chuang et al. | Hypercube-based data gathering in wireless sensor networks | |
| CN103763171B (en) | Construction method for interconnection network of massively parallel computing system | |
| He et al. | On Practical Reconstruction of Quality Virtual Backbones in Heterogeneous Wireless Sensor Networks with Faulty Nodes | |
| CN104599197B (en) | Intelligent substation protection system reliability layering equivalence 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Random-walk-based fault tolerance method for wireless sensor network Effective date of registration: 20170110 Granted publication date: 20150805 Pledgee: China Co truction Bank Corp Beijing Zhongguancun branch Pledgor: Beijing Sincode Science & Technology Co., Ltd. Registration number: 2017990000022 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20180326 Granted publication date: 20150805 Pledgee: China Co truction Bank Corp Beijing Zhongguancun branch Pledgor: Beijing Sincode Science & Technology Co., Ltd. Registration number: 2017990000022 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Random-walk-based fault tolerance method for wireless sensor network Effective date of registration: 20180329 Granted publication date: 20150805 Pledgee: China Co truction Bank Corp Beijing Zhongguancun branch Pledgor: Beijing Sincode Science & Technology Co., Ltd. Registration number: 2018110000005 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20201113 Granted publication date: 20150805 Pledgee: China Co. truction Bank Corp Beijing Zhongguancun branch Pledgor: BEIJING SINCODE SCIENCE & TECHNOLOGY Co.,Ltd. Registration number: 2018110000005 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201215 Address after: 225500 south of Fuyuan Road, Luo Tang street, Jiangyan District, Taizhou, Jiangsu, China Patentee after: XINGKEDI TECHNOLOGY (TAIZHOU) Co.,Ltd. Address before: 100091 Beijing city Haidian District Chapeng Road No. 2 Patentee before: BEIJING SINCODE SCIENCE & TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |