Within the framework of the effective-mass approximation and the dipole approximation, considering the three-dimensional confinement of the electron and hole and the strong built-in electric field(BEF) in strained wurtzite Zn O/Mg0:25Zn0:75O quantum dots(QDs), the optical properties of ionized donor-bound excitons(D+, X)are investigated theoretically using a variational method. The computations are performed in the case of finite band offset. Numerical results indicate that the optical properties of(D+, X) complexes sensitively depend on the donor position, the QD size and the BEF. The binding energy of(D+, X) complexes is larger when the donor is located in the vicinity of the left interface of the QDs, and it decreases with increasing QD size. The oscillator strength reduces with an increase in the dot height and increases with an increase in the dot radius. Furthermore, when the QD size decreases, the absorption peak intensity shows a marked increment, and the absorption coefficient peak has a blueshift. The strong BEF causes a redshift of the absorption coefficient peak and causes the absorption peak intensity to decrease remarkably. The physical reasons for these relationships have been analyzed in depth. 相似文献
Large scale wireless sensor networks raise many challenges in the design of efficient and effective routing algorithm due to their complexity and hardware constraints. However, the scalability challenge may be mitigated from a macroscopic perspective. One example is the distributed De la Garza iteration (DDLGI) algorithm for global routing load-balancing, based on a set of partial differential equations iteratively solved by the De la Garza method. We theoretically analyze the parallelism of DDLGI and illustrate that the region of interest may impact the degree of parallelism and error. Furthermore, though DDLGI always converges, the slow convergence and long-range information exchange problems may lead to excess energy consumption in communication. Thus, we propose various enhanced De la Garza routing (E-DLGR) algorithms to alleviate the energy consumption problem by which nodes may exchange less information and only need to exchange information with closer nodes to complete each iteration. Our theoretical analysis and simulation results show that the proposed E-DLGR algorithms may have less transmission overhead, thus further reducing energy consumption, and converge faster while still maintaining adequate accuracy.
