Yogesh Chaba
Yahoo!
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Yogesh Chaba.
international conference on computer modeling and simulation | 2010
Yogesh Chaba; Yudhvir Singh; Manish Joon
Ad-hoc networks have been the focus of research interest in wireless networks since 1990. Nodes in an ad-hoc network connect to each other dynamically in an arbitrary manner. The dynamic features of ad-hoc networks demand a new set of routing protocols that are different from the routing schemes used in traditional wired networks. A wide range of routing protocols have been proposed by researchers to overcome the limitations of wired routing protocols. This paper focuses on comparative analysis of two on demand routing protocols: Adhoc on demand distance vector (AODV) and dynamic source routing (DSR) based on packet delivery ratio, normalized routing over head and end to end delay while varying number of sources and pause time.
Journal of Networks | 2009
Yogesh Chaba; Yudhvir Singh; Preeti Aneja
In Mobile Ad hoc Networks (MANET), various types of Denial of Service Attacks (DoS) are possible because of the inherent limitations of its routing protocols. Considering the Ad hoc On Demand Vector (AODV) routing protocol as the base protocol it is possible to find a suitable solution to overcome the malicious flooding i.e. attack of initiating / forwarding Route Requests (RREQs) that lead to hogging of network resources and packet dropping is a technique in which a node drops data packets (conditionally or randomly) that it is supposed to forward hence denial of service to genuine nodes. In this paper, a technique is proposed that can prevent a specific kind of DoS attack i.e. flood attack which Disable IP Broadcast. The proposed scheme is distributed in nature it has the capability to prevent Distributed DoS (DDoS) attack. The performance of the proposed algorithm in a series of simulations reveals that the proposed scheme provides a better solution than existing approaches.
grid computing | 2010
Ritu Sharma; Yogesh Chaba; Yudhvir Singh
Wireless Sensor Networks (WSNs) consists of low power nodes, with limited processing, communication, and storage. The networks are made up of tiny nodes which are becoming future of many applications, but due to deployment nature the sensor nodes are prone to physical attacks against the adversaries and resource limitations raises some serious question to secure these nodes. Random failure of nodes occurred in real-life deployment scenarios. Due to the resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security is a challenging task in WSN and basic security goals in sensor networks are Confidentiality, Integrity, Authentication and Availability (CIAA). Many security solutions have been proposed in the domain so far. Due to a number of physical constraints in sensor nodes, traditional cryptographic mechanisms are not suitable to deal with such potential security threats. This paper is devoted to the research on security efficiency for wireless sensor networks. The proposed scheme of Individual Pairwise and Cluster (IPC) key management is based on the generation and distribution of the individual key, pairwise key and the cluster head broadcast key. This paper proposes a solution which uses the basic scheme, but does not use group-based deployment model and pre-deployment knowledge of the locations of nodes, and yet performs better than the schemes which uses the group-based deployment. The security analysis shows that the scheme within this paper meets the unique security needs of the sensor networks.
international conference on telecommunications | 2010
Yogesh Chaba; Yudhvir Singh; Kanwar Preet Singh; Prabha Rani
The lack of any centralized infrastructure in mobile ad hoc networks (MANET) is one of the greatest security concerns in the deployment of wireless networks. MANET functions properly only if the participating nodes cooperate in routing without any malicious intention. However, some of the nodes may be malicious in their behavior by initially attracting a large amount of traffic and later on launching active security attacks like worm hole. Wormhole attack is severe attack in ad hoc networks and particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. This approach evaluates the impact of various wormhole attacks by evaluating different performance parameters like jitter, frame dropped, end to end delay, throughput and packet delivered on various routing protocols and recommends the safest and weakest routing protocol against wormhole attack.
Archive | 2010
Ritu Sharma; Yogesh Chaba; Yudhvir Singh; Guru Jambheshwar
international conference on advances in computing, control, and telecommunication technologies | 2009
Yogesh Chaba; Yudhvir Singh; Manish Joon
Asian Journal of Computer Science and Information Technology | 2013
Neeraj Sharma; B.L. Raina; Prabha Rani; Yogesh Chaba; Yudhvir Singh
Archive | 2008
Yogesh Chaba; Yudhvir Singh
Archive | 2009
Yogesh Chaba; Manish Joon; Yudhvir Singh
ieee international advance computing conference | 2009
Yudhvir Singh; Yogesh Chaba