Skip to main content

An Efficient Access Technique based on Clustering and Resources Sharing for Machine Type Communication over LTE Network

Research Abstract

Machine Type Communication (MTC) over the cellular network plays an important role in many smart applications. Long Term Evolutionary (LTE) network is considered the best cellular network for deploying the MTC devices in remote areas because of its high data rate and wide coverage area. The massive access of the MTC devices over LTE network results in poor network performance due to the high collision rate, high retransmission rate, high overhead, high delay, low throughput, and high power wastage. This paper proposes a new access technique to increase the access performance for MTC over LTE network. It is based on the clustering and grouping approach and resources sharing using the capillary network without using cluster head/helper node. In the proposed technique, MTC devices are divided into WLAN groups based on the geographical distance. In each WLAN, an MTC device can ask for uplink resources for data transmission from eNB for individual use or a group use. The MTC device shares the allocated resources with other devices inside its WLAN after finishing its data transmission using Distributed List Hub Polling (DLHPL) MAC protocol. The other devices inside the same WLAN can contend locally on these free resources without querying the eNB. The devices send data frames over LTE using these shared uplink resources without the need to relay it through a head node. The experimental results show that the proposed access technique gives lower collision rate, higher access probability, higher transmission opportunity, higher resources utilization, lower overhead, higher throughput, and lower delay compared with other recent techniques.

Research Authors
Mahmoud Abd El-sattar, Nagwa M. Omar and Hosny M. Ibrahim
Research Date
Research Department
Research Journal
Applied Mathematics & Information Sciences
Research Pages
1-16
Research Publisher
Natural Sciences
Research Vol
16
Research Website
http://www.naturalspublishing.com/Article.asp?ArtcID=24390
Research Year
2022

A color image encryption technique using block scrambling and chaos

Research Abstract

Images are very important forms of data that are widely used nowadays. Every day, millions of grey and color images are transferred via the web. Protecting these images from unauthorized persons is an important issue. Image encryption is one of the image-securing techniques. One advantage of using encryption is that the plain image is converted to an unrecognized one. Also, the plain image is restored without any loss of information. In this paper, a color image encryption technique using blocks scrambling and chaos is presented. First, the plain image is decomposed into three channels: R, G, and B. Then, each channel is divided into sub-images and blocks. Our encryption algorithm depends on two main steps: scrambling and diffusion. First, the pixels’ arrangement in sub-images and blocks is changed, and then scrambling between sub-images is done to get the scrambled image. Then, in diffusion, the scrambled image diffuses using the logistic map to get the encrypted image. The experimental results show that our proposed algorithm has good performance in encrypting color images.

Research Authors
Khalid M Hosny, Sara T Kamal, Mohamed M Darwish
Research Date
Research Department
Research Journal
Multimedia Tools and Applications
Research Pages
505–525
Research Publisher
Springer US
Research Vol
81
Research Year
2022

New geometrically invariant multiple zero-watermarking algorithm for color medical images

Research Abstract

The single watermarking algorithm for medical images faced several inherent problems like lack of security. In
this paper, a new geometrically invariant multiple zero-watermarking method is proposed to secure medical
images. We proposed a novel set of multi-channels shifted Gegenbauer moments of fractional orders (FrMGMs).
These moments are used to extract the geometrically invariant features from the color medical images. Then we
construct a featured image of the original medical image using the magnitude of the selected precise FrMGMs
moments. Finally, we applied a scrambling method to scramble the watermark image and then the exclusive OR
operation to the images’ feature and scrambled watermark to construct a zero-watermark. Experimental results
proved that the proposed approach effectively provided better robustness to various standard attacks and outperformed the existing single-, dual-, & triple-zero-watermarking algorithms for medical images.

Research Authors
Khalid M. Hosny , Mohamed M. Darwish
Research Date
Research Department
Research Journal
Biomedical Signal Processing and Control

Measuring Text Similarity based on Structure and Word Embedding

Research Abstract

The problem of finding similarity between natural language sentences is crucial for many applications in Natural Language Processing (NLP). Moreover, accurate calculation of similarity between sentences is highly needed. Many approaches depends on word-to-word similarity to measure sentences similarity. This paper proposes a new approach to improve accuracy of sentences similarity calculation. The proposed approach combines different similarity measures in calculation of sentences similarity. In addition to traditional word-to-word similarity measure the proposed approach exploits sentences semantic structure. Discourse representation structure (DRS) which is a semantic representation for natural sentences is generated and used to calculated structure similarity. Furthermore, word order similarity is measured to consider order of words in sentences. Experiments show that exploiting structural information achieves good results. Moreover, the proposed method outperforms the current approaches on Pilot standard benchmark dataset achieving 0.8813 peasron correlation with human similarity.
 

Research Authors
Mamdouh Farouk
Research Date
Research Department
Research Pages
1-10
Research Publisher
elsevier
Research Vol
63
Research Year
2020

Measuring Sentences Similarity Based on Discourse Representation Structure

Research Abstract

The problem of measuring similarity between sentences is crucial for many applications in Natural Language Processing (NLP). Most of the proposed approaches depend on similarity of words in sentences. This research considers semantic relations between words in calculating sentence similarity. This paper uses Discourse Representation Structure (DRS) of natural language sentences to measure similarity. DRS captures the structure and semantic information of sentences. Moreover, the estimation of similarity between sentences depends on semantic coverage of relations of the �first sentence in the other sentence. Experiments show that exploiting structural information achieves better results than traditional word-to- word approaches. Moreover, the proposed method outperforms similar approaches on a standard benchmark dataset.

Research Authors
Mamdouh Farouk
Research Date
Research Department
Research Journal
Computing and Informatics
Research Pages
464-480
Research Vol
39
Research Year
2020

Automated classification of malignant and benign breast cancer lesions using neural networks on digitized mammograms

Research Abstract

Automated classification of malignant and benign breast cancer lesions using neural networks on digitized mammograms

Research Authors
Abdelsamea, Mohammed M and Mohamed, Marghny H and Bamatraf, Mohamed
Research Journal
Cancer informatics
Research Pages
1176935119857570
Research Publisher
SAGE Publications Sage UK: London, England
Research Vol
18
Research Year
2019

ASGOP: An aggregated similarity-based greedy-oriented approach for relational DDBSs design

Research Abstract

ASGOP: An aggregated similarity-based greedy-oriented approach for relational DDBSs design

Research Authors
Amer, Ali A and Mohamed, Marghny H and Al\_Asri, Khaled
Research Date
Research Journal
Heliyon
Research Pages
e03172
Research Publisher
Elsevier
Research Vol
1
Research Year
2020

A New Cascade-Correlation Growing Deep Learning Neural Network Algorithm

Research Abstract

In this paper, a proposed algorithm that dynamically changes the neural network structure is presented. The structure is changed based on some features in the cascade correlation algorithm. Cascade correlation is an important algorithm that is used to solve the actual problem by artificial neural networks as a new architecture and supervised learning algorithm. This process optimizes the architectures of the network which intends to accelerate the learning process and produce better performance in generalization. Many researchers have to date proposed several growing algorithms to optimize the feedforward neural network architectures. The proposed algorithm has been tested on various medical data sets. The results prove that the proposed algorithm is a better method to evaluate the accuracy and flexibility resulting from it. View Full-Text

Research Authors
Soha Abd El-Moamen Mohamed, Marghany Hassan Mohamed, Mohammed F Farghally
Research Date
Research Department
Research Journal
Algorithms
Research Member
Research Pages
158
Research Publisher
Multidisciplinary Digital Publishing Institute
Research Year
2021
Subscribe to