Optical performance of a composite parabolic trough

The effects of receiver misplacement and the trough pointing towards the sun on the concentration characteristics of a composite parabolic trough are discussed. Results from some numerical calculations are presented graphically and discussed.     

Distributed dynamic fault-tolerant channel allocation for cellularnetworks

Efficient allocation of communication channels is critical for the performance of cellular systems. The centralized channel allocation algorithms proposed in literature are neither robust nor scalable. Several of these algorithms are unable to dynamically adjust to spatial and temporal fluctuations in channel demand (load). We present a distributed dynamic channel allocation (DCA) algorithm in which heavily loaded regions acquire a large number of communication channels, while their lightly loaded neighbors get assigned fewer channels. As the spatial distribution of channel demand changes with time, the spatial distribution of allocated channels adjusts accordingly. The algorithm described in this paper requires minimal involvement of the mobile nodes, thus conserving their limited energy supply. The algorithm is proved to be deadlock free, starvation free, and fair. It prevents cochannel interference and can tolerate the failure of mobile as well as static nodes without any significant degradation in service. Simulation experiments demonstrate that the performance of the proposed distributed dynamic algorithm is comparable to, and for some metrics, better than that of efficient centralized dynamic algorithms where the central switch has complete and latest information about channel availability. The major advantages of the proposed algorithm over its dynamic centralized counterparts are its scalability, flexibility, and low computation and communication overheads     

Parametric Optimization of Complementary Split-Ring Resonator Dimensions for Planar Antenna Size Miniaturization

Wireless Personal Communications -     

Reliability of large periphery GaN-on-Si HFETs

GaN devices exhibit excellent potential for use in many RF applications. However, commercial acceptance of the technology has been hindered by the scarcity and non-statistical nature of reliability results. In this work we present a full device level reliability study of GaN-on-Si HFETs. Reliability results on this technology include three-temperature DC data that show an activation energy of 1.7 eV and an average failure time >10⁷ h at 150 °C. Additionally, long duration DC lifetest (30 000 device hours) and RF lifetest (4000 device hours) results demonstrate a repeatable low drift process. Environmental tests such as autoclave and ESD demonstrate the ruggedness of the material system and technology. Finally, initial failure analysis is discussed.     

Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks

In this paper, we propose and investigate the characteristics of a fair queueing with service envelopes (FQSE) algorithm-a hierarchical fair-share scheduling algorithm for access networks based on a remote scheduling system such as Ethernet passive optical networks (EPON) or cable TV network. FQSE is designed to overcome the limiting factors of a typical remote scheduling system such as large control-plane delay, limited control-plane bandwidth, and significant queue switch-over overhead. The algorithm is based on a concept of service envelope-a function representing the fair allocation of resources based on a global network condition called satisfiability parameter (SP). We define properties of cousin-fairness and sibling-fairness and show the FQSE to be cousin-fair. FQSE is unique in that it is the only hierarchical algorithm that is simultaneously cousin-fair. Furthermore, we show the necessary techniques to adapt FQSE to variable-sized packet-based networks. We analyze FQSE performance in EPON serving 1024 independent queues and demonstrate FQSE's ability to provide guaranteed bandwidth to each queue and to share the excess bandwidth fairly.     

Simulation of interconnect inductive impact in the presence of process variations in 90 nm and beyond

The on-chip inductive impact on signal integrity has been a problem for designs in deep-submicrometer technologies. The inductive impact increases the clock skew, max timing, and noise of bus signals. In this letter, circuit simulations using silicon-validated macromodels show that there is a significant inductive impact on the signal max timing (/spl sim/ 10% pushout versus RC delay) and noise (/spl sim/2/spl times/RC noise). In nanometer technologies, process variations have become a concern. Results show that device and interconnect process variations add /spl sim/ 3% to the RLC max-timing impact. However, their impact on the RLC signal noise is not appreciable. Finally, inductive impact in 65- and 45-nm technologies is investigated, which indicates that the inductance impact will not diminish as technology scales.     

Characterization and Studies on Hydro Dynamically Stable Operation of an Angular Jet SOG for COIL

Chemical oxygen-iodine Laser (COIL) is one of the fast emerging high power laser source for near Infrared (λ=1.315μm) laser generation. The heart of the system is the singlet oxygen generator (SOG) which is a pumping source for this laser. A Jet type SOG with a novel approach was designed and fabricated. Singlet oxygen was taken out of the SOG at an angle of 40° thus avoiding the carry over of droplets, which is one of the major drawbacks of horizontal system. The preliminary results have been reported in our earlier publication. The present paper discusses the performance of this generator for various operational conditions viz. diluent's gas nitrogen / helium, basic hydrogen peroxide composition, generator pressure and gas velocity. Further, conditions for the stable operation from generator as well as chlorine injection point of view have been identified.     

Route optimization in mobile ATM networks

This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in mobile ATM (Asynchronous Transfer Mode) networks based on the PNNI (Private Network-to-Network Interface) standard. The route optimization algorithm uses hierarchical route information of the connection and summarized topology and loading information of the network to determine a “crossover node” such that adjusting the connection from that crossover node results in an optimally routed connection. Handoff management schemes that perform local rerouting of connections have been proposed in order to support fast handoffs. These methods result in suboptimally routed connections. In this paper, we demonstrate how this route optimization algorithm can be used to optimize the route of a connection after such a handoff is executed, as the second phase of a two-phase handoff scheme. This route optimization procedure can also be executed as part of the handoff procedure resulting in a one-phase handoff scheme. Applying this route optimization algorithm, we propose two one-phase schemes, the one-phase optimal scheme and the one-phase minimal scheme. A comparative performance analysis of one- and two-phase handoff schemes is presented. Measures of comparison are handoff latency and the amount of network resources used by a connection. Handoff latency in the one-phase optimal scheme is greater than that in the two-phase schemes, and handoff latency in the one-phase minimal scheme is smaller than that in the two-phase schemes. The one-phase methods show a significant increase in efficiency of the connection compared to the two-phase methods. This revised version was published online in June 2006 with corrections to the Cover Date.