Asymmetric Prevention Based Techniques In Ad-Hoc Networkss

A mobile ad hoc network is a infrastructure - less and autonomous network where so co operation among nodes is important since in such networks nodes depend on each other for forwarding packets. However, cooperation in such operations consumes nodes en ergy and resources. Therefore, it is necessary to design incentive mechanisms to enforce nodes to forward packets when the source and destination of the packet are other nodes in the network. Routing is a key issue in wireless networks and it has been the topic o f extensive research in the last few years. Prevention Techniques provides solutions that are designed such that malicious nodes are originated from actively init iating attacks. The prevention mechanisms need encryption techniques to give authentication, integrity, confidentiality and non repudiation of routing information. Among all of the recent preventive approaches, few proposals utilize symmetric algorithms, few utilize asymmetric algorithms, however the others utilizes one - way hashing, each particular having distinguish trade - offs and goals

PERFORMANCE AND EFFECTIVENESS OF SECURE ROUTING PROTOCOLS IN MANET

Mobile adhoc network (MANET) is a temporary network setup for a specific purpose without help of any preexisting infrastructure. The nodes in MANET are empowered to exchange packet using a radio channel. The nodes not in direct reach of each other uses their intermediate nodes to forward packets. (MANET) environment of MANET makes it vulnerable to various network attacks. A common type of attacks targets at the underlying routing protocols. Malicious nodes have opportunities to modify or discard routing information or advertise fake routes to attract user data to go through themselves. Some new routing protocols have been proposed to address the issue of securing routing information. However, a secure routing protocol cannot single-handedly guarantee the secure operation of the network in every situation. The objectives of the paper is to study the performance and effectiveness of some secure routing protocols in these simulated malicious scenarios, including ARIADNE and the Secure Ad hoc On-demand Distance Vector routing protocol (SAODV)

Analysis of Secure Routing Scheme for MANET

Mobile ad hoc networks pose various kinds of security problems, caused by their nature of collaborative and open systems and by limited availability of resources. In our work we look at AODV in detail, study and analyses various attacks that can be possible on it. Then we look into some existing mechanism for securing AODV protocol. Our proposed work is an extension to Adaptive-SAODV of the secure AODV protocol extension, which includes tuning strategies aimed at improving its performance. In A-SAODV an intermediate node makes an adaptive reply decision for an incoming request that helps to balance its load that is over-burdened by signing and verification task of incoming messages. Namely, we propose a modification to adaptive mechanism that tunes SAODV behavior. In our paper we have proposed an extension to Adaptive-SAODV of the secure AODV protocol extension, which includes further filtering strategies aimed at further improving its network performance. We have analyzed the how our proposed algorithm can help in further improvement of performance in adaptive SAODV and also compared its performance with existing mechanisms using simulation

Including context in a routing algorithm for the internet of things

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia InformáticaThe “Internet of Things” assumes that a large number of devices which are used on a daily basis will eventually become connected to the Internet. This scenario will provide room for a large set of new applications, however the network connections of an enormous set of nodes, which can be connected and disconnected, can move around and which have limitations with regards to their processing and communication capabilities, raises the need for the development of new message routing algorithms, different from those being in use today. In this thesis, a contribution is made towards the development of this type of algorithms. In particular, the idea which is tested is whether routing algorithms can improve their performance at various levels, such as, message delivery time, number of messages lost, power consumption, etc., if in the routing decisions these algorithms can make use of the concept of “Context”. Within the framework of this thesis, the “Context” is the organized collection of information which the routing algorithm collects from the environment surrounding the network nodes, and which allows it to make better routing decisions. This information can be related to low-level issues, such as, node location, power required to send a message, etc., as well as, with constraints related to the application, such as, message priority, maximum delivery time, etc. In order to evaluate this approach, this thesis proposes a routing algorithm called C-AODV. As the name suggests, it is based on the ADOV algorithm, however it is modified in several aspects; in particular, the possibility of using information collected from the context can be utilized to improve message routing. In order to test the proposed solution, several tests were performed on the NS-3 simulator which allowed the evaluation of the algorithm functionalities. The tests performed indicate that the proposed solution is valid

Securing Weight-Based AODV (WBAODV) Routing Protocol in MANETs: Towards Efficient and Secure Routing Protocol

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. There are number of routing protocols developed by researchers. Due to the nature of ad hoc networks, secure routing is an important area of research in developing secured routing protocols. Although researchers have proposed several secure routing protocols, their resistance towards various types of security attacks and efficiency are primary points of concern in implementing these protocols. After the evaluation of these protocols the results refer that they do not give complete protection against possible attacks and have some disadvantages on their performance. In this research, we examined a new routing protocol called Weight-Based Ad hoc On-demand Distance Vector (WBAODV) routing protocol which is efficient and superior of the standard Ad hoc On-demand Distance Vector (AODV) routing protocol in performance, but is not secure. So we proposed a new secure routing protocol based on WBAODV which will be efficient and also immune against the most commonly possible routing attacks. Finally we analyzed the proposed protocol against many attacks to ensure its security and also subject it to extensive simulation tests using JiST/SWAN simulation tool with the most commonly well-known ad hoc performance metrics to ensure its efficiency