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.
Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different
... Show MoreThis paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.
Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req
... Show MoreGeographic Information Systems (GIS) are obtaining a significant role in handling strategic applications in which data are organized as records of multiple layers in a database. Furthermore, GIS provide multi-functions like data collection, analysis, and presentation. Geographic information systems have assured their competence in diverse fields of study via handling various problems for numerous applications. However, handling a large volume of data in the GIS remains an important issue. The biggest obstacle is designing a spatial decision-making framework focused on GIS that manages a broad range of specific data to achieve the right performance. It is very useful to support decision-makers by providing GIS-based decision support syste
... Show MoreIn this paper the use of a circular array antenna with adaptive system in conjunction with modified Linearly Constrained Minimum Variance Beam forming (LCMVB) algorithm is proposed to meet the requirement of Angle of Arrival (AOA) estimation in 2-D as well as the Signal to Noise Ratio (SNR) of estimated sources (Three Dimensional 3-D estimation), rather than interference cancelation as it is used for. The proposed system was simulated, tested and compared with the modified Multiple Signal Classification (MUSIC) technique for 2-D estimation. The results show the system has exhibited astonishing results for simultaneously estimating 3-D parameters with accuracy approximately equivalent to the MUSIC technique (for estimating elevation and a
... Show MoreThis paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.
Future wireless communication systems must be able to accommodate a large number of users and simultaneously to provide the high data rates at the required quality of service. In this paper a method is proposed to perform the N-Discrete Hartley Transform (N-DHT) mapper, which are equivalent to 4-Quadrature Amplitude Modulation (QAM), 16-QAM, 64-QAM, 256-QAM, … etc. in spectral efficiency. The N-DHT mapper is chosen in the Multi Carrier Code Division Multiple Access (MC-CDMA) structure to serve as a data mapper instead of the conventional data mapping techniques like QPSK and QAM schemes. The proposed system is simulated using MATLAB and compared with conventional MC-CDMA for Additive White Gaussian Noise, flat, and multi-path selective fa
... Show MorePharmaceutical-instigated pollution is a major concern, especially in relation to aquatic environments and drugs such as meropenem antibiotics. Adsorbents, such as multi-walled carbon nanotubes, offer potential as means of removing polluting meropenem antibiotics and other similar compounds from water. In order to evaluate the effectiveness of multi-walled carbon nanotubes in this capacity, various experimental parameters, including contact time, initial concentration, pH, temperature and the dose of adsorbent have been investigated. The Langmuir and the Freundlich isotherm models have been used. The data obtained using a modified Langmuir model have been consistent with the experimental ones; the best pH value has been obtained to have the
... Show More