Advance Authentication Scheme for Wireless Ad Hoc Network

(1)

ISSN: 2277-3754 ISO 9001:2008 Certified

International Journal of Engineering and Innovative Technology (IJEIT) Volume 4, Issue 9, March 2015

165

Advance Authentication Scheme for Wireless Ad Hoc Network

Shweta sarva, Anurag Maloo M.Tech Student, Assistant professor

Sangam University, bhilwara Abstract: A mobile ad-hoc network (MANET) is a group of

wireless mobile nodes serve organized to create a momentary relationship among them. Neither pre-defined network infrastructure nor central network administration subsist to assist in announcement in MANETs. Nodes converse with every another via direct common wireless radio links. Every mobile node has a limited transmission range. though, we prominence that such a conclude is not only inadequate for trust computation, except for is as well vulnerable to deception, a node might maliciously modify the packet contents throughout forwarding and still obtain a positive rating by the trust model. We have obtainable an indication of systems that attempt to detect and correct a node's selfish or malicious misbehavior. Regrettably, the misbehavior problem has not yet been addressed adequately and the incentives based solution for selfish nodes requires trusted hardware.

Trust has been calculated as a measure of the forwarding mechanism by network nodes. However, we emphasis that such a measure is not only inadequate for trust computation, but is also vulnerable to deception. For example, a node may maliciously modify the packet contents during forwarding and still get a positive rating by the trust model.

Keywords: MANET, QoS, Wireless Ad Hoc Network, Feedback-Based Trust Selection.

I. INTRODUCTION

Wireless ad hoc networks are acquisition reputation in current years due to their mobility, flexibility and effortlessness of deployment. A mobile ad hoc wireless network is a network devoid of any central authority.

Central server. Devoid of a central administration, network packets are forward from one machine to an additional by the nodes within the network. Mobile ad hoc networks (MANETs) consist of a compilation of wireless mobile nodes which dynamically exchange data among themselves lacking the reliance on a fixed base station or a wired backbone network. MANETs have potential use in a wide variety of disparate situations.

Such situations include moving battlefield communications to disposable sensors which are dropped from high altitudes and dispersed on the ground for hazardous materials detection. Civilian applications include simple scenarios such as people at a conference in a hotel where their laptops comprise a temporary MANET to more complicated scenarios such as highly mobile vehicles on the highway which form an ad hoc Mobile Ad Hoc Networks are wireless networks characterized by mobile nodes where nodes cooperate to form a network independent of any fixed infrastructure or centralized administration. No base station exists and thus

every node acts as a router. Nodes communicate over multi-hop wireless links and the network topology changes continuously due to frequent node mobility. Due to lack of centralized infrastructure, ad hoc networks happen to easy to set up and discover their request in Areas where a network needs to be hurriedly recognized, such as battleground infrastructure, vehicular communications, disaster recovery operations, on-the-fly conferencing etc. MANETs comprise of nodes supplied with a limited amount of battery energy. Thus designing routing protocols that conserve energy has been an active area of research. Energy aware routing reduces the overall energy consumption and thus increases the lifetime of the network. Traditional routing protocols aim to provide communication by finding minimum hop paths. They lack the ability to differentiate between paths and thus have a negative impact on network lifetime and other factors. Also with the rise in popularity of MANETs, it has become essential for MANETs to support real time and multimedia applications. These applications have strict quality of service requirements in terms of bandwidth, delay, reliability etc. Designing QoS aware routing protocols for MANETs remains a very complex process due to several characteristics of MANETs such as frequent node mobility, imprecise state information, limited availability of resources, lack of central coordination in this paper, Authors have projected anomaly transfer detection replica based on network traffic. By extracting more network features, fuzzy logic approach is introduced and Bayesian classifier for classifying the anomaly network traffic. Naïve Bayesian based classification doesn’t give accurate and efficient results than fuzzy based classification method. Moreover Naïve Bayesian classifier uses probability method for classification. In future work, More network features has been extracted for anomaly based model can be analyzed still more effectively. Proposed approach is compared with existing approaches and proved to be better classification algorithm. end-to-end services. The presence of mobility implies that links make and break often and in an undetermined fashion. This dynamic nature makes routing and consequently support in these networks fundamentally different from fixed networks.

