In this paper, we investigate and characterize the effects of multi-channel and rendezvous protocols on the connectivity of dynamic spectrum access networks using percolation theory. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from a phenomenon which we define as channel abundance. To cope with the existence of multi-channel, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocols, it becomes difficult for two nodes to agree on a common channel, thereby, potentially remaining invisible to each other. We model this invisibility as a Poisson thinning process and show that invisibility is even more pronounced with channel abundance. Following the disk graph model, we represent the multiple channels as parallel edges in a graph and build a multi-layered graph (MLG) in R2. In order to study the connectivity, we show how percolation occurs in the MLG by coupling it with a typical discrete percolation. Using a Boolean model and the MLG, we study both cases of primaries' absence and presence. For both cases, we define and characterize connectivity of the secondary network in terms of the available number of channels, deployment densities, number of simultaneous transmissions per node, and communication range. When primary users are absent, we derive the critical number of channels which maintains supercriticality of the secondary network. When primary users are present, we characterize and analyze the connectivity for all the regions: channel abundance, optimal, and channel deprivation. For each region we show the requirement and the outcome of using either type of rendezvous techniques. Moreover, we find the tradeoff between deployment-density versus rendezvous probability which results in a connected network. Our results can be used to decide on the goodness of any channel rendezvous algorithm by computing the expected resultant connectivity. They also provide a guideline for achieving connectivity using minimal resources.
Reinforced concrete (RC) beams containing a longitudinal cavity have become an innovative development and advantage for economic purposes of light-weight members without largely affecting their resistance against the applied loads. This type of openings can also be used for maintenance purposes and usage space of communication lines, pipelines, etc. RC beams are primarily loaded in the plane of the members, which are two-dimensional in a plane stress state and the dominant structural behaviours include bending, shear, or combination of both. In the present study, six numerical models of RC beams with and without openings were simulated by using commercial finite element software ANSYS to evaluate the structural behaviours of those b
... Show MoreThe goal of this work is demonstrating, through the gradient observation of a of type linear ( -systems), the possibility for reducing the effect of any disturbances (pollution, radiation, infection, etc.) asymptotically, by a suitable choice of related actuators of these systems. Thus, a class of ( -system) was developed based on finite time ( -system). Furthermore, definitions and some properties of this concept -system and asymptotically gradient controllable system ( -controllable) were stated and studied. More precisely, asymptotically gradient efficient actuators ensuring the weak asymptotically gradient compensation system ( -system) of known or unknown disturbances are examined. Consequently, under convenient hypo
... Show MoreThis paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption b
... Show MoreA numerical study has been carried out to investigate heat transfer by natural convection and radiation under the effect of magnetohydrodynamic (MHD) for steady state axisymmetric twodimensional laminar flow in a vertical cylindrical channel filled with saturated porous media. Heat is generated uniformly along the center of the channel with its vertical surface remain with cooled constant wall temperature and insulated horizontal top and bottom surfaces. The governing equations which used are continuity, momentum and energy equations which are transformed to dimensionless equations. The finite difference approach is used to obtain all the computational results using the MATLAB-7 programming. The parameters affected on the system are Rayl
... Show MoreFree Space Optics (FSO) plays a vital role in modern wireless communications due to its advantages over fiber optics and RF techniques where a transmission of huge bandwidth and access to remote places become possible. The specific aim of this research is to analyze the Bit-Error Rate (BER) for FSO communication system when the signal is sent the over medium of turbulence channel, where the fading channel is described by the Gamma-Gamma model. The signal quality is improved by using Optical Space-Time Block- Code (OSTBC) and then the BER will be reduced. Optical 2×2 Alamouti scheme required 14 dB bit energy to noise ratio (Eb/N0) at 10-5 bit error rate (BER) which gives 3.5 dB gain as compared to no diversity scheme. Th
... Show MoreA modification to cascaded single-stage distributed amplifier (CSSDA) design by using active inductor is proposed. This modification is shown to render the amplifier suitable for high gain operation in small on-chip area. Microwave office program simulation of the Novel design approach shows that it has performance compatible with the conventional distributed amplifiers but with smaller area. The CSSDA is suitable for optical and satellite communication systems.
Current design codes and specifications allow for part of the bonded flexure tension reinforcement to be distributed over an effective flange width when the T-beams' flanges are in tension. This study presents an experimental and numerical investigation on the reinforced concrete flanged section's flexural behavior when reinforcement in the tension flange is laterally distributed. To achieve the goals of the study, numerical analysis using the finite element method was conducted on discretized flanged beam models validated via experimentally tested T-beam specimen. Parametric study was performed to investigate the effect of different parameters on the T-beams flexural behavior. The study revealed that a significant reduction in the
... Show MoreWe define and study new ideas of fibrewise topological space on D namely fibrewise multi-topological space on D. We also submit the relevance of fibrewise closed and open topological space on D. Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space on D. Furthermore, we propose and prove a number of statements about these ideas.
The aim of the research is to apply fibrewise multi-emisssions of the paramount separation axioms of normally topology namely fibrewise multi-T0. spaces, fibrewise multi-T1 spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal spaces and fibrewise multi-functionally normal spaces. Also we give many score regarding it.
This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show More