Preferred Language
Articles
/
VoZ8soYBIXToZYAL47HT
Multi-Channel Distributed DSA Networks: Connectivity and Rendezvous Tradeoffs
...Show More Authors

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.

Scopus Clarivate Crossref
Publication Date
Sun Mar 01 2020
Journal Name
Computer Networks
An improved multi-objective evolutionary algorithm for detecting communities in complex networks with graphlet measure
...Show More Authors

View Publication
Scopus (6)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Mon Jan 28 2019
Journal Name
Soft Computing
Bio-inspired multi-objective algorithms for connected set K-covers problem in wireless sensor networks
...Show More Authors

Scopus (10)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Sat Aug 25 2012
Journal Name
Wireless Personal Communications
Multi-Objective Evolutionary Algorithm Based on Decomposition for Energy Efficient Coverage in Wireless Sensor Networks
...Show More Authors

Scopus (56)
Crossref (42)
Scopus Clarivate Crossref
Publication Date
Sun Aug 24 2014
Journal Name
Wireless Personal Communications
Multi-layer Genetic Algorithm for Maximum Disjoint Reliable Set Covers Problem in Wireless Sensor Networks
...Show More Authors

View Publication
Scopus (22)
Crossref (14)
Scopus Clarivate Crossref
Publication Date
Wed Sep 12 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A Comparison between Multi-Layer Perceptron and Radial Basis Function Networks in Detecting Humans Based on Object Shape
...Show More Authors

       Human detection represents a main problem of interest when using video based monitoring. In this paper, artificial neural networks, namely multilayer perceptron (MLP) and radial basis function (RBF) are used to detect humans among different objects in a sequence of frames (images) using classification approach. The classification used is based on the shape of the object instead of depending on the contents of the frame. Initially, background subtraction is depended to extract objects of interest from the frame, then statistical and geometric information are obtained from vertical and horizontal projections of the objects that are detected to stand for the shape of the object. Next to this step, two ty

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Feb 01 2016
Journal Name
Swarm And Evolutionary Computation
Improving the performance of evolutionary multi-objective co-clustering models for community detection in complex social networks
...Show More Authors

Scopus (31)
Crossref (27)
Scopus Clarivate Crossref
Publication Date
Sun Jul 02 2023
Journal Name
Iraqi Journal Of Science
A secure Search over Distributed Data
...Show More Authors

In recent years, due to the economic benefits and technical advances of cloud
computing, huge amounts of data have been outsourced in the cloud. To protect the
privacy of their sensitive data, data owners have to encrypt their data prior
outsourcing it to the untrusted cloud servers. To facilitate searching over encrypted
data, several approaches have been provided. However, the majority of these
approaches handle Boolean search but not ranked search; a widely accepted
technique in the current information retrieval (IR) systems to retrieve only the top–k
relevant files. In this paper, propose a distributed secure ranked search scheme over
the encrypted cloud servers. Such scheme allows for the authorized user to

... Show More
View Publication Preview PDF
Publication Date
Fri Jun 01 2018
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Improvement of Fading Channel Modeling Performance for Wireless Channel
...Show More Authors

Fading channel modeling is generally defined as the variation of the attenuation of a signal with various variables. Time, geographical position, and radio frequency which is included. Fading is often modeled as a random process. Thus, a fading channel is a communication channel that experiences fading. In this paper, the proposed system presents a new design and simulate a wireless channel using Rayleigh channels. Rayleigh channels using two approaches (flat and frequency-selective fading channels) in order to calculate some path space loss efforts and analysis the performance of different wireless fading channel modeling. The results show that the bite error rate (BER) performance is dramatically improved in the value of signal to

... Show More
Scopus (3)
Scopus Crossref
Publication Date
Mon Dec 18 2023
Journal Name
Journal Of Iraqi Al-khwarizmi
Fibrewise Multi-Compact and Locally Multi- Compact Spaces
...Show More Authors

The primary objective of this paper is to introduce a new concept of fibrewise topological spaces on D is named fibrewise multi- topological spaces on D. Also, we entroduce the concepts of multi-proper, fibrewise multi-compact, fibrewise locally multi-compact spaces, Moreover, we study relationships between fibrewise multi-compact (resp., locally multi-compac) space and some fibrewise multi-separation axioms.

Preview PDF
Publication Date
Sun Oct 15 2017
Journal Name
Research Journal Of Applied Sciences, Engineering And Technology
Optimization of IPv6 Protocol Independent Multicast-Sparse Mode Multicast Routing Protocol based on Greedy Rendezvous Point Selection Algorithm
...Show More Authors

View Publication
Crossref