V.K. Bhat

Shri Mata Vaishno Devi University, Katra, Uttar Pradesh, India

Are you V.K. Bhat?

Claim your profile

Publications (20)0 Total impact

  • Neetu Kumari, V.K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: We discuss minimal prime ideals of skew polynomial rings over 2-primal Noetherian rings. Recall that a ring R is 2-primal if and only if N(R)=P(R), i.e. if the prime radical is completely semiprime. Let now R be a 2-primal Noetherian, which is also an algebra over ℚ. Let U be a minimal prime ideal of R and σ an automorphism of R such that σ(U)=U. Let δ be a σ-derivation of R such that δ(σ(a))=σ(δ(a)) for all a∈R. Then we show that δ(U)⊆U and U[x;σ,δ] is a minimal prime ideal of R[x;σ,δ].
    International Journal of Algebra. 01/2012;
  • 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
    01/2011;
  • Source
    Ajay Koul, R B Patel, V K Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper discusses the link stability estimation for Mobile Ad hoc Networks (MANETs). In this approach the total time for which the link remains connected with the neighboring nodes is estimated. This helps to predict the stability of the route which is required to forward the packets to the destination. This method does not use the selection of the next hop on the basis of shortest distance, but is based on the time period for which the next hop link remains connected. The parameters we use, are the distance and frequency and signal quality. These provide the way for a node to decide the best next hop neighbor and hence a perfect Quality of Service (QoS) is also obtained.
    01/2010;
  • Ajay Koul, R. B. Patel, V. K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: The security in mobile ad hoc networks (MANETs) is a serious concern. This article presents a new approach namely the double split (DSPLIT) for enhancing the security features in MANET. The basic idea is to transform a secret message into categories of information and dictionary symbols. The information symbols are further splitted and delivered via multiple paths to the destination while as a position table is generated based on the dictionary symbols and the same is sent through a single path. The purpose of doing so is to provide an additional security against the adversaries that collect many shares, which leads to message reconstruction. We present the overall system architecture and discuss the model for the generation of information and dictionary symbols, position table formation and finally further dividing information symbols and allocating them to their corresponding multipaths. Our simulation study shows that this approach is useful as it enhances the security and consumes less bandwidth.
    ARTCom 2009, International Conference on Advances in Recent Technologies in Communication and Computing, Kottayam, Kerala, India, 27-28 October 2009; 01/2009
  • N. Nehra, R.B. Patel, V.K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: In mobile ad hoc networks (MANETs), a source node must rely on other nodes to forward its packets on multi-hop routes to the destination. Secure and reliable handling of packets by the intermediate nodes is difficult to ensure in an ad hoc network. This is particularly challenging when malicious nodes collude with one another to disrupt the network operation. So we propose a trust establishment scheme for MANETs which aims to improve the reliability of packet forwarding over multi-hop routes in the presence of potentially malicious nodes using mobile agent (MA). We evaluate two key metric for trust establishment namely trust and confidence which are used by corresponding MA for route discovery and topology maintenance. We have extended the solution to secure the network against colluding malicious nodes. Proposed scheme is evaluated using PMADE (platform for mobile agent distribution and execution) along with Glomosim. Simulation results shows that proposed scheme is quite effective for trust establishment in ad hoc networks.
    Advanced Computing and Communications, 2007. ADCOM 2007. International Conference on; 01/2008
  • V.K. Bhat, Ravi Raina
    [Show abstract] [Hide abstract]
    ABSTRACT: Let R be a ring, σ an automorphism of R and let δ be a σ-derivation of R. Recall that a ring R is said to be a δ-ring if aδ(a)∈P(R) implies a∈P(R), where P(R) denotes the prime radical of R. It is known that if R is a δ-Noetherian ℚ-algebra, σ and δ are as usual such that σ(δ(a))=δ(σ(a)), for all a∈R and σ(P)=P, for all minimal prime ideals P of R, then R[x,σ,δ] is a 2-primal Noetherian ring. In this article it is proved that in the case δ is the zero map, R is a 2-primal Noetherian ring implies that R[x,σ] is a 2-primal Noetherian ring. In the case σ is the identity map, a similar result is proved for the differential operator ring R[x,δ] (R in this case is moreover a Noetherian ℚ-algebra).
    Vietnam Journal of Mathematics. 01/2008; 36(4).
  • Source
    Koul Ajay, Patel R.B, Bhat V.K
    [Show abstract] [Hide abstract]
    ABSTRACT: An ad hoc network is a collection of mobile stations forming a temporary network without the aid of any centralized coordinator. Routing messages are an essential component of Mobile Adhoc Networks, as each packet needs to be passed quickly through intermediate nodes from source to destination. Internal threats due to changes in the node behaviour that target the routing discovery or maintenance phase of the routing protocol and security challenges can however lead to insecure communication in MANETS. We proposed a model that found the improper behaviour of the nodes and eliminated them. Also it provided secure routing mechanism of sharing messages between sourceand destination by modifying and making use of Arithmetic encoding that not only saved the bandwidth but also provided the security by crypting the data. The reason we chose Arithmetic coding was because it typically enabled very high coding efficiency and provided better security.
    Journal of Computer Science. 01/2008;
  • N. Nehra, R.B. Patel, V.K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: An ad hoc wireless mobile network is an infrastructure-less network that has no fixed routes; instead, all nodes are capable of movement and can be connected dynamically in an arbitrary manner. In order to facilitate communication of mobile nodes that may not be within the wireless range of each other, an efficient routing protocol is needed to discover routes between nodes so that messages may be delivered in a timely manner. Therefore in this paper, we propose routing with load balancing using mobile agent (RLBMA). We use the concept of mobile agent (MA) for route discovery and balance the traffic load on the route. This MA selects the disjoint (alternate) path called active path set (APS) for reliable transmission to avoid congestion. RLBMA provides topology updation and path maintenance also. A comprehensive simulation study was conducted to evaluate the performance of the proposed scheme. Performance results shows that MA approach outperforms existing ad hoc routing protocols in terms of packet delivery fraction, average end-to-end delay and normalized routing load.
    Computer and Information Science, 2007. ICIS 2007. 6th IEEE/ACIS International Conference on; 08/2007
  • N. Nehra, R.B. Patel, V.K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: Dynamic load balancing (DLB) is an important system function destined to distribute workload among participating nodes to improve throughput and/or execution times of parallel computers. Instead of balancing the load in cluster by process migration, or by moving an entire process to a less loaded computer, we make an attempt to balance load by splitting processes into separate jobs and then balance them among nodes. In order to get target, we use mobile agent (MA) to distribute load among nodes in a cluster. In this paper, distributed dynamic load balancing using MA (DDLBMA) technique is presented. We introduce types of agents needed to meet the requirements of the proposed load balancing. Different metrics are used to compare load balancing mechanism with the existing technology. The experiment is carried out on cluster of PC's divided into multiple local area network (LAN) using mobile agent system PMADE (Platform for Mobile agent distribution and execution). Preliminary experimental results demonstrated that the proposed technique is effective.
    Advanced Computing and Communications, 2006. ADCOM 2006. International Conference on; 01/2007
  • Nehra Neeraj, Patel R.B, Bhat V.K
    [Show abstract] [Hide abstract]
    ABSTRACT: Distributed Dynamic load balancing (DDLB) is an important system function destined todistribute workload among available processors to improve throughput and/or execution times ofparallel computer in Cluster Computing. Instead of balancing the load in cluster by process migration,or by moving an entire process to a less loaded computer, we make an attempt to balance load bysplitting processes into separate jobs and then balance them to nodes. In order to get target, we usemobile agent (MA) to distribute load among nodes in a cluster. In this study, a multi-agent frameworkfor load balancing in heterogeneous cluster is given. Total load on node is calculated using queuelength which is measured as the total number of processes in queue. We introduce types of agents alongwith policies needed to meet the requirements of the proposed load-balancing. Different metrics areused to compare load balancing mechanism with the existing message passing technology. Theexperiment is carried out on cluster of PC’s divided into multiple LAN’s using PMADE (Platform forMobile agent distribution and execution). Preliminary experimental results demonstrated that theproposed framework is effective than the existing ones.
    Journal of Computer Science. 01/2007;
  • V.K. Bhat, Ravi Raina
    [Show abstract] [Hide abstract]
    ABSTRACT: A ring R with unity is called a pseudo-valuation ring if for every prime ideal P and any two elements a,b∈R either aP⊆bR or bR⊆aP; R is said to be divided if every prime ideal is comparable (under inclusion) to every ideal of R. Let R be a commutative Noetherian ℚ-algebra with a derivation δ and an automorphism σ. Then the following hold: if R is a pseudo-valuation ring (respectively, divided ring) then so are the rings R[x,δ] and R[x,x -1 ,σ], the latter under the assumption that σ(P)⊆P for all prime ideals P of R.
    International Journal of Algebra. 01/2007;
  • Nehra Neeraj, Patel R.B, Bhat V.K
    [Show abstract] [Hide abstract]
    ABSTRACT: In grid computing, load balancing with optimal resource utilization and fault tolerance are important issues. The availability of the selected resources for job execution is a primary factor that determines the computing performance. Typically, the probability of a failure is higher in the grid computing than in a traditional parallel computing and the failure of resources affects job execution fatally. Therefore, a fault tolerance service is essential in grid. Also grid services are often expected to meet some minimum levels of Quality of Service (QoS) for a desirable operation. To address this issue, we propose load balancing with optimal resource utilization and fault tolerance service that satisfies QoS requirements. A fault tolerance service deals with various types of resource failures, which include process failures, processor failures and network failures. We design and implement a fault detector and a fault manager. Approach is effective in the sense that the fault detector detects the occurrence of resource failures and the fault manager guarantees that the submitted jobs completely executed with optimal resources. The performance of job execution is improved due to job migration using Mobile Agent (MA) even if some failures occurs. This MA executes one of the check pointing algorithms and its performance is compared with check pointing algorithm-using Message Passing Interface (MPI). Also the overhead generated during job migration is compared with MA and MPI.
    Information Technology Journal. 01/2007;
  • Neeraj Nehra, R. B. Patel, V. K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: Service discovery is an integral part of Mobile Ad Hoc Networks (MANETs). While several service discovery protocols such as Service Location Protocol [1] and Universal Plug and Play (UPnP)[2] have been developed, most of them are designed for infrastructure based networks and thus not suitable to be used in MANETs. This paper proposes Mobile Agent Based Service Discovery (MASD) for Ad Hoc network. It is a policy driven agent based mechanism that facilitates cross platform service discovery in ad-hoc environments. The various agents are chosen in MASD which executes the predefined policies. Our approach achieves a high degree of flexibility in adapting itself to changes in ad-hoc environments and is aware of common problems associated with structured compound formation in mobile Ad Hoc environments. Mechanism consists of grouping mobile nodes into clusters while a gateway in each cluster is responsible for routing. We evaluated the performance of the scheme by running simulations on Glomosim simulator. Also the motion of agents is taken care of by PMADE (Platform for Mobile Agent Distribution and Execution).The results obtained shows that MASD is quite effective for successful service discovery in MANETs.
    High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings; 01/2007
  • Source
    V. K. Bhat, Ravi Raina, Om Prakash
    [Show abstract] [Hide abstract]
    ABSTRACT: Let R be a Noetherian Q-algebra (Q the field of rational num- bers) and δ be a derivation of R. An ideal P is an associated prime ideal of differential operator ring R(x, δ) if and only if P =( P ∩ R)(x, δ) and P ∩ R is an associated prime ideal of R.
    International Journal of Contemporary Mathematical Sciences. 01/2007; 2(9).
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper an annihilator of a subset of a complete distributive lattice is defined and it characterises the annihilator of any subset of a complete chain.
    International Journal of Contemporary Mathematical Sciences. 01/2007; 2(13).
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this article we discuss the graphs of the sets of zero-divisors of a ring. Now let R be a ring. Let G be a graph with elements of R as vertices such that two non-zero elements a, b ∈ R are adjacent if ab = ba = 0. We examine such a graph and try to find out when such a graph is planar and when is it complete etc.
    International Journal of Contemporary Mathematical Sciences. 01/2007; 2(13).
  • V.K. Bhat, Ravi Raina, Om Prakash
    [Show abstract] [Hide abstract]
    ABSTRACT: We find a relation between the prime radical of a 2-primal ring R and that of R[x,σ,δ], where σ is an automorphism of R and δ is a σ-derivation of R.
    International Journal of Contemporary Mathematical Sciences. 01/2006; 1(9).
  • Source
    Neeraj Nehra, R. B. Patel, V. K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: Use of the Internet and the World-Wide-Web (WWW) has become widespread in recent years and mobile agent technology has proliferated at an equally rapid rate. In this scenario load balancing becomes important for P2P systems. Beside P2P systems can be highly heterogeneous, i.e., they may consists of peers that range from old desktops to powerful servers connected to internet through high-bandwidth lines. There are various loads balancing policies came into picture. Primitive one is Message Passing Interface (MPI). Its wide availability and portability make it an attractive choice; however the communication requirements are sometimes inefficient when implementing the primitives provided by MPI. In this scenario we use the concept of mobile agent because Mobile agent (MA) based approach have the merits of high flexibility, efficiency, low network traffic, less communication latency as well as highly asynchronous. In this study we present decentralized load balancing scheme using mobile agent technology in which when a node is overloaded, task migrates to less utilized nodes so as to share the workload. However, the decision of which nodes receive migrating task is made in real-time by defining certain load balancing policies. These policies are executed on PMADE (A Platform for Mobile Agent Distribution and Execution) in decentralized manner using JuxtaNet and various load balancing metrics are discussed.
  • Source
    Neeraj Nehra, R. B. Patel, V. K. Bhat
    [Show abstract] [Hide abstract]
    ABSTRACT: Summary Resource Co-allocation is one of the crucial problems affecting the performance of the grid. In addition to this if the system load in each of nodes is nearly equal; it indicates good resource allocation and utilization. It is well known that load balancing is a key factor in developing parallel and distributed applications. Instead of balancing the load in grid by process migration, or by moving an entire process to a less loaded node, we make an attempt to balance load by splitting up processes into separated jobs and then balance them to nodes. To address the problem of load balancing, many centralized approaches have been proposed in the literature but centralization has proved to raise scalability tribulations. So in order to get the target, we use mobile agents (MAs) to distribute load among nodes in the grid. Because a quick response time is necessary for need of users in real grid environment so a real time resource co-allocation is needed for such type of applications. So a parallel resource co-allocation using MA is proposed in this paper which not only balance the load on grid using proposed architecture but also allocate the resources. It is concluded with the results of the experiments that parallel method not only reduces total execution time but also reduces overall response time small.
  • Ravi Raina, V.K. Bhat, Neetu Kumari
    [Show abstract] [Hide abstract]
    ABSTRACT: Let N be a prime Γ-near ring with multiplicative center Z. Let σ and τ be automorphisms of N and δ be a Γ-(σ,τ)-derivation of N such that N is 2-torsion free. The following results are proved: (1) If σγδ=δγσ and τγδ=δγτ and δ(N)⊆Z, or [δ(x),δ(y)] γ =0, for all x,y∈N and γ∈Γ, then N is a commutative ring. (2) If δ 1 is a Γ-derivation, δ 2 is a Γ-(σ,τ) derivation of N such that τγδ 1 =δ 1 γτ and τγδ 2 =δ 2 γτ, then δ 1 (δ 2 (N))=0 implies δ 1 =0 or δ 2 =0. (3) The condition for a Γ-(σ,τ)-derivation to be zero in prime Γ-near ring is also investigated.
    Acta Mathematica Academiae Paedagogicae Nyíregyháziensis. New Series [electronic only]. 2(2).