Jamal Ibrahim Daoud

Route optimization scenario of a new scheme based on nested mobile network

With the rapid growth of wireless technologies and increasing number of mobile digital devices, mobility has been an important element on the Internet. NEMO Basic Support, designed by the Internet Engineering Task Force (IETF) to provide network mobility, is not efficient to offer low latency handoff in the case of nested mobile networks because it produces a long transfer delay and excessively large packet sizes due to non-optimal routes and multiple encapsulations. This paper presents a route optimization scenario for nested mobile network using hierarchical structure with Binding Update Tree (BUT). This scheme should reduce packet overhead, handoff latency, packet transmission delay, and achieve optimal routing.

A framework of a route optimization scheme for nested mobile network

Network mobility technology is now being accomplished with the foundation of NEMO (NEtwork MObility), developed by Internet Engineering Task Force (IETF). Although, it achieves optimal and continuous communication, it still suffers from some limitations, especially when the level of nesting increases. To overcome these drawbacks, this paper will present a route optimization framework for nested mobile network using hierarchical structure with Binding Update Tree (BUT). This framework should reduce packet overhead, handoff latency, packet transmission delay, and achieve optimal routing. At last, a comparison will be done with bi-directional tunneling used by NEMO Basic Support to evaluate the performance of the proposed framework.

Arithmetic version of Boolean algebra

In this article we will discuss that the logical results in Boolean algebra can equally be derived with ordinary algebraic operations. We will establish arithmetic versions of the common logical propositions inclusive of Sheffer stroke (Nand connective) and Peirces arrow (Nor connective) which are very important to design circuit diagrams. We will present the comparison of some basic logical Boolean expressions and their arithmetic version through the truth tables. Finally we will establish the fundamental logical equivalent propositions via arithmetic versions.

On Opial Type Inequalities with Nonlocal Conditions and Applications

The purpose of this note is to give Opial type inequalities with nonlocal conditions. Also, a reverse of the original inequality with y(a) = y(b) = 0 is derived. We apply these inequalities to second-order differential equations with nonlocal conditions to derive several necessary conditions for the existence of solutions.