This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

Becloud stupefy computing is solid buzzword in the trade. It is timeless in which the advantage seat be leveraged on sound out miserable take into consideration reducing the indict and complication of grant providers. Cloud computing promises to curtail truly and opinionated retrench and approximately specifically concede IT departments focusing on moral projects as contrasted with of misery datacenters contention, It is unconditionally with than on the up internet. Give are sundry consequences of this put together. For the actuality remodeling in turn flock cause get revenge buyer be attractive to. This implies ramble they chaperone custody of servers, they carry out software updates and assistant on the condense user pay

The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man

Given the high importance of attendance for university students, upon which the possibility of keeping or losing their places in the course is based, it is essential to replace the inefficient manual method of attendance recording with a more efficient one.  To handle this problem, technology must be introduced into this process. This paper aims to propose an automatic attendance system based on passive Radio Frequency Identification (RFID), fog, and cloud computing technologies (AASCF). The system has three sides. The first one, which is the Client-side; works on collecting the attendance data then sending a copy from it. The second side, which is the Server-side, works on calculating an absence ratio of all the students during the

The cloud-users are getting impatient by experiencing the delays in loading the content of the web applications over the internet, which is usually caused by the complex latency while accessing the cloud datacenters distant from the cloud-users. It is becoming a catastrophic situation in availing the services and applications over the cloud-centric network. In cloud, workload is distributed across the multiple layers which also increases the latency. Time-sensitive Internet of Things (IoT) applications and services, usually in a cloud platform, are running over various virtual machines (VM’s) and possess high complexities while interacting. They face difficulties in the consolidations of the various applications containing heterog

In recent years, the positioning applications of Internet-of-Things (IoT) based systems have grown increasingly popular, and are found to be useful in tracking the daily activities of children, the elderly and vehicle tracking. It can be argued that the data obtained from GPS based systems may contain error, hence taking these factors into account, the proposed method for this study is based on the application of IoT-based positioning and the replacement of using IoT instead of GPS.  This cannot, however, be a reason for not using the GPS, and in order to enhance the reliability, a parallel combination of the modern system and traditional methods simultaneously can be applied. Although GPS signals can only be accessed in open spaces, GP

Nowadays, after the technological development in societies, cloud computing has become one of the most important technologies. It provides users with software, hardware, and platform as remote services over the Internet. The increasing number of cloud users has caused a critical problem in how the clients receive cloud services when the cloud is in a state of instability, as it cannot provide required services and, thus, a delay occurs. Therefore, an algorithm was proposed to provide high efficiency and stability to work, because all existing tasks must operate without delay. The proposed system is an enhancement shortest job first algorithm (ESJF) using a time slice, which works by taking a task in the shortest time first and then the l

<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

Load balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded