CN110460407B - Communication method, mobile terminal and computer storage medium - Google Patents

Communication method, mobile terminal and computer storage medium Download PDF

Info

Publication number
CN110460407B
CN110460407B CN201910593823.2A CN201910593823A CN110460407B CN 110460407 B CN110460407 B CN 110460407B CN 201910593823 A CN201910593823 A CN 201910593823A CN 110460407 B CN110460407 B CN 110460407B
Authority
CN
China
Prior art keywords
information
node
nodes
time interval
decoding rule
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910593823.2A
Other languages
Chinese (zh)
Other versions
CN110460407A (en
Inventor
马骏
杨升浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chinese University of Hong Kong Shenzhen
Original Assignee
Chinese University of Hong Kong Shenzhen
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chinese University of Hong Kong Shenzhen filed Critical Chinese University of Hong Kong Shenzhen
Priority to CN201910593823.2A priority Critical patent/CN110460407B/en
Publication of CN110460407A publication Critical patent/CN110460407A/en
Application granted granted Critical
Publication of CN110460407B publication Critical patent/CN110460407B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B11/00Transmission systems employing sonic, ultrasonic or infrasonic waves
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B13/00Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
    • H04B13/02Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0061Error detection codes
    • H04L1/0063Single parity check

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a communication method, a mobile terminal and a computer storage medium, wherein the communication method is applied to an underwater acoustic network, the underwater acoustic network comprises l nodes which are distributed at equal intervals, and the method comprises the steps that when the l nodes are communicated, the 2j-1 st node sends 2j-1 st information to an adjacent node; the first node receives second information sent by the second node to obtain third information; the l node receives the l-1 information sent by the l-1 node to obtain the l-2 information; when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the first node receives third information sent by the third node to obtain fifth information; the l node receives the l-2 information sent by the l-2 node to obtain the l-4 information; the first node obtains a first receiving message according to the third information and the fifth information; the l node obtains the l receiving information according to the l-2 information and the l-4 information. By the above method, the communication throughput can be improved.

Description

Communication method, mobile terminal and computer storage medium
Technical Field
The present application relates to the field of underwater acoustic communication technologies, and in particular, to a communication method, a mobile terminal, and a computer storage medium.
Background
With the adoption of underwater acoustic communication, the underwater acoustic communication is widely applied to scientific research, military affairs and commerce, such as marine environment monitoring, disaster prevention and control, submarine resource development, offshore safety and the like. Such applications require long-distance underwater communications varying from several kilometers to tens of kilometers, but the characteristics of the underwater acoustic channel make long-distance point-to-point underwater communications extremely difficult. Since the acoustic signal of the underwater acoustic wave is absorbed, the transmission power of the underwater acoustic wave should increase exponentially. Furthermore, more high frequency signals will be absorbed with increasing distance, and thus the effective bandwidth will decrease with increasing transmission distance. Since the underwater equipment is usually battery powered, the high power consumption of the long distance underwater acoustic signal propagation can significantly reduce the operating time of the underwater equipment. In the prior art, a two-way communication mode is adopted, so that information communication in different directions can be performed at different frequencies at different times.
The inventor of the present application found in long-term research and development that in the existing two-way communication mode, the underwater acoustic channel has a high propagation delay, and the idle time between the transmitting state and the receiving state is too long, resulting in low communication throughput.
Disclosure of Invention
The application provides a communication method, a mobile terminal and a computer storage medium, which aim to solve the problem that in the prior art, the communication throughput is low due to the fact that the two-way network underwater acoustic channel propagation delay is large.
In order to solve the technical problem, the application adopts a technical scheme that: a communication method is provided, wherein the method is applied to an underwater acoustic network, the underwater acoustic network comprises l nodes (l is an odd number), the l nodes are distributed at equal intervals, the method comprises that when the l nodes carry out communication, the 2j-1(j is 1,2, 3., (l +1)/2) th node sends 2j-1 th information to the adjacent nodes; the 2j-1 node carries the 2j-1 information; the first node receives second information sent by a second node, and the first node obtains third information according to the second information and a preset decoding rule; the l-th node receives l-1 information sent by the l-1-th node, and the l-2 information is obtained according to the l-th information and the preset decoding rule; when all the nodes with odd items in the l nodes communicate, the 2j-1 node sends 2j-1 information to the nodes with adjacent odd items; the 2j-1 node carries the 2j-1 information; the first node receives third information sent by a third node, and the first node obtains fifth information according to the third information and the preset decoding rule; the l node receives the l-2 information sent by the l-2 node, and the l-4 information is obtained according to the l-2 information and the preset decoding rule; the first node obtains a first receiving message according to the third information and the fifth information; and the l-th node obtains the l-th receiving information according to the l-2 information and the l-4 information.
In order to solve the above technical problem, another technical solution adopted by the present application is: a mobile terminal is provided, wherein the mobile terminal comprises a processor and a memory coupled to each other, the memory being configured to store a computer program, and the processor being configured to load and execute the computer program.
In order to solve the above technical problem, the present application adopts another technical solution: a computer storage medium is provided, having a computer program stored thereon, wherein the computer program is for implementing the steps of the method of any of the above embodiments.
The beneficial effect of this application is: in contrast to the prior art, the present application provides a communication method, a mobile terminal, and a computer storage medium, where the communication method is applied to an underwater acoustic network, where the underwater acoustic network includes l nodes (l is an odd number) and the l nodes are distributed at equal intervals, and the method includes when the l nodes perform communication, transmitting 2j-1(j is 1,2, 3., (l +1)/2) th information to an adjacent node; the 2j-1 st node carries 2j-1 st information; the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule; the l node receives the l-1 information sent by the l-1 node, and the l-2 information is obtained according to the l information and a preset decoding rule; when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the 2j-1 st node carries 2j-1 st information; the first node receives third information sent by a third node, and the first node obtains fifth information according to the third information and a preset decoding rule; the l node receives the l-2 information sent by the l-2 node, and the l-4 information is obtained according to the l-2 information and a preset decoding rule; the first node obtains a first receiving message according to the third information and the fifth information; the l node obtains the l receiving information according to the l-2 information and the l-4 information. Odd nodes are distributed at equal intervals, the information communicated among the nodes is obtained in the first stage, the information communicated among the nodes in the odd number in the nodes is obtained in the second stage, and the information of the two parts is mixed, so that the problem of low communication throughput in the prior art is solved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the application, the drawings that are needed to be used in the description of the embodiments are briefly introduced below, it is obvious that the drawings in the following description are only some embodiments of the application, and other drawings can be obtained by those skilled in the art without inventive efforts, wherein:
FIG. 1 is a schematic flow chart diagram illustrating an embodiment of a communication method of the present application;
FIG. 2 is a schematic flow chart diagram illustrating another embodiment of a communication method of the present application;
FIG. 3 is a schematic diagram of a three-node network according to the present application;
FIG. 4 is a schematic diagram of a five-node network according to the present application;
fig. 5 is a schematic structural diagram of an embodiment of a mobile terminal according to the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any inventive step based on the embodiments in the present application, are within the scope of protection of the present application.
It should be noted that if directional indications (such as up, down, left, right, front, and back … …) are referred to in the embodiments of the present application, the directional indications are only used to explain the relative positional relationship between the components, the movement situation, and the like in a specific posture (as shown in the drawings), and if the specific posture is changed, the directional indications are changed accordingly.
In addition, if there is a description of "first", "second", etc. in the embodiments of the present application, the description of "first", "second", etc. is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart illustrating a communication method according to an embodiment of the present application. The method disclosed by the embodiment is applied to an underwater acoustic network, wherein the underwater acoustic network comprises l nodes (l is an odd number), the l nodes are distributed at equal intervals, and the l nodes are distributed linearly.
In the two-way communication of the underwater acoustic network, two methods of frequency division and time division are included. The frequency division method means that the bandwidth of the sound wave can be divided into two sub-bands which are respectively used for communication in two different directions. Time division means that communication between different directions can be carried out at different times.
The method disclosed in this embodiment is a physical layer based network coding method (PNC). The PNC is specially proposed for radio communication, and can superpose received waveforms from different transmitters in a bidirectional network, decode a linear function formed by transmitted message sequences and further improve the scheduling efficiency of the bidirectional network.
In the embodiment, the communication comprises two stages of communication, wherein in the first stage, all nodes participate in the communication process; the second stage is that in the l nodes, all nodes with odd number terms participate in the communication process, and the PNC in the second stage is used for eliminating interference. The PNCs in the two stages are mixed together, so that the transmission gap can be made up, the optimal bidirectional traffic rate is realized in underwater sound bidirectional communication, and the throughput of the bidirectional communication can be improved.
Specifically, the method disclosed in this embodiment may include the following steps:
s11: when the l nodes communicate, the l node sends the l information to the adjacent nodes, and the 2j-1(j is 1,2, 3., (l +1)/2) node sends the 2j-1 information to the adjacent nodes; the 2j-1 st node carries the 2j-1 st information.
In a linear network, a first node and a l-th node exchange information via intermediate nodes. In the first stage, all communication is carried out by the I nodes, and the I nodes all have different states, such as a transmitting state, a receiving state and an idle state. When a node is in one state, a certain transition time, usually several hundred milliseconds, is required to transition to another state.
In this embodiment, the l nodes respectively carry information with the same length and different contents, for example, the first node carries the first information, and the 1 st node carries the l information … …, the 2j-1 st node carries the 2j-1 st information. Each node may send information carried by itself to an adjacent node according to the power, for example, the ith node sends the ith information to the adjacent node, and the 2j-1 st node sends the 2j-1 st information to the adjacent node.
S12: and the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule.
In this embodiment, when a node is in a transmitting state, information can be transmitted with minimum power and propagated to neighboring nodes. For example, a first node sends first information to a second node, a third node sends third information to the second node, and the second node can obtain second information according to the first information and the third information, so that the second information can be sent to the first node. The first node receives second information sent by the second node, and the second information is obtained from the first information, so that the first node decodes the second information according to the first information and a preset decoding rule, and further obtains third information.
S13: and the l-th node receives the l-1-th information sent by the l-1-th node and obtains the l-2-th information according to the l-th information and a preset decoding rule.
Similar to the step S12, the ith node is a node at the end of the linear network, the ith node and the ith node both send information to the ith node and the ith-2 node and the ith node send the ith-1 information to the ith node, and the ith node can decode the ith-1 information according to the ith information and a preset decoding rule, so as to obtain the ith-2 information.
S14: when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the 2j-1 st node carries the 2j-1 st information.
In the second stage, all nodes with odd number terms in the l nodes are communicated with each other, in this embodiment, the odd number term node is represented by 2j-1, and the 2j-1 th node may be the first node, the third node, and the fifth node … … the l-th node. Correspondingly, the first node carries the first information, the third node carries the third information, and the fifth node carries the fifth information … … the ith node carries the ith information.
S15: and the first node receives third information sent by the third node, and the first node obtains fifth information according to the third information and a preset decoding rule.
The third node is located between the first node and the fifth node and is used for receiving the first information sent by the first node and the fifth information sent by the fifth node, and the third node obtains the third information according to the first information and the fifth information.
And when the third node is in a sending state, the third node is used for sending third information to the first node and the fifth node, and the first node decodes the third information according to the first information and a preset decoding rule so as to obtain fifth information.
S16: and the l-th node receives the l-2-th information sent by the l-2-th node and obtains the l-4-th information according to the l-2-th information and a preset decoding rule.
Similarly to the step S15, the ith node is a node at the end of the odd term of the linear network, and the ith node and the ith-4 node both send information to the ith-2 node. When the l-2 node is in a sending state, the l-2 node sends the l-2 information to the l node, and the l node can decode the l-2 information according to the l information and a preset decoding rule so as to obtain the l-4 information.
S17: and the first node obtains a first receiving message according to the third information and the fifth information.
And mixing the information obtained by each node in the two stages to obtain final information, wherein the odd-numbered nodes comprise the information obtained in the two stages, and the even-numbered nodes only comprise the information obtained in the first stage. The first node located at the end point of the underwater acoustic network is an odd number, so that the received message finally obtained by the first node is mixed information of the third information and the fifth information, and the manner of mixing the third information and the fifth information is not limited here.
S18: the l node obtains the l receiving information according to the l-2 information and the l-4 information.
The l-th node located at the end point of the underwater acoustic network is an odd number, so that the received message finally obtained by the first node is the mixed information of the l-2-th information and the l-4-th information, and the way of mixing the l-2-th information and the l-4-th information is not limited here.
The application provides a communication method, which is applied to an underwater acoustic network, wherein the underwater acoustic network comprises l nodes (l is an odd number), the l nodes are distributed at equal intervals, and the method comprises the steps that when the l nodes carry out communication, the 2j-1(j is 1,2, 3., (l +1)/2) nodes send 2j-1 information to adjacent nodes; the 2j-1 st node carries 2j-1 st information; the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule; the l node receives the l-1 information sent by the l-1 node, and the l-2 information is obtained according to the l information and a preset decoding rule; when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the 2j-1 st node carries 2j-1 st information; the first node receives third information sent by a third node, and the first node obtains fifth information according to the third information and a preset decoding rule; the l node receives the l-2 information sent by the l-2 node, and the l-4 information is obtained according to the l-2 information and a preset decoding rule; the first node obtains a first receiving message according to the third information and the fifth information; the l node obtains the l receiving information according to the l-2 information and the l-4 information. Odd nodes are distributed at equal intervals, the information communicated among the nodes is acquired in the first stage, the information communicated among the nodes in the odd number in the nodes is acquired in the second stage, and the information of the two parts is mixed, so that the communication throughput can be improved.
On the basis of the foregoing embodiments, please refer to fig. 2, and fig. 2 is a flowchart illustrating another embodiment of a communication method according to the present application. The method disclosed by the embodiment is applied to an underwater acoustic network, wherein the underwater acoustic network comprises l nodes (l is an odd number), the l nodes are distributed at equal intervals, and the l nodes are distributed linearly. The same portions in this embodiment as those in the above embodiments are not described herein again.
Specifically, the method disclosed in this embodiment may include the following steps:
s21: and presetting the state information of the odd-number nodes and the frequency of sending the information.
In a linear network of l nodes, each node may be provided with one underwater modem. The modem serves to translate the digital computer signals into pulse signals that can be transmitted over a conventional telephone line, which in turn can be received by another modem at the other end of the line and translated into computer readable language. In this embodiment the hydro-acoustic modem is used to send or receive information of the hydro-acoustic signal.
Each node has a underwater modem operating in three states: a transmit state, a receive state, and an idle state (e.g., when the modem is in a sleep state). A single node cannot transmit and receive acoustic signals simultaneously. The time τ required for the transmission state and the reception state to mutually transit is generally several hundred milliseconds, and the underwater sound velocity c is about 1500 meters per second. Let D be D/c, and D be the acoustic propagation delay between two adjacent nodes under water.
In this embodiment, setting the state transition of a node may include at least one cycle, in each of which the odd-numbered nodes will be at time intervals (0, s)1) At a power of P (D) in a transmitting state; at a time interval s1+(0,s2) In a transmit state at power of P (2D); at a time interval s1+2d+(0,s1+s2) In a receiving state; and may be in an idle state at other times.
Wherein D is the distance between two adjacent nodes; d is the acoustic propagation delay of two adjacent nodes; p (D) is the lowest transmission power for transmitting information between two nodes with the distance D, and P (2D) is the lowest transmission power for transmitting information between two nodes with the distance 2D; s is the time of the transmitting state or the receiving state, s1Is a first time interval, s2Is a second time interval and s is s1And s2The sum of (1).
In order to ensure that the odd-numbered nodes are switched from the transmitting state to the receiving state, a second time interval s is set2Less than or equal to twice the difference between the acoustic propagation delay d and the state transition time τ of two adjacent nodes.
S22: and presetting the state information of the even-numbered nodes and the frequency of sending the information.
In each cycle, the even term nodes are set at time intervals d + (0, s)1) In a receiving state; at a time interval s1+s2+d+(0,s1) At a power of P (D) in a transmitting state; and may be in an idle state at other times.
Wherein s is1Is a first time interval, s2A second time interval; p (D) is the lowest transmit power for transmitting information between two nodes at distance D.
Also, in order to ensure that the even-numbered nodes are switched from the transmission state to the reception state, a second time interval s is set2Greater than or equal to the state transition time τ, and a second time interval s2Less than or equal to twice the difference between the acoustic propagation delay d and the state transition time τ of two adjacent nodes.
According to the steps S21 and S22, the length L of one cycle is twice the first time interval S1A second time interval s2Two times the acoustic propagation delay d of two adjacent nodes and the sum of the state transition times τ.
S23: when the l nodes communicate, the l node sends the l information to the adjacent nodes, and the 2j-1(j is 1,2, 3., (l +1)/2) node sends the 2j-1 information to the adjacent nodes; the 2j-1 st node carries the 2j-1 st information.
In the first PNC phase, t cycles (t being a positive integer) may be included. In any cycle, at time intervals (0, s)1) In the method, the 2j-1 st node sends the 2j-1 st information; at a time interval s1+s2+d+(0,s1) In the method, the 2j node sends the 2j information with the power of P (D), the 2j receiving information is decoded according to the 2j node and a preset decoding rule at a time interval d + (0, s)1) The received 2 j-th received message.
Specifically, at time intervals (0, s)1) Inner, 2j-1 node v2j-1v2j-1Sending 2j-1 message a2j-1Node v 2j +12j+1Sending a 2j +1 message a2j+1. At time interval d + (0, s)1) Inner, 2j node v2jIn a receiving state, a 2j-1 message a is received2j-1And 2j +1 th message a2j+1Decoding to obtain the 2j information a2jThen at a time interval s1+s2+d+(0,s1) In the 2j information a of the sending message with the power of P (D)2j
S24: and the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule.
At a time interval s1+2d+s2+(0,s1) The first node obtains third information according to the second information and a preset decoding rule; the preset decoding rule comprises a single-user decoding method and a PNC decoding method.
In particular, the first node v1And a third node v3There are information a and information b of the same length, respectively. In the information transmission, the information can be divided into two parts, wherein in the first part, the first node v1And a third node v3Information is encoded using a physical layer method that allows PNC and the encoded waveforms are sent out simultaneously in the same time interval (0, s) using the same power. Second node v2Receiving a first node v during a time interval (d, d + s)1And a third node v3Superposition of the emitted waveforms, second node v2To transmit informationa and information b, which method is denoted as binary exclusive-or
Figure BDA0002115702490000111
Referred to as PNC decoding.
In the second part, a second node v2It takes tau time to convert to a transmission state and uses the same physical layer method allowing PNC to carry out information sequence
Figure BDA0002115702490000112
And (5) encoding. Second node v2Emitting a coded waveform during a time interval (d + s + τ, d +2s + τ), a first node v1Receiving a second node v during a time interval (d + s + τ, d +2s + τ)2A transmitted waveform, and information
Figure BDA0002115702490000113
Decoding is performed, a process referred to as single-user decoding. Due to the first node v1Carrying information a, first node v1The information b can be further recovered. In the same way, the third node v3Can decode
Figure BDA0002115702490000114
And recovers a.
S25: and the l-th node receives the l-1-th information sent by the l-1-th node and obtains the l-2-th information according to the l-th information and a preset decoding rule.
At a time interval s1+2d+s2+(0,s1) And the l-th node obtains the l-2-th information according to the 2 j-1-th information and a preset decoding rule.
In particular, at time interval s1+2d+s2+(0,s1) Inner, 2j-1 node v2j-1Receiving the 2j +1 node v2j+12j +1 st information a2j+1And 2j-3 node v2j-32j-3 information a of2j-3Node v 2j-12j-1Decoding
Figure BDA0002115702490000115
L node vlReceiving the l-1 st node vl-1Transmitted l-1 information
Figure BDA0002115702490000116
According to the single-user decoding method, the l-th node vlCan be based on the ith information alFor the l-1 information
Figure BDA0002115702490000117
Decoding is performed to obtain the l-2 information al-2
When the cycle t is less than or equal to 0, in the information of the odd-numbered nodes in each cycle, a in each cycle1And alAre respectively the first node v1And the l node vlNewly generated information.
S26: when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the 2j-1 st node carries the 2j-1 st information.
In the second PNC phase, t cycles (t is a positive integer) may be involved, with communication between all odd-numbered ones of the l nodes. In the t-th cycle, at time interval s1+(0,s2) Inner, 2j-1 node v2j-1Transmitting the 2j-1 information A2j-1
S27: and the first node receives third information sent by the third node, and the first node obtains fifth information according to the third information and a preset decoding rule.
In the t-th cycle, at time interval s1+2d+s2+(0,s1) And the first node obtains the fifth information of the t-1 th cycle according to the third information and a preset decoding rule.
Specifically, A2j-1Is the 2j-1 node v in the t cycle2j-1At a time interval s1+(0,s2) The message to be sent.
The odd nodes of the l nodes comprise a first node v1A third node v3The fifth node v5… … th node vlThird node v3For receiving a first node v1First of transmissionInformation A1And a fifth node v5Fifth information A of transmission5Third node v3According to the first information A1And fifth information A5Obtaining the third information
Figure BDA0002115702490000121
In the t-th cycle, the third node v3In a transmitting state, to a first node v1And a fifth node v5Transmitting the third information obtained in the t-1 th cycle
Figure BDA0002115702490000122
First node v1According to the first information A1And a single-user decoding method for the third information
Figure BDA0002115702490000123
Decoding is carried out, thereby obtaining fifth information A in the t-1 th cycle5
S28: and the l-th node receives the l-2-th information sent by the l-2-th node and obtains the l-4-th information according to the l-2-th information and a preset decoding rule.
In the t-th cycle, the l-4 th node vl-4To the l-2 th node vl-2Transmitting the l-4 th information Al-4The l th node vlTo the l-2 th node vl-2Transmitting the first information AlThe l-2 node vl-2Decoding
Figure BDA0002115702490000124
Figure BDA0002115702490000125
In the t +1 th cycle, the l-th node vlReceiving the l-2 node vl-2Transmitted by
Figure BDA0002115702490000126
Figure BDA0002115702490000127
According to single useMethod of decoding, node i v in the t +1 th cyclelThe received information is the l-4 information A in the t cyclel-4
When the cycle t is less than or equal to 0, A in each cycle in the information of the odd-numbered node in each cycle1And AlAre respectively the first node v1And the l node vlNewly generated information.
S29: and the first node obtains a first receiving message according to the third information and the fifth information.
And mixing the information obtained by each node in the two stages to obtain final information, wherein the odd-numbered nodes comprise the information obtained in the two stages, and the even-numbered nodes only comprise the information obtained in the first stage. The first node located at the end point of the underwater acoustic network is an odd number, so that the received message finally obtained by the first node is mixed information of the third information and the fifth information, and the manner of mixing the third information and the fifth information is not limited here.
S30: the l node obtains the l receiving information according to the l-2 information and the l-4 information.
The l-th node located at the end point of the underwater acoustic network is an odd number, so that the received message finally obtained by the first node is the mixed information of the l-2-th information and the l-4-th information, and the way of mixing the l-2-th information and the l-4-th information is not limited here.
Based on the above embodiment, the value of the throughput R can be derived according to equation (1):
Figure BDA0002115702490000131
given the values d and τ of d, the inequality (2) can be derived:
Figure BDA0002115702490000132
the minimum value R of R can be obtained according to inequality (2)* ybrid(T), as shown in equation (3):
Figure BDA0002115702490000133
in an embodiment, please refer to fig. 3, in which fig. 3 is a schematic structural diagram of a three-node network according to the present application. Where each row represents the timeline state of one node. The shaded bars represent the transmit state and the blank bars represent the receive state. The space between the shadow and blank bars is idle.
Assume that time starts at 0. The time interval (i, j) will also be denoted as i + (0, j-i) in the following discussion. At time intervals (0, s)1) During that time, the first node v1And a third node v3Respectively encode information a1And information b1And simultaneously sends out signals with power P (D), respectively.
After D time, the second node v2Receiving by the first node v1And a third node v3The emitted waveforms are superimposed and decoded
Figure BDA0002115702490000141
At a time interval s1+(0,s2) During that time, the first node v1And a third node v3Respectively encode information a2And information b2And simultaneously signals with power P (2D), respectively. At a time interval s1+s2+2d+(0,s2) During that time, the first node v1And a third node v3Receiving mutually transmitted waveforms and transmitting them from the first node v1Decoding b2Third node v3Decoding a2. At a time interval s1+s2+d+(0,s1) During that time, the second node v2Encoding
Figure BDA0002115702490000142
And signals at power p (d). At a time interval s1+s2+2d+(0,s1) During that time, the first node v1And a third node v3Receiving a second node v2Emitted waveform and decoding
Figure BDA0002115702490000143
After all the procedures are completed, the first node v1And a third node v3Completion information (a)1,a2) And (b)1,b2) Are exchanged with each other. To guarantee the first node v1And a third node v3There is sufficient time to switch from the transmit state to the receive state, s 22 d-tau or less; to guarantee the second node v2There is sufficient time to switch from the receive state to the transmit state, s2Is more than or equal to tau. Thus, there is formula (4):
τ≤s2≤2d-τ
(4)
since the time s between two transmission time intervals is 2s1+s2+2d + τ, the length of this cycle, i.e., the transmission period T, is equation (5):
T=2s1+s2+2d+τ
(5)
since the state transition can be at the first time s under the constraint of equation (5)1+s2Is successfully completed, the throughput can be expressed as equation (1), and further inequalities (2) and (3) are derived.
First node v1The transmission power consumption P of (2) is formula (6):
Figure BDA0002115702490000144
the transmission power consumption of the node v3 is the same as that of the node v1, and the transmission power consumption of the node v2 is formula (7):
Figure BDA0002115702490000151
when s is22d- τ and s1=(T-s 22d- τ)/2, formula (8) and formula (9):
Figure BDA0002115702490000152
Figure BDA0002115702490000153
another related performance indicator is the energy consumption per bit, which is given by equation (10):
Figure BDA0002115702490000154
when s is22d- τ and s1=(T-s2-2d- τ)/2, having formula (11):
Figure BDA0002115702490000155
in an embodiment, please refer to fig. 4, in which fig. 4 is a schematic structural diagram of a five-node network according to the present application. Where each row represents the timeline state of one node. The shaded bars represent the transmit state and the blank bars represent the receive state. The space between the shadow and blank bars is idle.
A five-node linear network may be used as another example to explain the hybrid PNC method in the present embodiment. In the first PNC scenario, each cycle goes from time 0 to time s1During that time, the first node v1A third node v3The fifth node v5Sends out information encoded by the PNC scheme with power P (D), so that the second node v2The first node v can be decoded1And a third node v3XOR of the information of, the fourth node v4The third node v can be decoded3And a fifth node v5Xor of the information of (1). (in the first cycle, the third node v3No information is received and only null information is sent. )
After receiving the PNC frame, the fourth node v4Waiting for a period s2(s2τ) and then the information, i.e., encoded by the PNC at power P (D),Third node v3And a fifth node v5The information of (2) is sent out by exclusive or. Each cycle of slave s1+s2+ d to 2s1+s2Within +2d time, the first node v1A third node v3And a fifth node v5Receiving by the second node v2And a fourth node v4The issued PNC frame. Fifth node v5Receiving a fourth node v4The information sent, i.e. the fifth node v5And a third node v3And decodes the third node v3The information of (1). Third node v3Decoding a second node v2And a fourth node v4XOR of the information of, i.e. the first node v1And a fifth node v5Xor of the information of (1). This is the time when the first PNC scenario loops to completion.
In the second scenario of PNC, each cycle is from time s1To time s1+s2During that time, the first node v1A third node v3The fifth node v5Information encoded by the PNC scheme with power P (2D) is issued. Due to the propagation delay, when s is less than or equal to 2 d-tau, the transmission and reception of the three nodes will not overlap. Fifth node v5Receiving a third node v3When information of (v) is received, the third node v3Decoding a first node v1And a fifth node v5Xor of the information of (1). This time the second PNC scenario cycle is complete.
In the present embodiment, PNCs are classified into two types, one being the first node v1A third node v3The fifth node v5PNC in between, another class being (first node v)1A second node v2A third node v3) (second node v)2A third node v3Fourth node v4) And (third node v)3Fourth node v4The fifth node v5) PNC in between.
From the above discussion, equation (4) is obtained, and the transmission period T of the method is equation (5) and the throughput R is equation (1). For constant values of d and τ, and d ≧ τ, the inequality (2) can be derived, along with equation (3), resulting in maximum throughput for constant values of T and τ.
The application provides a communication method, which is applied to an underwater acoustic network, wherein the underwater acoustic network comprises l nodes (l is an odd number), the l nodes are distributed at equal intervals, and the method comprises the steps that when the l nodes carry out communication, the 2j-1(j is 1,2, 3., (l +1)/2) nodes send 2j-1 information to adjacent nodes; the 2j-1 st node carries 2j-1 st information; the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule; the l node receives the l-1 information sent by the l-1 node, and the l-2 information is obtained according to the l information and a preset decoding rule; when all odd-numbered nodes in the nodes carry out communication, the 2j-1 node sends 2j-1 information to adjacent odd-numbered nodes; the 2j-1 st node carries 2j-1 st information; the first node receives third information sent by a third node, and the first node obtains fifth information according to the third information and a preset decoding rule; the l node receives the l-2 information sent by the l-2 node, and the l-4 information is obtained according to the l-2 information and a preset decoding rule; the first node obtains a first receiving message according to the third information and the fifth information; the l node obtains the l receiving information according to the l-2 information and the l-4 information. Odd nodes are distributed at equal intervals, the information communicated among the nodes is acquired in the first stage, the information communicated among the nodes in the odd number in the nodes is acquired in the second stage, and the information of the two parts is mixed, so that the communication throughput can be improved.
In response to the above method, the present application provides a mobile terminal, please refer to fig. 5, and fig. 5 is a schematic structural diagram of an embodiment of the mobile terminal of the present application. The mobile terminal 100 disclosed in the present application comprises a memory 12 and a processor 14 coupled to each other, wherein the memory 12 is used for storing a computer program, and the processor 14 is used for executing the computer program to implement the steps of the method of any one of the above embodiments. The method is applied to an underwater acoustic network, wherein the underwater acoustic network comprises l nodes (l is an odd number), and the l nodes are distributed at equal intervals.
Specifically, processor 14 is configured to:
when the l nodes communicate, the 2j-1(j ═ 1,2, 3., (l +1)/2) th node transmits the 2j-1 th information to the neighboring nodes. The 2j-1 st node carries the 2j-1 st information.
And the first node receives second information sent by the second node, and the first node obtains third information according to the second information and a preset decoding rule.
And the l-th node receives the l-1-th information sent by the l-1-th node and obtains the l-2-th information according to the l-th information and a preset decoding rule.
When all the odd-numbered nodes in the l nodes communicate, the 2j-1 st node sends 2j-1 st information to the adjacent odd-numbered nodes. The 2j-1 st node carries the 2j-1 st information.
And the first node receives third information sent by the third node, and the first node obtains fifth information according to the third information and a preset decoding rule.
And the l-th node receives the l-2-th information sent by the l-2-th node and obtains the l-4-th information according to the l-2-th information and a preset decoding rule.
And the first node obtains a first receiving message according to the third information and the fifth information.
The l node obtains the l receiving information according to the l-2 information and the l-4 information.
The mobile terminal 100 of the present embodiment can improve the communication throughput.
In the several embodiments provided in the present application, it should be understood that the system, apparatus and method disclosed in the present application can be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above embodiments are merely examples and are not intended to limit the scope of the present disclosure, and all modifications, equivalents, and flow charts using the contents of the specification and drawings of the present disclosure or those directly or indirectly applied to other related technical fields are intended to be included in the scope of the present disclosure.

