CN114422101B - Replacement address algorithm based on ultra-low rate data transmission radio station information communication - Google Patents
Replacement address algorithm based on ultra-low rate data transmission radio station information communication Download PDFInfo
- Publication number
- CN114422101B CN114422101B CN202111682361.5A CN202111682361A CN114422101B CN 114422101 B CN114422101 B CN 114422101B CN 202111682361 A CN202111682361 A CN 202111682361A CN 114422101 B CN114422101 B CN 114422101B
- Authority
- CN
- China
- Prior art keywords
- terminal
- information
- replacement
- queuing
- address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 17
- 230000005540 biological transmission Effects 0.000 title claims description 17
- 238000000034 method Methods 0.000 claims description 4
- 230000007123 defense Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/14—Two-way operation using the same type of signal, i.e. duplex
- H04L5/16—Half-duplex systems; Simplex/duplex switching; Transmission of break signals non-automatically inverting the direction of transmission
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a replacement address algorithm based on ultra-low rate data radio information communication, a half duplex data radio starts a working mode, a service system sends a group query instruction according to a preset time interval, a terminal starts queuing to report the return information orderly after receiving the group query instruction, a terminal queuing serial number in a working scene is obtained, after the service system selects the terminal to operate, a core network system starts to use the replacement position algorithm, the terminal can quickly locate the corresponding information in the replacement information by utilizing the self equipment queuing serial number, and then the service system is combined with other identifiers to judge whether the current instruction needs to be executed and returned.
Description
Technical Field
The invention relates to the technical field of encoding and decoding, in particular to a replacement address algorithm based on ultra-low rate data transmission radio station information communication.
Background
In the civil air defense industry, the civil air defense alarm adopts a half-duplex data transmission radio station to carry out terminal control, and because of factors such as rare communication frequency points, large transmission distance and the like, the communication rate of the half-duplex data transmission radio station is generally 300-500bps, and in practical application, when a terminal alarm terminal is purposefully selected to carry out functions such as real-time state inquiry, intelligent voice issuing, equipment self-checking plan issuing, equipment remote switching on and off and the like, a terminal address occupies a large amount of data resources, and the instruction issuing time delay is large; in practical application, considering distance and interference conditions, information is often sent multiple times, which takes longer time in terms of civil air defense emergency response speed.
The working mode of the half duplex data transmission radio station can only keep the same state when transmitting and receiving, the receiver wants to receive the wireless signal, all the devices are required to work at the same frequency point, thus realizing the master control to control a plurality of terminals, when the master control wants to let the terminals work, all the terminals receive the wireless signal through the issuing of instructions, when the instructions are no device address or all the terminals are required to be executed, no influence is caused, but if only partial devices are required to work, the terminals are required to be autonomously judged, so the master control can add a terminal address list required to be executed into the executing instructions, when the terminal data reach a certain quantity, the address list becomes long, under the ultra-low speed communication, the larger the data is, the longer the transmission time is, the possibility of transmission failure caused by interference is larger
Therefore, it is needed to develop a permuted address algorithm based on ultra-low rate data transmission station information communication, so as to solve the problem of low frequency point resource utilization and communication efficiency of the half-duplex data transmission station in ultra-low rate wireless communication.
Disclosure of Invention
In order to solve the technical problems, the invention provides a replacement address algorithm based on ultra-low rate data transmission radio station information communication, which comprises the following steps:
s1, starting a working mode of a half-duplex data transmission radio station, sending a group inquiry command by a service system according to a preset time interval, starting queuing to report the return information orderly after receiving the group inquiry command by a terminal, and obtaining a terminal queuing sequence number under a working scene;
s2, after the service system selects a terminal to operate, the core network system starts to use a replacement address algorithm;
s3, based on S2, the service system replaces the original data set which is the real address with 0 and 1, the service setting designates 0 to represent the execution command, 1 to represent the non-execution command or 0 to represent the non-execution command, 1 to represent the execution command, each 0 or 1 to represent a terminal, and the position of the single digit in the data set of 0 and 1 is provided with the corresponding terminal queuing serial number;
s4, based on the S3, using the data quantity obtained by the replacement address algorithm as the selection of the core network system to obtain replacement information;
s5, after the terminal receives the information sent by the main control, the terminal can quickly position the corresponding information in the replacement information by using the equipment queuing sequence number of the terminal, and the replacement information in the step S4 transmits the execution instruction combination to the terminal;
s6, based on the S5, after finding out the corresponding information, the terminal judges whether the current instruction needs to be executed and shown back according to the setting of the service system;
and S7, based on the S6, if the current instruction is judged to need to be executed and returned, the terminal executes the current instruction in the replacement information according to the self-ordering bit, and then recalculates the current returned sequence through the replacement information to carry out ordered returned.
Preferably, in the step S7, after the terminal receives the main control instruction, the sequence of the information feedback will be determined according to the sequence of the terminal in the instruction address list, and after using the permuted address algorithm, the sequence of the feedback is calculated.
Preferably, in the step S7, if the current instruction needs to be shown, the terminal uses a method of data interception to take out the data set from 1bit to the data bit to which the terminal belongs, and eliminates the number that does not need to be executed, so as to obtain the length of the new data set, namely the queuing number of the terminal that the instruction replies.
Preferably, in the step S6, after receiving the instruction with the replacement information, the terminal needs to intercept the replacement information first.
Preferably, after the replacement information is intercepted, if the length of the replacement information is smaller than the queuing number of the terminal, the instruction is not required to be executed; if the length of the replacement information is greater than the queuing number of the terminal itself, the queuing number is used as a subscript to locate data in the data set, and the terminal determines whether the current instruction needs to be executed according to the service setting in step S3.
Compared with the prior art, the invention has the following beneficial effects:
(1) According to the invention, the address information is replaced by the address information algorithm, when the address quantity of the terminal reaches a certain quantity, the address information can be replaced by the ordering information algorithm, the terminal acquires whether the current command needs to be executed or not in the short replacement information according to the ordering bits of the terminal, and then the present showing sequence is recalculated by the replacement information to carry out ordered showing.
Drawings
Fig. 1 is a flowchart of the present invention for generating substitution information.
FIG. 2 is a schematic diagram of a permuted address algorithm of the invention.
Fig. 3 is a schematic diagram of the real address algorithm of the present invention.
FIG. 4 is a byte comparison algorithm of the permuted address algorithm and the real address algorithm of the present invention.
Fig. 5 is a bit comparison algorithm of the permuted address algorithm and the real address algorithm of the present invention.
Fig. 6 is a flowchart of a process for replacing information by the terminal of the present invention.
Fig. 7 is a schematic diagram showing a substitution information expression scheme according to the present invention.
Detailed Description
The invention will be further described with reference to the drawings and detailed description.
In the description of the present invention, unless otherwise indicated, the meaning of "a plurality" is two or more; the terms "upper," "lower," "left," "right," "inner," "outer," "front," "rear," "head," "tail," and the like are used as an orientation or positional relationship based on that shown in the drawings, merely to facilitate description of the invention and to simplify the description, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore should not be construed as limiting the invention. Furthermore, the terms "first," "second," "third," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In the description of the present invention, it should be noted that, unless explicitly specified and limited otherwise, the terms "connected," "connected," and "connected" are to be construed broadly, and may be either fixedly connected, detachably connected, or integrally connected, for example; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
As shown in fig. 1, 2, 6 and 7, the permuted address algorithm based on ultra-low rate data transfer station information communication comprises the following steps:
s1, starting a working mode of a half-duplex data transmission radio station, sending a group inquiry command by a service system according to a preset time interval, starting queuing to report the return information orderly after receiving the group inquiry command by a terminal, and obtaining a terminal queuing sequence number under a working scene;
specifically, in the working mode of the half-duplex data transmission radio station, when the terminals report data collectively, in order not to generate interference, the terminals need to report the return information orderly in a queuing mode, and the terminal queuing number is the queuing number in the working scene.
S2, after the service system selects a terminal to operate, the core network system starts to use a replacement address algorithm;
s3, based on S2, the service system replaces the original data set which is the real address with 0 and 1, the service setting designates 0 to represent the execution command, 1 to represent the non-execution command or 0 to represent the non-execution command, 1 to represent the execution command, each 0 or 1 to represent a terminal, and the position of the single digit in the data set of 0 and 1 is provided with the corresponding terminal queuing serial number;
s4, based on the S3, using the data quantity obtained by the replacement address algorithm as the selection of the core network system to obtain replacement information;
specifically, the permuting position algorithm replaces the information that the terminal needs to execute in the received instruction address list with the queuing number and the information that whether to execute, in the specific working situation, whether to execute is a judgment of "0" and "1", the queuing number of the terminal is unique relative to the master control and the equipment, the digital combination information of "0" and "1" is provided with element information such as whether to execute, a data sequencing bit and the like, the information generated by the permuting position algorithm is a long array formed by using "0" and "1", each digit in the array represents a terminal, and judges which digit is a subscript in the corresponding array of the queuing number of the terminal, for example, a 50-long permuting information array represents a terminal with queuing numbers of 1 to 50, so that the terminals represented in the permuting information are all continuous terminals with queuing numbers, and all the terminals are arranged from queuing number 1, the maximum length of the array is determined by selecting the largest queuing number in the terminal, the array size of the permuting information can be determined, finally, the core network system sequentially sets the corresponding digits in the array as the whole queuing number 1 according to the selected terminal, and sets the whole number to the corresponding digits in the array to "0", and sets the whole number in the order to execute command.
S5, after the terminal receives the information sent by the main control, the terminal can quickly position the corresponding information in the replacement information by utilizing the equipment queuing sequence number of the terminal, and the replacement information in the step S4 can also send the execution instruction combination to the terminal;
s6, based on the S5, after finding out the corresponding information, the terminal judges whether the current instruction needs to be executed and shown back according to the setting of the service system;
and S7, based on the S6, if the current instruction is judged to need to be executed and returned, the terminal executes the current instruction in the replacement information according to the self-ordering bit, and then recalculates the current returned sequence through the replacement information to carry out ordered returned.
In step S7, after receiving the main control instruction, the terminal calculates the sequence of the feedback according to the sequence of the terminal in the instruction address list, and after using the permuted address algorithm. If the current instruction needs to be shown back, the terminal uses a data interception method to take out the data group from 1bit to the data bit to which the terminal belongs, eliminates the number which does not need to be executed, and obtains the length of the new data group, namely the queuing number of the current instruction reply of the terminal.
In step S6, after receiving the instruction with the replacement information, the terminal needs to intercept the replacement information first.
After the replacement information is intercepted, if the length of the replacement information is smaller than the queuing number of the terminal, the instruction is not required to be executed; if the length of the replacement information is greater than the queuing number of the terminal itself, the queuing number is used as a subscript to locate data in the data set, and the terminal determines whether the current instruction needs to be executed according to the service setting in step S3.
In this embodiment, by using the address information replacement address algorithm, when the address quantity of the terminal reaches a certain quantity, the terminal can adopt the algorithm of replacing the address information by using the ordering information, and the terminal obtains whether the terminal needs to execute the current command itself in the short replacement information according to the self-ordering bits, and then recalculates the present playback sequence by using the replacement information to perform ordered playback, and compared with the algorithm using the real address algorithm, the algorithm of the present invention can reduce the data resource by several times, and greatly improve the speed of information delivery
As shown in fig. 2 to 5, the permuted address algorithm uses 1bit data to represent a terminal, the real address algorithm uses 2 bytes (bytes, 1 byte=8 bits) data to represent a terminal, the byte comparison algorithm calculates the number of bytes occupied by the real address algorithm, and then finds the maximum queuing number (integer) in the selected terminal, and divides the maximum queuing number by 8 to obtain the data size of the permuted address algorithm. The bit comparison algorithm multiplies the selected number of terminals by the terminal address length, and then by 8 (1 byte=8 bits), to obtain the data size of the real address algorithm and the data size of the permuted address algorithm. The data volume of the obtained replacement address algorithm is smaller than that of the real address algorithm, and the data resource is effectively reduced.
The above-described embodiments are only preferred embodiments of the present invention and should not be construed as limiting the scope of the invention, and thus, modifications, equivalent variations, improvements, etc. made in accordance with the claims of the present invention still fall within the scope of the invention.
Claims (5)
1. The address replacement algorithm based on the ultra-low rate data transmission radio station information communication is characterized by comprising the following steps of:
s1, starting a working mode of a half-duplex data transmission radio station, sending a group inquiry command by a service system according to a preset time interval, starting queuing to report the return information orderly after receiving the group inquiry command by a terminal, and obtaining a terminal queuing sequence number under a working scene;
s2, after the service system selects a terminal to operate, the core network system starts to use a replacement address algorithm;
s3, based on S2, the service system replaces the original data set which is the real address with 0 and 1, the service setting designates 0 to represent the execution command, 1 to represent the non-execution command or 0 to represent the non-execution command, 1 to represent the execution command, each 0 or 1 to represent a terminal, and the position of the single digit in the data set of 0 and 1 is provided with the corresponding terminal queuing serial number;
s4, based on the S3, using the data quantity obtained by the replacement address algorithm as the selection of the core network system to obtain replacement information;
s5, after the terminal receives the information sent by the main control, the terminal can quickly position the corresponding information in the replacement information by using the equipment queuing sequence number of the terminal, and the replacement information in the step S4 transmits the execution instruction combination to the terminal;
s6, based on the S5, after finding out the corresponding information, the terminal judges whether the current instruction needs to be executed and shown back according to the setting of the service system;
and S7, based on the S6, if the current instruction is judged to need to be executed and returned, the terminal executes the current instruction in the replacement information according to the self-ordering bit, and then recalculates the current returned sequence through the replacement information to carry out ordered returned.
2. The permuted address algorithm based on ultra low rate data transfer station information communication of claim 1, wherein: in the step S7, after the terminal receives the main control instruction, the sequence of information feedback will be determined according to the sequence of the terminal in the instruction address list, and after using the replacement address algorithm, the sequence of feedback is calculated.
3. The permuted address algorithm based on ultra low rate data transfer station information communication of claim 2, wherein: in the step S7, if the current instruction needs to be shown, the terminal uses a method of data interception to take out the data set from 1bit to the data bit to which the terminal belongs, and eliminates the number which does not need to be executed, so as to obtain the length of the new data set, namely the queuing number of the current instruction reply of the terminal.
4. The permuted address algorithm based on ultra low rate data transfer station information communication of claim 1, wherein: in the step S6, after receiving the instruction with the replacement information, the terminal needs to intercept the replacement information.
5. The permuted address algorithm based on ultra low rate data transfer station information communication of claim 4, wherein: after the replacement information is intercepted, if the length of the replacement information is smaller than the queuing number of the terminal, the instruction is not required to be executed; if the length of the replacement information is greater than the queuing number of the terminal itself, the queuing number is used as a subscript to locate data in the data set, and the terminal determines whether the current instruction needs to be executed according to the service setting in step S3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111682361.5A CN114422101B (en) | 2021-12-30 | 2021-12-30 | Replacement address algorithm based on ultra-low rate data transmission radio station information communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111682361.5A CN114422101B (en) | 2021-12-30 | 2021-12-30 | Replacement address algorithm based on ultra-low rate data transmission radio station information communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114422101A CN114422101A (en) | 2022-04-29 |
| CN114422101B true CN114422101B (en) | 2024-03-19 |
Family
ID=81271460
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111682361.5A Active CN114422101B (en) | 2021-12-30 | 2021-12-30 | Replacement address algorithm based on ultra-low rate data transmission radio station information communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114422101B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116781744B (en) * | 2023-07-11 | 2024-03-01 | 北京和欣运达科技有限公司 | Key event scanning method based on half-duplex bus, gateway and terminal |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000033539A1 (en) * | 1998-11-30 | 2000-06-08 | Aimal Siraj | Communication system |
| CN101453801A (en) * | 2007-12-04 | 2009-06-10 | 株式会社日立国际电气 | Communication system and gateway |
| CN106792538A (en) * | 2016-12-29 | 2017-05-31 | 哈尔滨海能达科技有限公司 | Information uploading method, terminal pattern changing method and digital communication system |
| CN108347313A (en) * | 2017-01-24 | 2018-07-31 | 华为技术有限公司 | Feedback method and user equipment |
| CN109981220A (en) * | 2019-03-18 | 2019-07-05 | 成都极客通科技有限公司 | The transmission of half duplex communication data and confirmation method based on 39 system compression algorithms |
| CN110786030A (en) * | 2019-09-20 | 2020-02-11 | 北京小米移动软件有限公司 | Communication method, communication apparatus, and storage medium |
| CN111294838A (en) * | 2020-02-04 | 2020-06-16 | 湖南科大天河通信股份有限公司 | Multi-power-station base station, civil air defense warning system and control instruction transmission method |
| CN112437484A (en) * | 2020-10-16 | 2021-03-02 | 山东大学 | Networking method for underground engineering geological exploration wireless seismograph and wireless seismograph |
| CN113115282A (en) * | 2021-03-03 | 2021-07-13 | 深圳市云海物联科技有限公司 | Internet of things communication method and Internet of things communication system |
-
2021
- 2021-12-30 CN CN202111682361.5A patent/CN114422101B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000033539A1 (en) * | 1998-11-30 | 2000-06-08 | Aimal Siraj | Communication system |
| CN101453801A (en) * | 2007-12-04 | 2009-06-10 | 株式会社日立国际电气 | Communication system and gateway |
| CN106792538A (en) * | 2016-12-29 | 2017-05-31 | 哈尔滨海能达科技有限公司 | Information uploading method, terminal pattern changing method and digital communication system |
| CN108347313A (en) * | 2017-01-24 | 2018-07-31 | 华为技术有限公司 | Feedback method and user equipment |
| CN109981220A (en) * | 2019-03-18 | 2019-07-05 | 成都极客通科技有限公司 | The transmission of half duplex communication data and confirmation method based on 39 system compression algorithms |
| CN110786030A (en) * | 2019-09-20 | 2020-02-11 | 北京小米移动软件有限公司 | Communication method, communication apparatus, and storage medium |
| CN111294838A (en) * | 2020-02-04 | 2020-06-16 | 湖南科大天河通信股份有限公司 | Multi-power-station base station, civil air defense warning system and control instruction transmission method |
| CN112437484A (en) * | 2020-10-16 | 2021-03-02 | 山东大学 | Networking method for underground engineering geological exploration wireless seismograph and wireless seismograph |
| CN113115282A (en) * | 2021-03-03 | 2021-07-13 | 深圳市云海物联科技有限公司 | Internet of things communication method and Internet of things communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114422101A (en) | 2022-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4610421B2 (en) | Wireless network system, call control device, terminal device, and call signal generation method | |
| US9794376B2 (en) | Compression devices, decompression devices, compression methods, and decompression methods | |
| CN101946552B (en) | Wireless communications method, base station apparatus and wireless communication system | |
| WO2006016745A1 (en) | Method and apparatus for transmitting ack frame | |
| CN114422101B (en) | Replacement address algorithm based on ultra-low rate data transmission radio station information communication | |
| US8780759B2 (en) | Method for transmitting and receiving group deletion information | |
| CN108012250A (en) | Data transmission method and data transmission device | |
| CN112637901A (en) | Data packet distribution method, sender device, receiver device, and storage medium | |
| CN112243009A (en) | IPv 6-based industrial heterogeneous network multi-protocol convergence networking and communication system and method | |
| JP6929946B2 (en) | Data transmission method, device, transmitting end, receiving end and system | |
| CN113784392A (en) | Communication method, device and system | |
| CN100571285C (en) | A kind of identification method of multi-stage far-end wireless device and device | |
| CN101449539B (en) | Connection configuration in a wireless telecommunications system using hash values | |
| CN107005464B (en) | Method and device for processing service flow data packet | |
| EP4087315A1 (en) | Port resource reservation method, electronic device, and storage medium | |
| WO2019029588A1 (en) | Method, terminal and network device for determining uplink transmission resources | |
| EP3606209B1 (en) | Information sending method and apparatus, terminal, access network device and system | |
| CN108737180A (en) | Collecting method, data transmission method for uplink, data acquisition equipment and the network equipment | |
| CN110768749B (en) | Data transmission method and device and power peak shaving system | |
| CN113572629B (en) | Message transmission method, terminal and storage medium | |
| CN106534056B (en) | Communication device and communication method | |
| KR20060053671A (en) | Method and apparatus for transmitting ack frame | |
| CN113115282A (en) | Internet of things communication method and Internet of things communication system | |
| JP2019519950A (en) | Inter-device (D2D) communication method and D2D device | |
| US20050157755A1 (en) | Method for data transmission in the hybrid network and hybrid network router |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |