CN113099498A - IPv 6-NDP-based wireless search automatic networking method - Google Patents
IPv 6-NDP-based wireless search automatic networking method Download PDFInfo
- Publication number
- CN113099498A CN113099498A CN202110346613.0A CN202110346613A CN113099498A CN 113099498 A CN113099498 A CN 113099498A CN 202110346613 A CN202110346613 A CN 202110346613A CN 113099498 A CN113099498 A CN 113099498A
- Authority
- CN
- China
- Prior art keywords
- channel
- network
- message
- node
- root node
- 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 33
- 230000006855 networking Effects 0.000 title claims abstract description 24
- 238000004891 communication Methods 0.000 claims abstract description 16
- 239000000126 substance Substances 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0055—Transmission or use of information for re-establishing the radio link
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/24—Reselection being triggered by specific parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/16—Discovering, processing access restriction or access information
-
- 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
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an IPv 6-NDP-based wireless search automatic networking method, relates to the technical field of automatic networking in a wireless communication network system, and solves the technical problems of low efficiency and poor stability of the existing IPv6 networking method. The method comprises the steps of searching a network wirelessly and switching a channel; the wireless search network comprises a root node and a plurality of leaf nodes and a network protocol used for communication between the root node and the leaf nodes; the network protocol comprises IPv6 and NDP; the root node can perform network access and network access management on the leaf nodes. The NDP protocol is added under the IPv6 protocol standard framework, the respective advantages of IPv6 and NDP are fully utilized, a channel switching method is introduced, and the stability and accuracy of the whole wireless search network communication are improved, so that the method is easy to accept and popularize.
Description
Technical Field
The invention relates to the technical field of automatic networking in a wireless communication network system, in particular to an IPv 6-NDP-based wireless search automatic networking method.
Background
Internet Protocol Version 6 (IPv 6) is the next generation IP Protocol designed by the Internet Engineering Task Force (IETF) to replace IPv 4. Since the biggest problem of the IPv4 is that network address resources are limited, the application and development of the internet are severely restricted. The use of the IPv6 not only solves the problem of the number of network address resources, but also solves the obstacle of connecting various access devices to the Internet. The full expansion of the IPv6 is a great trend, the development of the global IPv6 technology is continuously promoted, and as the IPv4 is depleted, many countries have recognized the advantages brought by the IPv6 technology, and china pushes the next generation of the IPv6 to be fully deployed and be commercialized in a large scale through some country-level projects.
The advantages of IPv6 plug and play can be fully exerted by utilizing a Neighbor Discovery Protocol (NDP), and a high-efficiency, quick and strong-universality wireless network node networking search method based on an IPv6 Protocol framework is provided for low-power consumption, low-speed and lossy networks. In wireless communication, nodes on different channels cannot communicate in principle and do not interfere with each other, but in practice, two adjacent channels are often found to be capable of communicating, but the communication has high error rate and instability and needs to be avoided as much as possible, so that a channel switching algorithm is added on networking channel searching at the same time to avoid unstable networking.
The currently common algorithm is that a leaf node sends a DIS message (DODAG Information Solicitation, DIS) to a root node to request network entry. If receiving DIS message, root node sends DAO message (DODAG Information Object, DIO) response to network access; if the root node does not receive the DIS message, the leaf node continues to send the DIS message until the root node receives the DIS message. And when the root leaf node receives the DAO message response, the root leaf node joins the network. In the algorithm, a leaf node sends a network access application without designing an effective channel switching rule, and adjacent channels are continuously searched, so that the channel is excessively occupied, the communication efficiency is influenced, and the stability and the accuracy of the whole network are not high.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: aiming at the technical problems of low efficiency and poor stability of the existing networking method of IPv6, the method provides an IPv 6-NDP-based wireless search automatic networking method.
The technical scheme adopted by the invention for solving the technical problems is as follows: a wireless search automatic networking method based on IPv6-NDP comprises a wireless search network and a channel switching method.
Further, the wireless search network comprises a root node and a plurality of leaf nodes and a network protocol for communication between the root node and the leaf nodes;
further, the network protocol includes IPv6, NDP; the root node can perform network access and network access management on the leaf nodes.
Further, the channel switching method comprises:
s100, a first leaf node sends an RS message in a first channel and searches the root node;
s200, if the first RA message sent by the root node is not searched, switching to a second channel to continue sending the RS message; the root node responds to the first leaf node search through the first RA message;
s300, if the first RA message sent by the root node is searched, waiting for a second RA message in the first channel; the first leaf node determines the existence of the root node through the second RA message;
s400, if the second RA message is not searched, the first leaf node is switched to the second channel to continue sending the RS message;
s500, if the second RA message is searched, the root node adds the first leaf node into the wireless search network.
Further, the first leaf node switches from the first channel to the second channel with a plurality of channels in between.
Preferably, the number of channels spaced between the first channel and the second channel is greater than 2, and is smaller than any prime number greater than 2 of the total number of channels.
Further, the first RA packet and the second RA packet are data files having the same format and size, and are periodically sent by the root node in different time periods.
Preferably, the first leaf node sends the RS packet 3 times in the first channel interval, and switches to the second channel if the first RA packet is not searched for 3 times.
Further, after the first leaf node searches the second RA packet, the root node allocates a network address.
Further, after the second leaf node is powered on and initialized, automatically searching the root node according to the steps S100-S500, and adding the root node into the wireless search network; and the second leaf node is a node which is not accessed to the network or a newly added node.
Further, the wireless search network further comprises a plurality of wireless routes communicatively connecting the root node with the leaf nodes and between the leaf nodes
Further, the network protocol includes IPv6 and NDP, and the root node is capable of performing network entry and network entry management on the leaf node.
The implementation of one of the technical schemes of the invention has the following advantages or beneficial effects:
(1) convenient to use, save the manual work. When a new leaf node is added into a wireless network or a certain leaf node is replaced, the leaf node can automatically search and access the network after being electrified; if the root node is replaced, other leaf nodes can automatically search the network where the new root node is located.
(2) The stability and the accuracy of the whole wireless search network communication are improved. The channel automatic scanning technology is added with a relevant mechanism, so that the whole wireless network can be ensured to use the same channel, and the communication of modules on different channel communication is avoided, thereby effectively improving the stability and the accuracy of the communication.
(3) The technology is carried out under the IPv6 protocol standard framework, can fully utilize the advantages of IPv6, and is easy to accept and popularize.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without inventive efforts, wherein:
fig. 1 is a flow chart of wireless search automatic networking according to an embodiment of the present invention.
Detailed Description
In order that the objects, aspects and advantages of the present invention will become more apparent, various exemplary embodiments will be described below with reference to the accompanying drawings, which form a part hereof, and in which are shown by way of illustration various exemplary embodiments in which the invention may be practiced, and in which like numerals in different drawings represent the same or similar elements, unless otherwise specified. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. It is to be understood that they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims, and that other embodiments may be used, or structural and functional modifications may be made to the embodiments set forth herein, without departing from the scope and spirit of the present disclosure. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
The terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, the features defined as "first" and "second" may explicitly or implicitly include one or more of the described features. The term "plurality" means two or more unless specifically limited otherwise.
The following embodiment is merely a specific example and does not indicate such an implementation of the present invention.
In order to explain the technical means of the present invention, the following description will be given by way of specific examples.
As shown in fig. 1, an IPv 6-NDP-based wireless search automatic networking method includes a wireless search network and a channel switching method. Specifically, the wireless search network comprises a root node and a plurality of leaf nodes, and a network protocol for communication between the root node and the leaf nodes, wherein the network protocol comprises IPv6 and NDP, and the root node can carry out network access and network access management on the leaf nodes.
Further, the channel switching method comprises the following steps:
s100, a first leaf node sends an RS message (RS) on a first channel, and automatically searches a root node through an automatic channel scanning technology;
s200, if the first RA message (Router Advertisement) sent by the root node is not searched, switching to a second channel to continue sending the RS message; the root node responds to the first leaf node search through the first RA message;
s300, if a first RA message sent by a root node is searched, waiting for a second RA message in a first channel; the first leaf node determines the existence of the root node through the second RA message. The waiting time is determined according to the actual condition of the scale of the wireless search network;
s400, if the second RA message is not searched, the first leaf node is switched to a second channel to continue to send the RS message;
s500, if the second RA message is searched, the root node adds the first leaf node into the wireless search network.
In this embodiment, the first leaf node switches from the first channel to the second channel with a plurality of channels in between. Specifically, the number of channels spaced between the first channel and the second channel is preferably greater than 2, and is smaller than any prime number greater than 2 of the total number of channels. Therefore, the leaf node can search efficiently and accurately, continuous searching of adjacent channels is avoided, a plurality of leaf nodes search on one channel at the same time, and each leaf node channel switching interval randomly extracts one of the values. This avoids continuous searching of adjacent channels and ensures that each channel is not overcrowded. Further, the first RA packet and the second RA packet are data files having the same format and size, and are periodically sent by the root node in different time periods.
Preferably, the first leaf node sends the RS message 3 times in the first channel interval, and switches to the second channel if the first RA message is not searched for 3 times. The time interval for sending the RS message is determined according to the scale of the wireless search network and the channel configuration. And when the first leaf node searches the second RA message, the root node allocates a network address. Thus, the first node successfully accesses the network.
It should be further noted that, after the second leaf node is powered on and initialized, the root node is automatically searched according to the above steps S100 to S500, and a wireless search network is added, where the second leaf node is an un-networked node or a newly added node, and the number of the second leaf node is at least one. And sequentially circulating the steps until all leaf nodes complete networking. And after networking is finished. If the root node is changed, each leaf node automatically searches for a new root node, and the updating is completed according to the steps S100-S500 of the channel switching method.
Further, the wireless search network also includes a plurality of wireless routes communicatively connected between the root node and the leaf nodes and between the leaf nodes.
The specific implementation scheme is as follows: the root node and the leaf node in the wireless network need networking and communication on the same channel, but before networking is finished, the leaf node and the root node are usually not on the same channel, at the moment, in order to search the network where the root node is located, the first leaf node sends an RS message on the first channel for searching the central node, if the RS message is sent discontinuously for 3 times in fixed time, and the first RA message responded by the root node is not searched, the node is switched to the second channel for continuous searching. After the RS message is sent on the first channel, the first RA message responded by the root node is searched, the channel switching is stopped, and the second RA message is waited on the first channel, so that the existence of the root node is confirmed. Because the root node periodically sends the RA message, if the leaf node cannot receive the RA message in the appointed time, the leaf node switches to the second channel to continue searching, and if the leaf node searches the RA message again in the appointed time, the root node adds the RA message into the network. The switching interval of the first channel and the second channel is greater than 2 and smaller than prime number between the total number of the channels (for example, 10 channels are total, and the values meeting the conditions are 3, 5 and 7). Except the first leaf node, other leaf nodes which are not accessed to the network execute the same steps as the first leaf node, and the networking is completed.
In conclusion, the channel switching algorithm is added into the wireless search network based on the IPv6 NDP, so that unstable networking is avoided, the stability and the accuracy of the communication of the whole wireless network are improved, and the method is convenient to use and easy to accept and popularize by the market.
After reading the description herein, it will be apparent to one skilled in the art that various features described herein can be implemented by a method, a data processing system, or a computer program product. Accordingly, these features may be embodied in less than hardware, in all software, or in a combination of hardware and software. Furthermore, the above-described features may also be embodied in the form of a computer program product stored on one or more computer-readable storage media having computer-readable program code segments or instructions embodied in the storage medium. The readable storage medium is configured to store various types of data to support operations at the device. The readable storage medium may be implemented by any type of volatile or non-volatile storage device, or combination thereof. Such as a static disk, a random access memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), an optical storage device, a magnetic storage device, a flash memory, a magnetic or optical disk, and/or combinations thereof.
While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
Claims (8)
1. A wireless search automatic networking method based on IPv6-NDP is characterized by comprising a wireless search network and a channel switching method; wherein the content of the first and second substances,
the wireless search network comprises a root node and a plurality of leaf nodes and a network protocol used for communication between the root node and the leaf nodes;
the channel switching method comprises the following steps:
s100, a first leaf node sends an RS message in a first channel and searches a first RA message sent by a root node;
s200, if the first RA message sent by the root node is not searched, switching to a second channel to continue sending the RS message; the root node responds to the first leaf node search through the first RA message;
s300, if the first RA message sent by the root node is searched, waiting for a second RA message in the first channel; the first leaf node determines the existence of the root node through the second RA message;
s400, if the second RA message is not searched, the first leaf node is switched to the second channel to continue sending the RS message;
s500, if the second RA message is searched, the root node adds the first leaf node into the wireless search network;
the first leaf node is spaced apart by a plurality of channels between switching from the first channel to the second channel.
2. The method according to claim 1, wherein the number of channels spaced between the first channel and the second channel is greater than 2, and is smaller than any prime number greater than 2 of the total number of channels.
3. The method according to claim 1, wherein the first RA packet and the second RA packet are data files having the same format and size, and are periodically transmitted by the root node in different time periods.
4. The method according to claim 3, wherein the first leaf node sends the RS message 3 times in the first channel gap, and switches to the second channel if the first RA message is not searched for 3 times.
5. The method according to claim 4, wherein the first leaf node assigns a network address after searching the second RA packet.
6. The method according to claim 1, wherein after power-on initialization of a second leaf node, automatically searching the root node according to the steps S100-S500, and joining the wireless search network; and the second leaf node is a node which is not accessed to the network or a newly added node.
7. The wireless search automatic networking method of claim 6, wherein the wireless search network further comprises a plurality of wireless routes communicatively connecting the root node with the leaf nodes and between the leaf nodes.
8. The wireless search automatic networking method according to claim 1, wherein the network protocol comprises IPv6, NDP; the root node can perform network access and network access management on the leaf nodes.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2020102465390 | 2020-03-31 | ||
| CN202010246539 | 2020-03-31 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113099498A true CN113099498A (en) | 2021-07-09 |
| CN113099498B CN113099498B (en) | 2022-05-20 |
Family
ID=76671983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110346613.0A Active CN113099498B (en) | 2020-03-31 | 2021-03-31 | IPv 6-NDP-based wireless search automatic networking method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113099498B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588948A (en) * | 2004-10-13 | 2005-03-02 | 中国科学院计算技术研究所 | Method for providing mobile IP v6 support in radio multiple jump network |
| CN101213770A (en) * | 2005-06-28 | 2008-07-02 | 三星电子株式会社 | Method and apparatus for performing fast handover in wireless network |
| US20120084568A1 (en) * | 2010-10-01 | 2012-04-05 | Futurewei Technologies, Inc. | Lightweight Secure Neighbor Discovery Protocol for Low-Power and Lossy Networks |
| CN102548038A (en) * | 2012-02-07 | 2012-07-04 | 江苏麦希通讯技术有限公司 | Micro-power wireless networking method |
| US8893271B1 (en) * | 2012-08-09 | 2014-11-18 | Cisco Technology, Inc. | End node discovery and tracking in layer-2 of an internet protocol version 6 network |
| CN107071906A (en) * | 2016-12-05 | 2017-08-18 | 中国电力科学研究院 | A kind of 6LoWPAN Radio Network Systems and its channel switching method |
| CN108156641A (en) * | 2017-11-28 | 2018-06-12 | 上海镭芯微电子有限公司 | The channel switching method and switching system of a kind of wireless sense network |
| CN108934051A (en) * | 2018-07-17 | 2018-12-04 | 深圳友讯达科技股份有限公司 | Channel switches method of network entry and device |
| CN109379772A (en) * | 2018-12-12 | 2019-02-22 | 乐鑫信息科技（上海）股份有限公司 | Switching method, device, equipment and the storage medium of network channel |
-
2021
- 2021-03-31 CN CN202110346613.0A patent/CN113099498B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588948A (en) * | 2004-10-13 | 2005-03-02 | 中国科学院计算技术研究所 | Method for providing mobile IP v6 support in radio multiple jump network |
| CN101213770A (en) * | 2005-06-28 | 2008-07-02 | 三星电子株式会社 | Method and apparatus for performing fast handover in wireless network |
| US20120084568A1 (en) * | 2010-10-01 | 2012-04-05 | Futurewei Technologies, Inc. | Lightweight Secure Neighbor Discovery Protocol for Low-Power and Lossy Networks |
| CN102548038A (en) * | 2012-02-07 | 2012-07-04 | 江苏麦希通讯技术有限公司 | Micro-power wireless networking method |
| US8893271B1 (en) * | 2012-08-09 | 2014-11-18 | Cisco Technology, Inc. | End node discovery and tracking in layer-2 of an internet protocol version 6 network |
| CN107071906A (en) * | 2016-12-05 | 2017-08-18 | 中国电力科学研究院 | A kind of 6LoWPAN Radio Network Systems and its channel switching method |
| CN108156641A (en) * | 2017-11-28 | 2018-06-12 | 上海镭芯微电子有限公司 | The channel switching method and switching system of a kind of wireless sense network |
| CN108934051A (en) * | 2018-07-17 | 2018-12-04 | 深圳友讯达科技股份有限公司 | Channel switches method of network entry and device |
| CN109379772A (en) * | 2018-12-12 | 2019-02-22 | 乐鑫信息科技（上海）股份有限公司 | Switching method, device, equipment and the storage medium of network channel |
Non-Patent Citations (2)
| Title |
|---|
| DORRA ABDELALI: "Neighbor Discovery with Activity Monitoring in Multichannel Wireless Mesh Networks", 《2010 IEEE WIRELESS COMMUNICATION AND NETWORKING CONFERENCE》 * |
| 顾嘉: "6LoWPAN适配层与ND协议的仿真与研究", 《中国优秀硕士学位论文全文数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113099498B (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10027623B2 (en) | Internet protocol address resolution | |
| CN101621414B (en) | Method and apparatus for discovering network resource and topology | |
| US20070253377A1 (en) | Apparatus and method for name resolution in an aggregation of mobile networks | |
| CN100490418C (en) | Virtual local network-based data exchanging method and equipment | |
| JP2022022277A (en) | Network address assignment and reclamation for hierarchical based rpl networks | |
| CN101753458B (en) | Method and device for processing ND neighbor table entry | |
| EP3451592B1 (en) | Packet transmission between vxlan domains | |
| US20020099856A1 (en) | Information processing device and method thereof, recording medium and program | |
| JP2008017315A (en) | Wireless bridge communication device | |
| CN108259218B (en) | IP address allocation method and device | |
| CN102984288A (en) | Method and system for managing internet protocol version 6 (IPV6) address conflicts automatically | |
| CN112492063B (en) | IP address pool allocation and application method, device, equipment and medium | |
| CN103259725A (en) | Messaging method and network equipment | |
| CN101127714A (en) | A route management method and device for wireless mesh network | |
| CN103249075A (en) | Access point (AP) fault detecting and recovering method and device | |
| CN101436965B (en) | Detection method, apparatus and system sharing access client terminal quantity | |
| CN111886843A (en) | Low power consumption Bluetooth network maintenance method, electronic device, Bluetooth network and medium | |
| CN103338275A (en) | Port distribution method and apparatus | |
| Ozturk et al. | A scalable distributed dynamic address allocation protocol for ad-hoc networks | |
| CN113099498B (en) | IPv 6-NDP-based wireless search automatic networking method | |
| CN102333000A (en) | Neighbor maintenance method and equipment based on transparent interconnection network of lots of links | |
| CN103166860A (en) | Method and device for peer-to-peer (P2P) overlay network data migration | |
| JP6764489B2 (en) | Stacking network equipment | |
| CN109873764B (en) | Method, device and electronic equipment for establishing oriented OSPF (open shortest Path first) neighbor relation | |
| CN102891902A (en) | Media access control address updating method and network equipment |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240411 Address after: 311121 Building 5, 138 Yunlian Road, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province Patentee after: Marketing service center of State Grid Zhejiang Electric Power Co.,Ltd. Country or region after: China Patentee after: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. Address before: 310014 District of Hangzhou City, Zhejiang Province, the eight district of Zhaohui Patentee before: STATE GRID ZHEJIANG ELECTRIC POWER COMPANY LIMITED ELECTRIC POWER Research Institute Country or region before: China Patentee before: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. |