M Tech Dissertations
Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3
Browse
3 results
Search Results
Item Open Access Secure data delivery in mobile ad hoc network using multiple paths(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Maheshwari, Mayur; Das, Manik LalA mobile ad hoc network (MANET) is a self configurable, self organized, infrastructure less multi hop mobile wireless network.Characteristics of ad hoc network make security a critical issue i.e. any node can join the network without revealing its presence as well as any node can behave in either a passive way (eavesdropping the message) or in an active way (manipulating the message, signal interference or jamming the network). When a node has some confidential information needed to transmit to other node, it needs some secure data delivery protocols such that, information can reach to intended node confidentially without tempered. We have studied two secure data delivery protocols namely SPREAD and Xia et al‟s scheme. These protocols focus on how to deliver a secret message over insecure MANET using multiple paths. These protocols provide confidentiality and robustness but don‟t focus on authentication and integrity. Due to the lack of authentication, any node can impersonate the good node or the intermediate node can manipulate message and no one can detect this misbehaviour. We have proposed a scheme that aims to provide confidentiality, authentication, and robustness for a message when they are delivered across the insecure MANET. We have used the concept of SPREAD, where message transforms into multiple shares and then delivers the shares via multiple independent paths to the destination, so that if a small number of nodes that are used to relay the message shares are compromised, the whole message is not compromised. We are using basic idea of TESLA to provide authentication. Finally, when we analyzed our proposed protocol and compared it with SPREAD. Our analysis showed that the proposed scheme provides all basic security objectives as well as it protects against data tempering, impersonation, replay and known session key attacks.Item Open Access Packet forwarding strategies for cooperation enforcement in mobile wireless ad hoc networks(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Patel, Nidhi; Muthu, RahulIn self-organized ad hoc networks, all networking functions rely on the contri- bution of the relay nodes. Nodes have to forward packets for each other in order to enable multi-hop communication. In recent years, researchers have identi ed the problem of stimulating cooperation in ad hoc networks and proposed several solutions to give nodes incentive to contribute to common network services. These solutions are based on incentive mechanisms like reputation based system or virtual currency based system. This paper aims at determining conditions under which, such cooperation without incentives can exist, while taking the network topology into account. We have focused on the most basic networking mechanism, namely, packet forwarding and proposed a game theoretic approach for achieving cooperation. We have de ned a game model where nodes act as players, their actions (forward or drop a packet) de ne strategies and they are given payo s based on the payo functions designed in terms of network parameters. We have considered di erent parameters for simulation like tramsmission range, di erent strategies, initial condition of nodes, energy cost for sending or forwarding packets, tra c rate, noise e ect, mobility, etc. Our simu- lation result shows how cooperation is achieved in network with nodes getting better payo s. Later we have extended our work to cover network with mobile nodes.Item Open Access Ant colony optimization in routing algorithms of mobile ad hoc networks(Dhirubhai Ambani Institute of Information and Communication Technology, 2010) Agarwal, Navneet; Srivastava, Sanjay; Sunitha, V.The study on performance of On-demand Ant Routing Algorithm for Mobile Ad Hoc Network is done. An ant routing algorithm based on swarm intelligence and especially on Ant Colony Optimization (ACO). It describes a noval on demand Ant colony algorithm for MANETs. This algorithm tries to minimize complexity at nodes and this is achived at exoences of optimality of routing path. Inextensive set of simulation experiment, We try to set parameter of ant routing algorithms and compare Proposed algorithm with DAR,a pre existing on demand ant routing algorithms and with AODV,a reference algorithm in MANETs. The comparition base on optimal path length with respect to control overhead.