Communication method for a mine telephone

CN122226150BActive Publication Date: 2026-08-21SHENOU COMM EQUIP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202610703771.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2026-05-21
Publication Date
2026-08-21
Estimated Expiration
2046-05-21

AI Technical Summary

Technical Problem

[0003]针对现有技术存在的不足,本发明的目的在于提供一种矿用电话机的通信方法,通过哈希映射存储地址表并配置老化机制解决离线节点地址残留问题,采用双重判定逻辑检测链路状态避免误判,设置帧优先级处理机制优化数据转发,实现主动解环和拓扑重置提升网络可靠性

Benefits of technology

[0009]The beneficial effects of this invention are as follows: By storing the address table using hash mapping and configuring a timestamp aging mechanism, it solves the problem of permanent address retention caused by non-link failures, avoiding invalid communication and bandwidth waste. The hash storage structure improves query efficiency and prevents network storms during the initialization phase. Dual-judgment logic detects link status, combining consecutive loss counts and time thresholds to filter out transient interference and reduce false positive rates. Adding unique identifiers and hop count limits to control frames effectively suppresses storms and avoids infinite forwarding. A frame priority mechanism ensures priority processing of critical control commands, and native frame encoding/decoding adaptation improves protocol compatibility. The active ring network detection and de-ringing mechanism, dynamic topology optimization, and fault self-healing function further improve network reliability and maintenance efficiency, achieving deep integration and management of fiber optic networks and the Profibus bus.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The application discloses a communication method of a mine telephone, comprising the following steps: a master station collects the topology and online state of all network nodes, issues a pre-configured address table and stores the address table by using a hash method, sets an address table capacity threshold and a table entry time stamp and aging time; a node receives a data frame through an LP electrical port / OP optical port, analyzes the address and refreshes the time stamp, periodically deletes the address of an offline node beyond the time limit and intercepts the frame, the master station sends a heartbeat frame, and a slave station responds to refresh the time stamp; the node analyzes the frame type, judges the link state by using the number of lost data and the time threshold, filters interference, adds the hop count and the identification to the control frame, discards the repeated frame and terminates the frame beyond the hop count, processes according to the priority of a fault control frame>real-time control frame>ordinary data frame, and the same priority is processed according to the first-come-first-served principle, and the original frame is directly encoded and decoded for transmission. The application realizes the dynamic management of the node by using the hash storage and the time stamp aging, improves the anti-interference ability by double detection, and guarantees the real-time performance and stability of the communication by the priority scheduling and loop network loop solving.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of mining communications, and more specifically to a communication method for a mining telephone. Background Technology

[0002] Optical fiber communication boasts advantages such as high transmission rate, large channel capacity, and long transmission distance. In recent years, the application of optical communication technology in high-speed fieldbus communication has become a research hotspot and has been applied in many situations. With the development trend of fieldbus networking, communication systems need to support various network topologies, including bus, star, ring, and hybrid types. Based on the advantages of optical fiber communication, the use of optical cables for communication in existing coal mines is very common. The existing communication methods of mine telephones are as follows: Currently, the existing technology includes an invention patent with publication number CN105790843A entitled "A Communication Method Applicable to Profibus," which discloses a corresponding optical fiber communication method. However, this method lacks an aging and elimination mechanism for the address table. It only deletes the corresponding address through control frames when a link fails. If a node leaves the network due to non-link failures such as power outages or offline status, its address will be permanently retained in the address tables of other nodes. This causes subsequent frames sent to the offline node to be forwarded in a targeted manner, resulting in wasted bandwidth, invalid communication, and misjudgment of the specific situation inside the coal mine. During the initialization / fault recovery phase, it is prone to network storms caused by full broadcasts, and linear storage leads to low query efficiency. The link fault detection has no threshold and is prone to misjudgment. The control frames lack storm suppression, there is no priority distinction between data and control frames, and the arbitration rules are unclear. The ring network detection method is simplistic, passively discarding relevant frames without an active resolution mechanism. It does not integrate with the Profibus master-slave architecture to achieve targeted forwarding and has not yet been deeply adapted to its native protocol. The optical fiber network is disconnected from the electrical bus management, increasing maintenance complexity. Summary of the Invention

