Purvi Tandel

Bio: Purvi Tandel is an academic researcher from Uka Tarsadia University. The author has contributed to research in topics: Ad hoc On-Demand Distance Vector Routing & Routing protocol. The author has an hindex of 1, co-authored 3 publications receiving 4 citations.

Mitigating techniques of black hole attack in MANET: A review

Abstract: A Mobile Ad-hoc Network (MANET) is infrastructure-less network where nodes can move arbitrary in any place without the help of any fixed infrastructure. Due to the vague limit, no centralized administrator, dynamic topology and wireless connections it is powerless against various types of assaults. MANET has more threat contrast to any other conventional networks. AODV (Ad-hoc On-demand Distance Vector) is most utilized well-known routing protocol in MANET. AODV protocol is scared by "Black Hole" attack. A black hole attack is a serious assault that can be effortlessly employed towards AODV protocol. A black hole node that incorrectly replies for each path requests while not having active path to targeted destination and drops all the packets that received from other node. If these malicious nodes cooperate with every other as a set then the harm will be very extreme. In this paper, present review on various existing techniques for detection and mitigation of black hole attacks.

AODV modification to address link breakage issue: A review

Abstract: An ad hoc network is a network that is composed of individual devices communicating with each other directly. It does not rely on a base station to coordinate the flow of messages to each node in the network, the individual network nodes forward packets to and from each other. As nodes can unreservedly freely in the network, ad-hoc network has the characteristic of dynamic topology. Due to this, link breakage happens frequently. To address this issue, various modifications have been done in the mostly used routing protocol, AODV. This paper explores some of the modified AODV routing protocol.

Efficient Ballot Casting in Ranked Based Voting System Using Homomorphic Encryption

Abstract: Elections conducted on paper consumes many resources. Online voting system is very faster, cheaper and more suitable. Recent in online voting system improve the security guarantees for elections, because of confidentiality of voters and their integrity and validity. For security purpose, three election models are used for online voting: the mix-net model, the blind signature model, and the homomorphic encryption model. However only homomorphic encryption gives direct tallying without decrypting every votes. In this paper, we are focusing on ballot casting and tallying for ranked based voting system using Paillier homomorphic and Elgamal homomorphic encryption schemes and at the end we will compare results of both encryption schemes.

CPAODV: Classifying and Assigning 3 Level Preference to the Nodes in VANET Using AODV Based CBAODV Algorithm

Abstract: Vehicles communicate with nearby vehicles to share high routing and traffic information in Vehicular Ad hoc Networks (VANETs) environment. Congestion and Delay in the transmission may occur due to the density of the nodes in the network. Traffic condition depends on the vehicles in Rural and Urban environment. Increase or Decrease in vehicle’s speed makes significant network changes when compared to the MANET environment. Road Side Terminals (RSTs) plays a major role in bridging the connection between the sender and the receiver nodes. The traditional AODV algorithm performs better when there are shortest path and link lifetime between the nodes in VANET. Giving 3 Level Preference to the nodes as High Preference (HP), Average Preference (AP) and Less Preference (LP) gives chances to nodes that have High Preference when compared to Less Preference. CPAODV model is proposed by implementing Classifying and giving preference to the RREQ to mitigate latency to the nodes. RST sends RREQ wisely based on the early model of Route Discovery stage itself. NS2 Simulator is used to analyze the strength of the proposed algorithm using QoS metrics like Throughput, Packet Delivery Ratio and End to End delay. This proposed CPAODV method performs better when compared to traditional AODV and CBAODV algorithm.

A review of black hole attack studies in wireless sensor network

Abstract: The specific application of ad-hoc network is a form of the wireless sensor network, that participates to achieve “smart sensing work” where the nodes are “smart sensors”. This modern technology has been used innovatively in many sensing applications and observations in various domains medical, banking security, and industry. MANET, referred to as a Mobile ad-hoc network, is a kind of ad-hoc network which depends on a set of auto-configuring mobile wireless points that are linked to change locations. for this large range of applications, and has been a promising and innovative research scope. The objective of the present study is to analytically review the previous studies and propose a path for the future. The proposed method used in this paper to analyze previous studies uses the content analysis approach. Furthermore, the limitations of wireless sensor networks include memory storage, the power of the battery, computational work, and range of communication in their system resources, which outline their defense against threats and performance. Based on the results, the present finding was that eleven types of research discussed the black hole attack in a wireless sensor network in different case studies.

Trust-Aware Fuzzy Evaluation Method for Preventive Route Generation in Mobile Network

Abstract: The existence of a non-cooperative or black hole node as an intermediate node in a mobile network can degrade the performance of the network and affects the trust of neighbor nodes In this paper, a trust-aware routing protocol is defined for improving the routing reliability against black hole attacks A new Trust aware and fuzzy regulated AODV (TFAODV) protocol is investigated in this work as an improvement over the existing AODV protocol The session-driven evaluation of stability, communication-delay, and failure-ratio parameters are conducted for evaluating the trust of nodes The fuzzy rules apply to these parameters for computing the degree of trust This trust vector isolates the attack-suspected and trustful nodes The proposed TFAODV protocol used the trustful mobile nodes as the intermediate path nodes The proposed protocol has been experimented with in the NS2 simulation environment The analytical results are obtained in terms of PDR ratio, Packet Communication, Loss rate parameters The comparative results are derived against the AODV, Probabilistic AODV, PDS-AODV, PSAODV, and Juneja et al protocols The analysis is performed on different scenarios varied in terms of network density, degree of stability, and the number of attackers The simulation results ensured the proposed TFAODV protocol has improved the PDR ratio and reduced the communication loss significantly against these state-of-art protocols