A carrier path selection method based on beacon success rate sliding window calculation
By using beacon sequence numbers and bitmaps to calculate carrier path selection, the unreliable success rate caused by CSMA slot contention in carrier path selection is solved, enabling reliable communication and rapid path adjustment between carrier nodes, thus improving the success rate and speed of meter reading.
Patent Information
- Application Number
- CN202311742323.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-18
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-12-18
AI Technical Summary
In existing carrier path selection strategies, it has been found that the failure of list messages to compete for slots in CSMA slots leads to unreliable communication success rate calculations, especially when there are many nodes in the distribution area and the probability of slot competition failure is high, affecting the accuracy of path selection.
The downlink communication success rate is calculated using beacon sequence numbers, and downlink communication success information is exchanged through discovery list messages. By combining bitmap and beacon sequence number adjustments, the success rate assessment period is dynamically adjusted to avoid the problem of CSMA slot contention failure, quickly identify power grid interference, and switch to the optimal path.
It enables reliable calculation of uplink and downlink communication success rates between carrier nodes, rapid response to power grid interference, and improved meter reading success rate and speed.
Smart Images

Figure CN117880916B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of broadband power line carrier communication, and more particularly to a carrier path selection method for low-voltage distribution areas. Background Technology
[0002] To facilitate understanding of existing carrier path selection strategies, some technical terms in the field of carrier communication are explained below. For specific sources, please refer to: Technical Specification for Interoperability of High-Speed Carrier Communication on Low-Voltage Power Lines, Part 4-2: Data Link Layer Communication Protocol.
[0003] 1) Beacon: A management message sent by the central coordinator, agents, and sites, carrying network management and maintenance information for a specific purpose. Beacons sent by the central coordinator are called central beacons, those sent by agents are called agent beacons, and those sent by sites are called discovery beacons.
[0004] 2) Beacon period: The time interval at which the central coordinator periodically sends central beacons, determined by the network size.
[0005] 3) Routing period: This indicates the time period used for route evaluation, in seconds, with a range of 20 to 420 seconds.
[0006] 4) Bonded Carrier Sense Multiple Access (CSMA): CSMA time slots can be allocated to a specific priority or a specific type of service during the beacon period. When multiple sites meet the conditions for using bonded CSMA time slots, the multiple sites further compete for the right to use bonded CSMA through a CSMA competition mechanism.
[0007] 5) Time Division Multiple Access (TDMA): Time is divided into periodic frames, and each frame is further divided into several time slots (both frames and time slots are non-overlapping). Each time slot is a communication channel, which is allocated to one carrier node. In other words, in a TDMA time slot, only one node is transmitting signals at any given time.
[0008] 6) Discovery List: A carrier communication message that is competitively sent in a CSMA time slot, carrying itself in the previous routing cycle, as well as the beacons that have detected other nodes and the total number of discovery lists.
[0009] 7) Downlink communication success rate: The success rate of a node successfully listening to messages sent by another node.
[0010] 8) Uplink communication success rate: The success rate of another node listening to its own sent messages.
[0011] Current carrier node path selection strategy: Calculate the downlink and uplink communication success rates between two nodes using the number of beacons and discovery list entries from the previous routing cycle, and obtain the discovery list information for node A and node B. Node A parses Node B's discovery list and calculates that the downlink communication success rate is 8 / 10 = 80%, and the uplink communication success rate is 7 / 10 = 70%. Similarly, Node B parses Node A's discovery list and calculates that the downlink communication success rate is 8 / 10 = 80%, and the uplink communication success rate is 8 / 10 = 80%. Through the exchange of discovery list information, any two nodes can calculate their respective downlink and uplink communication success rates.
[0012] However, the above path selection strategy has a problem. Because the discovery list message is sent in the CSMA time slot, the CSMA time slot needs to be contested. This means that even if there is no interference signal on the power line, the discovery list message will fail to be sent due to the failure to contest the time slot. The more nodes in the distribution area, the greater the probability of time slot contest failure. Therefore, when calculating the communication success rate, the number of discovery lists will make the calculation results unreliable. Summary of the Invention
[0013] This invention addresses the shortcomings of existing technologies by proposing a carrier path selection method based on a beacon success rate sliding window calculation. This method calculates the downlink communication success rate using beacon sequence numbers and publishes downlink communication success information through discovery list messages. Through the exchange of discovery list information, all network nodes establish uplink and downlink communication success rates with each other. In this method, the discovery list is only used for exchanging downlink communication success rates and is not used for channel evaluation between carrier nodes, thus avoiding the unreliability of success rate calculation results caused by CSMA slot contention failures. Furthermore, this method can adjust the size of the beacon sequence number bitmap to adjust the communication success rate evaluation period, enabling rapid identification of interference in the power grid and timely switching to the optimal path.
[0014] The path selection algorithm of this invention can be implemented through the following technical solutions: A carrier path selection method based on beacon success rate sliding window calculation includes the following steps: Step 1: The carrier node periodically sends beacons with a beacon period of T (1-15 seconds) and carries the beacon sequence number sn in the beacon message.
[0015] Step 2: The carrier node uses a bitmap of size N bits to record the reception of another carrier node's beacon over the past N beacon cycles.
[0016] Step 3: The carrier node calculates the downlink communication success rate based on the bitmap and publishes it in the discovery list.
[0017] Step 4: The carrier node parses the discovery list of other nodes to obtain the uplink communication success rate.
[0018] Step 5: All carrier nodes use the methods from Step 1 to Step 4 to calculate the downlink and uplink communication success rates with surrounding carrier nodes, and select the node with the largest product of downlink and uplink communication success rates as the proxy node, thereby forming the optimal path to the central node.
[0019] Furthermore, in step 2, the bitmap size N can be dynamically adjusted according to the beacon period T. When T < 2, N should be > 48 to avoid too few beacon count samples; when T > 10, N should be < 32 to avoid the sliding window period being too long and reducing timeliness. After considering the combined effects of sample size and timeliness, the product of N and T is less than 300 seconds.
[0020] Furthermore, in step 2, the current bit of the bitmap is cleared during each beacon cycle, and then set again when a beacon message is received. This prevents the downlink communication success rate from remaining at a historically high value when another carrier node's beacon is not received for an extended period. This mechanism serves as the downlink communication success rate aging mechanism, and the calculation formula for downlink communication success rate aging is as follows: in, rate d The downlink communication success rate is represented by N, where N is the size of the bitmap and n is the number of bits set in the bitmap at the current moment.
[0021] Furthermore, in step 2, when one carrier node detects a beacon message from another carrier node, it parses the beacon sequence number value, calculates the number of missed beacon detections using the difference between the old and new beacon sequence numbers, and clears the bits between the old and new beacon sequence numbers on the bitmap to age the downlink communication success rate. The downlink communication success rate is calculated using the following formula: in, rate d The downlink communication success rate is given by N, where N is the bitmap size and n is the number of bits set in the bitmap at the current beacon reception time.
[0022] Furthermore, the downlink communication success rate in step 3 is directly calculated from the carrier node statistical bitmap and published using a discovery list message. The uplink communication success rate is indirectly obtained by parsing the other party's discovery list message.
[0023] The beneficial technical effects of this invention are as follows: Downlink communication success rate is calculated using beacon sequence numbers, and downlink communication success information is published through discovery list messages. Through the exchange of discovery list information, all nodes in the network establish uplink and downlink communication success rates with each other. In this algorithm, the discovery list is only used to exchange downlink communication success rates and is not used for channel evaluation between carrier nodes, successfully avoiding the unreliable success rate calculation problem caused by CSMA slot contention failure. Furthermore, this method can dynamically adjust the size of the beacon sequence number bitmap to adjust the communication success rate evaluation period, enabling rapid detection of interference in the power grid that leads to a deterioration in communication success rate, thus allowing for timely switching to the optimal path. Attached Figure Description
[0024] Figure 1 This is the overall flowchart of the present invention.
[0025] Figure 2 This is a bitmap diagram illustrating normal beacon reception according to the present invention.
[0026] Figure 3 This is a schematic diagram illustrating the omission of beacon reception in this invention.
[0027] Figure 4 This is a schematic diagram illustrating the node communication success rate exchange of the present invention.
[0028] Figure 5 This is a schematic diagram of node path selection in this invention. Implementation
[0029] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and do not limit the scope of the invention.
[0030] Combined with appendix Figure 1 A carrier path selection method based on beacon success rate sliding window calculation includes the following steps: Step 1: The carrier node periodically transmits beacons in the TDMA time slot with a beacon period of T (1-15 seconds), and carries the beacon sequence number sn in the beacon message. The node increments the beacon sequence number sn by 1 each time it transmits a beacon. Depending on the length of the beacon message, the node can transmit one or more beacons within a beacon period.
[0031] Step 2: The carrier node uses a bitmap of size N bits, such as... Figure 2 As shown in bitmap 21, the bitmap is 6 bits in size and is used to record the reception status of another carrier node's beacon in the past 6 times. A bit of 1 indicates that the beacon of another node was received at the corresponding beacon sequence number, and a bit of 0 indicates that the beacon of another node was not received at the corresponding beacon sequence number.
[0032] Furthermore, in step 2, the current bit of the bitmap is cleared each beacon cycle, such as... Figure 2 As shown in bitmap 22, this avoids the downlink communication success rate remaining at a historically high value when another carrier node's beacon is not received for an extended period; the current bit is then set only when another carrier node's beacon message is received, as shown in bitmap 22. Figure 2 As shown in bitmap 23. In this case, the formula for calculating the downlink communication success rate aging is:
[0033] in, rate d The downlink communication success rate is represented by N, where N is the size of the bitmap and n is the number of bits set in the bitmap at the current moment.
[0034] Further, in step 2, when a carrier node misses listening to another carrier node's beacon in the past few beacon cycles but detects another carrier node's beacon in the current beacon cycle, it parses the beacon sequence number value, calculates the number of missed beacon listening times using the difference between the old and new beacon sequence numbers, first clears the bits between the old and new beacon sequence numbers, and then sets the bitmap corresponding to the new beacon sequence number, such as... Figure 3 As shown in bitmap 32, in this case, the formula for calculating the downlink communication success rate is:
[0035] in, rate d The downlink communication success rate is given by N, where N is the bitmap size and n is the number of bits set in the bitmap at the current beacon reception time.
[0036] Step 3: Carrier node A calculates the communication success rate of listening to carrier node B based on the number of bits set in the bitmap and the bitmap size N. This communication success rate is called the downlink communication success rate from carrier node A to B. Carrier node B also calculates the downlink communication success rate using the same method and publishes the B-to-A downlink communication success rate in the discovery list message, such as... Figure 4 As shown, this is so that other nodes can calculate the uplink communication success rate.
[0037] Step 4: Carrier node A listens to the discovery list message of carrier node B, parses the downlink communication success rate from B to A, and obtains the uplink communication success rate from A to B.
[0038] Furthermore, the downlink communication success rate from A to B is obtained directly by calculating the statistical bitmap; the uplink communication success rate from A to B is indirectly obtained by A parsing B's discovery list information. The uplink communication success rate from A to B is equivalent to the downlink communication success rate from B to A. Therefore, with the downlink communication success rate, the uplink and downlink communication success rates can be obtained by exchanging the discovery lists.
[0039] Step 5: All nodes in the carrier network use the methods from Steps 1 to 4 to calculate their downlink and uplink communication success rates when listening to surrounding carrier nodes. The node with the largest product of its downlink and uplink success rates is selected as its proxy node, thus forming the optimal path to the central node. Figure 5 As shown, the uplink and downlink communication success rates of nodes 4 and 2 are 90% and 95% respectively, and the uplink and downlink communication success rates of nodes 4 and 3 are 100% and 70% respectively. Therefore, node 4 selects node 2 as its proxy node to form the optimal path to reach the central node 1.
[0040] This embodiment uses actual field data to test and verify the method described in this invention, and compares the test data with the existing solutions in the background section. The comparison focuses on the success rate and speed of meter reading in low-voltage areas, and finds that the improved path selection algorithm has a significant improvement in both the success rate and speed of meter reading.
[0041] The above embodiments are descriptions of specific implementations of the present invention, and not limitations thereof. Those skilled in the art can make various modifications and changes without departing from the spirit and scope of the present invention to obtain corresponding equivalent technical solutions. Therefore, all equivalent technical solutions should be included in the patent protection scope of the present invention.
Claims
1. A carrier path selection method based on beacon success rate sliding window calculation, characterized in that, Includes the following steps: Step 1: The carrier node periodically sends beacons with a beacon period of T, and carries the beacon sequence number sn in the beacon message; Where T is a preset beacon period value, and the value of T ranges from 1 to 15 seconds; Step 2: The carrier node uses a bitmap of size N bits to record the beacon reception status corresponding to the N most recent beacon sequence numbers. Each bit of the bitmap corresponds one-to-one with the beacon sequence number. When a beacon from another carrier node is received, the corresponding bit is set; otherwise, the corresponding bit is cleared. Step 3: The carrier node calculates the downlink communication success rate based on the number of set bits in the bitmap and the bitmap size N, and publishes it in the discovery list; Step 4: The carrier node parses the discovery list of other nodes to obtain the downlink communication success rate from other nodes to this node, which is used as the uplink communication success rate from this node to other nodes. Step 5: All carrier nodes use the methods from Step 1 to Step 4 to calculate the downlink and uplink communication success rates with adjacent carrier nodes, and select the node with the largest product of downlink and uplink communication success rates as the proxy node, thereby forming the optimal path to the central node.
2. The carrier path selection method based on beacon success rate sliding window calculation according to claim 1, characterized in that, In step 2, the bitmap size N can be dynamically adjusted according to the beacon period T. When T < 2, N > 48; when T > 10, N < 32; and the product of N and T is less than 300 seconds.
3. The carrier path selection method based on beacon success rate sliding window calculation according to claim 1, characterized in that, In step 2, the current bit of the bitmap is cleared during each beacon cycle to age the downlink communication success rate. The current bit is then set again upon receiving a beacon message. The formula for calculating the downlink communication success rate aging is as follows: ; Among them, rate d The downlink communication success rate is represented by N, where N is the size of the bitmap and n is the number of bits set in the bitmap at the current moment.
4. The carrier path selection method based on beacon success rate sliding window calculation according to claim 1, characterized in that, In step 2, when one carrier node detects a beacon message from another carrier node, it parses the beacon sequence number, calculates the number of missed beacon detections using the difference between the old and new beacon sequence numbers, and clears the bits between the old and new beacon sequence numbers on the bitmap to age the downlink communication success rate. The downlink communication success rate is calculated using the following formula: ; Among them, rate d The downlink communication success rate is given by N, where N is the bitmap size and n is the number of bits set in the bitmap at the current moment.
5. The carrier path selection method based on beacon success rate sliding window calculation according to claim 1, characterized in that, The downlink communication success rate in step 3 is directly calculated by the carrier node's statistical bitmap and published using a discovery list message. The uplink communication success rate is obtained by the carrier node by parsing the other party's discovery list message to obtain the downlink communication success rate from the other party to this node. The downlink communication success rate from the other party to this node is the uplink communication success rate from this node to the other party.
Citation Information
Patent Citations
Signal sending method of broadband carrier communication network
CN111970030A
Information reporting method, device and equipment in electricity utilization information acquisition network
CN115102580A
