Secure Routing Environment with Enhancing QoS in Mobile Ad-Hoc Networks

A mobile adhoc network is infrastructure-free and self configured network connected without wire. As it is infrastructure-free and no centralized control, such type of network are suitable only for conditional inter communication link. So initially maintaining Quality of Service and security aware routing is a difficult task. The main purpose of QoS aware routing is to find an optimal secure route from source to destination which will satisfy two or more QoS constrain. In this paper, we propose a net based multicasting routing scheme to discovery all possible secure path using Secure closest spot trust certification protocol (SCSTC) and the optimal link path is derived from Dolphin Echolocation algorithm (DEA). The numerical result and performance analysis clearly describe that our provided proposal routing protocol generates better packet delivery ratio, decreases packet delay reduces overhead in secured environment

Countering Node Misbehavior Attacks using Trust Based Secure Routing Protocol

Wireless sensor networks have gained remarkable appreciation over the last few years. Despite significant advantages and tremendous applications, WSN is vulnerable to variety of attacks. Due to resource constraint nature of WSN, applicability of traditional security solutions is debatable. Although cryptography, authentication and confidentiality measures help in preventing specific types of attacks but they cannot safeguard against node misbehavior attacks and come at significant cost. To address this problem, we propose a Trust Based Secure Routing Protocol (TBSRP) which adopts on-demand routing principle and relies on distributed trust model for the detection and isolation of misbehaving nodes. The TBSRP aims to establish shortest path that contain all trusted nodes, identify packet forwarding misbehavior caused by malicious and faulty nodes and reroute the traffic to other reliable paths. The performance of TBSRP is evaluated in terms of packet delivery ratio, average end-to-end delay, normalized routing load and average throughput. Simulations results show that TBSRP can achieve both high delivery ratio and throughput in presence of various numbers of misbehaving and faulty nodes

Strategic Profiling and Analytic Modelling of Node Misbehaviour in Adhoc Networks via Game Theory

Ubiquitous Computing and Internet of Things (IOT) are extremely popular in recent age and therefore imparting high level security mechanism is highly indispensable for such advanced technical systems. However, the security problems in Mobile Adhoc Networks (MANETs) are a constant topic of interest and have been drawing attention of research community from the past decade, where massive study has already been witnessed for addressing the security affairs. One of the precarious problems encountered in MANET is that of identifying the malicious nodes. This is because nodes in MANET are equally influential to take accountability during transmission. Coordination among nodes during communication and working without control of any central manager truly ensembles them to be applied in IoT. However, the identification and later mitigation of malicious nodes becomes an immensely difficult task especially when Selfish/Erroneous nodes exist along with normal Collaborative nodes in the Regular camp. The presence of selfish nodes is potentially harmful as similar behaviour can be imitated by malicious nodes which are the point of concern of many security aspects. While reviewing some techniques on the security system in MANET, it was found that game theory had a prime contribution in the past few years due to potential accuracy in its probabilistic approach and computational efficiency. Therefore, this study accentuates the use of game theory and probability theory considering selfish nodes in the regular node camp while modelling the Regular versus Malicious node game and thereby enhancing the prior mathematical schema of strategical decision making to accommodate for the same. The proposed study performs statistical analysis and presents a mathematical model to mimic the multi-stage game between regular and malicious node using Game Theory. Furthermore, it does not use any complex cryptographic protocols that tend to increase network overhead. The framework tries to effectively represent the various unpredictable actions of node cooperation, node declination, node attacks as well as node reporting that can model the strategic profiling of various mobile nodes. Understanding the patterns and then deploying the algorithms in security products can reduce intrusion to a greater exten

STRATEGIC PROFILING & ANALYTIC MODELLING OF NODE MISBEHAVIOR IN MANET BASED IOT PARADIGM THEORY