Claims (7)

1. A communication method applied to an underwater acoustic network comprising l nodes, wherein l is an odd number, and l nodes are equidistantly distributed, the method comprising:
presetting odd number itemsState information of the node and frequency of sending information; wherein, at time intervals (0, s)1) At a power of P (D) in a transmitting state; at a time interval s1+(0,s2) In the transmit state at a power of P (2D); at a time interval s1+2d+(0,s1+s2) In a receiving state; wherein D is the distance between two adjacent nodes; d is the acoustic propagation delay of two adjacent nodes; p (D) is the lowest transmission power for transmitting information between two nodes with the distance D, and P (2D) is the lowest transmission power for transmitting information between two nodes with the distance 2D; s is the time of the sending state or the receiving state, s1Is a first time interval, s2Is a second time interval and s is s1And s2The sum of (1);
presetting state information of even number of nodes and frequency of sending information; wherein, at time interval d + (0, s)1) In a receiving state; at a time interval s1+s2+d+(0,s1) At a power of P (D) in a transmitting state; wherein s is1Is a first time interval, s2A second time interval; p (D) is the lowest transmission power for transmitting information between two nodes with the distance D;
in the first stage, all nodes participate in the communication process; in the second stage, all nodes with odd number terms participate in the communication process in the nodes with l number terms;
in the first stage, when l nodes communicate, the 2j-1(j is 1,2,3, …, (l +1)/2) th node sends the 2j-1 st information to the adjacent nodes; the 2j-1 node carries the 2j-1 information; wherein, at time intervals (0, s)1) The 2j-1 node sends the 2j-1 information; at a time interval s1+s2+d+(0,s1) In the method, a 2j node sends 2j information with power of P (D), and the 2j information is decoded at a time interval d + (0, s) according to a preset decoding rule by the 2j node1) The received 2j receiving information is obtained;
a first node receives second information sent by a second node, and the first node obtains third information according to the second information and a preset decoding rule;
the l node receives the l-1 information sent by the l-1 node, and the l-2 information is obtained according to the l information and the preset decoding rule;
in the second stage, when all the nodes with odd items in the nodes carry out communication, the 2j-1 node sends the 2j-1 information to the nodes with adjacent odd items; the 2j-1 node carries the 2j-1 information;
the first node receives the third information sent by a third node, and the first node obtains fifth information according to the third information and the preset decoding rule;
the l node receives the l-2 information sent by the l-2 node, and the l-4 information is obtained according to the l-2 information and the preset decoding rule;
the first node obtains a first receiving message according to the third information and the fifth information;
and the l-th node obtains the l-th receiving information according to the l-2 information and the l-4 information.
2. The method of claim 1, wherein a first node receives second information sent by a second node, and the step of the first node obtaining third information according to the second information and a preset decoding rule comprises:
at a time interval s1+2d+s2+(0,s1) The first node obtains the third information according to the second information and a preset decoding rule;
the method comprises the following steps that the l-1 information sent by the l-1 node is received by the l-1 node, and the l-2 information is obtained according to the 2j-1 information and the preset decoding rule:
at a time interval s1+2d+s2+(0,s1) And the l-th node obtains the l-2-th information according to the 2 j-1-th information and the preset decoding rule.
3. The method according to claim 1, wherein when all odd-numbered nodes of the/nodes communicate, the 2j-1 st node sends the 2j-1 st information to the neighboring odd-numbered nodes; the step that the 2j-1 node carries the 2j-1 information comprises the following steps:
at a time interval s1+(0,s2) And the 2j-1 node sends the 2j-1 information.
4. The method according to claim 3, wherein there are t cycles in advance, the first node receives third information sent by a third node, and the step of the first node obtaining fifth information according to the third information and the preset decoding rule comprises:
in the t-th cycle, at time interval s1+2d+s2+(0,s1) And the first node obtains the fifth information of the t-1 th cycle according to the third information and the preset decoding rule.
5. The method of claim 1, wherein the preset decoding rules comprise a single user decoding method and a PNC decoding method.
6. A mobile terminal, characterized in that the mobile terminal comprises a processor and a memory coupled to each other, the memory being adapted to store a computer program, the processor being adapted to load the computer program and to perform the steps of the method according to any of claims 1-5.
7. A computer storage medium having a computer program stored thereon, wherein the computer storage medium is adapted to load the computer program and perform the steps of the method of any of claims 1-5.
CN201910593823.2A 2019-07-02 2019-07-02 Communication method, mobile terminal and computer storage medium Active CN110460407B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910593823.2A CN110460407B (en) 2019-07-02 2019-07-02 Communication method, mobile terminal and computer storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910593823.2A CN110460407B (en) 2019-07-02 2019-07-02 Communication method, mobile terminal and computer storage medium

