Otherwise, when the data is offloaded for edge execution (xti = 1), we denote Pit as the transmit power constrained by the maximum power Pt ≤ Pmax and τtT as the amount of time iii allocated to the ith WD for computation offloading. Here, τit ∈ [0, 1] and 􏰏Ni=1 τit ≤ 1. The energy consumed on data offloading is Eit,O = PitτitT. Similar to [4] and [8], we neglect the delay on edge computing and result downloading such that the amount of data processed at the edge within the time frame is Dt =WτitTlog 􏰉1+Pithti􏰊=WτitTlog 􏰉1+Eit,Ohti􏰊, ∀xt =1, (2) i,O vu 2 N0 vu 2 τitTN0 i where vu ≥ 1 denotes the communication overhead and N0 denotes the noise power. Let Dit 􏰗 (1 − xti )Dit,L + xti Dit,O and Eit 􏰗 (1 − xti )Eit,L + xti Eit,O denote the bits computed and energy consumed in time frame t. We define computation rate rit and power consumption eti in 9 the tth time frame as ttttttt rt=Di=(1−xi)fi+xtWτilog􏰉1+ei,Ohi􏰊,et=Ei=(1−xt)κ􏰁ft􏰂3+xtet ,(3) i T φ ivu 2 τitN0 i T i i ii,O where eti,O 􏰗 Eit,O/T. For simplicity of exposition, we assume T = 1 without loss of generality in the following derivations.，解释cit

这段文字描述了一种边缘计算下的功耗和数据处理速率模型。其中，Pit表示限制最大功率Pt≤Pmax的传输功率，τtT表示分配给第i个终端设备的计算离线化时间。τit∈[0,1]且∑iτit≤1。数据离线化时的能量消耗为Eit,O=PitτitT。忽略边缘计算和结果下载的延迟，数据在时间框架内在边缘处理的数量为Dt=WτitTlog(1+Pithti)=WτitTlog(1+Eit,Ohti)，当xt=1时。Dit和Eit分别表示在时间框架t内处理的比特数和所消耗的能量。rit和eti分别表示在第t个时间框架中的计算速率和功耗。其中，et i,O = Eit,O/T。整个模型的目的是为了简化边缘计算下的计算速率和能量消耗的计算。

相关问题

Otherwise, when the data is offloaded for edge execution (xti = 1), we denote Pit as the transmit power constrained by the maximum power Pt ≤ Pmax and τtT as the amount of time iii allocated to the ith WD for computation offloading. Here, τit ∈ [0, 1] and 􏰎Ni=1 τit ≤ 1. The energy consumed on data offloading is Eit,O = PitτitT. Similar to [4] and [8], we neglect the delay on edge computing and result downloading such that the amount of data processed at the edge within the time frame is Dt =WτitTlog 􏰈1+Pithti􏰉=WτitTlog 􏰈1+Eit,Ohti􏰉, ∀xt =1, ，Eoit，pit是什么

根据文中的描述，Eit,O表示第i个设备的数据离载能耗，Pit表示传输功率的限制，由最大功率Pt ≤ Pmax决定，τit表示分配给第i个设备的计算离载时间，且τit ∈ [0, 1]，并且所有设备的计算离载时间之和不超过1（即􏰎Ni=1 τit ≤ 1）。因此，Eit,O = PitτitT表示第i个设备的数据离载能耗。

As illustrated in Fig. 1, we consider the general layout of HetNets, where each macro-BS serves multiple UE devices and contains a few backhaul-constrained small BSs within its range. Since the small BSs are backhaul-constrained, when UEs are offloaded to a small BS, the small BS may be overloaded when the number of serving UE devices exceeds its capacity (e.g., the small BS identified by the dotted line in Fig. 1). In this scenario, the overloaded small BS cannot provide the serving UEs with the expected QoS. Therefore, the backhaul capacity must be considered as a limitation in the design of the user association algorithm.翻译

如1所示，我们考虑HetNets的一般布局，其中每个宏基站为多个UE设备提供服务，并在其范围内包含一些受后向链路限制的小型基站。由于小型基站受到后向链路的限制，当UE设备被离载到小型基站时，当服务的UE设备数量超过其容量时（例如，图1中由虚线标识的小型基站），小型基站可能会超载。在这种情况下，超载的小型基站无法为服务的UE设备提供预期的QoS。因此，在设计用户关联算法时必须考虑后向链路容量作为限制因素。