R. B. Patel

Chandigarh Engineering College, Mohali, Punjab, India

Are you R. B. Patel?

Claim your profile

Publications (69)10.79 Total impact

  • International Journal of Computer Applications 05/2015; 117(16):9-13. DOI:10.5120/20637-3313 · 0.82 Impact Factor
  • Source
    G.S Bhamra · A.K Verma · R.B. Patel
    01/2015; 5(1):11-22. DOI:10.5121/ijfcst.2015.5102
  • Source
    Kamal Kumar · A. K. Verma · R. B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination node. We also identified forwarders for query by base station. The front is optimally calculated to maintain the security credential and avail multiple paths. According to our knowledge ours is first secure multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical analysis
    08/2014; 4(4). DOI:10.5121/ijfcst.2014.4404
  • Anil Kumar Verma · Kamal Kumar · R B Patel
    Malaysian Journal of Computer Science 01/2013; 26(2). · 0.50 Impact Factor
  • Source
    Shashi Bhushan · Mayank Dave · R B Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode. P2P systems are suitable for large-scale distributed environments in which nodes can share resources other than data such as computing power, memory and network bandwidth. Some of important parameters that affect the performance of P2P systems are peer availability, data availability, network overhead, overlay structure, churn rate, and data access time. In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed. This scheme organizes replicas in a Self Organized Hierarchical Logical Structure (SOHLS) that has special properties. The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums and reducing network overhead. This scheme is highly fault tolerant (tolerate up to 1 n  faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network. The architecture for IHQC is also proposed for implementing the scheme that supports improved performance of P2P systems. This scheme also maximizes the degree of intersection set of read and write quorums; hence, having higher probability to get updated data as compared to all other schemes. The mathematical correctness of the scheme is also presented in the paper. The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.
    09/2012; 4(10). DOI:10.5815/ijcnis.2012.10.02
  • Source
    A.K. Bindal · A. Mangla · D. Prasad · R.B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: The forwarding node placement problem in a wireless sensor network is concerned with deploying a minimum number of forwarding nodes (FNs) in a set of candidate locations in the network to satisfy a specific requirement(s), such as connectivity or survivability. The placement of FNs should be energy harvesting aware, because the more energy the placed nodes can harvest the more effective the network will be. In this paper we have presented a Possible Location Deployment Protocol (PLDP) for WSNs. PDLP, which provides survivability and connectivity throughout the network life. In PLDP, the amount of energy calculated and the decision is taken in the real time by FNs.
    Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A WSN is a distributed system of smart sensor nodes interconnected by a wireless communication network. The self-organizing ability of Wireless Sensor Networks (WSNs) permits one to access data from dangerous and hostile environments which otherwise would not be possible. With all the opportunities and promises, WSNs possess their own set of resource constraints like limited accommodation of new nodes, on-board sensor battery power, network communication bandwidth, processing power, memory capacity etc. To overcome some of these shortcomings we are devoted to design HiFAS(Scalable, Fault Tolerant Routing protocol) for wireless sensor networks, which is energy efficient and provides scalability as well. With the concept of gateways and cluster heads it provides prolonged network lifetime, fault tolerance, achieves better network support and prolonged uninterrupted operations.
  • R. B. Patel · Vishal Garg
    [Show abstract] [Hide abstract]
    ABSTRACT: This article presents a common solution to Peer-to-Peer (P2P) network problems and distributed computing with the help of ``Neighbor Assisted Distributed and Scalable Environment'' (NADSE). NADSE supports both device and code mobility. In this article mainly we focus on the NADSE based resource management technique. How information dissemination and searching is speedup when using the NADSE service provider node in large network. Results show that performance of the NADSE network is better in comparison to Gnutella, and Freenet.
    12/2011; DOI:10.1063/1.3669949
  • Source
    Vijay Kumar · R B Patel · Manpreet Singh
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a model for reliable packet delivery in Wireless Sensor Networks based on Discrete Parameter Markov Chain with absorbing state. We have demonstrated the comparison between cooperative and non cooperative automatic repeat request (ARQ) techniques with the suitable examples in terms of reliability and delay in packet transmission.
  • Source
    R B Patel · Dilip Kumar · Trilok C Aseri
    [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, energy efficiency and data gathering is a major concern in many applications of Wireless Sensor Networks (WSNs). One of the important issues in WSNs is how to save the energy consumption for prolonging the network lifetime. For this purpose, many novel innovative techniques are required to improve the energy efficiency and lifetime of the network. In this paper, we propose a novel Energy Efficient Clustering and Data Aggregation (EECDA) protocol for the heterogeneous WSNs which combines the ideas of energy efficient cluster based routing and data aggregation to achieve a better performance in terms of lifetime and stability. EECDA protocol includes a novel cluster head election technique and a path would be selected with max-imum sum of energy residues for data transmission instead of the path with minimum energy consumption. Simulation results show that EECDA balances the energy consumption and prolongs the network lifetime by a factor of 51%, 35% and 10% when compared with Low-Energy Adaptive Clustering Hierarchy (LEACH), Energy Efficient Hierarchical Clustering Algorithm (EEHCA) and Effective Data Gathering Algorithm (EDGA), respectively.
    International Journal of Computers, Communications & Control (IJCCC) 04/2011; VI(1):113-124. · 0.69 Impact Factor
  • Neeraj Kumar · Manoj Kumar · R. B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless mesh networks (WMNs) are receiving lot of attention in recent years due to the unique features such as low cost and easy deployment. The optimal routing in these networks depends on the link capacities determined by link scheduling. To increase the throughput and network capacity, use of multiple channels and interfaces has been introduced in these networks. But the presence of interference limits the use of link and channel assignment in these types of networks. In this paper, we present a novel approach for link scheduling and channel assignment (CA) to improve the overall capacity and throughput of WMNs. The problem of link scheduling and CA is formulated as a Linear Programming (LP) problem with associated constraints. Links are sorted and placed in a particular group based upon link cost metric (LCM). The LCM value is used to group the links together and placed in appropriate group for CA. As the links are sorted and placed in appropriate groups the corresponding entries are made in Link Assignment Matrix (LAM). Once the links are grouped using LCM, then CA for these links is done and corresponding entries are made in Channel Assignment Matrix (CAM). Two algorithms, one for link scheduling and other for CA, are proposed. Simulation results show that proposed scheme outperforms the earlier approaches with respect to packet delivery fraction, end-to-end delay, aggregate throughput, fairness index and packet loss rate.
    Journal of Network and Computer Applications 01/2011; 34(1-34):30-38. DOI:10.1016/j.jnca.2010.10.001 · 2.24 Impact Factor
  • Shashi Bhushan · M. Dave · R. B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: In structured and unstructured Peer-to-Peer P2P systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology CJM to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network.
    01/2011; 3:51-61. DOI:10.4018/jmcmc.2011070104
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a neural model for reliable and fault tolerant transmission in Wireless Sensor Networks based on Bi-directional Associative Memory. The proposed model is an attempt to enhance the performances of both the cooperative and non cooperative Automatic Repeat Request (ARQ) schemes in terms of reliability and fault tolerance. We have also demonstrated the performances of both the schemes with the help of suitable examples.
    International Journal of Advanced Computer Science and Applications 01/2011; 2(5-5). DOI:10.14569/IJACSA.2011.020519 · 1.32 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a model for reliable packet delivery in Wireless Sensor Networks based on Discrete Parameter Markov Chain with absorbing state. We have demonstrated the comparison between cooperative and non cooperative automatic repeat request (ARQ) techniques with the suitable examples in terms of reliability and delay in packet transmission.
  • Source
    D Prasad · Manik Gupta · R B Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Networks (WSNs) are one of the most exciting and challenging research areas. It is an emerging technology that shows various applications both for public and military purpose. In order to operate these applications successfully, it is necessary to maintain privacy and secrecy of the transmitted data. In this paper, we have presented a Reliable Security Model (RSM) for WSNs. To incorporate the security, we are using four keys out of which two are static and remaining two are dynamic. One of the static key is obtained by composition of Q number of keys, and other is real-time MAC ID (RTMAC). Dynamic keys are computed on fly and keep on changing each time when the network is synchronized. In RSM, the synchronization time is less than the time required to compromise any node by an adversary, so that even if some nodes get compromised, the keying materials of the node have already been changed. Keywords-Wireless sensor network (WSN); Sensor Node (SN); Base Station (BS); Static Keys; Dynamic Keys; Real-Time MAC ID (RTMAC).
    International Journal of Advanced Computer Science and Applications 01/2011; 2(4). DOI:10.14569/IJACSA.2011.020403 · 1.32 Impact Factor
  • Source
    Dilip Kumar · R. B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Recently, continued advances in wireless communication technologies have enabled the deployment of large-scale wireless sensor networks (WSNs). A key concern in the design and development of such WSNs is energy consumption. The hierarchical clustering algorithm is a kind of a technique which is used to reduce energy consumption. It can also increase the scalability, stability, and network lifetime. In some clustering schemes, the communication between a sensor node and its designated cluster head (CH) is assumed to be single-hop. However, multihop communication is often required when the communication range of the sensor nodes is limited or the number of sensor nodes is very large in a network. In this paper, we propose a distributed, randomized, multi-hop clustering algorithm to organize the sensor nodes in a WSN into clusters. The data collected by each sensor node communicate with their respective CHs by using multi-hop communication. The selected CHs collect data from member nodes in their respective clusters, aggregate the data, and send it to a base using multi-hop communication. Simulation results show that proposed algorithm efficiently mitigates the hot spot problem in heterogeneous WSN and achieves much improvement in network lifetime and load balance compared to the existing algorithms.
    International Journal of Distributed Sensor Networks 01/2011; 2011(3). DOI:10.1155/2011/984795 · 0.92 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a Markov model for reliability using different types of Sensors and spares that replace sensors in case failure occurs. The primary idea in this paper is to address and analyze the reliability issues to device a reliable and fault tolerance model for a sensor network system. We analyzed the model in terms of reliability and MTTF (Mean-Time-To-Failure). Our research work focus on the mechanism for providing an alternative of a redundant network by replacing the faulty sensor with the available spares.
  • Ajay koul · R. B. Patel · V. K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile Ad hoc Networks (MANETs) always bring challenges to the designers in terms of its security deployment due to its dynamic and infrastructure less nature. In the past few years different researchers have proposed different solutions for providing security to MANETs. In most of the cases however, the solution is targeting a particular attack or multiple attacks but fails to find the root cause of it. In this paper we use system level security for deploying the overall security in MANETs. The system level security is the security at node level as we believe that if nodes behave properly and in a coordinated fashion, the insecurity level will go drastically down. Our simulation results gives the advantage of using this approach
  • G. S. Bhamra · A. K. Verma · R. B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Distributed Data Mining (DDM) is concerned with application of the classical Data Mining (DM) approach in a Distributed Computing (DC) environments so that the available resource including communication networks, computing units and distributed data repositories, human factors etc. can be utilized in a better way and on-line, real-time decision support based distributed applications can be designed. A Mobile Agent (MA) is an autonomous transportable program that can migrate under its own or host control from one node to another in a heterogeneous network. This paper highlights the agent based approach for mining the association rules from the distributed data sources and proposed an another framework called Agent enriched Mining of Strong Association Rules (AeMSAR) from Distributed Data Sources. As agent technology paradigm of the DC has gained lots of research in the recent years, therefore, making an alliance of agent and Association Rules Mining(ARM) will help mining the Association rules in a Distributed environment in a better way.
    Agents and Data Mining Interaction - 7th International Workshop on Agents and Data Mining Interation, ADMI 2011, Taipei, Taiwan, May 2-6, 2011, Revised Selected Papers; 01/2011
  • Source
    Dilip Kumar · Trilok C. Aseri · R.B. Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Effective energy management in heterogeneous wireless sensor networks (WSNs) is a more challenging issue compared to homogeneous WSNs. Much of the existing research has often assumed homogeneous sensor nodes in the networks. The energy preservation schemes for the homogeneous WSNs do not perform efficiently when applied to heterogeneous WSNs. In this paper, we have presented an energy-efficient multi-hop communication routing (MCR) protocol in order to address the traditional problem of load balancing, lifetime, stability and energy efficiency in the WSNs. MCR protocol is based on dividing the network into dynamic clusters. The cluster-heads election is based on weighted probability. The cluster's nodes communicate with an elected cluster head node by using single hop communication approach, and then the cluster heads communicate the information to the base station via multi-hop communication approach. Performance studies indicate that MCR effectively solves the problem of load balancing across the network, extends the network lifetime, stability and is more energy efficient in comparison to multi-hop low-energy adaptive clustering hierarchy (M-LEACH) and multilayer energy efficient cluster head communication protocol (MEECHCP).
    01/2011; 1(2):130 - 145. DOI:10.1504/IJITCC.2011.039281

Publication Stats

348 Citations
10.79 Total Impact Points

Institutions

  • 2012
    • Chandigarh Engineering College
      Mohali, Punjab, India
  • 2010–2011
    • Maharishi Markandeshwar University, Mullana
      Ambata, Haryana, India
    • Mody University of Science and Technology
      Sīkar, Rajasthan, India
  • 2009–2011
    • Alabama A & M University
      Huntsville, Alabama, United States
    • Deenbandhu Chhotu Ram University of Science and Technology, Murthal
      • Department of Computer Science and Engineering
      Sonapur, Orissa, India
  • 2005–2010
    • Haryana Engineering College
      Ambata, Haryana, India
  • 2007–2008
    • Shri Mata Vaishno Devi University
      Katra, Uttar Pradesh, India
  • 1999
    • Veer Narmad South Gujarat University
      • Department of Statistics
      Surat, Gujarāt, India