Publications (2)

Publication Number Publication Date
CN110460407A CN110460407A (en) 2019-11-15
CN110460407B true CN110460407B (en) 2022-04-15

Family

ID=68482021

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910593823.2A Active CN110460407B (en) 2019-07-02 2019-07-02 Communication method, mobile terminal and computer storage medium

Country Status (1)

Country Link
CN (1) CN110460407B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101695056A (en) * 2009-10-09 2010-04-14 魏昕 Routing method based on inter-session network coding in underwater sound communication network
CN106788782A (en) * 2016-12-06 2017-05-31 哈尔滨工程大学 Underwater sound communication network OFDM Link Physical Layers and MAC layer cross-layer communication method
CN109347604A (en) * 2018-10-26 2019-02-15 香港中文大学(深圳) A kind of multihop network communication means and system based on Sparse Code in batches

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8279781B2 (en) * 2008-08-28 2012-10-02 Massachusetts Institute Of Technology Random linear network coding for time division duplexing
US8504891B2 (en) * 2009-03-27 2013-08-06 University Of Connecticut Apparatus, systems and methods including nonbinary low density parity check coding for enhanced multicarrier underwater acoustic communications
CN104243388B (en) * 2014-09-25 2017-10-27 陈景竑 Acoustic communication system based on OFDM

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101695056A (en) * 2009-10-09 2010-04-14 魏昕 Routing method based on inter-session network coding in underwater sound communication network
CN106788782A (en) * 2016-12-06 2017-05-31 哈尔滨工程大学 Underwater sound communication network OFDM Link Physical Layers and MAC layer cross-layer communication method
CN109347604A (en) * 2018-10-26 2019-02-15 香港中文大学(深圳) A kind of multihop network communication means and system based on Sparse Code in batches

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
A Primer on Physical-Layer Network Coding;Shengli Zhang;《Synthesis Lectures on Communications Networks》;20150630;全文 *
Hot Topic: Physical-Layer Network Coding;Shengli Zhang等;《Proceedings of the 12th annual international conference on Mobile computing and networking》;20060930;全文 *
Iterative Receiver Processing for OFDM Modulated Physical-Layer Network Coding in Underwater Acoustic Channels;Zhaohui Wang;《IEEE Transactions on Communications 》;20130307;全文 *
Multi-hop Underwater Acoustic Networks based on BATS Codes;Jun Ma;《Proceedings of the Thirteenth ACM International Conference on Underwater Networks & Systems》;20181231;全文 *