Further, since the quality of the network in terms of available resources reside in the wireless medium and in the mobile nodes: e.g. cushion and succession state vary with time. It has to be mentioned that a QoS Model does not define specific protocols or implementations. Instead,

(2)

ISSN: 2277-3754 ISO 9001:2008 Certified

166 it defines the methodology and architecture by which certain type of services can be provided in the network.

Integrated services and Differentiated services are the two basic architectures proposed [3]. Integrated Services architecture allows sources to communicate their requirements to routers and destinations on the data path by means of a signaling protocol such as our proposed protocol.

For examples, MANET can be used to provide emergency services when the network is impaired due to the damaging of existing infrastructure. Computer scientists have predicted a world of ubiquitous computing in which computers will be every approximately us, continually the theater mundane tasks to make our lives a little easier. These ubiquitous computers connect in mobile ad hoc mode and change the environment or react to the change of the environment where they are suitable.

MANET is also establish functional in the so-called

sensor dust network to coordinate the activities and reports of a large collection of tiny sensor devices which could offer detailed information about terrain or environmental dangerous conditions. These two modes concern whether or not nodes in an ad hoc network should keep track of routes to all possible destination, or as an substitute remain track of merely those destinations of immediate interest. Proactive protocols store route information even before it is needed. This kind of protocols has advantage that communications with arbitrary destination experience minimal delay. However it also suffers from the disadvantage that additional control traffic is needed to continually update stale route information. This could significantly increase routing overhead especially for the MANET where the links are often broken. Reactive protocols, on the contrary, acquire routing information only when it is actually needed.

II. COMPARATIVE WORK

Topics Algorithm Technology Year

Trust-aware Opportunistic Routing Protocol for Wireless Networks

novel opportunistic routing protocol is proposed which selects next hop forwarder nodes

Simulation results represent that the proposed method performs well in a hostile environment where malicious nodes prevent from forwarding received packets

Mahmood in at [2014]

Source based trusted AODV routing protocol for mobile ad hoc networks

Approach based upon trust to provide security to Ad hoc On-demand Distance Vector (AODV) protocol, which helps AODV to detect the compromised nodes.

evaluation of trusted AODV with Black hole attack has been done with the help of QualNet 5.0 simulator.

A.Pravin Renold in at al[2012]

trust based security in MANET routing protocols: a survey

Detect and correct a node's selfish or malicious

misbehavior CORE

(Collaborative Reputation).

Provides a survey of the work done in this field.

Poonam in at al[2010]

A Trust Evaluation Framework for Sensor Readings in

Body Area Sensor Networks.

Galvanic Skin Response

(GSR) and

Electrocardiography (ECG) sensed data.

Demonstrate the trust evaluation according to two quality properties (sampling reliability and data integrity) of sensor readings for the examples of GSR and ECG data. These data are collected from the sensors by using the VITRUVIUS body sensor platform

Vinh Bui in at al[2013]

Analytical Models for Trust Based Routing Protocols in Wireless Ad Hoc Networks

propose and design a new protocol - Trust based Routing using Dominating Set Approach (TRDSA)

Modified version of DSR protocol is used for discovering multiple partial disjoint paths

Deepika Kukreja in at al[2012]

(3)

ISSN: 2277-3754 ISO 9001:2008 Certified

167 Practical Defenses

Against Pollution Attacks in Wireless

Network Coding

propose a light weight scheme, DART, EDART

Simulation setup.

Experiments were performed with the Glomosim simulator8 configured with 802.11 as the MAC layer protocol.

JING DONG in at al[2011]

