R. B. Patel

Chandigarh Engineering College, Mohali, Punjab, India

Are you R. B. Patel?

Claim your profile

Publications (79)9.72 Total impact

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Network (WSN) has attracted researchers in recent years due to its wide scope of utility in a future era of automation and remote monitoring. Effective deployment of Sensor Nodes (SNs) is a major point of concern as performance and lifetime of any WSN primarily depends on it. Various models have been proposed by researchers to deploy SNs in large-scale open regions. This article aims at classification, working and comparative analysis of these models.
    Full-text · Article · Sep 2015 · Egyptian Informatics Journal

  • No preview · Article · May 2015 · International Journal of Computer Applications
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) consist of a number of sensor nodes, which are able to collect information from the environment by measuring diverse environment variables, like temperature, humidity, sound etc. Sometimes the sensor nodes (SN) are expected to be deployed in unattended environments for long durations; the major challenge is tapping on ambient energy to power such networks. This paper investigates on providing dedicated power supply to all static sensor nodes (SN) through mobile power nodes (MPNs); which is equipped with solar cells and super capacitors to store harvested energy. The MPNs are used to supply energy to all other static sensor nodes which has energy below minimum threshold level. The super capacitor guarantees a longer lifetime in terms of charge cycles, it presents itself as a “green” technology compared to batteries and it has a wide range of operating temperature.
    Full-text · Article · May 2015 · International Journal of Computer Applications
  • [Show abstract] [Hide abstract]
    ABSTRACT: The fundamental function of Wireless Body Area Network (WBAN) is to convey information over short distances. Because of their tremendous potential in medical and home applications, WBANs have raised tremendous research interests in recent years. Optimal and efficient slot allocation is one of the most active research areas in low-latency applications. The proposed dynamic slot allocation scheme address the bandwidth underutilization problem of the Guaranteed Time Slot (GTS) allocation scheme by IEEE 802.15.4 standard. The scheme is applicable to varieties of applications such as home automation, remote sensing, patient monitoring etc., where data rate are low and require dedicated bandwidth for contention free transmissions. The coordinator allocates GTS of size as requested by the device instead of allocating GTSs in the multiple of superframe slots size as in IEEE 802.5.4 standard and avoids the wastage of bandwidth. The scheme is analysed for performance view point and it has been observed that the proposed scheme is better than IEEE 802.15.4 standard, in terms of bandwidth utilization and number of devices supported.
    No preview · Article · Feb 2015
  • [Show abstract] [Hide abstract]
    ABSTRACT: Brain hemorrhage which happens as a result of bleeding due to rupturing of blood vessels within the brain matter is the main causes of human death. This discharge of blood may disturb the normal circulation of the brain. Computed Tomography (CT) has been the primary modality for the detection of brain hemorrhages because it is widely available, less expensive, quick to perform, and depicts rapidly. However intensity inhomogeneity, worst tissue contrast and weak boundaries in CT images may cause significant difficulties in hemorrhage detection. Thus in this paper the performance of various segmentation methods for hemorrhage detection from brain CT images have been evaluated.
    No preview · Article · Feb 2015
  • Source
    G.S Bhamra · A.K Verma · R.B. Patel

    Full-text · Article · Jan 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Static sensors have been a prominent area of research for last many years. They have a wide area of applications. Mobility in WSN broadens the application area of WSNs, but it imposes challenge of increased energy requirements and mechanism to find the location of moving sensor nodes. In this article a 2-Way Energy Efficient Localization (TWEEL) scheme is proposed, which is energy efficient and provides better localization as well without employing GPS at all mobile sensor nodes hence reducing the cost. Accuracy is achieved by using twin mobile anchor nodes and energy efficiency is achieved using combined and coordinated movements of nodes towards a single common objective. The location of a sensor node is computed by measuring the distance to the virtual anchor point using TDOA (time difference of arrival) method. The proposed scheme is compared with Zhang and Yu scheme and results shows that TWEEL outperform Zhang and Yu scheme on various parameters.
    Full-text · Article · Jan 2015 · International Journal of Applied Engineering Research
  • R. Goyal · H.S. Bhadauria · R.B. Patel · D. Prasad
    [Show abstract] [Hide abstract]
    ABSTRACT: The fundamental function of Wireless Body Area Network (WBAN) is to convey information over short distances. Because of their tremendous potential in medical and home applications, WBANs have raised tremendous research interests in recent years. This paper presents an energy-efficient and delay sensitive medium access control (MAC) protocol suitable for communication in a WBAN for remote monitoring of physiological signals such as EEG and ECG. In the proposed scheme, sensors are allowed to interrupt the PDA in case of emergency so that immediate action may be taken to avoid any causality, hence provides support to deal with emergency data along with the normal data. For performance analysis proposed scheme is simulated and compared with IEEE 802. 15. 4 standard. The simulation result shows that the proposed scheme is better in QoS for emergency (higher priority) data and gives better performance in terms of the average transmission time and energy efficiency.
    No preview · Article · Jan 2015 · International Journal of Applied Engineering Research
  • 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
    Full-text · Article · Aug 2014
  • Anil Kumar Verma · Kamal Kumar · R B Patel
    [Show abstract] [Hide abstract]
    ABSTRACT: Secure Communication is important parameter in unattended and hostile environment. Wireless Sensor Networks(WSNs) are deployed and operate in vulnerabilities and are candidate networks which should be commissioned for security provisioning in end to end communications. Because of their specialized applications many solutions in terms of cryptographic, Intrusion Detection and Key Management have been proposed. Most solutions lack and seem of ignoring the fact that route is as strong as weakest link in the route with respect to other links in the route. Variance of number of keys and high average number of keys on routes is an issue that we tried to resolve in our proposal using non-uniform key pre-distribution in Heterogeneous Wireless Sensor Networks (HWSNs). Analytical and Simulation based study supports our concern and reports an improvement in Average number of keys in almost60 percent routes and decreasing variance in almost 50 percent routes in random and probabilistic neighbourhood.
    No preview · Article · Jan 2013 · Malaysian Journal of Computer Science
  • 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.
    Full-text · Article · Sep 2012
  • 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.
    Full-text · Conference Paper · Jan 2012
  • Shashi Bhushan · R.B. Patel · Mayank Dave

    No preview · Article · Jan 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.
    Full-text · Article · Jan 2012
  • 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.
    No preview · Article · Dec 2011
  • 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.
    No preview · Article · Jul 2011 · International Journal of Mobile Computing and Multimedia Communications
  • Source
    Hemant Sethi · Devendra Prasad · R.B. Patel

    Preview · Article · May 2011
  • 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.
    No preview · Conference Paper · May 2011
  • 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.
    Full-text · Article · Apr 2011
  • 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.
    Preview · Article · Apr 2011 · International Journal of Distributed Sensor Networks

Publication Stats

498 Citations
9.72 Total Impact Points


  • 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
    • Indian Institute of Technology Roorkee
      • Department of Electronics and Computer Engineering
      Roorkee, Uttarakhand, India
  • 2008
    • Shri Mata Vaishno Devi University
      Katra, Uttar Pradesh, India
  • 1999
    • Veer Narmad South Gujarat University
      • Department of Statistics
      Surat, Gujarāt, India

We use cookies to give you the best possible experience on ResearchGate. Read our cookies policy to learn more.