CN109688593B - Charging base station deployment method based on core node rule - Google Patents
Charging base station deployment method based on core node rule Download PDFInfo
- Publication number
- CN109688593B CN109688593B CN201910023267.5A CN201910023267A CN109688593B CN 109688593 B CN109688593 B CN 109688593B CN 201910023267 A CN201910023267 A CN 201910023267A CN 109688593 B CN109688593 B CN 109688593B
- Authority
- CN
- China
- Prior art keywords
- base station
- node
- charging base
- nodes
- common
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a charging base station deployment method based on core node rules. The existing charging base station deployment method is high in strategy complexity. The invention is as follows: firstly, establishing a plane rectangular coordinate system. And secondly, determining a core node in the wireless sensor network. And thirdly, dividing the wireless sensor network into different areas according to each core node. And fourthly, updating the position of the charging base station to cover more wireless chargeable sensors. And fifthly, arranging the charging base station into the wireless sensor network according to the coordinates of the positions of the charging base stations in the final charging base station set. According to the invention, the sensors are deployed with the charging base station according to the specific distance between the sensors. By setting the core nodes, the wireless sensor network is divided into different small areas, the repeated charging area of the charging base station is reduced as much as possible, and the number of the charging base stations is optimized.
Description
Technical Field
The invention belongs to the technical field of wireless chargeable sensor network energy transmission, and particularly relates to a charging base station deployment method based on core node rules.
Background
With the continuous development of the internet of things technology, people's demand for wireless sensor networks is increasing. And setting a charging base station in the wireless sensor network, and further supplementing energy to the sensor. The process of actively setting up an energy source and then charging the sensor in a wireless mode forms a wireless chargeable sensor network. The energy of the sensor is effectively supplemented by the appearance of the wireless chargeable sensor network. Among them, the location and number of the established base stations are the most important issues. Because the construction cost of the wireless charging base station is generally very high, if the whole network can be covered by the charging base stations as few as possible and the energy of the sensors can be supplemented within the limited range of the sensor network, the charging cost can be greatly reduced, and the economical efficiency can be improved.
Related researchers have conducted planning research from different aspects with respect to a wireless sensor network charging base station deployment method. Xu cheng hua et al in the patent "directional charging base station deployment method of wireless chargeable sensor network" (patent number: 201610279938.0) propose that energy is supplemented to the sensor network by setting up a directional base station, and the directional charging base station needs to rotate its angle for each charging to meet the charging requirement of sensors in a certain area and cannot guarantee the charging real-time requirement of all common nodes.
Welch and Henchun et al propose a novel routing method in a wireless chargeable sensor network clustering and clustering routing method (patent number: 201711081873.X), so that mobile energy supplement equipment can better perform wireless energy supplement on a network. However, the complexity of the strategy is high, and when the mobile charging device supplements energy to the sensor, the coils are not easy to align, so that the charging efficiency is affected.
Disclosure of Invention
The invention aims to provide a charging base station deployment method of a wireless chargeable sensor network aiming at the problems that the charging of a directional charging base station cannot be fully covered and a supplementary energy coil of a mobile device is not easy to align, so that the charging base stations with the minimum number are deployed on the premise of ensuring that all sensors in the whole wireless sensor network can continuously work, and the charging cost of the whole wireless sensor network is reduced.
The method comprises the following specific steps:
step 1, establishing a plane rectangular coordinate system. The positions of the n wireless chargeable sensors correspond to the n common nodes. The n common nodes form a common node set S. And establishing a transition node set Q ═ S.
And 2, determining a core node in the wireless sensor network.
2-1, selecting the common node closest to the origin of coordinates of the rectangular coordinate system of the distance plane in the common node set S as a first core node p1Adding a core node set P and a first pre-cover set C1(ii) a Merging a set of transit nodes Q to a first core node p1The common nodes with the distance less than 2R are deleted from the transition node set Q and added into a first pre-covering set C1In (1). And R is the charging radius of the omnidirectional charging base station. Assign 1 to i.
2-2, selecting the ith core node p from the transition node set QiIs used as the i +1 th core node pi+1. Will go to the (i + 1) th core node pi+1The ordinary nodes with the distance less than 2R are deleted from the transitional node set Q, and the ith pre-covering set is added. Then step 2-3 is entered.
2-3, if common nodes exist in the transition node set Q, increasing i by 1, and repeating the step 2-2; otherwise, go to step 3.
And 3, dividing the wireless sensor network into different areas according to each core node.
3-1.i ═ 1,2, …, m, and step 3-2 was performed sequentially. And (3) assigning the number of the core nodes determined in the step (2) to m.
3-2, obtaining the ith pre-covering set CiCoordinates (a) of the corresponding charging base station positioni,bi)；aiEquals the ith pre-cover set CiAverage of the abscissas of all common nodes within. biEqual to the mean of the ordinates of all the common nodes in the ith pre-coverage set. Ith Pre-cover set CiInner, and coordinate (a)i,bi) The common nodes with the distance less than R form the ith real coverage set Di。
And 4, step 4: and updating the position of the charging base station to cover more wireless chargeable sensors.
And 4-1, taking the common nodes with the distances between the common node set S and all the charging base stations larger than R as uncovered nodes, and adding the uncovered node set W.
4-2.i ═ 1,2, …, v, steps 4-3 to 4-5 were performed in that order. v is the number of uncovered nodes in the set of uncovered nodes W.
And 4-3, selecting the charging base station position closest to the ith uncovered node as the updated base station position. The coordinates of the updated base station location are (a, B).
4-4, calculating the distance between the ith uncovered node and the updated base station
Wherein XiThe abscissa of the ith uncovered node; y isiIs the ordinate of the ith uncovered node; candidate update coordinates (a ', B') of the updated base station are calculated. A' ═ a + (d-R) · (X)i-A)/d；B′＝B+(d-R)·(Yi-B)/d。
And 4-5, if the distances from all the common nodes to the coordinates (A ', B') in the real coverage set corresponding to the updated base station are less than or equal to R, updating the coordinates of the updated base station to (A ', B'), and adding the ith uncovered node into the real coverage set corresponding to the updated base station.
And 4-6, adding the positions of all the charging base stations into a final charging base station set Z. And deleting all common nodes in the real coverage set corresponding to each charging base station from the common node set S. Thereafter, the process proceeds to step 5.
Step 5, if there are common nodes in the common node set S, making the transition node set Q equal to S, and repeatedly executing steps 2, 3, and 4; otherwise, go to step 6.
And 6, arranging the charging base station into the wireless sensor network according to the coordinates of the positions of the charging base stations in the final charging base station set.
Further, in step 1, all the n wireless chargeable sensors are located in the first quadrant of the plane orthogonal coordinate system.
The invention has the beneficial effects that:
according to the invention, the sensors are deployed with the charging base station according to the specific distance between the sensors. By setting the core nodes, the wireless sensor network is divided into different small areas, the repeated charging area of the charging base station is reduced as much as possible, and the number of the charging base stations is optimized.
Drawings
FIG. 1 is a diagram illustrating the distribution of common nodes and core nodes in an example of the present invention;
FIG. 2 is a schematic diagram of a pre-coverage set of core nodes in an example of the present invention;
fig. 3 is a schematic diagram of charging base stations and their real coverage sets in an example of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The invention aims at a charging base station deployment scene that all wireless chargeable sensors in a wireless sensor network are arranged on the same plane, and except that the consumed power of each wireless chargeable sensor is different, the other specifications are the same. One wirelessly rechargeable sensor may be simultaneously charged by multiple charging base stations. The charging base station is an omnidirectional charging base station with the same specification, and the effective charging area of the charging base station is a circle with the center of the circle and the radius of the circle as R. The wirelessly rechargeable sensor may continue to operate as long as it is within the charging area of any one of the charging base stations. The charging base station can charge a plurality of wireless chargeable sensors at the same moment. N wireless chargeable sensors with random and known positions are arranged on a deployment plane of the wireless sensor network.
A charging base station deployment method of a wireless chargeable sensor network comprises the following specific steps:
step 1, establishing a WRSN model, and deploying a wireless chargeable sensor network consisting of n sensors in a given range; the method comprises the following specific steps:
establishing a plane rectangular coordinate system to ensure that all the n wireless chargeable sensors are positioned on a plane rectangular seatThe first quadrant of the system. The positions of the n wireless chargeable sensors correspond to the n common nodes. n common nodes form a common node set S ═ S1,S2,…,SN}. And establishing a transition node set Q ═ S.
Step 2, determining a core node in the wireless sensor network, specifically comprising the following steps:
2-1, selecting the common node closest to the origin of coordinates of the rectangular coordinate system of the distance plane in the common node set S as a first core node p1Adding a core node set P and a first pre-coverage set C1(ii) a Merging a set of transit nodes Q to a first core node p1The common nodes with the distance less than 2R are deleted from the transition node set Q and added into the first pre-coverage set C1In (1). And R is the charging radius of the omnidirectional charging base station. Assign 1 to i.
2-2, selecting the ith core node p from the transition node set QiIs used as the i +1 th core node pi+1. Centering a transition node set Q to an i +1 th core node pi+1The ordinary nodes with the distance less than 2R are deleted from the transitional node set Q, and the ith pre-covering set is added. Then step 2-3 is entered.
2-3, if common nodes exist in the transition node set Q, increasing i by 1, and repeating the step 2-2; otherwise, go to step 3.
And 3, dividing the wireless sensor network into different areas according to each core node, wherein the specific steps are as follows:
3-1.i ═ 1,2, …, m, and step 3-2 was performed sequentially. And (3) assigning the number of the core nodes determined in the step (2) to m.
3-2, obtaining the ith pre-covering set CiCoordinates (a) of the corresponding charging base station positioni,bi)；aiEquals the ith pre-cover set CiAverage of the abscissas of all common nodes within. biEqual to the mean of the ordinates of all the common nodes in the ith pre-coverage set. Ith Pre-cover set CiInner, and coordinate (a)i,bi) Common node group of less than RTo the ith real coverage set Di。
And 4, step 4: and updating the position of the charging base station to cover more wireless chargeable sensors.
And 4-1, taking the common nodes with the distances between the common node set S and all the charging base stations larger than R as uncovered nodes, and adding the uncovered node set W.
4-2.i ═ 1,2, …, v, steps 4-3 to 4-5 were performed in that order. v is the number of uncovered nodes in the set of uncovered nodes W.
And 4-3, selecting the charging base station position closest to the ith uncovered node as the updated base station position. The coordinates of the updated base station location are (a, B). Coordinates (A, B) are coordinates (a)1,b1) To the coordinate (a)m,bm) The coordinate closest to the ith uncovered node.
4-4, calculating the distance between the ith uncovered node and the updated base station
Wherein XiThe abscissa of the ith uncovered node; y isiIs the ordinate of the ith uncovered node; candidate update coordinates (a ', B') of the updated base station are calculated. A' ═ a + (d-R) · (X)i-A)/d；B′＝B+(d-R)·(Yi-B)/d。
4-5, calculating the distance between each common node in the real coverage set corresponding to the updated base station and the coordinates (A ', B'). If the distances from all common nodes to the coordinates (A ', B') in the real coverage set corresponding to the updated base station are smaller than or equal to R, updating the coordinates of the updated base station to (A ', B'), and adding the ith uncovered node into the real coverage set corresponding to the updated base station; otherwise, the coordinates of the updated base station are not updated.
And 4-6, adding the positions of all the charging base stations into a final charging base station set Z. And deleting all common nodes in the real coverage set corresponding to each charging base station from the common node set S. Thereafter, the process proceeds to step 5.
Step 5, if common nodes exist in the common node set S, copying all common nodes in the common node set S into a transition node set Q (i.e., the transition node set Q is equal to S), setting all the core node set P, the uncovered node set W, all the pre-coverage sets and all the real coverage sets as empty sets, and repeatedly executing steps 2, 3 and 4 to increase the coverage of the charging base station on all the wireless chargeable sensors; otherwise, go to step 6.
And 6, arranging the real charging base station into the wireless sensor network according to the coordinates of the positions of the charging base stations in the final charging base station set to charge the n wireless chargeable sensors. And each charging base station charges the wireless chargeable sensor in the corresponding real coverage set.
In the wireless chargeable sensor network shown in fig. 1, the charging base station deployment is performed as shown in fig. 1,2 and 3. Determining the common node A as a first core node according to the step 2; and finding out core nodes B, C, D, E, F and G in sequence.
The pre-coverage set of each core node is shown in fig. 2, and each ring in fig. 2 is the pre-coverage set corresponding to the core node in the ring.
The positions of the charging base stations and the corresponding real coverage sets thereof are shown in fig. 3, and each circle in fig. 3 is the real coverage set corresponding to the charging base station at the center of the circle.
Claims (2)
1. A charging base station deployment method based on core node rules is characterized in that: step 1, establishing a plane rectangular coordinate system; the positions of the n wireless chargeable sensors correspond to the n common nodes; n common nodes form a common node set S; establishing a transition node set Q ═ S;
step 2, determining a core node in the wireless sensor network;
2-1, selecting the common node closest to the origin of coordinates of the rectangular coordinate system of the distance plane in the common node set S as a first core node p1Adding a core node set P and a first pre-cover set C1(ii) a Merging a set of transit nodes Q to a first core node p1Common nodes with a distance less than 2RDeleting from the transitional node set Q and adding a first pre-cover set C1Performing the following steps; r is the charging radius of the omnidirectional charging base station; assigning 1 to i;
2-2, selecting the ith core node p from the transition node set QiIs used as the i +1 th core node pi+1(ii) a Will go to the (i + 1) th core node pi+1Common nodes with the distance less than 2R are deleted from the transition node set Q and added into the ith pre-covering set; then entering step 2-3;
2-3, if common nodes exist in the transition node set Q, increasing i by 1, and repeating the step 2-2; otherwise, entering step 3;
step 3, dividing the wireless sensor network into different areas according to each core node;
3-1.i ═ 1,2, …, m, and performing step 3-2 in that order; assigning the number of the core nodes determined in the step 2 to m;
3-2, obtaining the ith pre-covering set CiCoordinates (a) of the corresponding charging base station positioni,bi)；aiEquals the ith pre-cover set CiAverage value of horizontal coordinates of all common nodes in the node; biEqual to the average value of the vertical coordinates of all common nodes in the ith pre-covering set; ith Pre-cover set CiInner, and coordinate (a)i,bi) The common nodes with the distance less than R form the ith real coverage set Di；
And 4, step 4: updating the charging base station location to cover more wireless chargeable sensors;
4-1, taking the common nodes with the distances between the common node set S and all the charging base stations larger than R as uncovered nodes, and adding the uncovered nodes into an uncovered node set W;
4-2.i ═ 1,2, …, v, steps 4-3 to 4-5 are performed in that order; v is the number of uncovered nodes in the uncovered node set W;
4-3, selecting the position of the charging base station closest to the ith uncovered node as the position of the updated base station; the coordinates of the updated base station position are (A, B);
4-4. calculating the ith uncovered node and the quiltUpdating the range of a base station
Wherein XiThe abscissa of the ith uncovered node; y isiIs the ordinate of the ith uncovered node; calculating candidate update coordinates (a ', B') of the updated base station; a' ═ a + (d-R) · (X)i-A)/d；B′＝B+(d-R)·(Yi-B)/d；
4-5, if the distances from all common nodes to the coordinates (A ', B') in the real coverage set corresponding to the updated base station are less than or equal to R, updating the coordinates of the updated base station to (A ', B'), and adding the ith uncovered node into the real coverage set corresponding to the updated base station;
4-6, adding the positions of all charging base stations into a final charging base station set Z; deleting all common nodes in the real coverage set corresponding to each charging base station from the common node set S; then, entering step 5;
step 5, if there are common nodes in the common node set S, making the transition node set Q equal to S, and repeatedly executing steps 2, 3, and 4; otherwise, entering step 6;
and 6, arranging the charging base station into the wireless sensor network according to the coordinates of the positions of the charging base stations in the final charging base station set.
2. The charging base station deployment method based on the core node rule as claimed in claim 1, wherein: in step 1, all the n wireless chargeable sensors are located in the first quadrant of the plane rectangular coordinate system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910023267.5A CN109688593B (en) | 2019-01-10 | 2019-01-10 | Charging base station deployment method based on core node rule |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910023267.5A CN109688593B (en) | 2019-01-10 | 2019-01-10 | Charging base station deployment method based on core node rule |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109688593A CN109688593A (en) | 2019-04-26 |
| CN109688593B true CN109688593B (en) | 2021-11-09 |
Family
ID=66192916
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910023267.5A Active CN109688593B (en) | 2019-01-10 | 2019-01-10 | Charging base station deployment method based on core node rule |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109688593B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112929888A (en) * | 2021-01-21 | 2021-06-08 | 南京邮电大学 | Static charging base station deployment method based on core node selection |
| CN112929889B (en) * | 2021-01-23 | 2022-01-07 | 西北工业大学 | Method for positioning 5G ultra-density network node based on H index |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104734372A (en) * | 2015-03-16 | 2015-06-24 | 河海大学常州校区 | Energy adaptive charging method combined with geographical location routing in WRSNs |
| CN105101478A (en) * | 2015-06-04 | 2015-11-25 | 中国联合网络通信集团有限公司 | Method and device for charging wireless network sensor |
| CN105704731A (en) * | 2016-04-28 | 2016-06-22 | 杭州电子科技大学 | Omnibearing charging base station deployment method of wireless rechargeable sensing network |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN106714222A (en) * | 2017-01-24 | 2017-05-24 | 天津工业大学 | Charging sequence scheduling method of wireless chargeable sensor network nodes |
| CN107635238A (en) * | 2017-08-28 | 2018-01-26 | 昆明理工大学 | A kind of chargeable sensor network arrangement of repeaters method of multi-hop wireless based on Clustering |
| CN108173664A (en) * | 2017-11-28 | 2018-06-15 | 昆明理工大学 | Resonance repeater dispositions method in a kind of chargeable sensor network of multi-hop wireless |
| CN108924895A (en) * | 2018-07-13 | 2018-11-30 | 国网四川省电力公司技能培训中心 | A kind of wireless sensor network mobile charging model and routing optimization method |
-
2019
- 2019-01-10 CN CN201910023267.5A patent/CN109688593B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104734372A (en) * | 2015-03-16 | 2015-06-24 | 河海大学常州校区 | Energy adaptive charging method combined with geographical location routing in WRSNs |
| CN105101478A (en) * | 2015-06-04 | 2015-11-25 | 中国联合网络通信集团有限公司 | Method and device for charging wireless network sensor |
| CN105704731A (en) * | 2016-04-28 | 2016-06-22 | 杭州电子科技大学 | Omnibearing charging base station deployment method of wireless rechargeable sensing network |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN106714222A (en) * | 2017-01-24 | 2017-05-24 | 天津工业大学 | Charging sequence scheduling method of wireless chargeable sensor network nodes |
| CN107635238A (en) * | 2017-08-28 | 2018-01-26 | 昆明理工大学 | A kind of chargeable sensor network arrangement of repeaters method of multi-hop wireless based on Clustering |
| CN108173664A (en) * | 2017-11-28 | 2018-06-15 | 昆明理工大学 | Resonance repeater dispositions method in a kind of chargeable sensor network of multi-hop wireless |
| CN108924895A (en) * | 2018-07-13 | 2018-11-30 | 国网四川省电力公司技能培训中心 | A kind of wireless sensor network mobile charging model and routing optimization method |
Non-Patent Citations (3)
| Title |
|---|
| An Efficient Routing Algorithm to Optimize the Lifetime of Sensor Network Using Wireless Charging Vehicle;Tseng-Yi Chen等;《2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems》;20141231;全文 * |
| 一种基于贪婪算法的WRSN基站部署新方法;程瑜华，方向远，王高峰;《传感技术学报》;20201215;全文 * |
| 无线可充电传感器网络中充电器的部署优化;王志方，郑霖，李晓记;《计算机工程》;20180531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109688593A (en) | 2019-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109688593B (en) | Charging base station deployment method based on core node rule | |
| CN101820676B (en) | Sensor node positioning method | |
| CN104394535B (en) | The base station planning method of facing cooperation communication | |
| CN109583665A (en) | A kind of unmanned plane charging tasks dispatching method in wireless sensor network | |
| CN102547918A (en) | Non-ranging-based wireless sensor network three-dimensional node positioning method | |
| CN109121200B (en) | Space layout optimization and indoor positioning method for iBeacon base station | |
| CN107978169B (en) | A kind of method of bus station positional deviation correction under pair of multi-source data source | |
| CN110351735B (en) | Greedy algorithm-based wireless chargeable sensor network base station deployment method | |
| CN109511150B (en) | Mobile charging vehicle path planning method based on single-pair multi-charging technology | |
| CN109348483B (en) | Fixed-point charging base station deployment method of wireless rechargeable sensor network | |
| CN109495843B (en) | Fixed-point wireless charging base station deployment method based on convex hull selection | |
| CN108173302A (en) | Charge completion time optimization method of the wireless charger in wireless sensor network | |
| CN108985516A (en) | Indoor paths planning method based on cellular automata | |
| CN110418434A (en) | A kind of the wireless sensor network charging method and device of unmanned plane auxiliary | |
| Pal et al. | Placement of electric vehicle charging station and solar distributed generation in distribution system considering uncertainties | |
| CN105451292A (en) | Grid structure-based hierarchical network charging method and system in WRSNs | |
| CN113011652A (en) | Site selection optimization method and system for electric vehicle charging station | |
| Zhou et al. | Research on resource allocation optimization of smart city based on big data | |
| CN114442664A (en) | Power transmission line unmanned aerial vehicle formation cooperative inspection task allocation method considering airspace conflicts | |
| Adrian et al. | A controllable rsu and vampire moth to support the cluster stability in vanet | |
| CN109246602B (en) | Charging base station deployment method of wireless chargeable sensor network | |
| Shukla et al. | A novel software-defined network based approach for charging station allocation to plugged-in electric vehicles | |
| CN115589367A (en) | Multi-charger carrier separation charging method based on deep reinforcement learning | |
| CN108650682A (en) | A kind of the base station installation aiding device and its method of the ultra dense set networks of 5G | |
| Chen | A novel data collection method with recharge plan for rechargeable wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211129 Address after: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, Nanyang Avenue, Yaoxi street, Longwan District, Wenzhou City, Zhejiang Province Patentee after: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. Patentee after: HANGZHOU DIANZI University Address before: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, Nanyang Avenue, Yaoxi street, Longwan District, Wenzhou City, Zhejiang Province Patentee before: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221101 Address after: No. G3-1, Floor 3, Building G, South Zhejiang Yungu, No. 2003, Nanyang Avenue, Yaoxi Street, Longwan District, Wenzhou City, Zhejiang Province 325,038 Patentee after: Zhejiang shushuo Sports Technology Co.,Ltd. Address before: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, Nanyang Avenue, Yaoxi street, Longwan District, Wenzhou City, Zhejiang Province Patentee before: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. Patentee before: HANGZHOU DIANZI University |
|
| TR01 | Transfer of patent right |