ترغب بنشر مسار تعليمي؟ اضغط هنا

A Unified Framework for IRS Enabled Wireless Powered Sensor Networks

86   0   0.0 ( 0 )
 نشر من قبل Zhengyu Zhu
 تاريخ النشر 2021
  مجال البحث هندسة إلكترونية
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper unveils the importance of intelligent reflecting surface (IRS) in a wireless powered sensor network (WPSN). Specifically, a multi-antenna power station (PS) employs energy beamforming to provide wireless charging for multiple Internet of Things (IoT) devices, which utilize the harvested energy to deliver their own messages to an access point (AP). Meanwhile, an IRS is deployed to enhance the performances of wireless energy transfer (WET) and wireless information transfer (WIT) by intelligently adjusting the phase shift of each reflecting element. To evaluate the performance of this IRS assisted WPSN, we are interested in maximizing its system sum throughput to jointly optimize the energy beamforming of the PS, the transmission time allocation, as well as the phase shifts of the WET and WIT phases. The formulated problem is not jointly convex due to the multiple coupled variables. To deal with its non-convexity, we first independently find the phase shifts of the WIT phase in closed-form. We further propose an alternating optimization (AO) algorithm to iteratively solve the sum throughput maximization problem. To be specific, a semidefinite programming (SDP) relaxation approach is adopted to design the energy beamforming and the time allocation for given phase shifts of WET phase, which is then optimized for given energy beamforming and time allocation. Moreover, we propose an AO low-complexity scheme to significantly reduce the computational complexity incurred by the SDP relaxation, where the optimal closed-form energy beamforming, time allocation, and phase shifts of the WET phase are derived. Finally, numerical results are demonstrated to validate the effectiveness of the proposed algorithm, and highlight the beneficial role of the IRS in comparison to the benchmark schemes.



قيم البحث

اقرأ أيضاً

Wireless sensor networks (WSN) acts as the backbone of Internet of Things (IoT) technology. In WSN, field sensing and fusion are the most commonly seen problems, which involve collecting and processing of a huge volume of spatial samples in an unknow n field to reconstruct the field or extract its features. One of the major concerns is how to reduce the communication overhead and data redundancy with prescribed fusion accuracy. In this paper, an integrated communication and computation framework based on meta-learning is proposed to enable adaptive field sensing and reconstruction. It consists of a stochastic-gradient-descent (SGD) based base-learner used for the field model prediction aiming to minimize the average prediction error, and a reinforcement meta-learner aiming to optimize the sensing decision by simultaneously rewarding the error reduction with samples obtained so far and penalizing the corresponding communication cost. An adaptive sensing algorithm based on the above two-layer meta-learning framework is presented. It actively determines the next most informative sensing location, and thus considerably reduces the spatial samples and yields superior performance and robustness compared with conventional schemes. The convergence behavior of the proposed algorithm is also comprehensively analyzed and simulated. The results reveal that the proposed field sensing algorithm significantly improves the convergence rate.
78 - Xiaobo Zhou , Shihao Yan , Min Li 2020
This work, for the first time, considers confidential data collection in the context of unmanned aerial vehicle (UAV) wireless networks, where the scheduled ground sensor node (SN) intends to transmit confidential information to the UAV without being intercepted by other unscheduled ground SNs. Specifically, a full-duplex (FD) UAV collects data from each scheduled SN on the ground and generates artificial noise (AN) to prevent the scheduled SNs confidential information from being wiretapped by other unscheduled SNs. We first derive the reliability outage probability (ROP) and secrecy outage probability (SOP) of a considered fixed-rate transmission, based on which we formulate an optimization problem that maximizes the minimum average secrecy rate (ASR) subject to some specific constraints. We then transform the formulated optimization problem into a convex problem with the aid of first-order restrictive approximation technique and penalty method. The resultant problem is a generalized nonlinear convex programming (GNCP) and solving it directly still leads to a high complexity, which motivates us to further approximate this problem as a second-order cone program (SOCP) in order to reduce the computational complexity. Finally, we develop an iteration procedure based on penalty successive convex approximation (P-SCA) algorithm to pursue the solution to the formulated optimization problem. Our examination shows that the developed joint design achieves a significant performance gain compared to a benchmark scheme.
In this paper, a novel intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) architecture is proposed for low-power Internet-of-Things (IoT) devices, where the IRS is exploited to improve the performance of WPCN under imperfect channel state information (CSI). We formulate a hybrid access point (HAP) transmission energy minimization problem by a joint design of time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient under the imperfect CSI and non-linear energy harvesting model. Due to the high coupling of optimization variables, this problem is a non-convex optimization problem, which is difficult to solve directly. In order to solve the above-mentioned challenging problems, the alternating optimization (AO) is applied to decouple the optimization variables to solve the problem. Specifically, through AO, time allocation, HAP energy beamforming, receiving beamforming, user transmit power allocation, IRS energy reflection coefficient and information reflection coefficient are divided into three sub-problems to be solved alternately. The difference-of-convex (DC) programming is applied to solve the non-convex rank-one constraint in solving the IRS energy reflection coefficient and information reflection coefficient. Numerical simulations verify the effectiveness of our proposed algorithm in reducing HAP transmission energy compared to other benchmarks.
Wireless sensor networks as the base support for the Internet of things has been a large number of popularity and application. Such as intelligent agriculture, we have to use the sensor network to obtain the growth environmental data of crops, etc.. However, the difficulty of power supply of wireless nodes has seriously hindered the application and development of Internet of things. In order to solve this problem, people use low-power, sleep scheduling and other energy-saving methods on the nodes. Although these methods can prolong the working time of nodes, they will eventually become invalid because of the exhaustion of energy. The use of solar energy, wind energy, and wireless signals in the environment to obtain energy is another way to solve the energy problem of nodes. However, these methods are affected by weather, environment and other factors, and are unstable. Thus, the discontinuity work of the node is caused. In recent years, the development of wireless power transfer (WPT) has brought another solution to this problem. In this paper, a three-layer framework is proposed for mobile station data collection in rechargeable wireless sensor networks to keep the node running forever, named TLFW which includes the sensor layer, cluster head layer, and mobile station layer. And the framework can minimize the total energy consumption of the system. The simulation results show that the scheme can reduce the energy consumption of the entire system, compared with a Mobile Station in a Rechargeable Sensor Network(MSiRSN).
In this paper we investigate fusion rules for distributed detection in large random clustered-wireless sensor networks (WSNs) with a three-tier hierarchy; the sensor nodes (SNs), the cluster heads (CHs) and the fusion center (FC). The CHs collect the SNs local decisions and relay them to the FC that then fuses them to reach the ultimate decision. The SN-CH and the CH-FC channels suffer from additive white Gaussian noise (AWGN). In this context, we derive the optimal log-likelihood ratio (LLR) fusion rule, which turns out to be intractable. So, we develop a sub-optimal linear fusion rule (LFR) that weighs the clusters data according to both its local detection performance and the quality of the communication channels. In order to implement it, we propose an approximate maximum likelihood based LFR (LFR-aML), which estimates the required parameters for the LFR. We also derive Gaussian-tail upper bounds for the detection and false alarms probabilities for the LFR. Furthermore, an optimal CH transmission power allocation strategy is developed by solving the Karush-Kuhn-Tucker (KKT) conditions for the related optimization problem. Extensive simulations show that the LFR attains a detection performance near to that of the optimal LLR and confirms the validity of the proposed upper bounds. Moreover, when compared to equal power allocation, simulations show that our proposed power allocation strategy achieves a significant power saving at the expense of a small reduction in the detection performance.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا