Search

Antenna beamforming for Simultaneous Wireless Information and Power Transfer (SWIPT) and Wireless Power Transfer (WPT) in an indoor 6G communication system is presented in this paper. The objective function is to maximize the total harvesting power for the SWIPT and WPT nodes with the constraints of the bit error rate and minimum harvesting power. In the study, the power-splitting ratio between harvesting power and decoding information can be adjusted for the SWIPT node. Due to the non-convex problem, we use Self-Adaptive Dynamic Differential Evolution (SADDE) to optimize the designed multi-objective function. We use a symmetric antenna array to study three situations of distance—closer, farther, and similar—between the transmitting antenna and the individual SWIPT and WPT nodes in this paper. Experimental results show that the overall harvesting efficiency is improved, especially in the case of SWIPT nodes closer to the transmitter. The total harvesting power can be improved by 86.7% in the total short-distance case, and by 7.87% in the total long-distance case. [ABSTRACT FROM AUTHOR]

Multiple objective function with beamforming techniques by algorithms have been studied for the Simultaneous Wireless Information and Power Transfer (SWIPT) technology at millimeter wave. Using the feed length to adjust the phase for different objects of SWIPT with Bit Error Rate (BER) and Harvesting Power (HP) are investigated in the broadband communication. Symmetrical antenna array is useful for omni bearing beamforming adjustment with multiple receivers. Self-Adaptive Dynamic Differential Evolution (SADDE) and Asynchronous Particle Swarm Optimization (APSO) are used to optimize the feed length of the antenna array. Two different object functions are proposed in the paper. The first one is the weighting factor multiplying the constraint BER and HP plus HP. The second one is the constraint BER multiplying HP. Simulations show that the first object function is capable of optimizing the total harvesting power under the BER constraint and APSO can quickly converges quicker than SADDE. However, the weighting for the final object function requires a pretest in advance, whereas the second object function does not need to set the weighting case by case and the searching is more efficient than the first one. From the numerical results, the proposed criterion can achieve the SWIPT requirement. Thus, we can use the novel proposed criterion (the second criterion) to optimize the SWIPT problem without testing the weighting case by case. [ABSTRACT FROM AUTHOR]