Ubiquitous Computing and Internet of Things (IoT) are extremely popular in recent age and therefore imparting high level security mechanism is highly indispensable for such advanced technical systems. Game Theory acts as a suitable tool offering promising solutions to securityrelated concerns in Mobile Ad-Hoc Networks (i.e., MANETs). In MANETs, security forms a prominent concern as it includes nodes which are usually portable and require significant coordination between them. Further, the absence of physical organisation makes such networks susceptible to security breaches, hindering secure routing and execution among nodes. Coordination among nodes during communication and working without control of any central manager truly ensembles them to be applied in IoT. However, the identification and later mitigation of malicious nodes becomes an immensely difficult task especially when Selfish/Erroneous nodes exist along with normal Collaborative nodes in the Regular camp. Game Theory approach has been manipulated in the current study to achieve an analytical view while addressing the security concerns in MANETs. This study considers selfish nodes in the regular node camp while modelling the Regular versus Malicious node game and thereby enhancing the prior mathematical schema of strategical decision making to accommodate for the same. The proposed study performs statistical analysis and presents a mathematical model to mimic the multi-stage game between regular and malicious node using Game Theory. The simulation of the model has proved that the Perfect Bayesian Equilibrium outshines other approaches used in this study, specifically pure strategy and mixed strategy. The utility of both regular and malicious node has improved noticeably when nodes adopt PBE strategy. The framework tries to effectively represent the various unpredictable actions of node cooperation, node declination, node attacks as well as node reporting that can model the strategic profiling of various mobile nodes. Understanding the patterns and then deploying the algorithms in security products can reduce intrusion to a greater extent

SECURITY, PRIVACY AND APPLICATIONS IN VEHICULAR AD HOC NETWORKS

With wireless vehicular communications, Vehicular Ad Hoc Networks (VANETs) enable numerous applications to enhance traffic safety, traffic efficiency, and driving experience. However, VANETs also impose severe security and privacy challenges which need to be thoroughly investigated. In this dissertation, we enhance the security, privacy, and applications of VANETs, by 1) designing application-driven security and privacy solutions for VANETs, and 2) designing appealing VANET applications with proper security and privacy assurance. First, the security and privacy challenges of VANETs with most application significance are identified and thoroughly investigated. With both theoretical novelty and realistic considerations, these security and privacy schemes are especially appealing to VANETs. Specifically, multi-hop communications in VANETs suffer from packet dropping, packet tampering, and communication failures which have not been satisfyingly tackled in literature. Thus, a lightweight reliable and faithful data packet relaying framework (LEAPER) is proposed to ensure reliable and trustworthy multi-hop communications by enhancing the cooperation of neighboring nodes. Message verification, including both content and signature verification, generally is computation-extensive and incurs severe scalability issues to each node. The resource-aware message verification (RAMV) scheme is proposed to ensure resource-aware, secure, and application-friendly message verification in VANETs. On the other hand, to make VANETs acceptable to the privacy-sensitive users, the identity and location privacy of each node should be properly protected. To this end, a joint privacy and reputation assurance (JPRA) scheme is proposed to synergistically support privacy protection and reputation management by reconciling their inherent conflicting requirements. Besides, the privacy implications of short-time certificates are thoroughly investigated in a short-time certificates-based privacy protection (STCP2) scheme, to make privacy protection in VANETs feasible with short-time certificates. Secondly, three novel solutions, namely VANET-based ambient ad dissemination (VAAD), general-purpose automatic survey (GPAS), and VehicleView, are proposed to support the appealing value-added applications based on VANETs. These solutions all follow practical application models, and an incentive-centered architecture is proposed for each solution to balance the conflicting requirements of the involved entities. Besides, the critical security and privacy challenges of these applications are investigated and addressed with novel solutions. Thus, with proper security and privacy assurance, these solutions show great application significance and economic potentials to VANETs. Thus, by enhancing the security, privacy, and applications of VANETs, this dissertation fills the gap between the existing theoretic research and the realistic implementation of VANETs, facilitating the realistic deployment of VANETs