CN103002009A - Method for building adjacent node relations in mesh network - Google Patents
Method for building adjacent node relations in mesh network Download PDFInfo
- Publication number
- CN103002009A CN103002009A CN2012103751291A CN201210375129A CN103002009A CN 103002009 A CN103002009 A CN 103002009A CN 2012103751291 A CN2012103751291 A CN 2012103751291A CN 201210375129 A CN201210375129 A CN 201210375129A CN 103002009 A CN103002009 A CN 103002009A
- Authority
- CN
- China
- Prior art keywords
- node
- section point
- neighbouring relations
- adjacent
- centroid
- 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 40
- 230000006855 networking Effects 0.000 claims abstract description 52
- 238000004891 communication Methods 0.000 abstract description 4
- 230000005540 biological transmission Effects 0.000 description 14
- 238000005516 engineering process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
An embodiment of the invention relates to the technical field of communication and discloses a method for building adjacent node relations in a mesh network. The method includes the steps of S1, by a first node, receiving a networking beacon transmitted by a second node; S2, by the first node, recording a first adjacent relation table between the first node and the second node; S3, judging whether the first node receives the networking beacon or not, if so, executing step S4, and if not, executing step S6; S4, by the first node, judging whether all nodes having higher priority than the first node finishes transfer of the networking beacon or not, if so, executing step S5, and if not, executing step S4; S5, by the first node, transferring the networking beacon to other nodes connected with the first node; and S6, by the first node, receiving adjacent relation tables uploaded by other nodes, and uploading the adjacent relation tables uploaded by other nodes and the first adjacent relation table to the second node. By the method, fast building of adjacent node relations in the mesh network is achieved.
Description
Technical field
The present invention relates to communication technical field, be specifically related to the method for building up of adjacent node relation in a kind of mesh network.
Background technology
Based on netted web frame under the wireless communication technology, it is a kind of network interconnection phenomenon that neighbouring relations present the state that interweaves between a kind of network node that causes because of the wireless communication transmissions coverage distance, be characterized between nodes, having formed regional complete reciprocity interconnecting relation, thus it also can be called be a kind of extension of cellular wireless telecommunication network technology.
To any network configuration, because of the existing nonuniformity of network topology structure and dynamically changeable property more, how to utilize the node neighbouring relations to ensure that network topology structure changes, and can not to affect network throughput be the key technology point that all-network all need possess, and to realize the core of this key technology point, just be how to realize fast the Rapid Establishment of network node neighbouring relations.Especially when be during without Centroid or mobile communications network environment in the face of network configuration, the node neighbouring relations Rapid Establishment in the network just shows its importance more especially.
Generally seek the foundation of network node neighbouring relations by the mode of broadcasting inundation in the prior art, concrete is, sent the broadcasting of a networking beacon by Centroid, other network node receives after this networking beacon, with record and the neighbouring relations table of node on every side, again neighbouring relations top layer layer is uploaded to Centroid, but there is larger defective in the mode of broadcasting inundation: because the neighbouring relations of mesh network are comparatively complicated, cause easily the transmission collision of networking beacon, cause the foundation failure of network node neighbouring relations.
Summary of the invention
Embodiment of the invention technical problem to be solved provides the method for building up of the relation of adjacent node in a kind of mesh network, can overcome the transmission collision problem that the broadcasting flooding method of available technology adopting brings, and sets up fast the neighbouring relations of network node.
The embodiment of the invention provides the method for building up of adjacent node relation in a kind of mesh network, comprises the following steps:
S1, first node receive the networking beacon that Section Point sends; Described Section Point is any one node in the mesh network, and described first node is adjacent with described Section Point to be connected;
The first adjacent relation table between S2, first node record and the described Section Point; The described first adjacent relation table comprises the sequence node number of the sequence node number of Section Point, described first node and the signal strength signal intensity between first node and the Section Point;
Whether S3, the described first node of judgement receive the networking beacon for the first time, if so, and execution in step S4, otherwise execution in step S6;
S4, first node judge whether whole nodes that priority is higher than described first node have all finished the forwarding of networking beacon, if execution in step S5, otherwise, execution in step S4;
S5, first node are transmitted the networking beacon to connected other node; Described other node does not comprise Section Point;
S6, first node receive the neighbouring relations table that described other node is uploaded, and neighbouring relations table and the first adjacent relation table that described other node is uploaded are uploaded to Centroid.
The invention provides the method for building up of adjacent node relation in a kind of mesh network, carry out in a certain order the orderly transmission of networking beacon by control network nodes, can overcome the transmission collision problem that broadcasting flooding method that prior art adopts causes, realize the Rapid Establishment of adjacent node relation in the mesh network.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, the below will do to introduce simply to the accompanying drawing of required use among the embodiment, apparently, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the flow chart of the method for building up of adjacent node relation in the mesh network that provides of the embodiment of the invention one;
Fig. 2 is the flow chart of the method for building up of adjacent node relation in the mesh network that provides of the embodiment of the invention two;
Fig. 3 is the flow chart of the method for building up of adjacent node relation in the mesh network that provides of the embodiment of the invention three.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
The method for building up of adjacent node relation in a kind of mesh network is provided in the embodiment of the invention, has been used for realizing the Rapid Establishment of mesh network adjacent node relation, overcome simultaneously the unordered transmission problem in traditional broadcasting flooding method.Below be elaborated respectively.
Embodiment one:
The invention provides the method for building up of adjacent node relation in a kind of mesh network, as shown in Figure 1, comprise the following steps:
101, first node receives the networking beacon that Section Point sends; Above-mentioned Section Point is any one node in the mesh network, and above-mentioned first node is adjacent with above-mentioned Section Point to be connected;
102, the first adjacent relation table between first node record and the above-mentioned Section Point; The above-mentioned first adjacent relation table comprises the sequence node number of sequence node number, first node of Section Point and the signal strength signal intensity between first node and the Section Point;
Particularly, in the present embodiment, the sequence node of each node number comprises the level number of this node and the factory number (be the factory number of processor, and the factory number of each processor being unique) of this node; Be that first node is received for the first time when first node receives the networking beacon that is sent by Section Point, if the level of Section Point number is n, then the level of first node number is n+1;
103, judge whether above-mentioned first node receives the networking beacon for the first time, if so, execution in step 104, otherwise execution in step 106;
104, judge whether whole nodes that priority is higher than above-mentioned first node have all finished the forwarding of networking beacon, if execution in step 105, otherwise, execution in step 104;
Whole nodes that priority is higher than above-mentioned first node comprise:
Level number is less than whole nodes of described first node; And
Number identical with described first node but the factory number of level is less than whole nodes of described first node;
In the present embodiment, for fear of the transmission collision, each node will be in a certain order, and (height of priority) sends the networking beacon successively, and then first node needs just to carry out the transmission of networking beacon after whole nodes that priority is higher than it all are sent;
105, first node is transmitted the networking beacon to connected other node; Above-mentioned other node does not comprise Section Point;
106, first node receives the neighbouring relations table that above-mentioned other node is uploaded, and neighbouring relations table and the first adjacent relation table that above-mentioned other node is uploaded are uploaded to Centroid.
In the present embodiment, after the networking beacon is sent completely, each node will successively be uploaded the neighbouring relations table to Centroid.
In the present embodiment, each node in the mesh network carries out the ordering of priority according to predetermined rule, then carry out successively the forwarding of networking beacon according to the height of priority, can overcome the problem of the transmission collision that the unordered transmission of broadcasting in the flooding method may cause, with the success of guaranteeing that neighbouring relations are set up.
Particularly, the method for present embodiment medium priority ordering is:
The priority of the node that level is number less is higher;
The node priority that factory number is less in number identical node of level is higher.
Embodiment two,
The invention provides the method for building up of adjacent node relation in a kind of mesh network, as shown in Figure 2, comprise the following steps:
201, determine Centroid;
Before setting up adjacent node relation, need to determine a Centroid, can computing function in the network is relatively powerful, a high-grade microprocessor that the resources occupation rate is relatively high is as Centroid;
202, above-mentioned Centroid sends the networking beacon to each node that is adjacent;
After Centroid is established, can outwards send the networking beacon by Centroid, adjacent each node that is connected with Centroid all will be received the networking beacon, and in the present embodiment, the level of Centroid number is 0, and then the level of the node adjacent with Centroid number is 1;
203, first node receives the networking beacon that Section Point sends; Above-mentioned Section Point is any one node in the mesh network, and above-mentioned first node is adjacent with above-mentioned Section Point to be connected;
204, the first adjacent relation table between first node record and the above-mentioned Section Point; The above-mentioned first adjacent relation table comprises the sequence node number of sequence node number, first node of Section Point and the signal strength signal intensity between first node and the Section Point;
205, judge whether above-mentioned first node receives the networking beacon for the first time, if so, execution in step 206, otherwise execution in step 208;
If not receiving the networking beacon for the first time, this networking beacon is not transmitted, can prevent the transmission that repeats of networking beacon;
Particularly, in the present embodiment, the sequence node of each node number comprises the level number of this node and the factory number (be the factory number of processor, and the factory number of each processor being unique) of this node; Be that first node is received for the first time when first node receives the networking beacon that is sent by Section Point, if the level of Section Point number is n, then the level of first node number is n+1;
206, first node judges whether whole nodes that priority is higher than above-mentioned first node have all finished the forwarding of networking beacon, if execution in step 207, otherwise, execution in step 206;
207, first node is transmitted the networking beacon to connected other node; Above-mentioned other node does not comprise Section Point;
208, first node receives the neighbouring relations table that above-mentioned other node is uploaded, and neighbouring relations table and the first adjacent relation table that above-mentioned other node is uploaded is uploaded to above-mentioned Section Point.
In the present embodiment, after the networking beacon is sent completely, each node will successively be uploaded the neighbouring relations table to Centroid.
In the present embodiment, each node in the mesh network carries out the ordering of priority according to predetermined rule, then carry out successively the forwarding of networking beacon according to the height of priority, can overcome the problem of the transmission collision that the unordered transmission of broadcasting in the flooding method may cause, with the success of guaranteeing that neighbouring relations are set up.
Particularly, the method for present embodiment medium priority ordering is:
The priority of the node that level is number less is higher;
The node priority that factory number is less in number identical node of level is higher.
Embodiment three,
The invention provides the method for building up of adjacent node relation in a kind of mesh network, as shown in Figure 3, comprise the following steps:
301, determine Centroid;
Before setting up adjacent node relation, need to determine a Centroid, can computing function in the network is relatively powerful, a high-grade microprocessor that the resources occupation rate is relatively high is as Centroid;
302, above-mentioned Centroid sends the networking beacon to each node that is adjacent;
After Centroid is established, can outwards send the networking beacon by Centroid, adjacent each node that is connected with Centroid all will be received the networking beacon, and in the present embodiment, the level of Centroid number is 0, and then the level of the node adjacent with Centroid number is 1;
303, first node receives the networking beacon that Section Point sends; Above-mentioned Section Point is any one node in the mesh network, and above-mentioned first node is adjacent with above-mentioned Section Point to be connected;
304, the first adjacent relation table between first node record and the above-mentioned Section Point; The above-mentioned first adjacent relation table comprises the sequence node number of sequence node number, first node of Section Point and the signal strength signal intensity between first node and the Section Point;
305, judge whether above-mentioned first node receives the networking beacon for the first time, if so, execution in step 306, otherwise execution in step 308;
Particularly, in the present embodiment, the sequence node of each node number comprises the level number of this node and the factory number (be the factory number of processor, and the factory number of each processor being unique) of this node; Be that first node is received for the first time when first node receives the networking beacon that is sent by Section Point, if the level of Section Point number is n, then the level of first node number is n+1;
306, first node judges whether whole nodes that priority is higher than above-mentioned first node have all finished the forwarding of networking beacon, if execution in step 307, otherwise, execution in step 306;
Particularly, the method for present embodiment medium priority ordering is:
The priority of the node that level is number less is higher;
The node priority that factory number is less in number identical node of level is higher;
307, first node is transmitted the networking beacon to connected other node; Above-mentioned other node does not comprise Section Point;
308, first node receives the neighbouring relations table that above-mentioned other node is uploaded, and neighbouring relations table and the first adjacent relation table that above-mentioned other node is uploaded are uploaded to Centroid;
In the present embodiment, after the networking beacon is sent completely, each node will successively be uploaded the neighbouring relations table to Centroid;
309, above-mentioned Centroid receives the neighbouring relations table that each node is successively uploaded in the above-mentioned mesh network;
Each node is all uploaded neighbouring relations table self record and that receive toward connected upper layer node, until be uploaded to Centroid;
310, above-mentioned Centroid is optimized the neighbouring relations table that receives and calculates and create whole network neighbouring relations table;
In the present embodiment, optimize to calculate and refer to that Centroid is optimized calculating to retain the strongest N of signal strength signal intensity (preseting) to the neighbouring relations table of each node, if the adjacent node number of certain node is no more than N, then its neighbouring relations are not optimized;
For any one node, optimize to calculate and to carry out like this: all neighbouring relations of this node size according to signal strength signal intensity is sorted; The N of stick signal intensity maximum, delete all the other neighbouring relations;
Optimizing the meaning of calculating is: for the node in the densely distributed zone of node, it more robustness neighbouring relations (signal strength signal intensity is stronger) may occur, but consider the fast problem of response of node resource occupation rate and network node path, need to avoid a node too much adjacent path to occur, so need to the neighbouring relations of each node be optimized, abandon the relatively weak neighbouring relations of some signal strength signal intensities, only keep limited crucial adjacent path;
311, above-mentioned first node is deleted the above-mentioned first adjacent relation table;
In the present embodiment, after the networking process finished, all nodes except Centroid were all deleted neighbouring relations table in own node memory storage with the saving memory space.
In the present embodiment, each node in the mesh network will send the networking beacon according to predetermined order orderly (namely according to priority height) after receiving the networking beacon, can prevent the transmission collision between the different nodes, reach the purpose of Rapid Establishment adjacent node relation; Centroid also can be optimized neighbouring relations simultaneously, improves the capability of fast response of each node in the network; And after the networking process finishes, preserve the neighbouring relations off-balancesheet except Centroid, all the other each nodes are all deleted the neighbouring relations table of its record, but the memory space in the releasing network.
One of ordinary skill in the art will appreciate that all or part of step in the whole bag of tricks of above-described embodiment is to come the relevant hardware of instruction finish by program, this program can be stored in the computer-readable recording medium, storage medium can comprise: flash disk, read-only memory (Read-Only Memory, ROM), random access device (Random Access Memory, RAM), disk or CD etc.
More than in the mesh network that the embodiment of the invention is provided the method for building up of adjacent node relation be described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. the method for building up of adjacent node relation in the mesh network is characterized in that, comprises the following steps:
S1, first node receive the networking beacon that Section Point sends; Described Section Point is any one node in the mesh network, and described first node is adjacent with described Section Point to be connected;
The first adjacent relation table between S2, first node record and the described Section Point; The described first adjacent relation table comprises the sequence node number of the sequence node number of Section Point, described first node and the signal strength signal intensity between first node and the Section Point;
Whether S3, the described first node of judgement receive the networking beacon for the first time, if so, and execution in step S4, otherwise execution in step S6;
S4, first node judge whether whole nodes that priority is higher than described first node have all finished the forwarding of networking beacon, if execution in step S5, otherwise, execution in step S4;
S5, first node are transmitted the networking beacon to connected other node; Described other node does not comprise Section Point;
S6, first node receive the neighbouring relations table that described other node is uploaded, and neighbouring relations table and the first adjacent relation table that described other node is uploaded are uploaded to Centroid.
2. method according to claim 1, it is characterized in that, the sequence node of described Section Point number comprises the level number of described Section Point and the factory number of described Section Point, and the sequence node of described first node number comprises the level number of described first node and the factory number of described first node; When the judged result of described step S3 when being, the level of the level of described first node number=described Section Point number+1.
3. method according to claim 2 is characterized in that, whole nodes that described priority is higher than described first node comprise:
Level number is less than whole nodes of described first node; And
Number identical with described first node but the factory number of level is less than whole nodes of described first node.
4. according to claim 1 to the described method of 3 any one, it is characterized in that before described step S1, described method also comprises:
S00, determine Centroid.
5. method according to claim 4 is characterized in that, before described step S1, described method also comprises:
S01, described Centroid send the networking beacon to each node that is adjacent.
6. method according to claim 5 is characterized in that, after described step S6, described method also comprises:
S7, described Centroid receive the neighbouring relations table that each node is successively uploaded in the described mesh network;
S8, described Centroid are optimized the neighbouring relations table that receives and calculate and create whole network neighbouring relations table.
7. method according to claim 6 is characterized in that, described Centroid is optimized calculating to the neighbouring relations table that receives and specifically comprises:
Described Centroid according to the neighbouring relations table that receives to each node and its separately the size of the signal strength signal intensity of other adjacent node sort, only the N of a stick signal intensity maximum neighbouring relations are deleted remaining neighbouring relations; N presets.
8. method according to claim 6 is characterized in that, described Centroid was optimized calculating and creates whole network neighbouring relations table to the neighbouring relations table that receives after, described method also comprised:
S9, described first node are deleted the described first adjacent relation table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210375129.1A CN103002009B (en) | 2012-09-29 | 2012-09-29 | The method for building up of adjacent node relation in a kind of mesh network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210375129.1A CN103002009B (en) | 2012-09-29 | 2012-09-29 | The method for building up of adjacent node relation in a kind of mesh network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103002009A true CN103002009A (en) | 2013-03-27 |
| CN103002009B CN103002009B (en) | 2015-09-16 |
Family
ID=47930142
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210375129.1A Active CN103002009B (en) | 2012-09-29 | 2012-09-29 | The method for building up of adjacent node relation in a kind of mesh network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103002009B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111241210A (en) * | 2020-01-14 | 2020-06-05 | 北京明略软件系统有限公司 | Method, device, computer storage medium and terminal for realizing relationship analysis |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651874A (en) * | 2008-08-12 | 2010-02-17 | 大唐移动通信设备有限公司 | Neighbor relationship establishing method |
| CN101877871A (en) * | 2010-06-25 | 2010-11-03 | 新邮通信设备有限公司 | Network self-organization method and evolution base station |
| CN102223724A (en) * | 2011-07-12 | 2011-10-19 | 电信科学技术研究院 | Method and equipment for adjusting priority of resources |
-
2012
- 2012-09-29 CN CN201210375129.1A patent/CN103002009B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651874A (en) * | 2008-08-12 | 2010-02-17 | 大唐移动通信设备有限公司 | Neighbor relationship establishing method |
| CN101877871A (en) * | 2010-06-25 | 2010-11-03 | 新邮通信设备有限公司 | Network self-organization method and evolution base station |
| CN102223724A (en) * | 2011-07-12 | 2011-10-19 | 电信科学技术研究院 | Method and equipment for adjusting priority of resources |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111241210A (en) * | 2020-01-14 | 2020-06-05 | 北京明略软件系统有限公司 | Method, device, computer storage medium and terminal for realizing relationship analysis |
| CN111241210B (en) * | 2020-01-14 | 2023-04-28 | 北京明略软件系统有限公司 | Method, device, computer storage medium and terminal for realizing relationship analysis |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103002009B (en) | 2015-09-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103533529B (en) | A kind of method of resource multiplex improving D2D system energy efficiency and system | |
| CN105101454A (en) | Method and device for random access of MTC UE (Machine Type Communication User Equipment) | |
| CN106304403A (en) | A kind of multi-link method for building up and relevant device | |
| CN104349505A (en) | Method of radio bearer establishment in dual connectivity | |
| CN105517182A (en) | Random access signaling transmitting method and transmitting device | |
| US10172052B2 (en) | Method and device for dynamically constructing virtual cell | |
| CN104205918A (en) | Method and apparatus providing data offloading and carrier aggregation associated measurement reporting | |
| CN104158581A (en) | Method and device for discovering relay node | |
| US10159002B2 (en) | Network management | |
| CN104955163B (en) | A kind of communication of mobile terminal control method, equipment and system | |
| CN105874861B (en) | A kind of method and device adjusting capacity density of eating dishes without rice or wine | |
| CN104168629A (en) | Proximity-based service relay node discovering method, terminal and proximity-based service communication system | |
| CN106488424A (en) | Activiation method and the device of UE is relayed under D2D scene | |
| CN105072563A (en) | Method and apparatus for device-to-device communication | |
| KR20120104867A (en) | Cluster head node election method for hierarchical routing protocol in sensor network | |
| CN104919839A (en) | System and method to establish and maintain cell cluster | |
| CN105451208A (en) | Method and apparatus for achieving device to device (D2D) discovery | |
| CN114449601A (en) | Method and device for sharing traffic under networking | |
| CN103002009A (en) | Method for building adjacent node relations in mesh network | |
| US11171706B2 (en) | Method for coordinating beam sweeping scheduling and intelligent controller | |
| CN109309947A (en) | Instruction terminal core network access, the method for core network access, base station and terminal | |
| CN105472711A (en) | Base station control method and device and base stations | |
| CN102316481B (en) | Neighborhood path loss mapping method and device | |
| CN106537967A (en) | Method and device for deploying access point | |
| CN105246088A (en) | Base station and adjacent cell list configuration 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 | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 518055 Shenzhen, Nanshan District, Taoyuan street, the former industrial zone, the second floor, building seventeen, building six, No. Applicant after: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. Address before: 518055 Shenzhen, Nanshan District, Taoyuan street, the former industrial zone, the second floor, building seventeen, building six, No. Applicant before: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT CO., LTD. TO: SHENZHEN YOUXUNDA TECHNOLOGY CO., LTD. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information |
Inventor after: Yang Shuyan Inventor after: Cui Tao Inventor after: Liu Zhu Inventor after: Zhang Xiaolong Inventor before: Cui Tao Inventor before: Liu Zhu Inventor before: Zhang Xiaolong |
|
| CB03 | Change of inventor or designer information | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 3rd Floor, Building 6, Guangqian Industrial Zone, Longzhu 3rd Road, Longzhu 3rd Road, Longguang Community, Taoyuan Street, Nanshan District, Shenzhen, Guangdong Province, 518000 Patentee after: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. Address before: 518055 6th floor, building 17, Guangqian Industrial Zone, Taoyuan Street, Nanshan District, Shenzhen City, Guangdong Province Patentee before: SHENZHEN FRIENDCOM TECHNOLOGY DEVELOPMENT Co.,Ltd. |