Address resolution protocol (ARP) is a very popular communication protocol in the local area network (LAN), working under the network layer, as per the open systems interconnection (OSI) model. It is used to associate Internet protocol (IP) address to medium access control (MAC) address; hence, the IP‐MAC addresses are stored in ARP cache of any network host. ARP has weakness in authentication that an attacker can exploit to gain unauthorized access to one's sensitive data. There are some approaches that can be used against ARP spoofing attacks. These provide an efficient and secure way to mitigate ARP attacks and detect ARP poisoning that can reduce the attack. This paper will discuss: various effective approaches, security issues in ARP spoofing, and poisoning attacks.

No abstract

Mobile Ad-hoc Network (MANET) is a kind of wireless network that has the most challenging network infrastructure. It is formed using the mobile nodes without any centralized administration from the security perspective and is a self-configuring fastest emerging wireless technology, each node on the MANET will act like a router which forwards the packets. Dynamic nature of this network makes routing protocols to play a prominent role in setting up efficient route among a pair of nodes. Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (ADOV) is a reactive MANET routing protocols. Most of the attacks on MANETs are routing protocol attacks. Attacks on routing protocols, especially internal attacks will cause the damage to MANETs. Sinkhole and black hole attacks are a type of internal attack which is affected by attempting to draw all network traffic to malicious nodes that fake routing update and degrade the performance of the network. The black hole nodes should be detected from the network as early as possible via detection mechanism and should also guarantee the higher detection rate and less cross-over error rate. In this paper, we studied the characteristics of black hole attack and how it will affect the performance of the distance vector routing on demand routing protocol such as (ADOV) protocol, which recognizes the presence of black hole node from packet flow information between nodes and isolates it from the network via applying AODV protocol that one of popular routing protocol. We have evaluated the performance of the system using widely used simulator NS2, results prove the effectiveness of our prevention and detection method.

Abstract-Search algorithm, is an efficient algorithm, which performs an important task that locates specific data among a collection of data. Often, the difference among search algorithms is the speed, and the key is to use the appropriate algorithm for the data set. Binary search is the best and fastest search algorithm that works on the principle of 'divide and conquer'. However, it needs the data collection to be in sorted form, to work properly. In this paper, we study the efficiency of binary search, in terms of execution time and speed up, by evaluating the performance improvement of the combined search algorithms, which are sorted into three different strategies: sequential, multithread, and parallel using message passing interface. The experimental code is written in 'C language' and applied on an IMAN1 supercomputer system. The experimental results show that the decision variables are generated from the IMAN1 supercomputer system, which is the most efficient. It varied for the three different strategies, which applies binary search algorithm on merge sort. The improvement in performance evaluation gained by using parallel code, greatly depends on the size of data set used, and the number of processors that the speed-up of the parallel codes on 2,4,8,16, 32, 64, 128, and 143 processors is best executed, using between a 50,000 and 500,000 dataset size, respectively. Moreover, on a large number of processors, parallel code achieves the best speed-up to a maximum of 2.72.

No abstract