[0003] To address the shortcomings of existing technologies, the present invention aims to provide a communication method for mining telephones. This method solves the problem of offline node address residue by storing address tables through hash mapping and configuring an aging mechanism, uses dual-judgment logic to detect link status to avoid misjudgment, sets a frame priority processing mechanism to optimize data forwarding, and achieves proactive loop de-looping and topology reset to improve network reliability.

[0004] To achieve the above objectives, the present invention provides the following technical solution: a communication method for a mining telephone, comprising the following steps: Step 1: The Profibus master station collects the topology and online status of all fiber optic nodes and slave stations in the network, sends the pre-configured address table to each fiber optic node, stores the address table of the fiber optic node using hash mapping, sets the address table capacity threshold to match the characteristics of the Profibus bus, adds a timestamp field to each address table entry and configures the aging time. Step 2: The fiber optic node receives the data frame to be communicated through the LP electrical port / OP optical port, parses the source and destination addresses of the data frame, and synchronously refreshes the timestamp of the corresponding source address table entry. Then, it scans the local address table at a fixed period, automatically deletes offline node addresses whose timestamps have exceeded the aging time, and if a data frame destined for such a node is subsequently received, it is directly intercepted and discarded locally. At the same time, the master station periodically sends address heartbeat frames, and the slave station responds to trigger the corresponding address timestamp refresh. Step 3: The fiber optic node performs type parsing on the received data frames and simultaneously detects the link status through a dual judgment logic based on the number of consecutive synchronization data loss and time thresholds, filtering out synchronization data loss caused by brief interference. Then, it adds forwarding hop counts and unique identifiers to control frames, discards frames with duplicate identifiers directly, and terminates forwarding of frames that exceed the hop count. Finally, it processes multiple frame data according to the priority order of fault control frames > Profibus real-time control frames > ordinary data frames, with the same priority following the first-come-first-served rule, and directly encodes and decodes Profibus native frames for fiber optic transmission.

[0005] As a further improvement of the present invention, during the frame forwarding process, the fiber optic nodes in steps two and three use multi-dimensional logic to determine the ring network. After detecting the ring network, they report a ring network alarm containing the involved optical port and topology information to the Profibus master station. After receiving the alarm, the master station determines the location of the ring network and sends an instruction to the designated fiber optic node to close the redundant optical port to achieve active ring de-looping.

[0006] As a further improvement of the present invention, when the link is normal, the master station optimizes the redundant ring network topology into a chain topology to reduce the number of forwarding nodes, and automatically opens the backup optical port when the link failure is recovered. At the same time, the master station issues address table update and forwarding route reconfiguration commands to complete the full network topology reset.

[0007] As a further improvement to the present invention, the specific steps for adding a timestamp field and configuring the aging time for each address table entry in step one are as follows: Step 11: Define the structure of the address table entries. This structure includes Profibus slave core information, timestamp, and aging time configuration, and uses hash mapping for storage. In steps one and two, when the master station sends down the pre-configured address table for the first time and confirms that the node is online, it writes the initial timestamp for the address table entry. Then, the master station collects the online status of the slave station according to the polling cycle of the Profibus bus. As long as the node communication is normal and the online status is True, the master station immediately updates the timestamp of the address table entry to the current time. The slave station actively sends heartbeat packets and status reporting messages. After receiving them, the master station will also immediately update the timestamp of the corresponding entry. Step 13: Set the aging time of all fiber optic nodes to the same value, set a longer aging time for critical nodes and a shorter time for ordinary nodes. Then, the main station starts a timed task to traverse the entire hash storage address table, execute it for each entry, calculate the time difference and determine the aging status of the entry. Step 14: Mark entries that are aged for the first time as "suspected offline" but retain the address table entry. For entries that are aged for the second time, mark the address table entry as "invalid", prohibit the master station from sending instructions to that address, and trigger node re-probing. Delete the address table entry after the second aging.

[0008] As a further improvement of the present invention, the specific steps of detecting the link status in step three through the dual determination logic of the number of consecutive data loss and time threshold are as follows: Step 31: The node checks whether a valid synchronization data frame has been received in each reception cycle. If a valid synchronization data frame is successfully received, no operation is performed. If no valid synchronization data frame is received, the node continues to the next step. Step 32: Each time synchronization data loss is detected, determine whether the following two conditions are met. Only when both conditions are met simultaneously is the link abnormality determined, and synchronization data is received before the double threshold is reached during the accumulation process: immediately terminate the determination, reset all counters, and maintain the link status as "normal". Condition 1: Number of consecutive data losses ≥ preset threshold; Condition 2: The cumulative time since the first loss is greater than or equal to the preset time threshold; Step 33: After the link has been determined to be "abnormal", the node continues to listen for synchronization data. If multiple valid synchronization data frames are received consecutively, and the cumulative time for receiving normal synchronization data exceeds the preset recovery confirmation time, the link is determined to be restored: all counters are reset, the link is updated to "normal", and a recovery notification is triggered.

