Mingshen Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mingshen Liang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Danfeng Zhao
College of Information and Communication Engineering, Harbin Engineering University, Harbin, 150001, China
2 shared publicationsGuiyang Lun
College of Information and Communication Engineering, Harbin Engineering University, Harbin, 150001, China
2 shared publications- Danfeng Zhao
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
1 shared publication Huaifeng Shi
1 shared publicationJinjue Duan
North Automation Control Technology Institute, Taiyuan, Shanxi 030006 CHINA
1 shared publicationLinmin Huang
College of Information and Communication Engineering, Harbin Engineering University, Harbin, 150001, China
1 shared publication
Latest Publications
- 6 March 2026
- Published by Elsevier in Acta Astronautica
- Vol. 245, 554-564
Two-level cross-layer bandwidth allocation algorithm based on a game model in satellite networks
- 6 March 2026
- Published by Elsevier in Acta Astronautica
- Vol. 245, 554-564
Two-level cross-layer bandwidth allocation algorithm based on a game model in satellite networks
- Open Access
- 4 March 2026
- Published by Elsevier in Digital Signal Processing
- Vol. 176
Research on high-resolution DOA estimation methods for closely spaced signals in low SNR
- 4 March 2026
- Published by Elsevier in Digital Signal Processing
- Vol. 176
Open AccessResearch on high-resolution DOA estimation methods for closely spaced signals in low SNR
- 22 March 2025
- Published by Springer Nature
- p. 578-589
Research on a Novel Combined Degree Distribution of Fountain Code for UAV Communication Scenarios
- 22 March 2025
- Published by Springer Nature
- p. 578-589
Research on a Novel Combined Degree Distribution of Fountain Code for UAV Communication Scenarios
- Open Access
- 6 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 69321-69334
Optimal Redundancy Control Strategy for Fountain Code-Based Underwater Acoustic Communication
In this paper, a transmission redundancy optimization strategy for fountain codes that uses an adaptive filtering technique as well as recent results concerning the upper bound of the source packet erasure probability for fountain codes over finite fields is proposed. The performance of the proposed strategy was evaluated in static and simulated realistic underwater acoustic channel environments simulated by a recently proposed statistical underwater acoustic channel model. The goal of this investigation is to improve the communication efficiency of underwater acoustic sensor networks that use communication protocols based on fountain codes. The performance of the proposed strategy is compared with the recently proposed approaches of discrete stochastic approximation (DSA) and the joint power and rate control (JPR) schemes. The simulation results demonstrate that the strategy proposed in this paper performs better than the existing schemes in both static and simulated realistic environments. The proposed strategy is 4.75 times better than the DSA in the static convergence performance evaluation. Further analysis shows that in the presence of a simulated realistic environment, compared to DSA and JPR, the strategy proposed in this paper reduces the overall transmission redundancy by approximately 11.4% and 52.6%, respectively. It also improves the average communication efficiency by 1.3% and 12.5%, respectively. The average optimization error relative to optimal redundancy is improved by approximately 62.1% and 92.5%, respectively. These numerical results are obtained by employing the specific simulation parameters and the simulated environment mentioned in this paper.
- 6 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 69321-69334
Open AccessOptimal Redundancy Control Strategy for Fountain Code-Based Underwater Acoustic Communication
In this paper, a transmission redundancy optimization strategy for fountain codes that uses an adaptive filtering technique as well as recent results concerning the upper bound of the source packet erasure probability for fountain codes over finite fields is proposed. The performance of the proposed strategy was evaluated in static and simulated realistic underwater acoustic channel environments simulated by a recently proposed statistical underwater acoustic channel model. The goal of this investigation is to improve the communication efficiency of underwater acoustic sensor networks that use communication protocols based on fountain codes. The performance of the proposed strategy is compared with the recently proposed approaches of discrete stochastic approximation (DSA) and the joint power and rate control (JPR) schemes. The simulation results demonstrate that the strategy proposed in this paper performs better than the existing schemes in both static and simulated realistic environments. The proposed strategy is 4.75 times better than the DSA in the static convergence performance evaluation. Further analysis shows that in the presence of a simulated realistic environment, compared to DSA and JPR, the strategy proposed in this paper reduces the overall transmission redundancy by approximately 11.4% and 52.6%, respectively. It also improves the average communication efficiency by 1.3% and 12.5%, respectively. The average optimization error relative to optimal redundancy is improved by approximately 62.1% and 92.5%, respectively. These numerical results are obtained by employing the specific simulation parameters and the simulated environment mentioned in this paper.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 74-78
Improved non-uniform selecting encoding algorithm for fountain codes with short code-length
Fountain codes are rateless and they can transmit information reliably and efficiently without knowing a priori knowledge of the channel. However, the performance of fountain codes decreases dramatically when code length is shortened. In order to improve the transmission reliability of fountain codes with short code-length, the adjustment among sets non-uniform selecting (ASNS) encoding algorithm is proposed. In ASNS algorithm, the robust soliton degree (RSD) distribution is modified to avoid source symbols imperfect coverage, and some operations on source symbols collections are done to change the probability of source symbols involved in encoding. Simulation consequences show that, under different channel conditions, the proposed ASNS algorithm can achieve much lower decoding failure rate than traditional uniform selecting algorithm and the doping and non-uniform selecting (DNS) algorithm with code-length at 100 and 500.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 74-78
Improved non-uniform selecting encoding algorithm for fountain codes with short code-length
Fountain codes are rateless and they can transmit information reliably and efficiently without knowing a priori knowledge of the channel. However, the performance of fountain codes decreases dramatically when code length is shortened. In order to improve the transmission reliability of fountain codes with short code-length, the adjustment among sets non-uniform selecting (ASNS) encoding algorithm is proposed. In ASNS algorithm, the robust soliton degree (RSD) distribution is modified to avoid source symbols imperfect coverage, and some operations on source symbols collections are done to change the probability of source symbols involved in encoding. Simulation consequences show that, under different channel conditions, the proposed ASNS algorithm can achieve much lower decoding failure rate than traditional uniform selecting algorithm and the doping and non-uniform selecting (DNS) algorithm with code-length at 100 and 500.
- 24 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 27 (4) , 772-779
Novel joint encoding/decoding algorithms of fountain codes for underwater acoustic communication
- 24 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 27 (4) , 772-779
Novel joint encoding/decoding algorithms of fountain codes for underwater acoustic communication
- Open Access
- 1 January 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Handshake triggered chained-concurrent MAC protocol for underwater sensor networks
The design of medium access control (MAC) protocols for Underwater Acoustic Sensor Networks (UASNs) pose many challenges due to low bandwidth and high propagation delay. In this paper, a new medium access control (MAC) protocol called Handshake Triggered Chained-Concurrent MAC (HTCC) is proposed for large-scale applications in UWSNs. The main idea of HTCC is to establish a chained concurrent transmission accomplishing spatial reuse. The novelties of HTCC lie in: firstly, the protocol allows multi-direction handshake with different nodes simultaneously; secondly, a random access mechanism is integrated with the handshake mechanism for improve channel utilization. Simulation results show that HTCC outperforms extended version of Slotted floor acquisition multiple accesses (Ext-sFAMA) in terms of network throughput, the RTS efficiency, as well as fairness in representative scenarios.
- 1 January 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessHandshake triggered chained-concurrent MAC protocol for underwater sensor networks
The design of medium access control (MAC) protocols for Underwater Acoustic Sensor Networks (UASNs) pose many challenges due to low bandwidth and high propagation delay. In this paper, a new medium access control (MAC) protocol called Handshake Triggered Chained-Concurrent MAC (HTCC) is proposed for large-scale applications in UWSNs. The main idea of HTCC is to establish a chained concurrent transmission accomplishing spatial reuse. The novelties of HTCC lie in: firstly, the protocol allows multi-direction handshake with different nodes simultaneously; secondly, a random access mechanism is integrated with the handshake mechanism for improve channel utilization. Simulation results show that HTCC outperforms extended version of Slotted floor acquisition multiple accesses (Ext-sFAMA) in terms of network throughput, the RTS efficiency, as well as fairness in representative scenarios.