Also Published As

Publication number Publication date
CN110460407A (en) 2019-11-15

Similar Documents

Publication Publication Date Title
US9451543B2 (en) Wireless communication method for transmitting message to slave devices from master devices
CN103428830A (en) Wireless communication system and method
KR20180137356A (en) Method for generating a sequence for a polar code and medium therefor and method and apparatus for transmitting data using thereof
US8855028B2 (en) Apparatus and method for bidirectional communication between multi-nodes using relay node
US6865373B2 (en) Apparatus and method for encoding and decoding data within wireless networks
US20180351656A1 (en) Methods, systems, and devices for high throughput acoustic transmission
CN111343730A (en) Large-scale MIMO passive random access method under space correlation channel
CN110460407B (en) Communication method, mobile terminal and computer storage medium
CN109361492B (en) High-performance decoding method combining physical layer network coding and polarization code
CN109889247B (en) Low-overhead dynamic feedback safe transmission method and system suitable for narrow-band Internet of things
US9451541B2 (en) System and method for wireless communication
Popovski et al. Two-way communication with energy exchange
CN102484533B (en) optical data bus and method
Liu et al. Propagation-delay based cyclic interference alignment with one extra time-slot for three-user X channel
US10579495B2 (en) Systems and methods for transmitting data using encoder cooperation in the presence of state information
CN108809504B (en) Information transmission method and device
CN115021869B (en) Data transmission method, device, equipment and storage medium
CN112188446A (en) Synchronization signal sending method, terminal, device and storage medium
WO2013117133A1 (en) Network encoding method, relay device and screening device
CN111123272B (en) Golay code coding excitation method and decoding method of unipolar system
JP2001069181A (en) Digital data transmitting method and device to carry out the same
JP5822549B2 (en) Signal transmission method, signal transmission system and transmitter
CN102142881B (en) Method and device for transmitting data in relay network
CN101373974B (en) Coding method and apparatus
Dimin et al. The Use Orthogonal Sequences in Order to Improve the Quality of Data Transmission over an Optical Communication Channel

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