III.PROPOSED METHODOLOGY We are proposing an intelligent system that is capable of the selection of the routing protocol to address a novel approach that can cope with the network performance’s degradation problem. The proposed system smartly selects the best routing protocol using an intelligence feedback mechanism according to the networking perspective. Dynamic feedback method is helpful into analyze the node’s behavior in MANET. Routes are selected on the basis of trust relationship between the mobile nodes in the MANET. The parameters selected to describe the networking perspective are the network size and standard mobility. The planned system functions by dependable routing mechanism with the time to keep the network performance at the most excellent level. The parameter chosen to explain the network context was the network size and standard mobility. The planned system then function by unreliable the routing mechanism with the time to keep the network performance at the most excellent level. The chosen protocol has been exposed to produce a combination of higher throughput; lower delay, fewer retransmissions attempts, less data drop, and inferior load. Therefore it is obliging to give optimized dynamic services in MANET. Our system is able to the selection of the routing protocol based on intelligent feedback mechanism that will improve the performance of network. Our research work is focuses on feedback mechanism which is best in its class due to it avoids the path assortment randomly. It preserves the most excellent routing path on the basis of trust based relationship among the nodes. Dynamic feedback method is useful into evaluate the node’s behavior. The parameters selected to describe the networking perspective are the network size and standard mobility. The recommend system functions by reliable routing method with the time to keep the network performance at the best level. Future work includes the enhancement of feedback mechanism to support energy efficient and time efficient mechanism to provide better and secure network.

Process of Feedback-Based Trust Selection

Disjoint routes offer certain advantages over non- disjoint routes. For example, non-disjoint routes may have lower aggregate resources than disjoint routes, due to non-disjoint routes share links or nodes. In principle, node disjoint routes offer the most aggregate resources, due to neither links nor nodes are shared between the paths. Disjoint routes are also provides higher fault- tolerance. In non-disjoint routes, a single node/link failure can causes multiple routes to fail. However, with link disjoint routes, a node failure can cause multiple routes

that share that node to fail. The main advantage of non- disjoint routes is that they can be more easily discovered.

This is due to there may be sparse areas between the two nodes that act as bottlenecks. Given the trade-offs between using node disjoint versus non-disjoint routes, link disjoint routes offer a good compromise between the two. In the following subsection, we review some of the proposed multipath protocols for finding node disjoint, link disjoint, and non-disjoint paths. Intelligent path selection can be used to enhance the performance of multipath routing. Path selection also plays an important role for QoS routing. In QoS routing, only a subset of paths that together satisfies the QoS requirement is selected. After a source begins sending data along multiple routes, some or all of the routes may break due to node mobility and/or link and node failures. As in unipath routing, route maintenance must be performed in the presence of route failures. Unipath routing, route discovery can be triggered upon failure of the route. And multipath routing, route discovery can be triggered each time one of the routes fails or only after all the routes fail.

Waiting for all the routes to fail before performing a route discovery would result in a delay before new routes are available. This may degrade the QoS of the services.

DSR, intermediate nodes do not keep a route cache, and therefore, do not reply to RREQs. This is to allow the destination to receive all the routes so that it can select the maximally disjoint paths. Maximally disjoint paths have as few links or nodes in common as possible.

Duplicate RREQs are not necessarily discarded. Instead, intermediate nodes forward RREQs that are received through a different incoming link, and whose hop count is not larger than the previously received RREQs. The proposed route selection algorithm only selects two routes.

An RREP for the first RREQ it receives, which represents the shortest delay path. The destination then waits to receive more RREQs. From the received RREQs, the path that is maximally disjoint from the shortest delay path is selected. If more than one maximally disjoint path exists, the shortest hop path is selected. If more than one shortest hop path exists, the path whose RREQ was received first is selected. The destination then sends an RREP for the selected RREQ.

Reaction route assortment using SVM classifier

Our proposed system select the optimum route to provide an approach that enhance network performance.

Our system uses an intelligent protocol that uses an SVM based intelligence feedback mechanism that uses a

(4)

ISSN: 2277-3754 ISO 9001:2008 Certified

168 intelligent feedback method. This system is trying to analyze the node’s behavior in Mobile Ad-Hoc Networks.

