Transient electroluminescence (EL) was used to measure the delay between the excitation pulse and onset of emission in OLEDs based on phosphorescent bis[3,5-bis(2-pyridyl)-1,2,4-triazolato] platinum(ΙΙ) doped into 4,4′-bis(carbazol-9-yl) triphenylamine (CBP), from which an electron mobility of 3.2 × 10−6 cm2/V s was approximated. Delayed recombination was observed after the drive pulse had been removed and based on its dependence on frequency and duty cycle, ascribed to trapping and de-trapping processes associated with disorder-induced carrier localization at the interface between the emissive layer and electron blocker. The data suggests that the exciton recombination zone is at, or close to the interface between the emissive layer and electron blocker. Despite the charge trapping effects, a peak power efficiency of 24 lm/W and peak external quantum efficiency of 10.64% were obtained. Mechanisms for the electroluminescence and delayed recombination are proposed. 相似文献
Providing good quality of service (QoS) in cellular IP networks is an important requirement for performance improvement of the cellular IP network. Resource reservation is one of the methods used in achieving this goal and is proven to be effective. The main resources to be reserved in a cellular IP network are bandwidth, buffer and central processing unit (CPU) cycles. Router CPU cycle is the time taken by the router to process the packet of the flow before forwarding it to the next router (hop). This paper proposes a model for CPU cycle optimization of routers for real‐time flows in a cellular IP network. The model applies both genetic algorithm (GA) and particle swarm optimization (PSO) as soft computing tools to optimize the CPU cycles and reduces the flow processing time at each router in the route taken by a flow. Simulation experiments illustrate a comparative study of the model. 相似文献
Utility is an important factor for serviceproviders, and they try to increase their utilities through adopting different policies and strategies. Because of unpredictable failures in systems, there are many scenarios in which the failures may cause random losses for service providers. Loss sharing can decrease negative effects of unexpected random losses. Because of capabilities of learning automata in random and stochastic environments, in this paper, a new learning automaton based method is presented for loss sharing purpose. It is illustrated that the loss sharing can be useful for service providers and helps them to decrease negative effect of the random losses. The presented method can be used especially in collaborative environments such as federated clouds. Results of the conducted experiments show the usefulness of the presented approach to improve utility of service providers. 相似文献
This paper investigates and compares the performance of two GMPLS-based distributed control and management protocols for dynamic lightpath provisioning in future IP networks. The first protocol is a global information-based link state approach that consists of both an integrated RWA algorithm and a signaling algorithm. Two triggering mechanisms for the LSAs update procedures are considered; one is periodic-based and the other is threshold-based. The second protocol is a local-information based fixed alternate link routing approach where the signaling protocol is closely integrated with the RWA protocols. 相似文献
International Journal of Wireless Information Networks - Dynamic variation of network topology in mobile ad hoc networks (MANET) forces network nodes to work together and rely on each other for... 相似文献
Wireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.
Wireless sensor networks (WSNs) are known to be highly energy-constrained and consequently lifetime is a critical metric in their design and implementation. Range assignment by adjusting the transmission powers of nodes create a energy-efficient topology for such networks while preserving other network issues, however, it may effect on the performance of other techniques such as network coding. This paper addresses the problem of lifetime optimization for WSNs where the network employs both range assignment and network-coding-based multicast. We formulate the problem and then reformulated it as convex optimization that offer a numerous theoretical or conceptual advantages. The proposed programming leads to efficient or distributed algorithms for solving the problem. Simulation results show that the proposed optimized mechanism decreases end-to-end delay and improve lifetime as compared by other conventional ones. 相似文献
Wireless Personal Communications - The position of mobile devices is determined by Real Time Differential Global Positioning System (RTDGPS). This system is composed of fixed and mobile station.... 相似文献
This paper presents link to system (L2S) interfacing technique for multiple input and multiple output (MIMO) iterative receivers. In L2S interfacing, usually the post detection signal to noise ratio (SNR)‐based frame error rate lookup tables (LUT) are used to predict the link level performance of receivers. While L2S interfacing for linear MIMO receivers can be conveniently implemented, it is more challenging for MIMO iterative receivers due to unavailability of the closed form SNR expressions. In this paper, we propose three methods for post detection SNR estimation for MIMO iterative receivers. The first is based on the QR decomposition of the channel matrix, the second relies on the residual noise calculation based on the soft symbols, and the third exploits the closed form SNR expressions for linear receivers. A link to system interface model for iterative receivers is developed for evaluating the reference curves for different modulation and coding schemes, and results are validated by comparing the simulated and predicted frame error rates. It is shown that linear and residual noise‐based SNR approximations result in a very good prediction performance whereas the performance of QR decomposition‐based method degrades for higher order modulations and coding schemes. This paper presents link to system interfacing technique for MIMO iterative receivers. A link to system interface model for iterative receivers is developed for evaluating the reference curves for different modulation and coding schemes, and results are validated by comparing the simulated and predicted frame error rates. Three post detection SNR evaluation schemes have been proposed for link to system interfacing all of which give good prediction performance especially at lower order modulation. 相似文献