CN110661870B - HPLC communication networking method, device, storage medium and electronic equipment - Google Patents

HPLC communication networking method, device, storage medium and electronic equipment Download PDF

Info

Publication number
CN110661870B
CN110661870B CN201910922773.8A CN201910922773A CN110661870B CN 110661870 B CN110661870 B CN 110661870B CN 201910922773 A CN201910922773 A CN 201910922773A CN 110661870 B CN110661870 B CN 110661870B
Authority
CN
China
Prior art keywords
node
network access
beacon
channel quality
current 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.)
Active
Application number
CN201910922773.8A
Other languages
Chinese (zh)
Other versions
CN110661870A (en
Inventor
肖本强
张波
刘德波
郭攀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qingdao Lianzhongxin Cloud Technology Co ltd
Original Assignee
Qingdao Lianzhongxin Cloud Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Qingdao Lianzhongxin Cloud Technology Co ltd filed Critical Qingdao Lianzhongxin Cloud Technology Co ltd
Priority to CN201910922773.8A priority Critical patent/CN110661870B/en
Publication of CN110661870A publication Critical patent/CN110661870A/en
Application granted granted Critical
Publication of CN110661870B publication Critical patent/CN110661870B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B3/00Line transmission systems
    • H04B3/54Systems for transmission via power distribution lines
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Environmental & Geological Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present disclosure relates to a method for HPLC communication networking, and relates to power line carrier communication, the method includes: the current node judges whether to start a network access process according to a preset evaluation strategy; after a network access process is started, selecting a node as a candidate proxy node according to the channel quality and the level of a neighbor node and the number of received beacon frames; and generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node. The method and the device reduce the probability of proxy change during network access, reduce the number of SOF frames in the network optimization stage, and improve the overall communication efficiency of the carrier channel.

Description

HPLC communication networking method, device, storage medium and electronic equipment
Technical Field
The present disclosure relates to the field of power line carrier communications, and in particular, to a method, an apparatus, a storage medium, and an electronic device for HPLC communication networking.
Background
High-speed Power line Communication (HPLC) is one of the main Communication means for the construction of domestic Power consumption information acquisition systems at present, and in the Power consumption information acquisition system, the Communication between a resident user and a distribution transformer is mainly completed by using the means, so that functional applications such as data acquisition, cost control and the like are completed.
In the prior art, proxy selection is usually counted by taking an SNR value as a reference, in addition, non-CSMA time slots are possible when proxy selection is performed, and before the CSMA time slots arrive, new beacons are received to refresh neighbor nodes, so that the proxy node selected at the time is not optimal, and finally, the link is unstable.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
In view of the above disadvantages, the present disclosure provides a method, an apparatus, a storage medium, and an electronic device for HPLC communication networking, so as to optimize the entire networking process.
To achieve the above object, according to a first aspect of embodiments of the present disclosure, there is provided a method of HPLC communication networking, the method comprising:
the current node judges whether to start a network access process according to a preset evaluation strategy;
after a network access process is started, selecting a node as a candidate proxy node according to the channel quality and the level of a neighbor node and the number of received beacon frames;
and generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node.
Optionally, the determining, by the current node, whether to start a network access process according to a preset evaluation policy includes:
after a beacon period, the current node selects a neighbor node for clock synchronization according to the channel quality and the hierarchy of the node sending the beacon frame;
after waiting for three beacon periods, judging whether the channel quality of a node sending a beacon frame and a current node exceeds a preset threshold value or not;
and if the channel quality of the node sending the beacon frame and the current node exceeds a preset threshold value, starting a network access process.
Optionally, the method further includes: if the channel quality of the node sending the beacon frame and the current node does not exceed a preset threshold value, after waiting for a beacon period, judging whether the channel quality of the neighbor node of the current node and the current node exceeds the preset threshold value or whether the number of proxy nodes displaying continuous N beacon periods in the beacon frame received by the current node changes, wherein N is a positive integer greater than 3;
and if the channel quality of the neighbor node of the current node and the current node exceeds a preset threshold value or the number of the proxy nodes in N continuous beacon periods displayed in the beacon frame received by the current node is not changed, starting a network access process.
Optionally, after the network access process is started, selecting a node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames, where the method includes:
selecting a node as a candidate agent node according to the following sequence: CCO and channel quality is larger than a preset threshold value, nodes of a low level, PCO and nodes with the largest number of received beacon frames.
Optionally, the generating an association request frame according to the timeout occurrence time of the timer to send a network access request to the candidate proxy node includes:
and if the timer is overtime T1 and occurs in CSMA time slot, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
Optionally, the method further includes: and if the timer is overtime T1 and occurs in a non-CSMA time slot, restarting the timer, and after the timer time T2 is overtime, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
Optionally, the method further includes: setting an identifier for sending the association request frame, closing a timer and waiting for the arrival of the next CSMA time slot;
at the arrival of the CSMA slot, the flag of the association request frame is cleared, the timer is restarted, and the timing time T2 is set to a random value between 0 and one-half of the CSMA period.
According to a second aspect of embodiments of the present disclosure, there is provided an apparatus for HPLC communication networking, the apparatus comprising:
the judging unit is used for judging whether to start the network access process or not by the current node according to a preset evaluation strategy;
the selection unit is used for selecting one node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames after the network access process is started;
and the sending unit is used for generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node.
According to a third aspect of embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of HPLC communication networking provided by the first aspect.
According to a fourth aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to implement the steps of the method of HPLC communication networking provided by the first aspect.
According to the technical scheme, whether a network access process is started or not is judged according to a preset evaluation strategy; after a network access process is started, selecting a node as a candidate proxy node according to the channel quality and the level of a neighbor node and the number of received beacon frames; and generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node. The method and the device reduce the probability of proxy change after network access, reduce the number of SOF frames in the network optimization stage, and improve the overall communication efficiency of the carrier channel.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:
fig. 1 is a flow chart illustrating a method of HPLC communication networking, according to an example embodiment;
FIG. 2 is a partial flow diagram illustrating a method of HPLC communications networking in accordance with an exemplary embodiment;
FIG. 3 is a partial flow diagram illustrating a method of HPLC communications networking in accordance with an exemplary embodiment;
FIG. 4 is a block diagram illustrating an apparatus for HPLC communications networking in accordance with an exemplary embodiment;
FIG. 5 is a block diagram illustrating an electronic device in accordance with an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
In the process of HPLC communication networking, after a slave node STA accesses a network, an agent node is selected through receiving and evaluating a network message, after the agent node is selected, an association request message needs to be initiated according to an indication in a beacon, after the STA receives an association summary indication message or association confirmation, the STA is added into the network, and then the STA performs agent optimization according to the conditions of the agent and the directly connected node in each routing period.
The inventor finds that in the prior art, proxy selection is performed based on an SNR value or a discovery list, but the success rate of the discovery list cannot directly reflect the current link condition, so that the currently evaluated proxy node is not the optimal proxy node, and in addition, the proxy selection is usually performed in a non-CSMA time slot, and before the CSMA time slot arrives, a new beacon is received to refresh a neighbor node, so that the currently selected proxy node is not the optimal proxy node, and finally, the link is unstable.
In order to solve the existing problems, the present disclosure provides a method for HPLC communication networking, which is applied to a slave node, as shown in fig. 1, and the method includes:
step 101, the current node judges whether to start a network access process according to a preset evaluation strategy.
In this embodiment, after receiving the beacon frame, the slave STA needs to evaluate for a period of time, and starts the network access procedure after finding the candidate agent meeting the standard, thereby reducing some unnecessary attempts and improving the overall communication efficiency of the carrier channel.
As shown in fig. 2, in an embodiment, the step 101 specifically includes:
1011. after a beacon period, the current node selects a neighbor node for clock synchronization according to the channel quality and the hierarchy of the node sending the beacon frame.
Firstly, the current node waits for receiving a beacon frame, if the beacon frame sent by the node which receives the same TEI of the network is more than 1 time, after the current beacon time slot is finished, one better neighbor node is selected for clock synchronization according to the comprehensive consideration of the channel quality and the level of the node which sends the beacon.
1012. And after waiting for three beacon periods, judging whether the channel quality of the node sending the beacon frame and the current node exceeds a preset threshold value.
In order to prevent the network access time of the entire network from being too long due to too long waiting time and the candidate proxy nodes that cannot be selected relatively well due to too short waiting time, the number of beacon periods waiting in this embodiment is three, and it can be understood that the value of the preset threshold in this embodiment is related to a specific carrier chip, and can be set by itself according to different chips, for example, if the SNR is found to be greater than 30 in the actual test process, the communication quality is relatively stable, and 30 may be selected as the preset threshold.
1013. And if the channel quality of the node sending the beacon frame and the current node exceeds a preset threshold value, starting a network access process.
It is understood that the preset threshold may be set by self according to experience, and the embodiment is not limited in particular.
1014. If the channel quality of the neighbor node of the current node and the channel quality of the current node exceed the preset threshold value or the number of the proxy nodes displaying the continuous N beacon periods in the beacon frame received by the current node changes is judged after waiting for one beacon period, wherein N is a positive integer larger than 3.
When the network is large or centralized, in order to avoid collision, a node with a good SNR is considered as a candidate proxy node, because the good SNR means that the node is closer to the current node, so that the ordered network access of the whole network layer by layer can be realized, otherwise, if the SNR is not considered, the network access is initiated as long as a beacon frame is received, because a plurality of STAs initiate the network access process together, the collision is relatively serious because the load on the link is large, some nodes are difficult to access the network, and the time is wasted, so that the networking time of the whole network is prolonged.
On the other hand, if the STA is not good enough to keep up with the previous level signal and the STA needs to access the network, the network access process may be initiated when the network is relatively stable. In order to prevent the network access time of the entire network from being too long due to too long latency and the candidate proxy nodes that cannot be selected relatively well due to too short latency, the number of beacon periods waiting in this embodiment is three.
1015. And if the channel quality of the neighbor node of the current node and the current node exceeds a preset threshold value or the number of the proxy nodes in N continuous beacon periods displayed in the beacon frame received by the current node is not changed, starting a network access process.
And step 102, after the network access process is started, selecting one node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames.
In a specific application, the comparison sequence of the neighbor nodes is as follows:
a first order: CCO (Central Coordinator) and the channel quality is greater than a preset threshold. Namely, if the neighbor node is a CCO and the channel quality is greater than a preset threshold value, the CCO is directly selected as a candidate proxy node.
And (3) second order: nodes of a lower hierarchy. That is, in the case where there is no first order, a node of a low hierarchy is preferentially selected as a candidate proxy node.
And (3) third order: PCO (Proxy Coordinator), i.e. without the first and second order, is selected as a candidate Proxy node.
And fourth order: and selecting the node with the largest number of received beacon frames as a candidate proxy node.
It can be understood that, after 3 beacon periods are continued, if the number of PCOs in the neighbor node is not changed, and the channel quality between the neighbor node and the current node does not exceed the threshold, the constraint of the channel quality threshold is skipped, and one node is selected from the neighbor nodes as a candidate proxy node according to the comparison method described above.
And 103, generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node.
The association request frame carries version information of the candidate agent node and the TEI of the candidate agent node, the candidate agent node forwards the association request frame to the CCO if finding that the association request frame is sent to the candidate agent node after receiving the association request frame, the CCO sends an association confirmation frame after receiving the association confirmation frame, and the candidate agent node is officially authenticated as the agent node of the node which sends the association request in the association confirmation frame.
In this embodiment, after the STA starts the network access procedure, a timer is started, and after the timer expires, a node is selected as a candidate proxy node according to the information of the current neighbor node.
As shown in fig. 3, specifically, step 103 further includes:
and step 1031, if the timer is overtime and occurs in the CSMA time slot, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
And if the time T1 of the timer is overtime and occurs in the CSMA time slot, immediately generating a correlation request frame according to the information of the neighbor node and sending a network access request to the candidate proxy node. And then the current node waits for the candidate agent node to return an association confirmation frame or an association aggregation frame, if the association confirmation frame or the association aggregation frame is received, the timer is closed, the network access flow of the network is ended, and otherwise, the current node continues to wait for the time T1 of the timer to timeout.
Step 1032, if the timer is overtime and occurs in the non-CSMA time slot, a mark for sending the association request frame is set, and the timer is closed to wait for the arrival of the next CSMA time slot.
And step 1033, when the CSMA time slot arrives, clearing the identifier, restarting the timer, and setting the timing time T2 as a random value between 0 and one half of the CSMA period.
In this implementation, when the number of nodes in the network is large, it is possible that the timers of multiple nodes that send association request frames are overtime in the beacon slot at the same time, and then need to compete for transmission just after entering the CSMA slot, and further cannot achieve the discrete effect, so that when the timers are overtime, the current slot needs to be judged, if not in the CSMA slot, an identifier is set, and when the CSMA slot arrives, if the identifier is set, a randomly delayed timer is started to generate the association request frame (at this time, the role of the identifier is already reached, and it is certain that the association request frame needs to be cleared). To ensure that the timer times out during the current CSMA slot, a limit on the range of the random delay is required.
And step 1034, after the time T2 of the timer is overtime, generating an association request frame and sending the association request frame to the candidate proxy node.
Specifically, if the time out during the non-CSMA slot is expired, the STA needs to wait until the next CSMA slot to transmit an association request frame, which is generated according to the neighbor node information, and a beacon slot is always available during the association request frame. That is, when the association request frame generated in the non-CSMA slot is capable of being transmitted, the inner candidate proxy node is not selected according to the latest neighbor node information, i.e., is not necessarily the most suitable. In order to avoid this situation, the present invention needs to determine the time slot when timeout occurs when generating the association request frame.
The current node judges whether to start a network access process according to a preset evaluation strategy, and the network access process is started only when a relatively proper candidate agent is found, so that unnecessary attempts are reduced, the overall communication efficiency of a carrier channel is improved, and after the network access process is started, one node is selected as a candidate agent node according to the channel quality and the level of a neighbor node and the number of received beacon frames; and generating a correlation request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node. The method and the device reduce the probability of proxy change during network access and reduce the number of SOF frames in the network optimization stage. Even when the time slot is not CSMA time slot, the optimal candidate agent node can be selected, and finally the performance of the link is more stable.
Fig. 4 is a block diagram illustrating an apparatus for HPLC communication networking, according to an example embodiment, and as shown in fig. 4, the apparatus 400 includes:
a determining unit 41, configured to determine, by the current node, whether to start a network access process according to a preset evaluation policy;
the selecting unit 42 is configured to select a node as a candidate proxy node according to the channel quality and the level of the neighboring node and the number of received beacon frames after the network access process is started;
a sending unit 43, configured to generate an association request frame according to the timeout occurrence time of the timer, so as to send a network access request to the candidate proxy node.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
In summary, the current node of the present disclosure judges whether to start a network access procedure according to a preset evaluation policy, and starts the network access procedure only when finding a relatively suitable candidate agent, thereby reducing some unnecessary attempts and improving the overall communication efficiency of a carrier channel, and after starting the network access procedure, selects a node as a candidate agent node according to the channel quality and level of a neighboring node and the number of received beacon frames; and generating a correlation request frame according to the overtime occurrence moment of the timer so as to send a network access request to the candidate proxy node. The method and the device reduce the probability of proxy change during network access and reduce the number of SOF frames in the network optimization stage. Even when the time slot is not CSMA time slot, the optimal candidate proxy node can be selected, and finally the performance of the link is more stable.
Fig. 5 is a block diagram illustrating an electronic device 500 in accordance with an example embodiment. For example, the electronic device 500 may be provided as a server. Referring to fig. 5, the electronic device 500 comprises a processor 522, which may be one or more in number, and a memory 532 for storing computer programs executable by the processor 522. The computer programs stored in memory 532 may include one or more modules that each correspond to a set of instructions. Further, the processor 522 may be configured to execute the computer program to perform the above-described method of HPLC communication networking.
Additionally, the electronic device 500 may also include a power component 526 and a communication component 550, the power component 526 may be configured to perform power management of the electronic device 500, and the communication component 550 may be configured to enable communication, e.g., wired or wireless communication, of the electronic device 500. In addition, the electronic device 500 may also include input/output (I/O) interfaces 558. The electronic device 500 may operate based on an operating system stored in memory 532, such as Windows Server, Mac OS XTM, UnixTM, Linux, and the like.
In another exemplary embodiment, a computer readable storage medium comprising program instructions which, when executed by a processor, implement the steps of the method of HPLC communication networking described above is also provided. For example, the computer readable storage medium may be the memory 532 described above including program instructions executable by the processor 522 of the electronic device 500 to perform the method of HPLC communication networking described above.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
The preferred embodiments of the present disclosure are described in detail above with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details in the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure, as long as it does not depart from the spirit of the present disclosure.

Claims (6)

1. A method for HPLC communication networking, applied to a slave node, the method comprising:
the current node judges whether to start a network access process according to a preset evaluation strategy:
the current node judges whether to start a network access process according to a preset evaluation strategy, and the method comprises the following steps:
after a beacon period, the current node selects a neighbor node for clock synchronization according to the channel quality and the hierarchy of the node sending the beacon frame;
after waiting for three beacon periods, judging whether the channel quality of a node sending a beacon frame and a current node exceeds a preset threshold value or not;
if the channel quality of the node sending the beacon frame and the current node exceeds a preset threshold value, starting a network access process:
if the channel quality of the node sending the beacon frame and the current node does not exceed a preset threshold value, after waiting for a beacon period, judging whether the channel quality of the neighbor node of the current node and the current node exceeds the preset threshold value or whether the number of proxy nodes displaying continuous N beacon periods in the beacon frame received by the current node changes, wherein N is a positive integer greater than 3;
if the channel quality of the neighbor node of the current node and the current node exceeds a preset threshold value or the number of proxy nodes displaying continuous N beacon periods in the beacon frame received by the current node is not changed, starting a network access process;
after the network access process is started, selecting a node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames:
after the network access process is started, selecting one node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames, wherein the method comprises the following steps:
selecting a node as a candidate agent node according to the following sequence: CCO and the channel quality is greater than a preset threshold value, nodes of a low level, PCO and the nodes with the largest number of received beacon frames;
generating an association request frame according to the overtime occurrence time of the timer so as to send a network access request to the candidate proxy node:
the generating of the association request frame according to the timeout occurrence time of the timer to send the network access request to the candidate proxy node includes:
and if the timer is overtime T1 and occurs in CSMA time slot, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
2. The method of claim 1, further comprising:
and if the timer is overtime T1 and occurs in a non-CSMA time slot, restarting the timer, and after the timer time T2 is overtime, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
3. The method of claim 2, further comprising:
setting an identifier for sending the association request frame, closing a timer and waiting for the arrival of the next CSMA time slot;
at the arrival of the CSMA slot, the flag of the association request frame is cleared, the timer is restarted, and the timing time T2 is set to a random value between 0 and one-half of the CSMA period.
4. An apparatus for HPLC communication networking, the apparatus comprising:
the judging unit is used for judging whether to start the network access process or not by the current node according to a preset evaluation strategy;
the current node judges whether to start a network access process according to a preset evaluation strategy, and the method comprises the following steps:
after a beacon period, the current node selects a neighbor node for clock synchronization according to the channel quality and the hierarchy of the node sending the beacon frame;
after waiting for three beacon periods, judging whether the channel quality of a node sending a beacon frame and a current node exceeds a preset threshold value or not;
if the channel quality of the node sending the beacon frame and the current node exceeds a preset threshold value, starting a network access process:
if the channel quality of the node sending the beacon frame and the current node does not exceed a preset threshold value, after waiting for a beacon period, judging whether the channel quality of the neighbor node of the current node and the current node exceeds the preset threshold value or whether the number of proxy nodes displaying continuous N beacon periods in the beacon frame received by the current node changes, wherein N is a positive integer greater than 3;
if the channel quality of the neighbor node of the current node and the current node exceeds a preset threshold value or the number of the proxy nodes in N continuous beacon periods displayed in the beacon frame received by the current node is not changed, starting a network access process;
the selection unit is used for selecting one node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames after the network access process is started;
after the network access process is started, selecting one node as a candidate proxy node according to the channel quality and the level of the neighbor node and the number of received beacon frames, wherein the method comprises the following steps:
selecting a node as a candidate agent node according to the following sequence: CCO and the channel quality is greater than a preset threshold value, nodes of a low level, PCO and the nodes with the largest number of received beacon frames;
a sending unit, configured to generate an association request frame according to an overtime occurrence time of a timer, so as to send a network access request to the candidate proxy node;
the generating of the association request frame according to the timeout occurrence time of the timer to send the network access request to the candidate proxy node includes:
and if the timer is overtime T1 and occurs in CSMA time slot, generating an association request frame according to the candidate proxy node so as to send a network access request to the candidate proxy node.
5. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 3.
6. An electronic device, comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to carry out the steps of the method of any one of claims 1 to 3.
CN201910922773.8A 2019-09-27 2019-09-27 HPLC communication networking method, device, storage medium and electronic equipment Active CN110661870B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910922773.8A CN110661870B (en) 2019-09-27 2019-09-27 HPLC communication networking method, device, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910922773.8A CN110661870B (en) 2019-09-27 2019-09-27 HPLC communication networking method, device, storage medium and electronic equipment

Publications (2)

Publication Number Publication Date
CN110661870A CN110661870A (en) 2020-01-07
CN110661870B true CN110661870B (en) 2022-05-27

Family

ID=69039423

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910922773.8A Active CN110661870B (en) 2019-09-27 2019-09-27 HPLC communication networking method, device, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN110661870B (en)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113347690B (en) * 2021-06-10 2022-09-09 浙江正泰仪器仪表有限责任公司 Networking method and system of dual communication modes
CN113260047A (en) * 2021-06-23 2021-08-13 国网信息通信产业集团有限公司 Dual-mode system, station and central coordinator combining HPLC and wireless communication
CN113949412B (en) * 2021-09-08 2023-06-09 国网宁夏电力有限公司营销服务中心(国网宁夏电力有限公司计量中心) Optimization method of high-speed power line carrier communication network
CN113949415B (en) * 2021-09-23 2022-09-13 中国能源建设集团广东省电力设计研究院有限公司 Agent change evaluation method and device for high-speed power line carrier communication network
CN113890567B (en) * 2021-10-29 2023-07-07 国网四川省电力公司营销服务中心 HPLC networking program fault diagnosis method based on network maintenance iterative algorithm
CN113923748B (en) * 2021-11-12 2023-06-02 重庆邮电大学 Method for forming cluster network based on proxy change
CN114629518B (en) * 2022-03-31 2024-03-01 厦门骐俊物联科技股份有限公司 Dynamic ad hoc network method of digital interphone
CN115209506B (en) * 2022-09-15 2023-01-20 北京智芯微电子科技有限公司 Networking method, device, equipment and medium
CN115348318A (en) * 2022-10-20 2022-11-15 北京智芯微电子科技有限公司 Proxy changing method, control device and multimode communication system for multimode communication
CN116743541B (en) * 2023-08-09 2023-10-10 北京智芯微电子科技有限公司 Hybrid networking method and system for multimode communication and communication equipment
CN116847474B (en) * 2023-09-01 2024-01-26 北京智芯微电子科技有限公司 Data transmission method and device based on CSMA protocol, communication equipment and power system
CN116846814B (en) * 2023-09-01 2024-01-23 北京智芯微电子科技有限公司 Networking method, networking device, computer equipment, chip and readable storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106559352A (en) * 2016-12-07 2017-04-05 中南大学 The QoS routing mechanisms that a kind of interference of smart grid-oriented NAN is perceived

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102752227B (en) * 2012-08-02 2015-11-11 国家电网公司 A kind of network-building method of power user power consumption information acquisition system, website and system
CN103441781B (en) * 2013-08-28 2015-07-29 江苏麦希通讯技术有限公司 Power line carrier ad hoc network and system
CN105763410A (en) * 2014-12-18 2016-07-13 国家电网公司 HomePlug AV standard-based automatic relay networking method for power line broadband carrier band
CN107509227B (en) * 2017-07-05 2020-05-08 国网浙江省电力公司 Micropower wireless network communication method for electricity consumption information acquisition system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106559352A (en) * 2016-12-07 2017-04-05 中南大学 The QoS routing mechanisms that a kind of interference of smart grid-oriented NAN is perceived

Also Published As

Publication number Publication date
CN110661870A (en) 2020-01-07

Similar Documents

Publication Publication Date Title
CN110661870B (en) HPLC communication networking method, device, storage medium and electronic equipment
US9553769B2 (en) Devices and methods for communication in ad-hoc networks
Pagliari et al. Scalable network synchronization with pulse-coupled oscillators
US8305946B2 (en) Intermittent operation communication device and communication system using beacon and sleep mode
TWI392277B (en) Automatic partner selection in the cooperative mac protocol
Huang et al. RC-MAC: A receiver-centric MAC protocol for event-driven wireless sensor networks
CN102695287B (en) VANET (vehicular ad-hoc network) media access control method
WO2021226760A1 (en) Partial sensing method and apparatus, terminal device, and storage medium
JP2015513243A (en) System and method for reducing collisions after traffic indication map paging
JP5174624B2 (en) Wireless communication system, wireless communication terminal, and wireless base station
US20110182178A1 (en) Randomization Management For Carrier Sensing Multiple Access with Collision Avoidance (CSMA-CA)
JP2013131834A (en) Radio communication device and radio communication method
JP5932162B2 (en) Temporary media handover
Dezfouli et al. DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks
JP5366920B2 (en) Wireless communication system, wireless communication method, and wireless communication program
US11979205B1 (en) Method for configuring and updating random access resources in multi-antenna MIMO environment
US8300756B2 (en) Intermittent operative communication apparatus adaptively controlling the timing of waiting data reception and a method therefor
KR101623439B1 (en) Data transmission reservation method and apparatus, data reception method and apparatus, and data transmission and reception system in receiver-initiated asynchronous medium access control protocol
US8855693B2 (en) Method and apparatus for controlling wireless devices
US20040186907A1 (en) Technique for optimizing backoff for a shared resource
KR20150111732A (en) Apparatus and methdo for transfering data using concurrent transmission
KR100919483B1 (en) Packet data transmission method in Wireless senssor network and system using the same
US20190104467A1 (en) Slotted channel access in communications network
EP4138475A1 (en) Method, apparatus and system for determining resource
Thu-Hang et al. Delay and reliability analysis of p-persistent carrier sense multiple access for multievent wireless sensor network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information

Address after: 266399 airport service building, No. 1, Zhanqian Avenue, Qingdao Airport Economic Demonstration Zone, Jiaodong sub district office, Jiaozhou City, Qingdao City, Shandong Province

Applicant after: Qingdao lianzhongxin cloud Technology Co.,Ltd.

Address before: 266300 Room 907, Convenient Service Center, Jiaodong Street Office, Qingdao City, Shandong Province

Applicant before: Qingdao Lianzhong Zhixin Technology Co.,Ltd.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant