Bulk micromachining of silicon in TMAH-based etchants for aluminum passivation and smooth surface

The fabrication of silicon based micromechanical sensors often requires bulk silicon etching after aluminum metallization. All wet silicon etchants including ordinary undoped tetramethyl ammonium hydroxide (TMAH)-water solution attack the overlaying aluminum metal interconnect during the anisotropic etching of (100) silicon. This paper presents a TMAH-water based etching recipe to achieve high silicon etch rate, a smooth etched surface and almost total protection of the exposed aluminum metallization. The etch rate measurements of (100) silicon, silicon dioxide and aluminum along with the morphology studies of etched surfaces are performed on both n-type and p-type silicon wafers at different concentrations (2, 5, 10 and 15%) for undoped TMAH treated at various temperatures as well as for TMAH solution doped separately and simultaneously with silicic acid and ammonium peroxodisulphate (AP). It is established through a detailed study that 5% TMAH-water solution dual doped with 38 gm/l silicic acid and 7 gm/l AP yields a reasonably high (100) silicon etch rate of 70 μm/h at 80 °C, very small etch rates of SiO₂ and pure aluminum (around 80 Å/h and 50 Å/h, respectively), and a smooth surface (±7 nm) at a bath temperature of 80 °C. The etchant has been successfully used for fabricating several MEMS structures like piezoresistive accelerometer, vaporizing liquid micro-thruster and flow sensor. In all cases, the bulk micromachining is carried out after the formation of aluminum interconnects which is found to remain unaffected during the prolonged etching process at 80 °C. The TMAH based etchant may be attractive in industry due to its compatibility with standard CMOS process.     

Multiuser Detection in SDMA–OFDM Wireless Communication System Using Complex Multilayer Perceptron Neural Network

The space division multiple access–orthogonal frequency division multiplexing (SDMA–OFDM) wireless system has become very popular owing high spectral efficiency and high load capability. The optimal maximum likelihood multiuser detection (MUD) technique suffers from high computational complexity. On the other hand the linear minimum mean square error (MMSE) MUD techniques yields poor performance and also fails to detect users in overload scenario, where the number of users are more than that of number of receiving antennas. By contrast, the differential evolution algorithm (DEA) aided minimum symbol error rate (MSER) MUD can sustain in overload scenario as it can directly minimizes probability of error rather than mean square error. However, all these classical techniques are still complex as these do channel estimation and multiuser detection sequentially. In this paper, complex multi layer perceptron (CMLP) neural network model is suggested for MUD in SDMA–OFDM system as it do both channel approximation and MUD simultaneously. Simulation results prove that the CMLP aided MUD performs better than the MMSE and MSER techniques in terms of enhanced bit error rate performance with low computational complexity.     

Scanning of sector and cosecant beams generated by a circular aperture

A method of scanning a one-dimensional shaped pattern generated by a circular aperture is presented. It is shown that the desired beam shape can be retained in the desired scan plane by superposing on the nonlinear phase distribution applied along and parallel to the meridian plane, a linear phase progression along the perpendicular direction. Analysis carried out using the stationary phase method of evaluating the integral reveals that the gradient of the linear phase progression is a function of position along the meridian plane of the aperture. Expressions for the phase functions are derived. Computed results on the phase distribution and the radiation pattern are presented.     

Routing Correlated Data in Wireless Sensor Networks: A Survey

Sensory data gathered from sensor nodes in physical proximity tend to exhibit strong correlation. To minimize such redundancy and hence curtail the load in wireless sensor networks with a goal to conserve energy, effective in-network fusion schemes have been extensively proposed in the literature. To this end, routing schemes supporting data fusion are extremely important as they dictate where and when sensory data streams shall intersect with each other and thus fusion will be performed. In this article we briefly articulate this problem and classify recently proposed routing schemes supporting data fusion in wireless sensor networks into three categories: routing-driven, coding-driven, and fusion-driven. We also give an overview of various algorithms in each category by summarizing their design approaches, benefits, and drawbacks.     

A model of front-illuminated n+-p-p+high-efficiency silicon solar cell

A realistic model of a front-illuminated n⁺-p-p⁺ silicon solar cell is developed by solving the current continuity equations for minority carriers in the quasi-neutral regions in steady state, assuming the light in the cell is trapped as a result of multiple reflections at the front and the back of the cell. This model is used to study the effects of the front emitter thickness and doping level and the light trapping on the J-V characteristic and thereby on the open-circuit voltage, short-circuit current density, curve factor, and the efficiency of the cell. A textured cell with an emitter thickness in the range of 0.3-1.0 μm with its doping ≈5×10¹⁸ cm^-3 and the recombination velocities of minority carriers as large as 200 cm/s at the n⁺ front surface and 10 cm/s at the back of the p base can exhibit an efficiency in excess of 26% (under AM 1.5 sunlight of 100 mW/cm² intensity) at 25°C if the light reflection losses at the front surface can be made small     

Evaluation of post-fault restoration strategies in multi-domain networks

Although multi-domain survivability is a major concern for operators, few studies have considered the design of post-fault restoration schemes. This paper proposes two such strategies, based upon hierarchical routing and signaling crankback, to handle single and multi-link failure events in multi-domain IP/MPLS networks (also extendible to optical DWDM networks). Specifically, the hierarchical routing strategy relies upon abstracted domain information to compute inter-domain loose routes, whereas the crankback scheme applies signaling re-tries to restore paths in a domain-by-domain manner. The performance of these proposed solutions is then analyzed and compared via simulation.     

Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

Next-generation wireless mobile communications will be driven by converged networks that integrate disparate technologies and services. The wireless mesh network is envisaged to be one of the key components in the converged networks of the future, providing flexible high- bandwidth wireless backhaul over large geographical areas. While single radio mesh nodes operating on a single channel suffer from capacity constraints, equipping mesh routers with multiple radios using multiple nonoverlap- ping channels can significantly alleviate the capacity problem and increase the aggregate bandwidth available to the network. However, the assignment of channels to the radio interfaces poses significant challenges. The goal of channel assignment algorithms in multiradio mesh networks is to minimize interference while improving the aggregate network capacity and maintaining the connectivity of the network. In this article we examine the unique constraints of channel assignment in wireless mesh networks and identify the key factors governing assignment schemes, with particular reference to interference, traffic patterns, and multipath connectivity. After presenting a taxonomy of existing channel assignment algorithms for WMNs, we describe a new channel assignment scheme called MesTiC, which incorporates the mesh traffic pattern together with connectivity issues in order to minimize interference in multi- radio mesh networks.     

Flexible hybrid WDM/TDM PON architectures using wavelength selective switches

For building an optical access network, we propose some new hybrid WDM/TDM passive optical network (PON) architectures that use wavelength selective switches (WSSs) at the remote node to improve flexibility, data security and power budget. Through simulations we demonstrate that the switching capabilities of a WSS can provide additional gains in terms of wavelength usage by a better statistical multiplexing. Several WSS-based hybrid WDM/TDM PON variants are proposed and assessed. These architectures are also compared with the more commonly used hybrid WDM/TDM PONs consisting of power splitters and/or arrayed wavelength gratings (AWGs), in terms of cost and power budget.     

Non-Cooperative Games for Service Differentiation in CDMA Systems

In this paper, we address the problem of user-class based service differentiation in CDMA networks. Users are categorized into three classes who get differentiated services based on their expected quality of service (QoS) from the service provider and the price they are willing to pay. We adopt a game theoretic approach for allocating resources through a two-step process. During a service admission, resource distribution is determined for each class. Then, the resource allocated to each class is distributed among the active users in that class. We devise a utility function for the providers which considers the expected revenue and the probability of users leaving their service provider if they are not satisfied with the service. Our model demonstrates how power can be controlled in a CDMA network to differentiate the service quality. Also, we show the impact of admitting high paying users on other users. Mainak Chatterjee received his Ph.D. from the department of Computer Science and Engineering at The University of Texas at Arlington in 2002. Prior to that, he completed his B.Sc. with Physics (Hons) from the University of Calcutta in 1994 and M.E. in Electrical Communication Engineering from the Indian Institute of Science, Bangalore, in 1998. He is currently an Assistant Professor in the department of Electrical and Computer Engineering at the University of Central Florida. His research interests include economic issues in wireless networks, applied game theory, resource management and quality-of-service provisioning, ad hoc and sensor networks, CDMA data networking, and link layer protocols. He serves on the executive and technical program committee of several international conferences. Haitao Lin received the BE degree in radio engineering from Southeast University, Nanjing, China, in 1996, the MS degree in computer applications from the Beijing University of Posts and Telecommunications, Beijing, China, in 2000, and Ph.D. in Computer Science and Engineering from The University of Texas at Arlington in 2004. He is currently with Converged Multimedia Services System Engineering at Nortel, Richardson, Texas. His research interests include wireless network performance evaluation and enhancement, wireless link adaptation, wireless network resource management, and applied game theory. Sajal K. Das received B.S. degree in 1983 from Calcutta University, M.S. degree in 1984 from Indian Institute of Science, Bangalore, and Ph.D. degree in 1988 from University of Central Florida, Orlando, all in Computer Science. He is currently a Professor of Computer Science and Engineering and also the Founding Director of the Center for Research in Wireless Mobility and Networking (CReWMaN) at the University of Texas at Arlington (UTA). Prior to 1999, he was a professor of Computer Science at the University of North Texas (UNT), Denton where he founded the Center for Research in Wireless Computing (CReW) in 1997, and also served as the Director of the Center for Research in Parallel and Distributed Computing (CRPDC) during 1995–97. Dr. Das is a recipient of the UNT Student Association's Honor Professor Award in 1991 and 1997 for best teaching and scholarly research; UNT's Developing Scholars Award in 1996 for outstanding research; UTA's Outstanding Faculty Research Award in Computer Science in 2001 and 2003; and the UTA College of Engineering Research Excellence Award in 2003. He is also frequently invited as a keynote speaker at international conferences and symposia. Dr. Das' current research interests include mobile wireless communications, resource and mobility management in wireless networks, mobile and pervasive computing, wireless multimedia, ad hoc and sensor networks, mobile internet architectures and protocols, distributed and grid computing, performance modeling and simulation. He has published over 350 research papers in these areas in international journals and conferences, directed numerous industry and government funded projects, and holds five US patents in wireless mobile networks. He received four Best Paper Awards in the ACM MobiCom'99, ICOIN'01, ACM MSWiM'00, and ACM/IEEE PADS'97. He as the Editor in Chief of the Pervasive and Mobile Computing (PMC) journal and also as an Associate Editor of IEEE Transactions on Mobile Computing, ACM/Kluwer Wireless Networks, Parallel Processing Letters, Journal of Parallel, Distributed and Emerging Systems. He served as General Chair of IEEE WoWMoM'05, PerCom'04, IWDC'04, MASCOTS'02, ACM WoWMoM'00-02; General Vice Chair of IEEE PerCom'03, ACM MobiCom'00 and IEEE HiPC'00-01; Program Chair of IWDC'02, WoWMoM'98-99; TPC Vice Chair of ICPADS'02; and as TPC member of numerous IEEE and ACM conferences. He is Vice Chair of the IEEE Computer Society's TCPP and TCCC Executive Committees.     

Secure Remote User Mutual Authentication Scheme with Key Agreement for Cloud Environment

Authentication schemes are widely used mechanisms to thwart unauthorized access of resources over insecure networks. Several smart card based password authentication schemes have been proposed in the literature. In this paper, we demonstrate the security limitations of a recently proposed password based authentication scheme, and show that their scheme is still vulnerable to forgery and offline password guessing attacks and it is also unable to provide user anonymity, forward secrecy and mutual authentication. With the intention of fixing the weaknesses of that scheme, we present a secure authentication scheme. We show that the proposed scheme is invulnerable to various attacks together with attacks observed in the analyzed scheme through both rigorous formal and informal security analysis. Furthermore, the security analysis using the widely-accepted Real-Or-Random (ROR) model ensures that the proposed scheme provides the session key (SK) security. Finally, we carry out the performance evaluation of the proposed scheme and other related schemes, and the result favors that the proposed scheme provides better trade-off among security and performance as compared to other existing related schemes.