[0009] The beneficial effects of this invention are as follows: By storing the address table using hash mapping and configuring a timestamp aging mechanism, it solves the problem of permanent address retention caused by non-link failures, avoiding invalid communication and bandwidth waste. The hash storage structure improves query efficiency and prevents network storms during the initialization phase. Dual-judgment logic detects link status, combining consecutive loss counts and time thresholds to filter out transient interference and reduce false positive rates. Adding unique identifiers and hop count limits to control frames effectively suppresses storms and avoids infinite forwarding. A frame priority mechanism ensures priority processing of critical control commands, and native frame encoding / decoding adaptation improves protocol compatibility. The active ring network detection and de-ringing mechanism, dynamic topology optimization, and fault self-healing function further improve network reliability and maintenance efficiency, achieving deep integration and management of fiber optic networks and the Profibus bus. Detailed Implementation

[0010] The present invention will be further described in detail below with reference to the given embodiments.

[0011] The communication method of a mining telephone according to this embodiment includes the following steps: Step 1: The Profibus master station collects the topology and online status of all fiber optic nodes and slave stations in the network, sends the pre-configured address table to each fiber optic node, stores the address table of the fiber optic node using hash mapping, sets the address table capacity threshold to match the characteristics of the Profibus bus, adds a timestamp field to each address table entry and configures the aging time. Step 2: The fiber optic node receives the data frame to be communicated through the LP electrical port / OP optical port, parses the source and destination addresses of the data frame, and synchronously refreshes the timestamp of the corresponding source address table entry. Then, it scans the local address table at a fixed period, automatically deletes offline node addresses whose timestamps have exceeded the aging time, and if a data frame destined for such a node is subsequently received, it is directly intercepted and discarded locally. At the same time, the master station periodically sends address heartbeat frames, and the slave station responds to trigger the corresponding address timestamp refresh. Step 3: The fiber optic node performs type parsing on the received data frames and simultaneously detects the link status through a dual judgment logic based on the number of consecutive synchronization data loss and time thresholds, filtering out synchronization data loss caused by brief interference. Then, it adds forwarding hop counts and unique identifiers to control frames, discards frames with duplicate identifiers directly, and terminates forwarding of frames that exceed the hop count. Finally, it processes multiple frame data according to the priority order of fault control frames > Profibus real-time control frames > ordinary data frames, with the same priority following the first-come-first-served rule, and directly encodes and decodes Profibus native frames for fiber optic transmission.

[0012] In the above process, the master station stores the address table through hash mapping and configures the aging time, which solves the problem of bandwidth waste caused by permanent address residue in the existing technology. The hash structure improves query efficiency. The dual link detection logic uses two thresholds, the number of times and the time, to avoid the defect of easy misjudgment by a single threshold. The frame priority processing mechanism ensures that key control commands are transmitted first. The native frame encoding and decoding achieves deep adaptation with the Profibus protocol, solving the problem of disconnect between fiber optic network and electrical bus management.

[0013] Furthermore, during frame forwarding, the fiber optic nodes in steps two and three employ multi-dimensional logic to determine ring networks. Upon detecting a ring network, they report a ring network alarm to the Profibus master station, including information on the involved optical port and topology. After receiving the alarm, the master station determines the location of the ring network and issues a command to the designated fiber optic node to close redundant optical ports, thus actively resolving the ring. This process, through proactive detection and ring resolving mechanisms, overcomes the limitations of existing technologies that passively discard frames, improving the proactivity and efficiency of ring network fault handling and reducing network congestion risks.

[0014] Furthermore, when the links are normal, the master station optimizes the redundant ring network topology into a chain topology to reduce forwarding nodes. Upon recovery from a link failure, it automatically activates the backup optical port. Simultaneously, the master station issues address table update and forwarding route reconfiguration commands to complete a full network topology reset. Through dynamic topology optimization and fault self-healing, the number of forwarding nodes under normal conditions is reduced, latency is lowered, and the topology is quickly reset upon fault recovery, improving network availability.

