A Secure AdHoc Wireless Clustering Scheme for Improving Security

wireless communication is easy to use, rapid implementable and low cost communication technique as compared to the traditional wired communication.Therefore a number of different applications are consumes the wireless communication technology. In wireless ad hoc technology the networks are supporting the mobility and ad hoc configuration of topology development. Therefore the on demand nature of routing is much helpful. Such kind of networks are suffers from the performance and security issues. Therefore the given paper addresses the key security issues and a solution is redesigned to incorporate the security solutions. This method utilizes the weighted clustering algorithm for demonstrating the security solution and the performance issues. In addition of that the implementation strategy and the obtained outcomes of the proposed secure weighted clustering algorithm is also provided. DOI: 10.17762/ijritcc2321-8169.15033

Reliability Analysis of Link Stability in Secured Routing Protocols for MANETs

The prime characteristics of Mobile Ad Hoc Network (MANET) are infrastructure free, absence of centralized authority and dynamic nature of nodes which are more vulnerable to security attacks. Reliability and security are prime issues to protect information and nodes in a network during communication which has received more research interest in designing a dynamic secured routing scheme. QoS is set of service requirement that needs to be satisfied by the network during the data transmission in the network. From the perception of QoS best effort protocols ensure optimum network operation in a unpredictable mobile environment. The multimedia applications are intolerable towards delay and reliability which are the features of mobile network, hence the potentials of MANET were not utilized in multimedia applications. These issues of delay and reliability of packet transmission in MANET are contributed by stability of the communication link even during the mobility of the nodes Its a necessity to analyze the performance of various secured routing protocols based on the stability of the communication link in case of mobility of nodes during data transfer. This paper is focused on a comparative study of various secured reactive routing protocols in MANET signifying the connectivity stability during the mobility of the nodes

Reputation-Based Internet Protocol Security: A Multilayer Security Framework for Mobil Ad Hoc Networks

This research effort examines the theory, application, and results for a Reputation-based Internet Protocol Security (RIPSec) framework that provides security for an ad-hoc network operating in a hostile environment. In RIPSec, protection from external threats is provided in the form of encrypted communication links and encryption-wrapped nodes while internal threats are mitigated by behavior grading that assigns reputations to nodes based on their demonstrated participation in the routing process. Network availability is provided by behavior grading and round-robin multipath routing. If a node behaves faithfully, it earns a positive reputation over time. If a node misbehaves (for any number of reasons, not necessarily intentional), it earns a negative reputation. Each member of the MANET has its own unique and subjective set of Reputation Indexes (RI) that enumerates the perceived reputation of the other MANET nodes. Nodes that desire to send data will eliminate relay nodes they perceive to have a negative reputation during the formulation of a route. A 50-node MANET is simulated with streaming multimedia and varying levels of misbehavior to determine the impact of the framework on network performance. Results of this research were very favorable. Analysis of the simulation data shows the number of routing errors sent in a MANET is reduced by an average of 52% when using RIPSec. The network load is also reduced, decreasing the overall traffic introduced into the MANET and permitting individual nodes to perform more work without overtaxing their limited resources. Finally, throughput is decreased due to larger packet sizes and longer round trips for packets to traverse the MANET, but is still sufficient to pass traffic with high bandwidth requirements (i.e., video and imagery) that is of interest in military networks

Manifestation and mitigation of node misbehaviour in adhoc networks

Mobile adhoc network is signified as a boon for advance and future wireless communication system. Owing to its self-establishing network features and decentralization, the system can actually establish a wireless communication with vast range of connectivity with the other nodes. However, the system of MANET is also beheld with various technical impediments owing to its inherent dynamic topologies. Although there are abundant volume of research work, but very few have been able to effectively address the node misbehavior problems in MANET. The paper initially tries to draw a line between different types of nodes in MANETs based on their behavior characteristics, then reviews some of the significant contribution of the prior researches for addressing node misbehavior issues. A major emphasis is laid on is the researches which use game theory as a tool to study and address the misbehavior problems. The manuscript is developed considering some of the latest and standard evidences of past 5 years and finally discusses the open issues related to the problems

