Mengmeng Xu
Research Subjects
Mengmeng Xu has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Hai Zhu
School of Computer, Henan University of Engineering, Zhengzhou, China
3 shared publications Hengzhou Xu
3 shared publicationsHai Zhu
2 shared publications- Hengzhou Xu
School of Computer, Henan University of Engineering, Zhengzhou 451191, China
2 shared publications - Huaan Li
College of Physics and Telecommunication Engineering, Zhoukou Normal University, Zhoukou 466001, China
2 shared publications - Guixiang Zhang
Zhengzhou Railway Vocational & Technical College
1 shared publication
Latest Publications
- 1 January 2023
- Published by Research Publishing Services
Design of Masking Matrices for Tanner (5,11)-Regular QC-LDPC Codes
- 1 January 2023
- Published by Research Publishing Services
Design of Masking Matrices for Tanner (5,11)-Regular QC-LDPC Codes
- Open Access
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Energy‐Efficient Data Transmission in Mobility‐Aware Wireless Networks
Data transmission scheme is an effective mode to improve the energy‐efficiency in packet delivery. In this paper, we investigate the energy‐efficient data transmission over reliable links and unreliable links in mobility‐aware wireless networks. The network topologies in mobility‐aware wireless networks are changed from one time slot to another, and they could be described by a sequence of static graphs. We first model these network topologies in a time period as a virtual space‐time graph. On the virtual space‐time graph, energy‐efficient data transmission problems over reliable links and unreliable links are defined. The aim of the two data transmission problems is to find a spatial‐temporal path with the minimum energy cost. Next, we propose an Energy‐Efficient Data Transmission algorithm over Reliable Links (EEDT‐RL) to find the optimal space‐time path. Based on EEDT‐RL, we also develop a heuristic data transmission protocol over unreliable links (named EEDT‐UL), in which the path reliability is taken into consideration. Simulation results show that our proposed algorithms perform well in terms of energy cost and transmission count compared with some existing algorithms.
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Open AccessEnergy‐Efficient Data Transmission in Mobility‐Aware Wireless Networks
Data transmission scheme is an effective mode to improve the energy‐efficiency in packet delivery. In this paper, we investigate the energy‐efficient data transmission over reliable links and unreliable links in mobility‐aware wireless networks. The network topologies in mobility‐aware wireless networks are changed from one time slot to another, and they could be described by a sequence of static graphs. We first model these network topologies in a time period as a virtual space‐time graph. On the virtual space‐time graph, energy‐efficient data transmission problems over reliable links and unreliable links are defined. The aim of the two data transmission problems is to find a spatial‐temporal path with the minimum energy cost. Next, we propose an Energy‐Efficient Data Transmission algorithm over Reliable Links (EEDT‐RL) to find the optimal space‐time path. Based on EEDT‐RL, we also develop a heuristic data transmission protocol over unreliable links (named EEDT‐UL), in which the path reliability is taken into consideration. Simulation results show that our proposed algorithms perform well in terms of energy cost and transmission count compared with some existing algorithms.
- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 449-453
A Short Note on the Girth of Tanner (5,13)-Regular QC-LDPC Codes
This paper studies the girth of Tanner (5,13)-regular QC-LDPC codes. We present the conditions for the existence of cycles of lengths less than 12 in Tanner (5,13)-regular QC-LDPC codes of length ${13p}$ where ${p}$ is a prime of the form ${65i+1}$ , and transfer these conditions into the equations in a 65th root of unity of the prime field ${\mathbb{F}_p}$ . By checking the existence of solutions for these equations over ${\mathbb{F}_p}$ , we derive the girth distribution of Tanner (5,13)-regualr QC-LDPC codes.- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 449-453
A Short Note on the Girth of Tanner (5,13)-Regular QC-LDPC Codes
This paper studies the girth of Tanner (5,13)-regular QC-LDPC codes. We present the conditions for the existence of cycles of lengths less than 12 in Tanner (5,13)-regular QC-LDPC codes of length ${13p}$ where ${p}$ is a prime of the form ${65i+1}$ , and transfer these conditions into the equations in a 65th root of unity of the prime field ${\mathbb{F}_p}$ . By checking the existence of solutions for these equations over ${\mathbb{F}_p}$ , we derive the girth distribution of Tanner (5,13)-regualr QC-LDPC codes.- Open Access
- 1 June 2019
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 13 (10) , 1524-1529
Integrating power assignment into energy‐efficient routing in E2E retransmission systems
Routing design is an effective mechanism to improve the energy‐efficiency in packet transmissions for wireless multihop networks. Meanwhile, the total energy consumption for packet transmissions over a path comprising of several unreliable links depends on the power assignment on each link. In this study, the authors address the energy‐efficient routing, which integrates with the optimal power assignment, in end‐to‐end (E2E) retransmission systems. The process of packet transmission across a path in E2E systems is modelled as a random walk. The expected energy consumed for the packet transmission is then calculated. As the expected energy consumption closely relies on the transmit power assigned on the path, it is necessary to integrate the power assignment into the energy‐efficient routing. The optimal power assignment on the candidate path is analytically derived for minimising the expected energy consumption. Specially, the energy‐efficient routing integrated with power sssignment (EERPA) algorithm is developed to find the optimal path among all candidate paths with all possible power assignments. Simulations demonstrate the efficiency of the authors' EERPA algorithm.
- 1 June 2019
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 13 (10) , 1524-1529
Open AccessIntegrating power assignment into energy‐efficient routing in E2E retransmission systems
Routing design is an effective mechanism to improve the energy‐efficiency in packet transmissions for wireless multihop networks. Meanwhile, the total energy consumption for packet transmissions over a path comprising of several unreliable links depends on the power assignment on each link. In this study, the authors address the energy‐efficient routing, which integrates with the optimal power assignment, in end‐to‐end (E2E) retransmission systems. The process of packet transmission across a path in E2E systems is modelled as a random walk. The expected energy consumed for the packet transmission is then calculated. As the expected energy consumption closely relies on the transmit power assigned on the path, it is necessary to integrate the power assignment into the energy‐efficient routing. The optimal power assignment on the candidate path is analytically derived for minimising the expected energy consumption. Specially, the energy‐efficient routing integrated with power sssignment (EERPA) algorithm is developed to find the optimal path among all candidate paths with all possible power assignments. Simulations demonstrate the efficiency of the authors' EERPA algorithm.
- 15 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (4) , 1293-1296
Frequency-Phase Decoupling Method for Carrier Synchronization in Space Communications
In space communications, there exist two prominent issues: large Doppler spread and limited pilot resources, which will result in poor performance for a pilot-aided (PA) traditional carrier synchronization mode (TCSM) with serial processing. In view of this, we propose a frequency-phase decoupling method (FPDM) based on an unbiased auto-correlation (AC) operator with a variable correlation delay length. By using this method, a new carrier synchronization mode (NCSM) is developed with parallel processing. Taking the classical maximum likelihood (ML) estimation as an example, both theoretical analysis and simulation results show that considering a modified generalized frame format, I) the resulting NCSM can implement decoupling of the frequency offset estimator (FOE) and the phase offset estimator (POE), and II) the POE of the NCSM achieves stronger ability of anti-Doppler spread and requires less complex multiplication operations compared to that of the TCSM.
- 15 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (4) , 1293-1296
Frequency-Phase Decoupling Method for Carrier Synchronization in Space Communications
In space communications, there exist two prominent issues: large Doppler spread and limited pilot resources, which will result in poor performance for a pilot-aided (PA) traditional carrier synchronization mode (TCSM) with serial processing. In view of this, we propose a frequency-phase decoupling method (FPDM) based on an unbiased auto-correlation (AC) operator with a variable correlation delay length. By using this method, a new carrier synchronization mode (NCSM) is developed with parallel processing. Taking the classical maximum likelihood (ML) estimation as an example, both theoretical analysis and simulation results show that considering a modified generalized frame format, I) the resulting NCSM can implement decoupling of the frequency offset estimator (FOE) and the phase offset estimator (POE), and II) the POE of the NCSM achieves stronger ability of anti-Doppler spread and requires less complex multiplication operations compared to that of the TCSM.
- 20 March 2018
- Published by Springer Nature
- p. 75-83
Low-Cost Topology Design for Wireless Ad Hoc Networks with Connectivity Constraint
- 20 March 2018
- Published by Springer Nature
- p. 75-83
Low-Cost Topology Design for Wireless Ad Hoc Networks with Connectivity Constraint