[0015] Furthermore, the specific steps for adding a timestamp field and configuring the aging time for each address table entry in step one are as follows: Step 11: Define the structure of the address table entries. This structure includes Profibus slave core information, timestamp, and aging time configuration, and uses hash mapping for storage. In steps one and two, when the master station sends down the pre-configured address table for the first time and confirms that the node is online, it writes the initial timestamp for the address table entry. Then, the master station collects the online status of the slave station according to the polling cycle of the Profibus bus. As long as the node communication is normal and the online status is True, the master station immediately updates the timestamp of the address table entry to the current time. The slave station actively sends heartbeat packets and status reporting messages. After receiving them, the master station will also immediately update the timestamp of the corresponding entry. Step 13: Set the aging time of all fiber optic nodes to the same value, set a longer aging time for critical nodes and a shorter time for ordinary nodes. Then, the main station starts a timed task to traverse the entire hash storage address table, execute it for each entry, calculate the time difference and determine the aging status of the entry. Step 14: Mark entries that are aged for the first time as "suspected offline" but retain the address table entry. For entries that are aged for the second time, mark the address table entry as "invalid", prohibit the master station from sending instructions to that address, and trigger node re-probing. Delete the address table entry after the second aging.

[0016] By employing a tiered aging mechanism and a dual-confirmation deletion process, accidental deletion of address table entries is avoided. Differentiated configuration of key nodes enhances system stability and solves the resource waste problem caused by the extensive address table management in existing technologies.

[0017] Furthermore, the specific steps for detecting the link status in step three using a dual-judgment logic based on the number of consecutive data loss and a time threshold are as follows: Step 31: The node checks whether a valid synchronization data frame has been received in each reception cycle. If a valid synchronization data frame is successfully received, no operation is performed. If no valid synchronization data frame is received, the node continues to the next step. Step 32: Each time synchronization data loss is detected, determine whether the following two conditions are met. Only when both conditions are met simultaneously is the link abnormality determined, and synchronization data is received before the double threshold is reached during the accumulation process: immediately terminate the determination, reset all counters, and maintain the link status as "normal". Condition 1: Number of consecutive data losses ≥ preset threshold; Condition 2: The cumulative time since the first loss is greater than or equal to the preset time threshold; Step 33: After the link has been determined to be "abnormal", the node continues to listen for synchronization data. If multiple valid synchronization data frames are received consecutively, and the cumulative time for receiving normal synchronization data exceeds the preset recovery confirmation time, the link is determined to be restored: all counters are reset, the link is updated to "normal", and a recovery notification is triggered.

[0018] This dual-judgment logic, combining the number of occurrences and the time dimension, effectively filters out false judgments caused by brief interferences, and the recovery confirmation mechanism ensures accurate switching of link states, thus solving the problem of low accuracy in link fault detection in existing technologies.

[0019] In summary, this invention solves the problems of address residue, link misjudgment, passive ring network processing, and insufficient protocol adaptation in existing mining telephone communication methods by using hash mapping address tables and aging mechanisms, dual link detection, frame priority processing, active ring network de-ringing, and dynamic topology optimization. It achieves the technical effects of efficient utilization of network resources, improved communication reliability, and reduced maintenance complexity.

[0020] The above description is merely a preferred embodiment of the present invention. The scope of protection of the present invention is not limited to the above embodiments. All technical solutions falling within the scope of the present invention's concept are within the scope of protection of the present invention. It should be noted that for those skilled in the art, any improvements and modifications made without departing from the principles of the present invention should also be considered within the scope of protection of the present invention.

Claims