A Unified Wormhole Attack Detection Framework for Mobile Ad hoc Networks

The Internet is experiencing an evolution towards a ubiquitous network paradigm, via the so-called internet-of-things (IoT), where small wireless computing devices like sensors and actuators are integrated into daily activities. Simultaneously, infrastructure-less systems such as mobile ad hoc networks (MANET) are gaining popularity since they provide the possibility for devices in wireless sensor networks or vehicular ad hoc networks to share measured and monitored information without having to be connected to a base station. While MANETs offer many advantages, including self-configurability and application in rural areas which lack network infrastructure, they also present major challenges especially in regard to routing security. In a highly dynamic MANET, where nodes arbitrarily join and leave the network, it is difficult to ensure that nodes are trustworthy for multi-hop routing. Wormhole attacks belong to most severe routing threats because they are able to disrupt a major part of the network traffic, while concomitantly being extremely difficult to detect. This thesis presents a new unified wormhole attack detection framework which is effective for all known wormhole types, alongside incurring low false positive rates, network loads and computational time, for a variety of diverse MANET scenarios. The framework makes three original technical contributions: i) a new accurate wormhole detection algorithm based on packet traversal time and hop count analysis (TTHCA) which identifies infected routes, ii) an enhanced, dynamic traversal time per hop analysis (TTpHA) detection model which is adaptable to node radio range fluctuations, and iii) a method for automatically detecting time measurement tampering in both TTHCA and TTpHA. The thesis findings indicate that this new wormhole detection framework provides significant performance improvements compared to other existing solutions by accurately, efficiently and robustly detecting all wormhole variants under a wide range of network conditions

Intelligent detection of black hole attacks for secure communication in autonomous and connected vehicles

Detection of Black Hole attacks is one of the most challenging and critical routing security issues in vehicular ad hoc networks (VANETs) and autonomous and connected vehicles (ACVs). Malicious vehicles or nodes may exist in the cyber-physical path on which the data and control packets have to be routed converting a secure and reliable route into a compromised one. However, instead of passing packets to a neighbouring node, malicious nodes bypass them and drop any data packets that could contain emergency alarms. We introduce an intelligent black hole attack detection scheme (IDBA) tailored to ACV. We consider four key parameters in the design of the scheme, namely, Hop Count, Destination Sequence Number, Packet Delivery Ratio (PDR), and End-to-End delay (E2E). We tested the performance of our IDBA against AODV with Black Hole (BAODV), Intrusion Detection System (IdsAODV), and EAODV algorithms. Extensive simulation results show that our IDBA outperforms existing approaches in terms of PDR, E2E, Routing Overhead, Packet Loss Rate, and Throughput

Secure Multicast Routing Protocol in Manets Using Efficient ECGDH Algorithm

An Ad-hoc Network covers a set of autonomous mobile nodes that communicates through wireless communication in an infrastructure-less environment. Mostly MANETs are used in group communication mechanisms like military applications, emergency search, rescue operations, vehicular ad-hoc communications and mining operations etc. In such type of networks, group communication is takes place by multicasting technique. Communication and collaboration is necessary among the nodes in the groups in multicast protocols. PUMA has the best multicast routing protocol compared to tree and mesh based multicast protocols although it suffers from security issues. PUMA mainly suffers from Man In The middle attack. MITM attack generates traffic flow, drop the packets and miscommunicate the neighbor nodes with false hop count. So defending from MITM attack we designed a new mechanism called Elliptic Curve Group Diffie-Hellman (ECGDH). This paper compares results of PUMA [1] routing protocol with legitimate, under attack and after providing security against attack. Finally we observed ECGDH [2] gives efficient results even attack has happened