In this paper, we characterize the percolation condition for a continuum secondary cognitive radio network under the SINR model. We show that the well-established condition for continuum percolation does not hold true in the SINR regime. Thus, we find the condition under which a cognitive radio network percolates. We argue that due to the SINR requirements of the secondaries along with the interference tolerance of the primaries, not all the deployed secondary nodes necessarily contribute towards the percolation process- even though they might participate in the communication process. We model the invisibility of such nodes using the concept of Poisson thinning, both in the presence and absence of primaries. Invisibility occurs due to nodes that i) cannot decode transmissions except from their nearest neighbors, ii) are always interfered, and iii) belong to isolated components. We find the thinning probability in terms of primary and secondary densities, communication radii, and interference cancellation coefficient. Further, we show how the effective coverage radius shrinks which also adds to the thinning. Theoretical findings are validated through simulations.
Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreThe aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).
High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination
... Show More<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In
... Show MoreThe objective of this paper is to improve the general quality of infrared images by proposes an algorithm relying upon strategy for infrared images (IR) enhancement. This algorithm was based on two methods: adaptive histogram equalization (AHE) and Contrast Limited Adaptive Histogram Equalization (CLAHE). The contribution of this paper is on how well contrast enhancement improvement procedures proposed for infrared images, and to propose a strategy that may be most appropriate for consolidation into commercial infrared imaging applications.
The database for this paper consists of night vision infrared images were taken by Zenmuse camera (FLIR Systems, Inc) attached on MATRIC100 drone in Karbala city. The experimental tests showed sign
Cognitive radio is observed as a new approach, which could be cope with the spectral limitations. This approach is designed to detect whether a particular segment of the radio spectrum is currently in use and to jump into the temporarily unused spectrum rapidly without interfering with the transmissions of other users. CR is the promising radio technology which aims to detect and utilize the temporally unused spectrum bands by sensing its radio environment in order to improve spectrum utilization. To enhance the sensing performance, cooperative spectrum sensing has been proposed. However, when the number of cognitive user tends to be very large, the bandwidth for reporting sensing results to the common receiver will be very huge. In this pa
... Show More