Adnan A. Hnaif

Routing protocols are the fundamental block of selecting the optimal path from a source node to a destination node in internetwork. Due to emerge the large networks in business aspect thus; they operate diverse routing protocols in their infrastructure. In order to keep a large network connected; the implementation of the route redistribution is needed in network routers. This paper creates the four scenarios on the same network topology by using Optimized Network Engineering Tools Modeler (OPNET 14.5) simulator in order to analyze the performance of the route redistribution among three routing protocols by configuring three protocols from a set of Routing Information Protocol (RIPv2), Enhanced Interior Gateway Routing Protocol (EIGRP), Open Shortest Path First (OSPF), and Intermediate System to Intermediate System (IS-IS) dynamic routing protocols on each scenario. The first scenario is EIGRP_OSPF_ISIS, the second scenario is EIGRP_OSPF_RIPv2, the third scenario is RIPv2_EIGRP_ISIS, and the fourth scenario is RIPv2_OSPF_ISIS. The simulation results showed that the RIPv2_EIGRP_ISIS scenario outperforms the other scenarios in terms of network convergence time, the hops number, jitter, packet delay variation, packet end to end delay; therefore, it fits real time applications such as voice and video conferencing. In contrast, the EIGRP_OSPF_ISIS scenario has better results compared with other scenarios in terms of response time in case of using web browsing, database query, and Email services.

Wireless sensor network systems deploy a dense array of small, low-cost sensors that observe the local environment. The system can be deployed anywhere, even in inaccessible places. This technology can provide real time monitoring for forest fires. Ignition can be determined rapidly, depending on the wake/sleep schedule of the system nodes. This study investigates the coverage and fire detection ability of a wireless network system. Sub-networks in randomly-distributed nodes convert the network from being randomly distributed to being organised, and reduce the operation time and energy consumption of each node. Dividing the network into three sub-networks increases network battery lifetime by 2.7% and increases energy performance by 63% compared to conventional fire detection networks. The proposed network only requires each node to be equipped with a cheap temperature sensor. Analysis of data from multiple sensors can indicate not only the presence of a fire, but also its intensity, behaviour and direction of spread, which can greatly assist firefighting efforts.

The evolving necessity of the Internet increases the demand on the bandwidth.
Therefore, this demand opens the doors for the hackers’ community to develop new
methods and techniques to gain control over networking systems. Hence, the intrusion
detection systems (IDS) are insufficient to prevent/detect unauthorized access the
network. Network Intrusion Detection System (NIDS) is one example that still suffers
from performance degradation due the increase of the link speed in today’s networks.
In This paper we proposed a novel algorithm to detect the intruders, who’s trying to
gain access to the network using the packets header parameters such as;
source/destination address, source/destination port, and protocol without the need to
inspect each packet content looking for signatures/patterns. However, the “Packet
Header Matching” algorithm enhances the overall speed of the matching process
between the incoming packet headers against the rule set. We ran the proposed
algorithm to proof the proposed concept in coping with the traffic arrival speeds and
the various bandwidth demands. The achieved results were of significant
enhancement of the overall performance in terms of detection speed.

In this paper we propose a new secure E-Voting protocol based on public-key encryption cryptosystem. This
protocol is summarized in three processes: firstly, access control process which involves the identification
and authentication phases for the applied citizens. Secondly, the voting process which will be done by
ciphering the voter information using public-key encryption cryptosystem (RSA), to be submitted over an
insecure network to the specified government election server. Finally, the election server administrator will
sort the final result by deciphering the received encrypted information using RSA private key. Actually, this
E-Voting protocol is more efficient than others E-Voting protocols since the voter can vote from his/her own
personal computer (PC) without any extra cost and effort. The RSA public-key encryption system ensures the
security of the proposed protocol. However, to prevent a brute force attack, the choice of the key size
becomes crucial.

In pattern matching or recognition the match usually has to be exact. This study, introduce a new general approach algorithm, called the Weighted Exact Matching Algorithm (WEMA). The WEMA applied to match the exact pattern within a text depending on preparing the text in an index matrix weight with the locations of characters in alphabetical order to perform direct access matching. Whereby, WEMA check the possibility of the pattern existence before applying the matching process. The simulation result showed significant improvement in the exact string matching and therefore extreme competence in the real applications.

Approximate string matching algorithms are techniques used to find a pattern ‘P’ in a text ‘T’ partially or exactly. These techniques
become very important in terms of performance and the accuracy of searching results. In this paper, we propose a general approach
algorithm, called the Direct Matching Algorithm (DMA). The function of this algorithm is to perform direct access matching for the
exact pattern or its similarities within a text depending on the location of a character in alphabetical order. We simulated the DMA in
order to show its competence. The simulation result showed significant improvement in the exact string matching or similarity matching,
and therefore extreme competence in the real applications.

Mobile payment is defined as mobile money, which is considered as an attractive alternative for cash,
cheque, or credit. In this paper we propose a new secure mobile paymentmethod. This method is
summarized in three processes: firstly, the authentication process, which involves the authentication phases
for the applied customers. Secondly, the member recognition process which tests and ensures the customer
membership by the market server. Finally, payment processwhich will be done by ciphering the customer
information using public-key encryption cryptosystem (RSA), to be submitted over an insecure network to
the market server. Actually, this mobile payment methodis more efficient than otherpayment methods since
the customer can pay from his/her own mobilephone without any extra cost and effort. The RSA public-key
encryption system ensures the security of the proposed method. However, to prevent a brute force attack,
the choice of the key size becomes crucial.

Traffic congestions are recognized as a major problem in the modern urban cities. The Hashemite Kingdom
of Jordan is considered as one of the top countries worldwide that is suffering from the traffic jam problem
due to its old infrastructure. The current traffic light signals system in Jordan is still controlled by the fixed
timers. Therefore, this research develops an intelligent Traffic Light Management System Based on the
Hamiltonian Routing Technique (TLBH) and on the Decision Support System (DSS) in order to execute a
proper action. Hence, this research develops a system can that be used to minimize the waiting time on the
traffic signals for vehicles, which can in return lead to the reduction of the traffic congestion incurred by the
vehicles.
This research is comprehensive to many scenarios, where three of these scenarios are listed in this
research and are implemented by the system by using the MATLAB programming language; based on
specific rules. According to these sufficient testing scenarios, the simulation result shows significant
improvements in the TLBH technique in comparison with the current traffic system. The proposed
technique has the minimum total and waiting time in all scenarios compared to the current traffic system.
Keywords:Traffic light management system, routing protocols, Hamiltonian routing technique.

Abstract
The increasing speed of today’s computer networks directly affects the performance of Network Intrusion Detection Systems (NIDS) in terms of speed of detection of threads. Therefore, the performance of the existing algorithms needs to be improved to enhance the speed of detection engine used in NIDS applications. Hence, this paper defines a new platform NIDS to enhance the speed of detection engine based on Weighted Exact Matching Algorithm (WEMA). Furthermore, this platform can be run in sequential and in parallel mode, using the pthread techniques, in order to increase the total performance of NIDS applications.