While a node produce a path to convey the data to objective nodes and it is establish a sudden broken path then it selects alternative path and forward the data. SVM is used as the classifier to classify the nodes trust while forwarding the packet from one location to another location. As we know SVM can tackle the classification challenge successfully. A classification approach includes training and testing of data sets. These data sets are fetched from the various network parameters such as packet forwarding and dropping ratios. Each example in the training set includes one target value and several attributes.

 Support Vector data analysis

 Feedback data Collection

 Nodes Trust Formation

 Data for training and testing

 Observation

 Node trust Selection

SVM model is designed to predict the target values of the data examples in the testing set. The testing set is generally provided by the network traffic that is below inspection. Our mechanism goes after the routes pattern plan in which routes are selected on the basis of trust relationship among the mobile nodes in the Mobile Ad- Hoc Networks. The parameters chosen to explain the networking viewpoint are the network size and average mobility. Our proposed system functions enhance performance by using reliable routing instrument. The parameters that are new to explain network staging are size, packet loss, average delay, link failure and average mobility.

IV. SYSTEM MODEL

In our research work, we have developed an intelligent system that is capable of the selection of the routing protocol to address a novel approach that can cope with the network performance’s degradation challenge. For the proposed system, we have developed an intelligent protocol that uses an intelligence feedback mechanism according to the networking perspective. Our networking protocol uses a dynamic feedback method. This mechanism will helpful in analyzing the node’s behavior in Mobile Ad-Hoc Networks. As we know that Mobile Ad-Hoc Networks is formed through the collection of mobile nodes that are moving here and there. This mobility is main challenge in developing and improvement in ad-hoc networking. Sometimes when a node selects a path to transfer the data to destination nodes and it is being experienced that unexpected busted path. It leads to reducing of data and we knowledgeable a degraded Mobile Ad-Hoc Networks performance. To overcome this situation, a mechanism is required to avoid such condition or if it occurs then there should be some facility for providing alternate route. Some research

suggests that when a link is broken then the node should buffer the data and wait for a alternative route formation to the destination node. A better approach is available that formed the link on the basis of trust among the nodes.

Our research works follow the routes formation strategy in which routes are selected on the basis of trust relationship between the mobile nodes in the MANETs.

The parameters can be selected and they describe the networking perspective are the network size and average mobility. Our proposed system functions by reliable routing mechanism with the time to keep the network performance at the best level. The selected protocol can be shown and to produce a combination of, lower delay, and fewer retransmissions higher throughput, attempts, less data drop, and subordinate load. Therefore it is cooperative to provide optimized dynamic services in Mobile Ad-Hoc Networks.

Intermediate nodes may drop the packets due to malicious attacks such as black hole, gray hole etc or poor wireless network quality and heavy congestion in the network. Trust evaluation in routing procedure has become a remark of a sender after it gets a forwarding service of one more node. The manage messages play a position in formative the path from source to destination in-order to transfer data among them. In AODV, if the control packet RREQ which has been processed by a node with same sequence number already appears then the particular RREQ will be discarded considering it as a duplicate control packet as part of our trust value calculation we have chosen the concept of redundant control messages. The trust score of the neighbor node will be calculated by evaluating the duplicate control packets received from that node.

Nodes Trust

Initially all the nodes in the network will be assigned with a trust value (Tr). supplementary the trust value of a node will in large if it is a compassionate node (Tr+1) and the trust value of a node will decrease if it is a malevolent node (Tr-1). The working principle of the proposed methodology is as follows, consider two nodes i and j. If node i wants to transmit a packet to the destination node n, then the node i, sends a route request to the neighbouring node j, node j after receiving the control packet from node i and check the target id, if the target id does not match with the control packet sent by node i, node j broadcasts the route request to its neighbouring nodes. The above action will occur only if node j is a benevolent one.

(5)

ISSN: 2277-3754 ISO 9001:2008 Certified

169 Therefore when node j, broadcasts the route request to its neighbouring node then node i will also receive the route request, which will be considered as a duplicate control packet. The node I will increase the trust value for node j. Suppose when node i did not receive the route request from the node j, then node i will decrease the trust value of node j and marks node j as a malicious node.

This evaluation of duplicate control packets is based upon the time to live (TTL) value.

Route Establishment

In the AODV routing protocol, the route will be established for the data transfer by considering the RREP which reaches the source first based upon two parameters: sequence number and the hop count. i.e., the route selected will have high sequence number and less hop count. But in our proposed system the route will be established based upon the sequence number, trust value and the hop count. Like considering the route with high sequence number, the proposed methodology will also consider the route with high trust value. Therefore this clearly shows that the trust value plays a major role in the RREP selection process. The trust value field of the routing table entry is updated at regular interval.

V. CONCLUSION

Trust has been intended as a compute of the forwarding method by network nodes. though, we importance that such a compute is not only insufficient for trust computation, but is as well vulnerable to dishonesty. For example, a node might maliciously adapt the packet inside throughout forwarding and still get a positive score by the trust model. Every the techniques use straight as well as not direct trust information to analyze trust for a

node. This augment the network routing transparency due to extreme control packets being use for advertising trust, scheming observed trust and concern certificate in trust estimate. Finally there is no stipulation for dealing with conspire malicious nodes in the network which considerably mortify the network presentation by generate black holes. So we believe that the intend of narrative trust method that takes into account every of the more than features would be an added judicious technique.

ACKNOWLEDGMENT

This work is support by teacher sangam university department of computer science.

REFERENCES

[1] Mahmood Salehi, Azzedine Boukerche,” Trust-aware Opportunistic Routing Protocol for Wireless Networks”

Q2SWinet’14, September 21–26, 2014, Montreal, QC, Canada. 2014 ACM 978-1-4503-3027-5/14/09.

[2] A.Pravin Renold, R.Parthasarathy,” source based trusted aodv routing protocol for mobile ad hoc networks”

icacci’12, august 3-5, 2012, Chennai, nadu, India.

[3] Poonam, K. Garg, M. Misra,” trust based security in manet routing protocols: a survey” A2WiC ’10, September 16–

17, 2010, India.

[4] Vinh Bui, Richard Verhoeven, Johan Lukkien, Rafal Kocielnik,” A Trust Evaluation Framework for Sensor Readings in Body Area Sensor Networks” bodynets2013 ,September 20-October 02 ,Boston , united states.

[5] Khabbazian, M., Bhargava, V. “Efficient Broadcasting in Mobile Ad Hoc Networks,” IEEE Trans. on Mobile Comp., Vol.8, No.2, Feb. 2009.

[6] Marwaha, S. et al.: Challenges and Recent Advances in QoS Provisioning, Signaling, Routing and MAC protocols for MANETs. In: Proc. of Telecommunication Networks and Applications Conference, 2008, pp. 97-102.

[7] M., Rao, D.: Design of an Efficient QoS Architecture (DEQA) for Mobile Ad hoc Networks. ICGST-CNIR Journal, vol. 8, 2009.

[8] Zhang, N., Anpalagan, A.: A Comprehensive Simulation Study of SWAN QoS Model in MANETs with Proactive and Reactive Routing. In: Proc. of Canadian Conference on Electrical and Computer Engineering, 2009.

[9] Lagesse B, Kumar M, Paluska JM, Wright M (2009) DTT:

a distributed trust toolkit for pervasive systems. In: IEEE conferences, 2009.

[10] Ahamed SI, Sharmin M, Ahmed S (2008) A risk-aware trust based secure resource discovery (RTSRD) model for pervasive computing. In: Sixth annual IEEE international conference on pervasive computing and communications.

IEEE, 2008.

[11] B. Tang, H. Gupta, S.R. Das, Benefit-Based Data Caching in Ad Hoc Networks, IEEE Transactions on Mobile Computing, vol. 7, 3:289-304, 2008.

[12] G. Chiu, C. Young, Exploiting In-Zone Broadcast for Cache Sharing in Mobile Ad Hoc Networks, IEEE

(6)

ISSN: 2277-3754 ISO 9001:2008 Certified

170 Transactions on Mobile Computing, vol. 8, 3:384-397, 2009.