CN102291302B - Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network - Google Patents
Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network Download PDFInfo
- Publication number
- CN102291302B CN102291302B CN201110230696.3A CN201110230696A CN102291302B CN 102291302 B CN102291302 B CN 102291302B CN 201110230696 A CN201110230696 A CN 201110230696A CN 102291302 B CN102291302 B CN 102291302B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- data
- straton net
- power line
- 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.)
- Expired - Fee Related
Links
- 230000006854 communication Effects 0.000 title claims abstract description 64
- 238000004891 communication Methods 0.000 title claims abstract description 63
- 238000000034 method Methods 0.000 title claims abstract description 18
- 241000239290 Araneae Species 0.000 claims abstract description 8
- 230000006855 networking Effects 0.000 claims description 9
- 230000007246 mechanism Effects 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims 1
- 239000010410 layer Substances 0.000 description 58
- 230000002093 peripheral effect Effects 0.000 description 16
- 241000221931 Hypomyces rosellus Species 0.000 description 13
- 239000002356 single layer Substances 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000005457 optimization Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 241000854291 Dianthus carthusianorum Species 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Selective Calling Equipment (AREA)
Abstract
低压配电网电力线载波通信网络中局部路由重构方法,涉及电力线通信领域。它解决了现有自动抄表系统中针对节点路由重构方法的重构效率、读表准确性差,以及信道利用率低的问题。本发明通过对自动抄表系统网络层及MAC层的分析研究,利用人工蛛网的这种特殊网络结构在组网完成后,子网的中心节点负责对子网局部的盲点进行重路由,不用对网络全部节点进行路由重构,节省寻路由的时间,提高通信效率及可靠性。本发明适用于低压配电网电力线载波通信网络中路由重构。
The invention relates to a local routing reconfiguration method in a power line carrier communication network of a low-voltage distribution network, which relates to the field of power line communication. It solves the problems of reconstruction efficiency, poor accuracy of meter reading and low channel utilization in the existing automatic meter reading system for node routing reconstruction methods. The present invention analyzes and studies the network layer and the MAC layer of the automatic meter reading system, and utilizes this special network structure of the artificial spider web. All nodes in the network are reconfigured to save routing time and improve communication efficiency and reliability. The invention is suitable for routing reconfiguration in the low-voltage power distribution network power line carrier communication network.
Description
技术领域technical field
本发明涉及电力线通信领域,具体涉及一种路由重构方法。The invention relates to the field of power line communication, in particular to a route reconfiguration method.
背景技术Background technique
当电力自动抄表系统MAC层人工蛛网组网完成后,由于信道干扰存在比较严重的情况,各子网内终端节点仍可能与中心节点通信不成功。此种情况下,可靠而高效的盲点重路由方法对保证整个自动抄表系统的服务质量是非常重要的。目前的针对节点路由重构技术主要有以下两种。After the artificial cobweb networking of the MAC layer of the electric power automatic meter reading system is completed, due to serious channel interference, the terminal nodes in each subnet may still fail to communicate with the central node. In this case, a reliable and efficient blind spot rerouting method is very important to ensure the service quality of the entire automatic meter reading system. Currently, there are mainly the following two routing reconfiguration technologies for nodes.
第一种是基于分簇思想的电力线通信路由算法,电力线通信分簇算法主要包括网络初始化算法和网络重构算法,可以有效扩展电力线通信网络的通信半径。这种方法存在的问题是,一旦网络终端节点由于信道环境变化不能与簇头通信,需要对整个网络的所有节点进行重新的分簇,路由重构。这种情况大大增加了系统的数据采集周期、时间延迟,降低了自动抄表系统的效率及读表准确性。The first is the power line communication routing algorithm based on the idea of clustering. The power line communication clustering algorithm mainly includes the network initialization algorithm and the network reconfiguration algorithm, which can effectively expand the communication radius of the power line communication network. The problem with this method is that once the network terminal node cannot communicate with the cluster head due to channel environment changes, all nodes in the entire network need to be re-clustered and route reconstructed. This situation greatly increases the data acquisition cycle and time delay of the system, and reduces the efficiency and accuracy of the automatic meter reading system.
第二种是基于人工智能算法,例如蚁群优化思想的电力线通信网络的路由优化算法,这些算法建立在网络的可连通性基础上,优化目标是最小跳数,在电力线通信网络中寻找源节点至目标节点之间的最优路径。同样,应用蚁群优化算法,如果由于信道环境改变造成的通信盲点,仍需要对网络内的所有节点进行重新的路由搜索、中继点节点的选取等。虽然自动抄表系统对时间的要求不高,但是由于信道环境变化频繁,组网完成后盲点出现的频率仍比较高,需要经常性的对系统内所有节点进行路由重构,增加了节点的计算量,并容易造成总线型信道的数据冲突,降低信道利用率。The second is based on artificial intelligence algorithms, such as the routing optimization algorithm of the power line communication network based on the idea of ant colony optimization. These algorithms are based on the connectivity of the network. The optimal path to the target node. Similarly, if the ant colony optimization algorithm is applied, if there is a communication blind spot caused by the change of the channel environment, it is still necessary to re-search for routes and select relay nodes for all nodes in the network. Although the automatic meter reading system does not have high requirements on time, due to frequent changes in the channel environment, the frequency of blind spots after the completion of the network is still relatively high. It is necessary to reconfigure the routes of all nodes in the system frequently, which increases the calculation of nodes. It is easy to cause data conflicts in bus-type channels and reduce channel utilization.
戚佳金在2010年发表的《低压配电网电力线载波通信动态组网方法研究》中公开了一种低压配电网电力线载波通信动态组网方法,但这种动态组网方法的通信效率和可靠性较低。Qi Jiajin disclosed a dynamic networking method of low-voltage distribution network power line carrier communication in "Research on Dynamic Networking Method of Low-Voltage Distribution Network Power Line Carrier Communication" published in 2010, but the communication efficiency and reliability of this dynamic networking method lower.
发明内容Contents of the invention
本发明是为了提高现有自动抄表系统中的通信效率及可靠性的问题,提供一种低压配电网电力线载波通信网络中局部路由重构方法。In order to improve the communication efficiency and reliability in the existing automatic meter reading system, the present invention provides a local route reconstruction method in the power line carrier communication network of the low-voltage distribution network.
低压配电网电力线载波通信网络中局部路由重构方法,它由以下步骤实现:A local route reconstruction method in a power line carrier communication network of a low-voltage distribution network, which is realized by the following steps:
步骤一、低压配电网电力线载波通信网络中的基站发起数据广播,低压配电网电力线载波通信网络的MAC层中的m个G节点接收基站的数据广播,并在MAC层组成m-1边单层蛛网逻辑拓扑结构的第n层子网,m为大于1的整数,n=1;Step 1: The base station in the power line carrier communication network of the low-voltage distribution network initiates data broadcasting, m G nodes in the MAC layer of the power line carrier communication network of the low-voltage distribution network receive the data broadcasting of the base station, and form m-1 edges in the MAC layer The n-th layer subnet of the single-layer cobweb logic topology, m is an integer greater than 1, n=1;
步骤二、在步骤一所述的m-1边单层蛛网逻辑拓扑结构的第n层子网中选择一个节点hn作为中心节点,所述中心节点与单层蛛网逻辑拓扑结构的第n层子网中其余任意一个节点均能直接进行数据通信;
步骤三、中心节点hn对m-1边单层蛛网逻辑拓扑结构的第n层子网中的每个节点分配逻辑ID;
步骤四、第n层子网的中心节点hn再次发起数据广播;
步骤五、低压配电网电力线载波通信网络的MAC层中的k个节点接收中心节点hn广播的数据,然后将已获得逻辑ID的所有节点剔除,将余下的k-m个节点形成第n+1层子网,在所述第n+1层子网中选择一个节点作为该层子网的中心节点hn+1,所述中心节点hn+1与第n+1层子网中其余任意一个节点均能直接进行数据通信,该中心节点hn+1对第n+1层子网中的每一个节点分配逻辑ID;令n=n+1,m=k-m,返回执行步骤四,对剩余的B节点进行搜索,直至所有节点均与基站实现直接通信或中继通信,完成低压配电网电力线载波通信网络的MAC层中通信网络的建立;k为大于m的整数;
步骤六、更新信道环境,对于每层子网:中心节点通过逻辑ID判断是否收到的来自该层子网内每个周边节点的数据,如果判断结果为是,则结束该层子网的路由重构;如果判断结果为否,则该层子网需要进行路由重构;针对每个需要路由重构的子网,执行步骤七和八,对该子网进行路由重构;Step 6. Update the channel environment. For each layer of subnet: the central node judges whether it has received data from each peripheral node in the layer of subnet through the logical ID. If the judgment result is yes, then end the routing of the layer of subnet Reconstruction; if the judgment result is no, the subnet of this layer needs to be reconfigured; for each subnet that needs reconfiguration, perform steps 7 and 8 to reconfigure the subnet;
步骤七、逐一判断该层子网内不能与该子网的中心节点通信的每一个周边节点是否能够与该周边节点在该层子网内的邻近节点进行通信,如果所有周边节点的判断结果为否,则返回步骤一,重新进行组网;否则,执行步骤八;Step 7, judge one by one whether each peripheral node that cannot communicate with the central node of the subnet in the layer subnet can communicate with the adjacent nodes of the peripheral node in the layer subnet, if the judgment result of all the peripheral nodes is If not, go back to
步骤八、该层子网的中心节点发送指令至每一个未收到数据的周边节点在该层子网内的邻近节点,发起对所述未收到数据的每一个周边节点的路由重构广播,建立未收到数据的每一个周边节点与该周边节点在该层子网内的邻近节点之间的握手机制,进而实现所有未收到数据的周边节点与该层子网的中心节点之间的中继通信,并结束对该层子网的局部路由重构;Step 8. The central node of the subnet of this layer sends an instruction to each neighboring node in the subnet of the subnet that has not received the data, and initiates a route reconstruction broadcast to each of the surrounding nodes that has not received the data. , establish a handshake mechanism between each peripheral node that has not received data and the adjacent nodes of the peripheral node in the subnet of this layer, and then realize the communication between all peripheral nodes that have not received data and the central node of the subnet of the layer relay communication, and end the local routing reconstruction of the layer subnet;
步骤九、当所有层子网均完成局部路由重构后,实现对自动抄表系统的局部路由重构;Step 9. After all subnets of all layers complete the local routing reconstruction, realize the local routing reconstruction of the automatic meter reading system;
G节点为能够直接与基站进行点对点通信的节点;The G node is a node that can directly communicate with the base station in point-to-point communication;
B节点是受到信道状态的影响不能与基站直接进行通信,但是能与其相邻节点进行通信的节点。Node B is a node that cannot directly communicate with the base station due to the influence of the channel state, but can communicate with its adjacent nodes.
有益效果:本发明通过对低压配电网电力线载波通信网络层及MAC层的分析研究,利用人工蛛网的这种特殊网络结构使得组网完成后,子网的中心节点负责对子网局部的盲点进行重路由,不用对网络全部节点进行重路由,节省寻路由的时间,提高通信效率及可靠性,提高读表准确性差,信道利用率较高。Beneficial effects: the present invention analyzes and studies the low-voltage distribution network power line carrier communication network layer and the MAC layer, and utilizes the special network structure of the artificial spider web to make the central node of the subnet responsible for local blind spots of the subnet after the networking is completed. Rerouting does not need to rerouting all nodes in the network, saving routing time, improving communication efficiency and reliability, improving meter reading accuracy, and high channel utilization.
附图说明Description of drawings
图1是本发明的具体实施方式一中所述总线型物理拓扑原理示意图,标记G为G节点,标记B为B节点;图2是人工蛛网通信逻辑拓扑原理示意图;图3是具体实施方式一中组网结果示意图标记G为G节点,标记B为B节点;图4是具体实施方式一中盲点路由重构原理示意图,标记G为G节点,标记B为B节点;图5是具体实施方式一中所述的盲点重路由时序图。Fig. 1 is a schematic diagram of the principle of the bus-type physical topology described in
具体实施方式Detailed ways
具体实施方式一、低压配电网电力线载波通信网络中局部路由重构方法,它由以下步骤实现:
步骤一、低压配电网电力线载波通信网络中的基站发起数据广播,低压配电网电力线载波通信网络的MAC层中的m个G节点接收基站的数据广播,并在MAC层组成m-1边单层蛛网逻辑拓扑结构的第n层子网,m为大于1的整数,n=1;Step 1: The base station in the power line carrier communication network of the low-voltage distribution network initiates data broadcasting, m G nodes in the MAC layer of the power line carrier communication network of the low-voltage distribution network receive the data broadcasting of the base station, and form m-1 edges in the MAC layer The n-th layer subnet of the single-layer cobweb logic topology, m is an integer greater than 1, n=1;
步骤二、在步骤一所述的m-1边单层蛛网逻辑拓扑结构的第n层子网中选择一个节点hn作为中心节点,所述中心节点与单层蛛网逻辑拓扑结构的第n层子网中其余任意一个节点均能直接进行数据通信;
步骤三、中心节点hn对m-1边单层蛛网逻辑拓扑结构的第n层子网中的每个节点分配逻辑ID;
步骤四、第n层子网的中心节点hn再次发起数据广播;
步骤五、低压配电网电力线载波通信网络的MAC层中的k个节点接收中心节点hn广播的数据,然后将已获得逻辑ID的所有节点剔除,将余下的k-m个节点形成第n+1层子网,在所述第n+1层子网中选择一个节点作为该层子网的中心节点hn+1,所述中心节点hn+1与第n+1层子网中其余任意一个节点均能直接进行数据通信,该中心节点hn+1对第n+1层子网中的每一个节点分配逻辑ID;令n=n+1,m=k-m,返回执行步骤四,对剩余的B节点进行搜索,直至所有节点均与基站实现直接通信或中继通信,完成低压配电网电力线载波通信网络的MAC层中通信网络的建立;k为大于m的整数;
步骤六、更新信道环境,对于每层子网:中心节点通过逻辑ID判断是否收到的来自该层子网内每个周边节点的数据,如果判断结果为是,则结束该层子网的路由重构;如果判断结果为否,则该层子网需要进行路由重构;针对每个需要路由重构的子网,执行步骤七和八,对该子网进行路由重构;Step 6. Update the channel environment. For each layer of subnet: the central node judges whether it has received data from each peripheral node in the layer of subnet through the logical ID. If the judgment result is yes, then end the routing of the layer of subnet Reconstruction; if the judgment result is no, the subnet of this layer needs to be reconfigured; for each subnet that needs reconfiguration, perform steps 7 and 8 to reconfigure the subnet;
步骤七、逐一判断该层子网内不能与该子网的中心节点通信的每一个周边节点是否能够与该周边节点在该层子网内的邻近节点进行通信,如果所有周边节点的判断结果为否,则返回步骤一,重新进行组网;否则,执行步骤八;Step 7, judge one by one whether each peripheral node that cannot communicate with the central node of the subnet in the layer subnet can communicate with the adjacent nodes of the peripheral node in the layer subnet, if the judgment result of all the peripheral nodes is If not, go back to
步骤八、该层子网的中心节点发送指令至每一个未收到数据的周边节点在该层子网内的邻近节点,发起对所述未收到数据的每一个周边节点的路由重构广播,建立未收到数据的每一个周边节点与该周边节点在该层子网内的邻近节点之间的握手机制,进而实现所有未收到数据的周边节点与该层子网的中心节点之间的中继通信,并结束对该层子网的局部路由重构;Step 8. The central node of the subnet of this layer sends an instruction to each neighboring node in the subnet of the subnet that has not received the data, and initiates a route reconstruction broadcast to each of the surrounding nodes that has not received the data. , establish a handshake mechanism between each peripheral node that has not received data and the adjacent nodes of the peripheral node in the subnet of this layer, and then realize the communication between all peripheral nodes that have not received data and the central node of the subnet of the layer relay communication, and end the local routing reconstruction of the layer subnet;
步骤九、当所有层子网均完成局部路由重构后,实现对自动抄表系统的局部路由重构;Step 9. After all subnets of all layers complete the local routing reconstruction, realize the local routing reconstruction of the automatic meter reading system;
G节点为能够直接与基站进行点对点通信的节点;The G node is a node that can directly communicate with the base station in point-to-point communication;
B节点是受到信道状态的影响不能与基站直接进行通信,但是能与其相邻节点进行通信的节点。Node B is a node that cannot directly communicate with the base station due to the influence of the channel state, but can communicate with its adjacent nodes.
原理:图1所示的是某单元楼内自动抄表系统的总线型物理拓扑。基站发起数据采集广播,由于广播信号随传输距离衰减,只有离基站比较近的终端节点可与基站直接可靠通信,为G节点。其他节点收不到基站的广播信息,不能将数据发送至基站,但相邻节点之间是可以点对点通信的,为B节点。Principle: Figure 1 shows the bus-type physical topology of the automatic meter reading system in a unit building. The base station initiates data collection and broadcasting. Since the broadcast signal attenuates with the transmission distance, only terminal nodes that are relatively close to the base station can communicate directly and reliably with the base station, which are G nodes. Other nodes cannot receive the broadcast information of the base station and cannot send data to the base station, but point-to-point communication between adjacent nodes is possible, which is a B node.
图1中,第1层子网内的所有节点均可与基站直接通信,节点之间可以直接点对点通信或通过中继节点进行通信。依此特点,第1层子网内各节点在MAC层可以等效为图2所示的单层人工蛛网的逻辑拓扑。如图2所示,m个终端节点构成一个m-1边的单层蛛网,h为m个节点中的任意一个,节点h可与子网内所有节点直接通信,相邻节点间可以点对点通信,不相邻节点以中心节点h为中继进行通信。In Figure 1, all nodes in the first layer subnet can communicate directly with the base station, and the nodes can communicate directly point-to-point or through relay nodes. According to this feature, each node in the first layer subnet can be equivalent to the logical topology of the single-layer artificial cobweb shown in Figure 2 at the MAC layer. As shown in Figure 2, m terminal nodes form a single-layer spider web with m-1 edges, h is any one of the m nodes, node h can communicate directly with all nodes in the subnet, and point-to-point communication between adjacent nodes , the non-adjacent nodes communicate with the central node h as the relay.
中心节点h对子网内的其余m-1个终端节点分配逻辑ID,直到所有节点均获得逻辑ID为止。The central node h allocates logical IDs to the remaining m-1 terminal nodes in the subnet until all nodes obtain logical IDs.
由节点h再次发送广播。节点h相对于基站,与B节点的物理距离更近,收到节点h广播信息的节点个数为k(k>m),在k-m个没有逻辑ID的节点中选择一个节点为中心节点,并对这k-m个节点分配逻辑ID。The broadcast is sent again by node h. Compared with the base station, node h is physically closer to node B, and the number of nodes receiving the broadcast information of node h is k (k>m). One node is selected as the central node among k-m nodes without logical ID, and Assign logical IDs to these k-m nodes.
第二个子网的中心节点再次发送广播,对B节点进行探索。如仍有新的节点,则重复步骤5,选取中心节点,分配逻辑ID,直到没有新的盲点为止;如果没有新的节点,则以上一个子网的中心节点为中继,向基站发送搜索结束信息。MAC层最后的组网结果如图3所示,以3个子网即搜索到所有盲点为例。The central node of the second subnet sends a broadcast again to explore the B node. If there are still new nodes, repeat
组网完成后,网络内所有节点以各子网的中心节点为中继与基站保持通信,但由于信道环境变化,子网内仍存在与中心节点不能通信的周边节点,如图3所示。After the networking is completed, all nodes in the network maintain communication with the base station using the central node of each subnet as a relay. However, due to changes in the channel environment, there are still peripheral nodes in the subnet that cannot communicate with the central node, as shown in Figure 3.
以第2层子网为例,中心节点n收到来自周边节点的数据中,通过判断逻辑ID,确认没有收到节点r的数据,等待一段时间,确认节点r的状态。Taking the second layer subnet as an example, when the central node n receives data from peripheral nodes, it confirms that no data from node r is received by judging the logical ID, and waits for a period of time to confirm the status of node r.
与节点r相邻的节点p,q仍能与中心节点n保持通信,经过时间PT(Process Time)的数据处理,节点n发送请求数据包RP(Request Packet)至节点p,q,由这两节点发起对节点r的重路由广播。The nodes p and q adjacent to the node r can still maintain communication with the central node n. After the data processing time PT (Process Time), the node n sends the request data packet RP (Request Packet) to the node p, q. The node initiates a rerouting broadcast to node r.
节点p收到请求数据包RP后,经过时间PT,向节点r发送请求数据包RP,q经过时间WT(Wait Time)(WT>PT)向节点r发送请求数据包RP。After receiving the request packet RP, node p sends a request packet RP to node r after time PT, and q sends a request packet RP to node r after time WT (Wait Time) (WT>PT).
节点r经过时间PT处理来自节点p和q的RP,等待时间WT,发送应答数据包AP(Answer Packet)给节点p,q,节点p,q收到节点r的应答数据包AP,完成节点r与节点p,q的通信握手机制。Node r processes RPs from nodes p and q after time PT, waits for time WT, sends response data packets AP (Answer Packet) to nodes p, q, nodes p, q receive the response data packets AP from node r, and complete node r Communication handshake mechanism with nodes p, q.
节点p,q分别等待时间2WT,WT将收到的应答数据包AP发送至中心节点n,至此节点r以节点p,q为中继与中心节点n重新取得数据通信,节点n完成对盲点r的路由重构。Nodes p and q wait for the time 2WT respectively, and WT sends the received response data packet AP to the central node n, so far, node r uses nodes p and q as the relay to regain data communication with central node n, and node n completes the blind point r routing refactoring.
以上节点p,q同时为中继节点的具体过程,单独选取其中一个为中继节点的时序与这个相似,去掉图5中的节点p或是节点q的时序,相应修改等待时间即可。本发明为了避免路由重构产生的数据冲突,定义了数据处理时间PT(Process Time)以及等待时间WT(Wait Time)。数据包的接收和转发按照设定的时序进行。The specific process of the above nodes p and q being relay nodes at the same time, the timing of individually selecting one of them as a relay node is similar to this, remove the timing of node p or node q in Figure 5, and modify the waiting time accordingly. In order to avoid data conflicts caused by routing reconstruction, the present invention defines a data processing time PT (Process Time) and a waiting time WT (Wait Time). Data packets are received and forwarded according to the set timing.
本发明通过对自动抄表系统网络层及MAC层的分析研究,利用人工蛛网的这种特殊网络结构使得组网完成后,子网的中心节点负责对子网局部的盲点进行重路由,不用对网络全部节点进行重路由,节省寻路由的时间,提高通信效率及可靠性。The present invention analyzes and studies the network layer and the MAC layer of the automatic meter reading system, and uses the special network structure of the artificial spider web to make the central node of the subnet responsible for rerouting the local blind spots of the subnet after the completion of the network, without All nodes in the network are rerouted to save routing time and improve communication efficiency and reliability.
Claims (1)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110230696.3A CN102291302B (en) | 2011-08-12 | 2011-08-12 | Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110230696.3A CN102291302B (en) | 2011-08-12 | 2011-08-12 | Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102291302A CN102291302A (en) | 2011-12-21 |
| CN102291302B true CN102291302B (en) | 2014-03-19 |
Family
ID=45337420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110230696.3A Expired - Fee Related CN102291302B (en) | 2011-08-12 | 2011-08-12 | Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102291302B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102904609B (en) * | 2012-06-14 | 2014-12-17 | 中国科学技术大学 | Networking method for integrated power line carrier communication network and topology network |
| CN104539315B (en) * | 2014-12-02 | 2017-02-22 | 上海电器科学研究院 | Rapid networking method for power line carrier communication |
| CN104640153B (en) * | 2015-01-16 | 2018-02-09 | 中国科学院上海微系统与信息技术研究所 | A kind of transmission line of electricity monitors network resources for wireless communication routing reconfigurability method |
| CN105391474B (en) * | 2015-10-30 | 2017-12-19 | 厦门中天微电子科技有限公司 | A kind of power line carrier centralized meter-reading system node-home automatically confirms that method |
| CN109361541B (en) * | 2018-10-22 | 2021-05-25 | 河南科技大学 | Network topology structure based on artificial spider web and construction method thereof |
| CN112968833B (en) * | 2021-04-20 | 2022-03-04 | 山东卓文信息科技有限公司 | Routing algorithm system based on low-voltage distribution network power line communication |
| CN113949413A (en) * | 2021-09-09 | 2022-01-18 | 广东电网有限责任公司电力调度控制中心 | Layered networking method for low-voltage power line carrier communication system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741724A (en) * | 2009-12-03 | 2010-06-16 | 成都华立达电力信息系统有限公司 | Automatic relay networking method in electric line carrier communication |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8325627B2 (en) * | 2007-04-13 | 2012-12-04 | Hart Communication Foundation | Adaptive scheduling in a wireless network |
-
2011
- 2011-08-12 CN CN201110230696.3A patent/CN102291302B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741724A (en) * | 2009-12-03 | 2010-06-16 | 成都华立达电力信息系统有限公司 | Automatic relay networking method in electric line carrier communication |
Non-Patent Citations (2)
| Title |
|---|
| 《低压配电网电力线载波通信动态组网方法研究》;戚佳金;《博士学位论文》;20100624;第31-40页 * |
| 戚佳金.《低压配电网电力线载波通信动态组网方法研究》.《博士学位论文》.2010,第31-40页. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102291302A (en) | 2011-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102291302B (en) | Local routing reconstruction method in power line carrier communication network of low-voltage electric distribution network | |
| JP6250736B2 (en) | A supported self-optimizing wireless network that is optimized for energy, mobility and capacity | |
| CN104539315B (en) | Rapid networking method for power line carrier communication | |
| WO2016026347A1 (en) | Micropower wireless network self-networking method and micropower wireless network | |
| CN111031544A (en) | Multi-network coexisting multi-frequency-point wireless communication networking method | |
| CN112586048A (en) | Method, apparatus, computer program product and dataset for managing a fronthaul network | |
| CN102595416B (en) | PCI (Physical Cell Identity) self-adaptive distribution method in cellular communication system | |
| CN104684041B (en) | A kind of real-time wireless sensing network route method for supporting extensive node application | |
| CN105451271B (en) | A kind of method for managing resource and device | |
| US7580382B1 (en) | System and method for distributed channelized group formation in a mobile wireless communication network | |
| CN105119828B (en) | A kind of quickly wireless network route implementation method | |
| KR101033665B1 (en) | Method for selecting head node for clustering wireless sensor network and wireless sensor network | |
| WO2015003500A1 (en) | Implementing access controller pool | |
| US9699661B2 (en) | Method and apparatus for PCI classified self-configuration | |
| CN106060957A (en) | CSMA/TDMA hybrid access control method | |
| CN106686685A (en) | Fast topology discovery method for multi-hop mobile wireless ad hoc networks | |
| CN106358257B (en) | A kind of cordless communication network configuration implementation method | |
| JP6587260B2 (en) | Method and system for air interface synchronization | |
| CN107437972A (en) | The subnet fusion method of single channel time division multiple acess MANET | |
| CN103428776B (en) | A kind of method and apparatus of cell management | |
| EP2671408A2 (en) | Method for improved topology mapping in wireless communication networks | |
| CN104883695A (en) | Multi-hop cognitive radio network architecture and deployment method | |
| WO2010131149A1 (en) | A method for assigning a network address for communicating in a segmented network | |
| US10547510B2 (en) | Assigning network devices | |
| CN102572907A (en) | Wireless communication mode of industrial information corridor |
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 |
Granted publication date: 20140319 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |