Dynamic address allocation method for power line carrier communication network

Abstract

The invention discloses a dynamic address allocation method for a power line carrier communication network, and the method comprises the steps: obtaining an impedance feature code corresponding to an electrical line connected with a terminal device when the terminal device is connected to a power line network, and generating a unique power line identity recognition code as an address seed; the terminal equipment performs communication negotiation with other nodes in the network by using the address seed, and obtains a network layer address through a negotiation process containing a conflict avoidance mechanism; monitoring the state of the allocated network layer address, starting a multi-stage verification and recovery process after detecting that the equipment corresponding to the address is offline, and updating the address state for reallocation; according to the method, the uniqueness and safety of address allocation are improved by utilizing the physical layer feature code, the allocation success rate is improved through an improved conflict avoidance mechanism, and the utilization efficiency of an address pool and the dynamic stability of a network are improved by adopting designed address life cycle management.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a dynamic address allocation method for power line carrier communication networks. Background Technology

[0002] Power line communication (PLC) technology, with its advantages of requiring no additional wiring and wide coverage, has become an important communication method in smart grids and the Internet of Things (IoT). In PLC networks, to meet the needs of a large number of nodes, an efficient dynamic address allocation mechanism is essential. Early solutions mainly employed static address pre-configuration or centralized allocation strategies. While static address configuration is simple, large-scale deployments not only involve complex management and maintenance but are also prone to address conflicts due to human error. Centralized allocation schemes, such as those based on DHCP, face the risk of single points of failure, and their signaling interaction process increases the communication burden on the power line channel, especially in harsh environments with frequent network topology changes, where their adaptability and efficiency are insufficient.

[0003] To address these challenges, existing technologies have explored distributed address management. For example, patent document CN118232961A discloses a dual-mode communication system for power information acquisition, which optimizes network self-organization capabilities through link state detection, thus improving communication reliability. However, such solutions still have limitations when applied to large-scale power line carrier communication networks. First, they fail to effectively utilize the inherent physical layer characteristics of power line channels (such as line impedance) to generate highly unique device identifiers, leading to a high risk of address conflicts during network initialization. Second, regarding network layer conflict resolution, the common CSMA / CA protocol primarily handles physical channel collisions, lacking efficient arbitration and confirmation methods for logical conflicts involving multiple devices requesting the same address. Furthermore, in address lifecycle management, the address reclamation mechanism for offline nodes is slow or inaccurate, easily leading to the invalidation of address resources, thereby reducing the utilization rate of the address pool and limiting the network's dynamic expansion capabilities.

[0004] Therefore, developing a dynamic address allocation method that can integrate physical layer features, efficient conflict arbitration mechanisms, and fine-grained address lifecycle management is crucial for improving the overall performance of power line carrier communication networks. Summary of the Invention

[0005] The purpose of this section is to outline some aspects of embodiments of the present invention and to briefly describe some preferred embodiments. Simplifications or omissions may be made in this section, as well as in the abstract and title of this application, to avoid obscuring the purpose of these documents; however, such simplifications or omissions should not be construed as limiting the scope of the invention.

[0006] In view of the aforementioned existing problems, this invention is proposed. Therefore, this invention provides a dynamic address allocation method for power line carrier communication networks to solve the problems mentioned in the background art.

[0007] To solve the above-mentioned technical problems, the present invention provides the following technical solution: a dynamic address allocation method for a power line carrier communication network, comprising:

[0008] When a terminal device is connected to a power line network, it obtains the impedance feature code corresponding to the electrical line connected to the terminal device, and generates a power line identification code based on the impedance feature code as an address seed.

[0009] The terminal device uses the generated address seed to negotiate with other nodes in the network and obtain a network layer address.

[0010] The status of the network layer address is monitored. When the terminal device corresponding to the address is detected to be offline, the status of the address is updated for subsequent reallocation.

[0011] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the process of generating a power line identification code based on the impedance feature code includes:

[0012] By performing frequency sweep impedance analysis on power line nodes, one or more characteristic frequency points in the complex impedance spectrum are extracted to form an initial feature code.

[0013] The initial feature code is processed using a preset chaotic encryption algorithm to generate the power line identification code.

[0014] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the communication negotiation includes:

[0015] In the first phase, the terminal device broadcasts an address request containing its address seed to the network.

[0016] In the second stage, after receiving the request, the neighboring devices in the network query the address mapping information and reply with an address that can be assigned.

[0017] In the third stage, when multiple terminal devices in the network simultaneously initiate address request requests, a preset conflict avoidance mechanism is applied to select one of the multiple requesting terminal devices to complete address allocation.

[0018] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the conflict avoidance mechanism preset in the third stage is a mechanism based on the carrier sense multiple access / conflict avoidance protocol.

[0019] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the conflict avoidance mechanism, upon detecting an address request conflict, determines the device to which the address belongs by querying a distributed hash table and utilizing the pre-stored mapping relationship between addresses and device identities in the distributed hash table.

[0020] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the conflict avoidance mechanism preset in the third stage further includes:

[0021] Based on the real-time status of network communication, the contention window size of the conflict avoidance mechanism is dynamically adjusted through a preset function;

[0022] A contention weight is assigned to the device based on its impedance characteristic code, and this contention weight determines the device's avoidance behavior in channel contention.

[0023] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the following steps are included: monitoring the status of the network layer address; updating the address's status for subsequent reallocation when the terminal device corresponding to the address is detected to be offline; and further including an address usage verification process.

[0024] When receiving data, the receiving device in the network verifies whether the device that sent the data has permission to use the network layer address currently in use.

[0025] If the verification passes, the data is received; if the verification fails, the data is discarded.

[0026] As a preferred embodiment of the dynamic address allocation method for the power line carrier communication network described in this invention, the monitoring and updating of the network layer address status includes:

[0027] The activity status of the network layer address is monitored by a periodic heartbeat detection mechanism. If no response is received for several consecutive times within a preset time, the address is marked as offline and awaiting confirmation.

[0028] Perform activity verification on addresses marked as offline and pending confirmation.

[0029] If the verification confirms that the address is inactive, the status of the address is updated to pending reclamation in the distributed hash table, and a timer for a preset duration is started for the pending reclamation status;

[0030] After the preset timeout period ends, the address is released into the available address pool.

[0031] Compared with existing technologies, the beneficial effects of the invention are:

[0032] 1. By obtaining the power line impedance feature code of the terminal device access point, and generating a highly unique power line identification code as an address seed based on this, while utilizing the inherent electrical characteristics of the physical layer, there is no need to pre-program or manually configure the address. This not only avoids operational errors, but also provides each node with a physically difficult-to-copy "identity", fundamentally reducing the probability of address conflicts during the network initialization phase.

[0033] 2. This invention introduces a secondary verification and arbitration mechanism based on a distributed hash table on top of the traditional CSMA / CA conflict avoidance mechanism. When a logical conflict occurs where multiple devices compete for the same network address, this mechanism can make a ruling by querying the distributed hash table, thereby efficiently and deterministically resolving the address allocation problem. This avoids the uncertainty brought about by the traditional mechanism relying solely on random backoff and enhances the reliability of the address allocation process.

[0034] 3. In addition, the present invention also realizes the automatic and secure reclamation of offline node addresses through periodic heartbeat detection, pending reclamation status marking and preset retention period. It can release and reallocate invalid addresses in a timely manner, effectively improve the utilization efficiency of the address pool, and ensure the long-term stable operation and scalability of the network in dynamic scenarios such as frequent node addition or removal. Attached Figure Description

[0035] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort. Wherein:

[0036] Figure 1 This is a general flowchart of a dynamic address allocation method for a power line carrier communication network according to an embodiment of the present invention. Detailed Implementation

[0037] To make the above-mentioned objects, features, and advantages of the present invention more apparent and understandable, specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the protection scope of the present invention.

[0038] Many specific details are set forth in the following description in order to provide a full understanding of the invention. However, the invention may also be practiced in other ways different from those described herein, and those skilled in the art can make similar extensions without departing from the spirit of the invention. Therefore, the invention is not limited to the specific embodiments disclosed below.

[0039] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The phrase "in one embodiment" appearing in different places in this specification does not necessarily refer to the same embodiment, nor is it a single or selective embodiment that is mutually exclusive with other embodiments.

[0040] This invention is described in detail with reference to the schematic diagrams. When detailing the embodiments of this invention, for ease of explanation, the cross-sectional views illustrating the device structure may be partially enlarged, not adhering to the usual scale. Furthermore, the schematic diagrams are merely examples and should not be construed as limiting the scope of protection of this invention. In actual fabrication, the three-dimensional spatial dimensions of length, width, and depth should be included.

[0041] Furthermore, in the description of this invention, it should be noted that the terms "upper," "lower," "inner," and "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. These terms are used solely for the convenience of describing the invention and for simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on the invention. In addition, the terms "first," "second," or "third" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0042] Unless otherwise explicitly specified and limited, the terms "installation," "connection," and "joining" in this invention should be interpreted broadly. For example, they can refer to fixed connections, detachable connections, or integral connections; similarly, they can refer to mechanical connections, electrical connections, or direct connections, or indirect connections through an intermediate medium, or internal connections between two components. Those skilled in the art can understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0043] Example 1

[0044] Reference Figure 1 This is the first embodiment of the present invention, which provides a dynamic address allocation method for a power line carrier communication network, comprising:

[0045] S1. When the terminal device is connected to the power line network, the impedance feature code corresponding to the electrical line connected to the terminal device is obtained, and a power line identification code is generated based on the impedance feature code as an address seed.

[0046] Furthermore, stable and distinctive physical features are extracted from the complex power line environment, namely, the impedance feature code is collected.

[0047] Specifically, when a terminal device (also known as an application node) is powered on and connected to the power line network for the first time, its internally integrated sweep frequency impedance analysis unit is activated. This analysis unit can be understood as a miniature network analyzer, which injects a wideband sweep frequency signal from low frequency to high frequency (e.g., from 0.1MHz to 30MHz) into the power line network. At the same time as injecting the wideband sweep frequency signal, the analysis unit simultaneously measures the voltage and current response of the line. By calculating the ratio between voltage and current, it obtains the complex impedance spectrum (including amplitude and phase) over the entire sweep frequency range. This spectrum is a complete snapshot of the electrical environment of the access point.

[0048] Specifically, the shape of the complex impedance spectrum is determined by the topology of the power line (such as line length, number of branches, and type of connected loads). Among these, the resonant points (i.e., the frequency points where the impedance reaches a maximum or minimum value) in the complex impedance spectrum are the most sensitive features to changes in the topology of the power line. Therefore, it is necessary to accurately identify and extract key characteristic frequency information from the spectrum. This information may include, but is not limited to: the center frequency of one or more resonant peaks, the peak impedance amplitude corresponding to the resonant peaks, the phase angle at a specific frequency point (such as 10MHz), and the average impedance value of the spectrum in a certain frequency band.

[0049] Furthermore, by digitally encoding and structurally combining the key feature frequency information extracted above, a high-dimensional feature vector can be formed. This feature vector is represented as a binary data string (for example, the length of the number string is 128 bits), which is also called the initial feature fingerprint.

[0050] It should be noted that this fingerprint is a highly condensed representation of the physical connection characteristics of the node corresponding to the current fingerprint. Since the line conditions of different nodes under the same power branch are significantly different (i.e., the impedance difference is greater than 15dB), the initial feature fingerprint has discriminative power.

[0051] Furthermore, considering the potential for transient interference in power line environments, directly using the initial feature fingerprint may introduce minor instabilities. To address this, the present invention introduces chaotic encryption, leveraging its extreme sensitivity to initial conditions (butterfly effect) and excellent pseudo-randomness to amplify minute, meaningful physical differences, thus distinguishing them from the final identification code, while simultaneously smoothing out meaningless noise fluctuations. The specific processing steps are as follows:

[0052] From the generated initial feature fingerprint, select two or more of the most stable and discriminative feature values, such as the impedance amplitude Z at two different resonant points.f1 and Z f2 Perform a bitwise XOR operation on the selected feature values;

[0053] It should be explained that the XOR operation is an efficient non-linear mixing method that can quickly cross-combine the bit information of two input values ​​to initially confuse the data;

[0054] At the same time, a chaotic sequence with randomness and unpredictability is generated by the Lorentz chaotic sequence generator inside the terminal device, using an internal timestamp or counter as the initial variable;

[0055] Then, the result of the XOR operation is concatenated with the generated chaotic sequence, aiming to combine deterministic information derived from physical properties with pseudo-random information derived from chaotic encryption, so that the final result retains both physical uniqueness and cryptographic randomness.

[0056] Finally, the concatenated result (a string) is input into a standard secure hash function (e.g., SHA-256), which processes it into a fixed-length (e.g., 256-bit) irreversible digest. This digest is the final power line identifier, which is also the address seed used by the subsequent network layer for address negotiation.

[0057] Furthermore, the above processing steps can also be expressed mathematically as follows:

[0058]

[0059] Among them, Z f1 Z represents the impedance amplitude of the first resonance peak. f2 This is represented by the impedance amplitude of the second resonant peak; The expression represents a bitwise XOR operation; Chaos(t) represents a chaotic sequence, where t represents the initial condition or time variable of the sequence, such as the timestamp of device startup, an internal counter, etc. Furthermore, the introduction of this sequence enhances the seed's resistance to attacks. Even if an attacker knows the physical characteristics, they cannot calculate the correct chaotic sequence because they do not know t, thus preventing the forgery of the address seed; || represents a concatenation operation; Hash represents a hash function.

[0060] It should be noted that this invention utilizes the inherent and difficult-to-replicate electrical characteristics of the physical layer of power line networks to generate a unique "physical identity" for each device, which not only avoids the tediousness and errors of manual configuration, but also avoids address conflicts at the source.

[0061] S2. The terminal device uses the generated address seed to negotiate with other nodes in the network and obtain a network layer address.

[0062] It should be noted that after obtaining the address seed, the terminal device enters the network layer address negotiation phase. The goal of this phase is to allocate a unique, life-cycle network layer address to each terminal device within the entire power line carrier communication network. This negotiation process is distributed and does not rely on a central server, and can be divided into the following three phases:

[0063] The first stage is address request. First, the terminal device constructs an address request frame. The format of the request frame follows standards such as IEEE 802.15.4, and the payload of the request frame contains the address seed. Then, the terminal device uses the power line channel to broadcast the address request frame to all neighboring nodes within its physical range.

[0064] It should be noted that by broadcasting, the terminal device announces its existence to the network and its intention to obtain a network address;

[0065] The second stage is the address response. When a neighboring node that already has a valid address in the network hears an address request frame, it extracts the address seed from the frame. Then, the neighboring node queries a network-wide shared, distributed address mapping information table. In this invention, this address mapping information table is built on a distributed hash table (DHT). That is, by querying the DHT, the neighboring node can know which addresses in the current network are occupied and which addresses are available. During this process, if an available address is found, one or more neighboring nodes will construct an address allocation confirmation frame and reply to the terminal device. Furthermore, to achieve dynamic address management, the confirmation frame also includes an address lease duration, for example, set to 24 hours. During this process, the confirmation frame is sent directly to the requesting terminal device in unicast form (its physical address is known from the request frame). Ideally, if there is only one terminal device in the network and the network is idle, after receiving the first confirmation frame, the terminal device will broadcast an address confirmation message to the network, officially occupying the address, and the negotiation process is complete.

[0066] Furthermore, in real-world network environments, especially during network initialization or in densely populated areas, multiple terminal devices may simultaneously initiate address request requests within a similar timeframe, which can lead to address conflicts. To resolve such conflicts, this invention employs an improved mechanism based on the Carrier Sense Multiple Access / Collision Avoidance (CSMA / CA) protocol. This mechanism can not only handle collisions in the physical channel but also arbitrate logical conflicts in address allocation.

[0067] The third stage is conflict arbitration, which employs a mechanism based on the improved Carrier Sense Multiple Access / Conflict Avoidance (CSMA / CA) protocol:

[0068] Specifically, assuming node A and node B simultaneously request address 0x010A, neighboring nodes will receive both requests simultaneously and detect a logical conflict. At this point, one or more neighboring nodes will act as "arbitrators," initiating an "ownership query" to the DHT. This query includes the conflicting address 0x010A and the address seeds of A and B. Furthermore, the DHT will follow a preset rule (e.g., a numerical comparison based on the hash value of the address seed, with the smaller value winning). According to this rule, the DHT returns the address seed of the sole winner.

[0069] It should be noted that by sending an acknowledgment frame only to the winner based on the result returned by the DHT, this process can transform a probabilistic problem that may require multiple random retries into a deterministic and adjudicable query, fundamentally resolving the logical conflict in address allocation and avoiding allocation deadlock or long delays.

[0070] Furthermore, to make channel contention at the physical layer more intelligent, this mechanism abandons the fixed binary exponential backoff algorithm; instead, it continuously monitors the network channel status through the node's MAC layer, calculates the collision rate or channel busyness over a time period, obtains a parameter t representing the network state change, and allows the contention window size between nodes to be adjusted in real time using the Sigmoid function.

[0071]

[0072] Among them, CW new New competitive window size, CW base Current competition window size, For the Sigmoid function, λ is a preset positive constant used to control the sensitivity of the competition window to changes in the network state (that is, the trend of the competition window).

[0073] It needs to be explained that, in the CSMA / CA protocol, when a node detects that the channel is busy, it needs to wait for a random period of time before it can try to send data again, and the upper limit of this random waiting time is determined by the size of the contention window.

[0074] It should be noted that, through this function, when the network is busy and conflicts intensify (t increases), the function will smoothly increase the new contention window, allowing nodes to back off for longer, thereby reducing the probability of collisions again; when the network is idle (t decreases), the new contention window will decrease accordingly, shortening unnecessary channel waiting time and improving throughput.

[0075] Furthermore, this invention also uses the physical layer information obtained in step S1 to guide the MAC layer to achieve an intrinsic quality of service (QoS) differentiation: that is, while generating the address seed, a competitive weight is assigned to the node based on a key indicator of the impedance feature code (e.g., the steepness of the resonance peak or the average impedance value of a specific frequency band, which can reflect the node's signal quality or its importance in the network topology); for example, a key node with good signal quality is given a weight of +2.

[0076] It should be noted that the advantage of allocating contention weights is that, during the backoff countdown phase of CSMA / CA, nodes with higher contention weights have a smaller range of random backoff times to choose from, which means that statistically, these nodes can always complete the backoff earlier than other ordinary nodes, thereby gaining priority access to the channel.

[0077] S3. Monitor the status of network layer addresses. When the terminal device corresponding to the address is detected to be offline, update the status of the address for subsequent reallocation.

[0078] Furthermore, in order to ensure the dynamic flow and efficient utilization of network resources and prevent the "address zombie" problem caused by abnormal node offline, this invention also designs a distributed address lifecycle management mechanism.

[0079] Specifically, suppose node A (address Addr_A) sends a data packet to node C (address Addr_C) in the network; when node C receives the data packet, its MAC layer and network layer protocol stack will not immediately pass the data payload up to the application layer, but will instead trigger the following address usage verification process first:

[0080] First, node C parses the source address Addr_A from the header of the received data frame. This data frame contains an embedded digital signature generated by node A's private key (which uniquely corresponds to the address seed generated in step S1). Then, node C uses the source address Addr_A as the query key to initiate a query request to the Distributed Hash Table (DHT) network, i.e., DHT.query(Key = Addr_A). The DHT, based on its internal routing algorithm, quickly locates the node storing the Addr_A information and returns the corresponding value. This value is represented as a data structure containing authority information, for example: {Owner_Seed:'Seed_A_authentic', Status:'Occupied',...}, where Seed_A_authentic is the value bound to Addr_A when the address allocation is successful in step S2. The unique address seed, Occupied, indicates that the address is currently occupied. Node C uses the address seed Seed_A_authentic obtained from the DHT to verify the digital signature in the data packet. If the signature verification is successful, it indicates that the sender is the legitimate holder of Addr_A. At this point, node C only needs to confirm the legitimacy of the data source and enter the normal data processing flow, submitting the data payload to the upper layer. Conversely, if the signature verification fails, it indicates that the sender is not the legitimate holder of address Addr_A, and there may be address theft or malicious attack. In this case, node C will immediately perform a discard operation, clearing the data packet from the receive buffer. In addition, to enhance network security, node C can also record this unauthorized access event (including time, source physical address, etc.) in the local log, or broadcast a security alert to the network after receiving multiple unauthorized data packets from the same physical source.

[0081] It should be noted that after the above process is completed, there will be some addresses of offline or "dead" nodes. In order for these addresses to be reallocated, the above address lifecycle management mechanism includes the following steps in addition to the verification process:

[0082] All terminal devices that have successfully obtained addresses in the network broadcast a heartbeat packet to their neighboring nodes at a fixed, very short interval (e.g., less than 10 milliseconds). This heartbeat continuously announces to the network, "I am still online." Each node in the network listens for the heartbeats of its neighbors. If a node does not receive a heartbeat packet from a specific address multiple times (e.g., 3 times) within a preset time window, the node initially determines that the device corresponding to that address is offline. To avoid false positives, the address is not immediately reclaimed; instead, it is temporarily marked as "pending confirmation offline" in its local neighbor list. Once an address is marked as "pending confirmation offline,"... In a "status check" mechanism, one or more neighboring nodes will proactively initiate one or more liveness verifications for the address. Specifically, a neighboring node will unicast a "challenge frame" to the address, containing a request for an immediate response. If the target device correctly replies to the request within a specified timeout period, i.e., sends back a "response frame" to the address, it proves that the device is still online (possibly due to temporary channel congestion causing heartbeat loss), and the neighboring nodes will remove the "pending confirmation offline status" flag, restoring it to its normal state. If no valid response is received after sending multiple response requests (e.g., three attempts at 50 millisecond intervals), the neighboring nodes in the network reach a consensus, confirming the address as inactive.

[0083] After confirming that an address is inactive, a neighboring node (e.g., the node that initiated the challenge) is responsible for broadcasting an update instruction to the distributed hash table. This instruction does not directly delete the entry for that address, but updates its status field from "occupied" to "pending reclamation". This operation of updating the status field is usually called "tombstone marking" in distributed systems. Then, while updating the status field to "pending reclamation", the DHT entry records the current timestamp and starts a timer for the pending reclamation state for a preset duration, which is a safe retention period, for example, it can be set to 24 hours.

[0084] It should be noted that the purpose of setting this retention period is to prevent the "address flip" problem. That is, a device may only have a brief power outage or deep sleep and then come back online. If its address is immediately reclaimed and assigned to a new device, it will cause a conflict. Setting this retention period gives the original device enough time to reconnect to the network and claim ownership of the original address.

[0085] When the preset timeout period (e.g., 24 hours) ends, the "pending reclamation" status of the address officially expires. At this time, any node in the network that queries the DHT and finds an address in the "pending reclamation" status with its timeout expired has the right to trigger the final reclamation operation. This reclamation operation involves sending an update command to the DHT to update the address's status from "pending reclamation" to "available". Thus, the address is completely released into the available address pool and can be used by new devices to apply for and allocate addresses during the address negotiation process.

[0086] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The solutions in the embodiments of this application can be implemented using various computer languages, such as the object-oriented programming language Java and the interpreted scripting language JavaScript.

[0087] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0088] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0089] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0090] Although preferred embodiments of this application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of this application.

[0091] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A dynamic address allocation method for a power line carrier communication network, characterized in that, include: When a terminal device is connected to a power line network, it obtains the impedance feature code corresponding to the electrical line connected to the terminal device, and generates a power line identification code based on the impedance feature code as an address seed. The terminal device uses the generated address seed to negotiate with other nodes in the network and obtain a network layer address. The status of the network layer address is monitored. When the terminal device corresponding to the address is detected to be offline, the status of the address is updated for subsequent reallocation.

2. The dynamic address allocation method for power line carrier communication networks as described in claim 1, characterized in that, The process of generating a power line identification code based on the impedance feature code includes: By performing frequency sweep impedance analysis on power line nodes, one or more characteristic frequency points in the complex impedance spectrum are extracted to form an initial feature code. The initial feature code is processed using a preset chaotic encryption algorithm to generate the power line identification code.

3. The dynamic address allocation method for a power line carrier communication network as described in claim 1, characterized in that, The communication negotiation includes: In the first phase, the terminal device broadcasts an address request containing its address seed to the network. In the second stage, after receiving the request, the neighboring devices in the network query the address mapping information and reply with an address that can be assigned. In the third stage, when multiple terminal devices in the network simultaneously initiate address request requests, a preset conflict avoidance mechanism is applied to select one of the multiple requesting terminal devices to complete address allocation.

4. The dynamic address allocation method for power line carrier communication networks as described in claim 3, characterized in that, The collision avoidance mechanism preset in the third stage is a mechanism based on the carrier sense multiple access / collision avoidance protocol.

5. The dynamic address allocation method for power line carrier communication networks as described in claim 4, characterized in that, When an address request conflict is detected, the conflict avoidance mechanism queries a distributed hash table and uses the pre-stored mapping relationship between addresses and device identities in the distributed hash table to determine the device to which the address belongs.

6. The dynamic address allocation method for a power line carrier communication network as described in claim 4, characterized in that, The conflict avoidance mechanism preset in the third stage also includes: Based on the real-time status of network communication, the contention window size of the conflict avoidance mechanism is dynamically adjusted through a preset function; A contention weight is assigned to the device based on its impedance characteristic code, and this contention weight determines the device's avoidance behavior in channel contention.

7. The dynamic address allocation method for a power line carrier communication network as described in claim 1, characterized in that, The network layer address is monitored for status. When the terminal device corresponding to the address is detected to be offline, the status of the address is updated for subsequent reallocation. This step also includes an address usage verification process, which is as follows: When receiving data, the receiving device in the network verifies whether the device that sent the data has permission to use the network layer address currently in use. If the verification passes, the data is received; if the verification fails, the data is discarded.

8. The dynamic address allocation method for a power line carrier communication network as described in claim 1, characterized in that, Monitoring and updating the status of network layer addresses, including: The activity status of the network layer address is monitored by a periodic heartbeat detection mechanism. If no response is received for several consecutive times within a preset time, the address is marked as offline and awaiting confirmation. Perform activity verification on addresses marked as offline and pending confirmation. If the verification confirms that the address is inactive, the status of the address is updated to pending reclamation in the distributed hash table, and a timer for a preset duration is started for the pending reclamation status; After the preset timeout period ends, the address is released into the available address pool.

Images