1. A communication method for a mining telephone, characterized in that: Includes the following steps: Step 1: The Profibus master station collects the topology and online status of all fiber optic nodes and slave stations in the network, sends the pre-configured address table to each fiber optic node, stores the address table of the fiber optic node using hash mapping, sets the address table capacity threshold to match the characteristics of the Profibus bus, adds a timestamp field to each address table entry and configures the aging time. Step 2: The fiber optic node receives the data frame to be communicated through the LP electrical port / OP optical port, parses the source and destination addresses of the data frame, and synchronously refreshes the timestamp of the corresponding source address table entry. Then, it scans the local address table at a fixed period, automatically deletes offline node addresses whose timestamps have exceeded the aging time, and if a data frame destined for such a node is subsequently received, it is directly intercepted and discarded locally. At the same time, the master station periodically sends address heartbeat frames, and the slave station responds to trigger the corresponding address timestamp refresh. Step 3: The fiber optic node performs type parsing on the received data frames and simultaneously detects the link status through a dual judgment logic based on the number of consecutive synchronization data loss and time thresholds, filtering out synchronization data loss caused by brief interference. Then, it adds forwarding hop counts and unique identifiers to control frames, discards frames with duplicate identifiers directly, and terminates forwarding of frames that exceed the hop count. Finally, it processes multiple frame data according to the priority order of fault control frames > Profibus real-time control frames > ordinary data frames, with the same priority following the first-come-first-served rule, and directly encodes and decodes Profibus native frames for fiber optic transmission.

2. The communication method of the mining telephone according to claim 1, characterized in that: During frame forwarding, the fiber optic nodes in steps two and three use multi-dimensional logic to determine the ring network. After detecting the ring network, they report a ring network alarm containing the involved optical port and topology information to the Profibus master station. After receiving the alarm, the master station determines the location of the ring network and sends a command to the designated fiber optic node to close the redundant optical port to achieve active ring de-looping.

3. The communication method for a mining telephone according to claim 2, characterized in that: When the link is normal, the master station optimizes the redundant ring network topology into a chain topology to reduce forwarding nodes, and automatically opens the backup optical port when the link failure is recovered. At the same time, the master station issues address table update and forwarding route reconfiguration commands to complete the full network topology reset.

4. The communication method of the mining telephone according to any one of claims 1 to 3, characterized in that: The specific steps for adding a timestamp field and configuring the aging time for each address table entry in step one are as follows: Step 11: Define the structure of the address table entries. This structure includes Profibus slave core information, timestamp, and aging time configuration, and uses hash mapping for storage. In steps one and two, when the master station sends down the pre-configured address table for the first time and confirms that the node is online, it writes the initial timestamp for the address table entry. Then, the master station collects the online status of the slave station according to the polling cycle of the Profibus bus. As long as the node communication is normal and the online status is True, the master station immediately updates the timestamp of the address table entry to the current time. The slave station actively sends heartbeat packets and status reporting messages. After receiving them, the master station will also immediately update the timestamp of the corresponding entry. Step 13: Set the aging time of all fiber optic nodes to the same value, set a longer aging time for critical nodes and a shorter time for ordinary nodes. Then, the main station starts a timed task to traverse the entire hash storage address table, execute it for each entry, calculate the time difference and determine the aging status of the entry. Step 14: The entries that are aged for the first time are marked as "suspected offline" but the address table entries are retained. For the entries that are aged for the second time, the address table entries are marked as "invalid". The master station is prohibited from sending instructions to the address and the node re-probe is triggered. The address table entries that are aged for more than two times are deleted.

5. The communication method of the mining telephone according to any one of claims 1 to 3, characterized in that: The specific steps for detecting the link status in step three using the dual judgment logic of the number of consecutive data loss and time threshold are as follows: Step 31: The node checks whether a valid synchronization data frame has been received in each reception cycle. If a valid synchronization data frame is successfully received, no operation is performed. If no valid synchronization data frame is received, the node continues to the next step. Step 32: Each time synchronization data loss is detected, determine whether the following two conditions are met. Only when both conditions are met simultaneously is the link abnormality determined, and synchronization data is received before the double threshold is reached during the accumulation process: immediately terminate the determination, reset all counters, and maintain the link status as "normal". Condition 1: Number of consecutive data losses ≥ preset threshold; Condition 2: The cumulative time since the first loss is greater than or equal to the preset time threshold; Step 33: After the link has been determined to be "abnormal", the node continues to listen for synchronization data. If multiple valid synchronization data frames are received consecutively, and the cumulative time for receiving normal synchronization data exceeds the preset recovery confirmation time, the link is determined to be restored: all counters are reset, the link is updated to "normal", and a recovery notification is triggered.

Citation Information

Patent Citations

  • Ethernet single ring network address refreshing method and system

    CN101902382A

  • Optical fiber communication method applicable to Profibus

    CN105790843A