Sanjeev Sharma

Vidyalankar School of Information Technology, Bhopal, Madhya Pradesh, India

Are you Sanjeev Sharma?

Claim your profile

Publications (15)2.76 Total impact

  • Gourav Jain, Nishchol Mishra, Sanjeev Sharma
    International Journal of Computer Applications. 04/2013; 67(25):26-30.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Region duplication forgery detection is a special type of forgery detection approach and widely used research topic under digital image forensics. In copy move forgery, a specific area is copied and then pasted into any other region of the image. Due to the availability of sophisticated image processing tools, it becomes very hard to detect forgery with naked eyes. From the forged region of an image no visual clues are often detected. For making the tampering more robust, various transformations like scaling, rotation, illumination changes, JPEG compression, noise addition, gamma correction, and blurring are applied. So there is a need for a method which performs efficiently in the presence of all such attacks. This paper presents a detection method based on speeded up robust features (SURF) and hierarchical agglomerative clustering (HAC). SURF detects the keypoints and their corresponding features. From these sets of keypoints, grouping is performed on the matched keypoints by HAC that shows copied and pasted regions.
    The Scientific World Journal 01/2013; 2013:267691. · 1.73 Impact Factor
  • International Journal of Computer Applications. 04/2012; 43(16):8-14.
  • Sanjay Bansal, Sanjeev Sharma, Ishita Trivedi
    [Show abstract] [Hide abstract]
    ABSTRACT: Failure of multiple nodes detection is a complex task in parallel and collaborative image processing on a cluster. Adaptive heartbeat detectors with complex prediction system are not effective due to high overheads as image processing itself having high time complexity and thus make such detectors unrealistic. In this paper an improved algorithm is proposed which combine stair case heartbeat mechanism with adaptive automatic time predication mechanism for such image processing application. All nodes are broadcasting with “I am ok” message by setting the time initially min time. All nodes who answer are kept in a first working node list. Again time is increased in stair case manner for only those nodes who had not answered. This is repeated till maximum time is reached. After this, node is declared as a faulty node if it does not answer. It improves the accuracy of the multiple failure detectors since this algorithm relates the time of different node as per the load and traffic by gradually determined stair case intervals. It is simple since no complex and time-consuming time prediction mechanism is incorporated. Simulation Results presented validate the effectiveness of the proposed algorithm.
    01/2012;
  • International Journal of Computer Applications. 01/2012; 37(5):25-29.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: One of the key issues in mobile communication is to find the current location of mobile terminal (MT) to deliver the services, which is called as location management (LM). Increasing users and diverse services demand for a high-quality skeleton for LM. As an MT moves within a cellular network, it registers its new location to the nearest base station (BS). When a call arrives for an MT, the network searches the target MT in the area where it was last registered. This paper presents comprehensive classification of existing major LM schemes, their comparative study and factors influencing their performance. Finally, guidelines for developing and rating a LM scheme are suggested with the help of LPCIC rule, which is the main contribution of this paper.
    12/2011;
  • Source
    Dhananjay Bisen, Dr. Sanjeev Sharma
    [Show abstract] [Hide abstract]
    ABSTRACT: In a mobile ad hoc network, temporary link failures and route changes occur frequently. With the assumption that all packet losses are due to congestion, TCP performs poorly in such an environment. There are many versions of TCP which modified time to time as per need. In this paper modifications introduced on TCP New Reno over mobile ad-hoc networks using calculation of New Retransmission Time out (RTO), to improve performance in term of congestion control. To calculate New RTO, adaptive backoff response approach (ABRA) in TCP New Reno was applied which suggest ABRA New Reno. It utilizes an ABRA by which congestion window and slow start threshold values were decreased whenever an acknowledgement is received and new backoff value calculate from smoothed round trip time. Evaluation based on comparative study of ABRA New Reno with other TCP Variants like New Reno and Reno was done using realistic parameters like TCP Packet Received, Packet Drop, Packets Retransmitted, Throughput, and Packet Delivery Ratio calculated by varying attributes of Node Speed, Number of Nodes and Pause Time. Implementation and simulations were performed in QualNet 4.0 simulator.
    05/2011;
  • Vaishali Ughade, Nishchol Mishra, Sanjeev Sharma
    International Journal of Computer Applications. 04/2011; 20(1).
  • Source
    Sanjay Bansal, Sanjeev Sharma
    [Show abstract] [Hide abstract]
    ABSTRACT: In case of multiple node failures performance becomes very low as compare to single node failure. Failures of nodes in cluster computing can be tolerated by multiple fault tolerant computing. Existing recovery schemes are efficient for single fault but not with multiple faults. Recovery scheme proposed in this paper having two phases; sequentially phase, concurrent phase. In sequentially phase, loads of all working nodes are uniformly and evenly distributed by proposed dynamic rank based and load distribution algorithm. In concurrent phase, loads of all failure nodes as well as new job arrival are assigned equally to all available nodes by just finding the least loaded node among the several nodes by failure nodes job allocation algorithm. Sequential and concurrent executions of algorithms improve the performance as well better resource utilization. Dynamic rank based algorithm for load redistribution works as a sequential restoration algorithm and reassignment algorithm for distribution of failure nodes to least loaded computing nodes works as a concurrent recovery reassignment algorithm. Since load is evenly and uniformly distributed among all available working nodes with less number of iterations, low iterative time and communication overheads hence performance is improved. Dynamic ranking algorithm is low overhead, high convergence algorithm for reassignment of tasks uniformly among all available nodes. Reassignments of failure nodes are done by a low overhead efficient failure job allocation algorithm. Test results to show effectiveness of the proposed scheme are presented.
    Computing Research Repository - CORR. 02/2011;
  • Sanjay Bansal, Sanjeev Sharma, Ishita Trivedi
    [Show abstract] [Hide abstract]
    ABSTRACT: When computational clusters increase in size, their mean time to failure reduces drastically. We generally use checkpoint to minimize the loss of computation. Most check pointing techniques, however, require central storage for storing checkpoints. This results in a bottleneck and severely limits the scalability of check pointing, while also proving to be too expensive for dedicated check pointing networks and storage systems. We propose a Stair-Case Replication (SCR) Based MPI check pointing facility. Our reference implementation is based on LAM/MPI; however, it is directly applicable to any MPI implementation. We use the staircase method of fault-tolerant MPI with asynchronous replication, eliminating the need for central or network storage. We evaluate centralized storage, a Sun-X4500-based solution, an EMC storage area network (SAN), and the Ibrix commercial parallel file system and show that they are not scalable, particularly after 64 CPUs. We use the staircase MPI method which allows the access point in a lower complexity level to the higher complexity level which improves the efficiency of the previous method. Keywordscheck pointing–Fault tolerance–MPI–SAN
    12/2010: pages 445-448;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In case of multiple node failures performance is very low as compare to single node failure. Failures of nodes in cluster computing can be tolerated by multiple fault tolerant computing. In this paper, we propose a multiple fault tolerant technique with improved failure detection and performance. Failure detection is done by improved adaptive heartbeats based algorithm to improve the degree of confidence and accuracy. Failure recovery is based on reassignment of load with a rank based algorithm Performance is achieved by distributing the load among all available nodes with dynamic rank based balancing algorithm. Dynamic ranking algorithm is low overhead algorithm for reassignment of tasks uniformly among all available nodes. Message logging is used to recover message loss.
    01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: One of the key issues in cellular mobile communication is to find the current location of mobile terminal (MT) to deliver the services, which is called location management (LM). Much research has been done on dynamic LM that reduced the LM cost up to a large extent. In movement based dynamic LM scheme, the location area is defined in the form of ring of cells for individual user. Whenever an MT visits a cell outside of its current location area (LA), it triggers location update (LU). For this purpose, network must inform the mobile terminal about ID of all the cells present in its current location area. In this paper, a simple way of cell-ID assignment is proposed under which, network sends only the ID of center cell of LA ring to MT and then MT can compute IDs of all other cells in its location area. This saves a significant amount of wireless bandwidth by minimizing the signaling traffic at VLR level and thus reduces the mobility management overhead.
    Telecommunication Systems · 1.03 Impact Factor
  • Source
    Sanjay Bansal, Sanjeev Sharma, Ishita Trivedi
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we give a survey on various fault tolerance techniques and related issues in distributed systems. More specially speaking, we talk about two most important issues; multiple fault handling capability and performance. This survey provides the related research results and also explored the future directions about fault tolerance techniques, and it is a good reference for researcher.
    IJIDCS) International Journal on Internet and Distributed Computing Systems. 1.
  • Source
    Sanjay Bansal, Sanjeev Sharma
    [Show abstract] [Hide abstract]
    ABSTRACT: Performance of a checkpointing based multiple fault tolerance is low. The main reason is overheads associate with checkpointing. A checkpointing algorithm can be improved by improved storing strategy and checkpointing scheduling. Improved storage strategy and checkpointing scheduling will reduce the overheads associated with checkpointing. Performance and efficiency is most desirable feature of recovery based on checkpointing. In this paper important critical issues involved in fast and efficient recovery are discussed based on checkpointing. Impact of each issue on performance of checkpointing based recovery is also discussed. Relationships among issues are also explored. Finally comparisons of important issues are done between coordinated checkpointing and uncoordinated checkpointing.