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
Thu Dec 01 2011
Journal Name
Swarm And Evolutionary Computation
Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks
...Show More Authors

Scopus (167)
Crossref (138)
Scopus Clarivate Crossref
Publication Date
Fri Jun 01 2007
Journal Name
Journal Of Al-nahrain University Science
ON THE GREEDY RADIAL BASIS FUNCTION NEURAL NETWORKS FOR APPROXIMATION MULTIDIMENSIONAL FUNCTIONS
...Show More Authors

The 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]).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Mar 24 2022
Journal Name
Arab World English Journal
Collocation Networks of Selected Words in Academic Writing: A Corpus-Based Study
...Show More Authors

This study aims at shedding light on the linguistic significance of collocation networks in the academic writing context. Following Firth’s principle “You shall know a word by the company it keeps.” The study intends to examine three selected nodes (i.e. research, study, and paper) shared collocations in an academic context. This is achieved by using the corpus linguistic tool; GraphColl in #LancsBox software version 5 which was announced in June 2020 in analyzing selected nodes. The study focuses on academic writing of two corpora which were designed and collected especially to serve the purpose of the study. The corpora consist of a collection of abstracts extracted from two different academic journals that publish for writ

... Show More
View Publication
Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Journal Of Sensors
Sequential Monte Carlo Localization Methods in Mobile Wireless Sensor Networks: A Review
...Show More Authors

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages

... Show More
View Publication Preview PDF
Scopus (24)
Crossref (15)
Scopus Clarivate Crossref
Publication Date
Tue Mar 25 2014
Journal Name
Sensors
Minimal Camera Networks for 3D Image Based Modeling of Cultural Heritage Objects
...Show More Authors

View Publication
Scopus (38)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Wed Jan 01 2020
Journal Name
International Journal Of Computational Intelligence Systems
Evolutionary Feature Optimization for Plant Leaf Disease Detection by Deep Neural Networks
...Show More Authors

View Publication
Scopus (46)
Crossref (45)
Scopus Clarivate Crossref
Publication Date
Sun Jul 01 2018
Journal Name
Ieee Transactions On Intelligent Transportation Systems
Real-Time Intersection-Based Segment Aware Routing Algorithm for Urban Vehicular Networks
...Show More Authors

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
View Publication
Scopus (68)
Crossref (61)
Scopus Clarivate Crossref
Publication Date
Sun Jul 01 2012
Journal Name
Applied Soft Computing
A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks
...Show More Authors

Scopus (245)
Crossref (202)
Scopus Clarivate Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Journal Of Engineering
Prediction of Shear Strength Parameters of Gypseous Soil using Artificial Neural Networks
...Show More Authors

The shear strength of soil is one of the most important soil properties that should be identified before any foundation design. The presence of gypseous soil exacerbates foundation problems. In this research, an approach to forecasting shear strength parameters of gypseous soils based on basic soil properties was created using Artificial Neural Networks. Two models were built to forecast the cohesion and the angle of internal friction. Nine basic soil properties were used as inputs to both models for they were considered to have the most significant impact on soil shear strength, namely: depth, gypsum content, passing sieve no.200, liquid limit, plastic limit, plasticity index, water content, dry unit weight, and initial

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Engineering
Data Aggregation in Wireless Sensor Networks Using Modified Voronoi Fuzzy Clustering Algorithm
...Show More Authors

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

... Show More
View Publication Preview PDF