CN105337639A - Standard spider-web fractal networking method for low voltage power line communication - Google Patents
Standard spider-web fractal networking method for low voltage power line communication Download PDFInfo
- Publication number
- CN105337639A CN105337639A CN201510677083.2A CN201510677083A CN105337639A CN 105337639 A CN105337639 A CN 105337639A CN 201510677083 A CN201510677083 A CN 201510677083A CN 105337639 A CN105337639 A CN 105337639A
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- host
- networking
- host 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B3/00—Line transmission systems
- H04B3/54—Systems for transmission via power distribution lines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B3/00—Line transmission systems
- H04B3/54—Systems for transmission via power distribution lines
- H04B3/544—Setting up communications; Call and signalling arrangements
Landscapes
- Engineering & Computer Science (AREA)
- Power Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a standard spider-web fractal networking method for low voltage power line communication, and relates to a standard spider-web fractal networking technology for low voltage power line communication. The standard spider-web fractal networking method for low voltage power line communication solves the problem that a current networking method has the disadvantages of being low in the networking efficiency, being low in the reliability and being low in survivability. The method comprises: a main node distributes two time slots for the main node, and then in the first time slot, the main node corrects the frequency offset between the main node and slave nodes. In the second time slot, the main node sends a data frame allowing registration of nodes to the slave nodes within the communication range. When the nodes register successfully, the main node can give a response. In a convergence area, the main node stores the registered slave nodes in a topology table and distributes TEI for the slave nodes. When the convergence process completes, the main node distributes time slots for the registered slave nodes, and the slave nodes which acquire the time slots can perform networking according to the distribution sequence of time slots. The standard spider-web fractal networking method for low voltage power line communication is suitable for a low voltage power line communication field.
Description
Technical field
The present invention relates to the fractal networking technology of the accurate spider web of low-voltage power line communication.
Background technology
Along with improving constantly of requiring low-voltage powerline carrier communication networking efficiency and network reliability, as flooding, cluster algorithm, ant group algorithm, plane spider web algorithm etc., also there is following problem in the organization algorithm that present stage adopts:
1, present stage inundation network-building method comparatively distinct issues be: when net interior nodes increasing number, the networking frame collision probability that node receives will become large, causes networking efficiency between node relatively low.
2, section networking method is after source node selects leader cluster node with certain mechanism, more progressively carries out networking by leader cluster node to residue node.But the method exists two problems, first is that Cluster Networks topology reliability is poor; Second is after leader cluster node breaks down, and just can not normally communicate between localized network node, Survivabilities of Networks is poor.
3, ant group network method distinct issues are that networking mechanism is comparatively complicated, amount of calculation is comparatively large present stage, and need the longer networking time, networking efficiency is relatively low.
4, plane spider web network-building method distinct issues, after the host node in sub-spider web or the link occurs fault between host node, just can not normally communicate between sub-spider web present stage.If network contains multistage sub-spider web, after certain grade of sub-spider web breaks down, the operation of whole network will be had a strong impact on.
Summary of the invention
The present invention is to solve following problem:
1), existing inundation network-building method exist when net interior nodes increasing number, the networking frame collision probability that node receives will become large, causes networking efficiency between node relatively low;
2), the Cluster Networks topology reliability that exists of existing section networking method is poor, and after leader cluster node breaks down, just can not normally communicate between localized network node, Survivabilities of Networks is poor;
3), existing ant group network method distinct issues are that comparatively complexity, amount of calculation comparatively greatly, need the longer networking time, cause networking efficiency relatively low networking mechanism;
4), after the existing host node of plane spider web network-building method in sub-spider web or the link occurs fault between host node, just can not normally communicate between sub-spider web, if and network contains multistage sub-spider web, will the operation of whole network be had a strong impact on after certain grade of sub-spider web breaks down;
Thus provide the accurate spider web of a kind of low-voltage power line communication fractal network-building method.
The fractal network-building method of the accurate spider web of low-voltage power line communication, is characterized in that: network low-voltage power line communication logical network being equivalent to the accurate three-dimensional cobweb model composition of M individual layer, and M is positive integer; Every layer of three-dimensional cobweb model of standard forms by host node with from node; Describedly comprise via node and terminal node from node;
In net, each node all has two time slots, wherein:
For host node, first time slot carries out correcting frequency deviation from node for communicating with in scope; Second time slot is used for sending to other nodes in its communication range the beacon frame allowing Node registry, realizes the registration process from node;
For from node, first time slot carries out correcting frequency deviation from node for communicating with in scope; Second time slot is used for sending to other nodes in its communication range the beacon frame allowing Node registry, realizes from node to its registration process;
The fractal network-building method of accurate three-dimensional spider web classification is realized by following steps:
Step one, host node be first oneself distribute two time slots, in first time slot, host node in its communication range from node send N correcting frequency deviation frame, N is positive integer; Receive this frame from node dynamic conditioning crystal oscillator frequency, through N time adjustment after, realize correct and host node between frequency offset;
In second time slot, host node allows the Frame of Node registry to sending from node in its communication range, receives seizing channel from node with CSMA mechanism and registering to host node of this frame;
Step 2, receive after the Frame of Node registry when host node, host node sends acknowledgement frame ACK to from node, and what receive ACK realizes successful registration from node, no longer registers to host node;
The seizing channel with CSMA mechanism again from node and register to host node of unsuccessful registration;
Step 3, after second time slot terminates, host node carries out converging from node successful registration and is its distribution T EI, and what receive TEI deposits tables of data from node by this information;
Step 4, host node judge whether the quantity from node obtaining TEI is less than four, if judged result is yes, then performs step 8; If judged result is no, then perform step 5;
Step 5, host node be unallocated time slot front four obtained TEI from peer distribution time slot;
Step 6, for four assigned slot from node, be designated as from node i, i=1,2,3 or 4;
In first time slot, should from node i can in its communication range other nodes send N correcting frequency deviation frame, receive this frame from node by dynamic conditioning crystal oscillator frequency; After N adjustment, realize correcting and being somebody's turn to do from the frequency offset between node i;
In second time slot, should can send from node i the Frame allowing Node registry to other in its communication range from node;
After other receives this Frame from node, channel will be seized with CSMA mechanism and register to from node i, thus establishing hierarchical network; Due to from node i in networking process, also can receive the beacon frame sent from node i with layer from node, therefore receive just this node being deposited into neighbor table from node of this beacon frame, thus establish hierarchical network;
What realize four assigned slot carries out networking to other in its communication range from node from node;
Step 7, judge whether the quantity from node obtaining TEI of remaining unallocated time slot is less than four, if judged result is yes, then performs step 8; If judged result is no, then return execution step 5;
Step 8, host node to remaining unallocated time slot obtain TEI from peer distribution time slot; And according to step 6 to the method for step 7, realize this remaining obtained TEI from node, from node, networking is carried out to other in its communication range;
Step 9, above-mentioned assigned slot from node as ground floor from node; After ground floor completes networking from node according to the sequencing of time slot, each ground floor is from node converging new registration to host node from node;
When host node receives ground floor after the accumulated information of node:
First the new of convergence is deposited topology table from node;
Secondly host node is to ground floor from node reverts back ACK, represents that host node has received this accumulated information sent out from node;
The ground floor converged to host node from node of new registration is now had to upgrade to via node after node receives ACK frame;
Last host node again for new registration from peer distribution TEI;
After convergence process terminates, host node be again new obtain TEI from peer distribution time slot, what obtain time slot will repeat the process of above-mentioned steps four to step 8 from node, until all the other nodes all join in network in net, completes the fractal networking of the accurate spider web of low-voltage power line communication.
The fractal networking of the accurate spider web of low-voltage power line communication, host node is arbitrated the neighbor table of ground floor from node, selects the Hot Spare from maximum that of node from node as host node in neighbor table.
The beneficial effect that the present invention obtains has:
1), the fractal network-building method of the accurate spider web of low-voltage power line communication of the present invention, reduce the collision probability that node receives networking frame, realize the efficient networking between great deal of nodes;
2), the fractal network-building method of the accurate spider web of low-voltage power line communication of the present invention, enhance network reliability and survivability;
3), the fractal network-building method of the accurate spider web of low-voltage power line communication of the present invention, networking complexity is lower, amount of calculation is relatively little, improves the networking efficiency between net interior nodes;
4), the fractal network-building method of the accurate spider web of low-voltage power line communication of the present invention, realize the Hot Spare of host node.Even if host node breaks down, network still can normally run, and avoids network reconfiguration;
The present invention has stronger versatility, is applicable to popularizing in the other fields such as rural area network is registered one's residence, vehicle entertainment system, high ferro/subway train system, Intelligent charging station, military affairs.
Accompanying drawing explanation
Fig. 1 is traditional plane cobweb model schematic diagram; In figure, b is host node, and a is from node;
Fig. 2 is accurate three-dimensional cobweb model schematic perspective view; In figure, b is host node, and a is terminal node;
Fig. 3 is accurate three-dimensional cobweb model schematic top plan view; In figure, b is host node, and a is from node;
Fig. 4 is accurate spider web classification form-separating structural network model schematic perspective view; In figure, A is host node, and B is from node/one-level relaying host node, and C is from node/secondary relaying host node, and D is from node/tri-grade relaying host node, and E is from node/Pyatyi relaying host node, and F is from node/six grade relaying host node;
Fig. 5 is accurate spider web classification form-separating structural network model schematic top plan view; In figure, b is host node, and a is from terminal node, and c is via node;
Fig. 6 is node slot time and functional schematic;
Fig. 7 is accurate three-dimensional spider web classification fractal net work topology schematic diagram;
Embodiment
The fractal network-building method of the accurate spider web of embodiment one, low-voltage power line communication, in low-voltage power line carrier communication system, adopts the networking process that the fractal network-building method of accurate spider web classification can realize net interior nodes.Accurate three-dimensional cobweb model is by host node, form from node.Via node and terminal node is comprised, as shown in Figures 1 to 3 from node.Compared with plane cobweb model, this model more can reflect true low-voltage power line topology of networks exactly, and therefore low-voltage power line communication logical network is equivalent to the network of the accurate three-dimensional spider web composition of multiple individual layer, as shown in Fig. 4 to 5 by the present invention.
In order to effectively explain the fractal network-building method of accurate spider web classification, first node slot time function is described.
Net interior nodes all has two time slots, and host node first time slot effect communicates with to carry out correcting frequency deviation from node in scope; Second time slot effect sends to other nodes in its communication range the beacon frame allowing Node registry, realizes the registration process from node.Communicate with to carry out correcting frequency deviation from node in scope from node first time slot effect; Second time slot effect sends to other nodes in its communication range the beacon frame allowing Node registry, realizes from node to its registration process, as shown in Figure 6.
Secondly the performing step of the fractal network-building method of accurate three-dimensional spider web classification is described:
1, host node is first oneself distribute two time slots, and in first time slot, host node, to repeatedly sending correcting frequency deviation frame from node in its communication range, receives the node of this frame by dynamic conditioning crystal oscillator frequency.After repeatedly adjustment, just can correct and frequency offset between host node.In second time slot, host node allows the Frame of Node registry to sending from node in its communication range, receives seizing channel with CSMA mechanism from node and registering to host node of this frame.
2, when host node receives after the Frame of Node registry, host node can send acknowledgement frame ACK to from node, receives again to host node registration, can not representing be successfully registered to host node 0 in Fig. 4 from node 1,3,11,12,13 from node of ACK.And the seizing channel with CSMA mechanism again from node and register to host node of unsuccessful registration.
3, after second time slot terminates, host node 0 carries out converging from node 1,3,11,12,13 successful registration and is its distribution T EI, and this information is deposited tables of data, in table 1 by the node receiving TEI.
Table 1 tables of data
| Field | Explain | Bit wide (bit) |
| MYTEI | Node TEI | 16 |
| MYTYPE | Node type | 8 |
| CCOTEI | Host node TEI | 16 |
4, the present invention combines the content of " IEEE1901 broadband power line network standard " peer distribution time slot, in accurate spider web classification fractal net work, host node can only be at most at every turn four obtained TEI from peer distribution time slot.As Fig. 7, host node 0 is first distribute time slot from node 1,3,11,12.
5, for from node 1, the networking process from node is described.After receive the time slot that host node distributes from node 1, in first time slot, correcting frequency deviation frame can be sent to other nodes in its communication range from node 1, receive this frame from node by dynamic conditioning crystal oscillator frequency.After repeatedly adjustment, just can to correct and from the frequency offset between node 1.In second time slot, the Frame allowing Node registry can be sent to other in its communication range from node from node 1.After receiving this Frame from node, will seize channel with CSMA mechanism and register to from node 1, Fig. 7 interior joint 4,5,6,9 expression be registered to from node 1, thus establishes hierarchical network.
Because node 1 is in networking process, also can receive the beacon frame sent from node 1 from node with layer, therefore receive just this node being deposited into neighbor table from node of this beacon frame, thus establish hierarchical network.Similarly, also with same networking mode, from node, networking is carried out to other in its communication range from node 3,11,12.
6, due to first time, be registered to host node 0 is 5 from nodes, and host node is only 4 peer distribution time slot in the first round, and therefore host node need be reallocated and one be taken turns time slot.When receive from node 13 host node 0 distribute time slot after just networking, networking process is identical with from node 1.
7, after ground floor completes networking from node according to the sequencing of time slot, converge from the node of node by new registration to host node.As shown in Figure 7, distribute the order of time slot from node 1,3,11,12,13 according to host node, converge the information of new registration node successively to host node 0.After host node 0 receives the accumulated information of ground floor node, first the new of convergence is deposited topology table, in table 2 from node by host node; Secondly via node 1,3, the 13 node reverts back ACK of host node 0 pair of ground floor, expression host node has received the accumulated information that child node is sent out.Now there is new node to converge to and host node upgrades to via node, as Fig. 7 node 1,3,13 after node receives ACK frame; Last host node again for new registration from peer distribution TEI.After convergence process terminates, host node 0 be again new obtain TEI from peer distribution time slot, what obtain time slot will repeat above-mentioned networking process from node, until all the other nodes all join network in net, networking process terminates.
Table 2 topology table
After network organizing terminates, host node 0 can be arbitrated the neighbor table of ground floor node, to select in neighbor table from maximum that of node from node as the Hot Spare of host node with the reliability of Logistics networks, so far complete the implementation procedure of the fractal networking of accurate spider web classification.
Specific embodiment:
The networking process of the accurate spider web fractal net work of low-voltage powerline carrier communication can be realized by method below.
First host node be first oneself distribute two time slots, in first time slot, host node can correct with from internodal frequency offset.In second time slot, host node can to the Frame sending permission Node registry from node in communication range.When after node successful registration, host node can be replied.In assembling area, host node is deposited registered topology table from node, and is its distribution T EI.After convergence process terminates, host node to registered from peer distribution time slot, obtain time slot from node by time slot allocation order networking.In first time slot, from node communicate with in scope other carry out correcting frequency deviation from node.In second time slot, complete the process registered to it from node.In assembling area, from node converging new registration to host node from node, now such just upgrades to via node from node.After host node receives accumulated information, be also its distribution T EI and time slot by newly depositing topology table from node.Follow-up identical with said process from node networking process, until net in all nodes all register complete till.After networking, host node can select backup host node in ground floor, has ensured the reliability of network further.
In sum, just can be realized the networking process of accurate spider web fractal net work between node in low-voltage power line carrier communication system by said method.
Claims (2)
1. the fractal network-building method of the accurate spider web of low-voltage power line communication, is characterized in that: network low-voltage power line communication logical network being equivalent to the accurate three-dimensional cobweb model composition of M individual layer, and M is positive integer; Every layer of three-dimensional cobweb model of standard forms by host node with from node; Describedly comprise via node and terminal node from node;
In net, each node all has two time slots, wherein:
For host node, first time slot carries out correcting frequency deviation from node for communicating with in scope; Second time slot is used for sending to other nodes in its communication range the beacon frame allowing Node registry, realizes the registration process from node;
For from node, first time slot carries out correcting frequency deviation from node for communicating with in scope; Second time slot is used for sending to other nodes in its communication range the beacon frame allowing Node registry, realizes from node to its registration process;
The fractal network-building method of accurate three-dimensional spider web classification is realized by following steps:
Step one, host node be first oneself distribute two time slots, in first time slot, host node in its communication range from node send N correcting frequency deviation frame, N is positive integer; Receive this frame from node dynamic conditioning crystal oscillator frequency, through N time adjustment after, realize correct and host node between frequency offset;
In second time slot, host node allows the Frame of Node registry to sending from node in its communication range, receives seizing channel from node with CSMA mechanism and registering to host node of this frame;
Step 2, receive after the Frame of Node registry when host node, host node sends acknowledgement frame ACK to from node, and what receive ACK realizes successful registration from node, no longer registers to host node;
The seizing channel with CSMA mechanism again from node and register to host node of unsuccessful registration;
Step 3, after second time slot terminates, host node carries out converging from node successful registration and is its distribution T EI, and what receive TEI deposits tables of data from node by this information;
Step 4, host node judge whether the quantity from node obtaining TEI is less than four, if judged result is yes, then performs step 8; If judged result is no, then perform step 5;
Step 5, host node be unallocated time slot front four obtained TEI from peer distribution time slot;
Step 6, for four assigned slot from node, be designated as from node i, i=1,2,3 or 4;
In first time slot, should from node i can in its communication range other nodes send N correcting frequency deviation frame, receive this frame from node by dynamic conditioning crystal oscillator frequency; After N adjustment, realize correcting and being somebody's turn to do from the frequency offset between node i;
In second time slot, should can send from node i the Frame allowing Node registry to other in its communication range from node;
After other receives this Frame from node, channel will be seized with CSMA mechanism and register to from node i, thus establishing hierarchical network; Due to from node i in networking process, also can receive the beacon frame sent from node i with layer from node, therefore receive just this node being deposited into neighbor table from node of this beacon frame, thus establish hierarchical network;
What realize four assigned slot carries out networking to other in its communication range from node from node;
Step 7, judge whether the quantity from node obtaining TEI of remaining unallocated time slot is less than four, if judged result is yes, then performs step 8; If judged result is no, then return execution step 5;
Step 8, host node to remaining unallocated time slot obtain TEI from peer distribution time slot; And according to step 6 to the method for step 7, realize this remaining obtained TEI from node, from node, networking is carried out to other in its communication range;
Step 9, above-mentioned assigned slot from node as ground floor from node; After ground floor completes networking from node according to the sequencing of time slot, each ground floor is from node converging new registration to host node from node;
When host node receives ground floor after the accumulated information of node:
First the new of convergence is deposited topology table from node;
Secondly host node is to ground floor from node reverts back ACK, represents that host node has received this accumulated information sent out from node;
The ground floor converged to host node from node of new registration is now had to upgrade to via node after node receives ACK frame;
Last host node again for new registration from peer distribution TEI;
After convergence process terminates, host node be again new obtain TEI from peer distribution time slot, what obtain time slot will repeat the process of above-mentioned steps four to step 8 from node, until all the other nodes all join in network in net, completes the fractal networking of the accurate spider web of low-voltage power line communication.
2. the fractal network-building method of the accurate spider web of low-voltage power line communication according to claim 1, it is characterized in that the fractal networking of the accurate spider web of low-voltage power line communication, host node is arbitrated the neighbor table of ground floor from node, selects the Hot Spare from maximum that of node from node as host node in neighbor table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510677083.2A CN105337639B (en) | 2015-10-16 | 2015-10-16 | Low-voltage power line communication quasi- spider web point shape network-building method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510677083.2A CN105337639B (en) | 2015-10-16 | 2015-10-16 | Low-voltage power line communication quasi- spider web point shape network-building method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105337639A true CN105337639A (en) | 2016-02-17 |
| CN105337639B CN105337639B (en) | 2017-10-27 |
Family
ID=55287976
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510677083.2A Expired - Fee Related CN105337639B (en) | 2015-10-16 | 2015-10-16 | Low-voltage power line communication quasi- spider web point shape network-building method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105337639B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110912584A (en) * | 2019-12-03 | 2020-03-24 | 南京协胜智能科技有限公司 | Communication method of power carrier communication system |
| CN110995315A (en) * | 2019-11-27 | 2020-04-10 | 深圳市力合微电子股份有限公司 | Communication method based on high-speed power line carrier |
| CN111263323A (en) * | 2020-01-15 | 2020-06-09 | 河南科技大学 | Spider-web-imitated wireless sensor network communication method and wireless sensor network |
| CN112019239A (en) * | 2019-05-30 | 2020-12-01 | 华为技术有限公司 | Method, node and storage medium for transmitting data |
| CN113938161A (en) * | 2020-06-29 | 2022-01-14 | 华为技术有限公司 | Power line communication PLC method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130034110A1 (en) * | 2011-08-01 | 2013-02-07 | Texas Instruments Incorporated | Broadcast transmission for multi-tone mask mode operation |
| US20130070790A1 (en) * | 2011-09-16 | 2013-03-21 | Texas Instruments Incorporated | Superframe format for mv-lv communication in multi tone-mask plc networks |
| CN103457900A (en) * | 2013-09-03 | 2013-12-18 | 清华大学 | Multi-frequency networking method and device based on OFDM in power line communication system |
-
2015
- 2015-10-16 CN CN201510677083.2A patent/CN105337639B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130034110A1 (en) * | 2011-08-01 | 2013-02-07 | Texas Instruments Incorporated | Broadcast transmission for multi-tone mask mode operation |
| US20130070790A1 (en) * | 2011-09-16 | 2013-03-21 | Texas Instruments Incorporated | Superframe format for mv-lv communication in multi tone-mask plc networks |
| CN103457900A (en) * | 2013-09-03 | 2013-12-18 | 清华大学 | Multi-frequency networking method and device based on OFDM in power line communication system |
Non-Patent Citations (2)
| Title |
|---|
| 刘晓胜等: "基于蛛网的新型电力线通信组网算法及通信协议", 《电力系统保护与控制》 * |
| 张良等: "一种低压电力线通信改进分级蚁群路由算法", 《电工技术学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112019239A (en) * | 2019-05-30 | 2020-12-01 | 华为技术有限公司 | Method, node and storage medium for transmitting data |
| CN112019239B (en) * | 2019-05-30 | 2021-11-19 | 华为技术有限公司 | Method, node and storage medium for transmitting data |
| CN110995315A (en) * | 2019-11-27 | 2020-04-10 | 深圳市力合微电子股份有限公司 | Communication method based on high-speed power line carrier |
| CN110912584A (en) * | 2019-12-03 | 2020-03-24 | 南京协胜智能科技有限公司 | Communication method of power carrier communication system |
| CN111263323A (en) * | 2020-01-15 | 2020-06-09 | 河南科技大学 | Spider-web-imitated wireless sensor network communication method and wireless sensor network |
| CN113938161A (en) * | 2020-06-29 | 2022-01-14 | 华为技术有限公司 | Power line communication PLC method and device |
| CN113938161B (en) * | 2020-06-29 | 2022-12-06 | 华为技术有限公司 | Power line communication PLC method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105337639B (en) | 2017-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105337639A (en) | Standard spider-web fractal networking method for low voltage power line communication | |
| CN102364970B (en) | Implementation method for automatically configuring address of mobile ad hoc network | |
| CN103475524B (en) | Based on the layering network-building method of master-slave node communication network | |
| CN102158983B (en) | Method for constructing 6LoWPAN wireless sensor network | |
| CN104917820B (en) | A kind of data transmission method based on the wireless interconnected interworking technology of micropower | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN103457852B (en) | A kind of survivability mapping method of multicast virtual network | |
| CN102395126B (en) | Mobile Ad hoc network address configuration realization method based on tree structure | |
| CN103078969A (en) | Method and equipment for announcing media access control (MAC) address information | |
| CN105119828B (en) | A kind of quickly wireless network route implementation method | |
| CN102572015A (en) | Implementation method for dynamic IPv6 address configuration of mobile ad hoc network | |
| CN105099902A (en) | Routing method for quantum Mesh network | |
| CN107018545A (en) | A kind of ad hoc network method being applied in wireless communication system | |
| CN105827439A (en) | Method for realizing wireless device ad hoc network | |
| CN102946327B (en) | The Topology g eneration method of exchanger management system | |
| CN102546380B (en) | Modified tree-based multicast routing scheme | |
| CN102215112B (en) | Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards | |
| CN103945415B (en) | Communication implementation method for wireless network | |
| CN102790692A (en) | Method for calculating network element interface and web master | |
| CN109217901A (en) | Electric line communication system and network-building method | |
| Xu | An O (n 1.5) deterministic gossiping algorithm for radio networks | |
| CN104202247A (en) | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) | |
| CN104270479B (en) | communication implementation method of next generation wireless network | |
| CN109547569A (en) | A kind of constructing communication network algorithm based on water heater application | |
| CN104244230B (en) | The cast communication implementation method of next generation wireless network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171027 Termination date: 20211016 |