MIT-World Peace University (MIT-WPU) is a top educational institute located in Pune, India. It is recognized within&nbsp;UGC under Government of Maharashtra Act No. XXXV 2017.&nbsp;

It is part of the MIT group of institutions (established in 1983) which covers 10+ campuses across India and has more than 50,000+ students enrolled across various disciplines at a given point of time. The institute houses 15 schools ranging from Engineering &amp; Technology, Design, Pharmacy, Commerce, Governance among others. It offers undergraduate, postgraduate and PhD programs among different disciplines.&nbsp;

&nbsp;

MIT World Peace University

School of Computer Engineering & Technology

World University root node

Engineering and Technology

Generating Ciphertext using Nonlinear System Equations Modified Approach : An Asymmetric Key Approach

International Journal of Engineering Research \& Technology (IJERT)

Node Authentication in Spontaneous Wireless Ad-Hoc Networking: Survey

Indian Patent office, Application number USA

Sectoring approach for separation of sensor nodes in various sectors to achieve reliability

International Journal of Wireless Communication

MARS: Sectoring scheme to improve reliability in WSN

CIIT International Journal of Digital Image Processing

Effective Distance Measures for Color-Content Based Image Retrieval

As we know Web caching and pre-fetching is a ubiquitous technique that can increase the speed of Web loading process. Because of mobile context has limited resources like speed and memory, a better technique for Web loading process is needed. In this paper we are going to study a new a hybrid technique based on combination of ANN and Particle Swarm Optimization (PSO) for classification Web object either to cache or not and generate rules from log data by using Rough Set technique on proxy server (Rough Neuro-PSO). This technique proves to be faster in searching or accessing process in mobile applications. This method is by using XML file for prefetching which is saved into mobile memory. Prefetching that used xml file is much faster to be searched or accessed. Where in web caching side enhance the speed by using Rough Neuro-PSO in order to choose the log. At the end study the new framework which up the access of the web page in mobile environment.&nbsp;

<a href="https://scholar.google.com/citations?view_op=view_citation&amp;hl=en&amp;user=fpZygLkAAAAJ&amp;citation_for_view=fpZygLkAAAAJ:IjCSPb-OGe4C">Web Caching and XML Prefetching for Accessing Social Sites from Mobile Environment</a>

Opportunistic network does not rely on any pre-existing infrastructure and no assumption is made on the existence of a complete path between source and destination. The development of efficient routing protocols for opportunistic networks is generally a difficult task due to the absence of knowledge about the network topology. Therefore, routing is one of the most persuasive challenges of opportunistic networks. In this chapter, we give the general definition of context information and emphasize the role of context information to take forwarding decisions in opportunistic networks. We classify the main routing protocols proposed in the literature on the basis of context information of users they exploit. Specifically, we classify two main classes of routing protocols, corresponding to context-oblivious and context-aware protocols. Then, we further classify context-aware routing protocols into two subclasses, i.e., partially context-aware and fully context-aware protocols, based on the amount of context information they use for routing. We emphasize and describe only routing protocols of context-aware category and the detailed discussion about context-oblivious routing protocols is out of the scope of this chapter.

Routing in Opportunistic Networks

Context-Based Routing Protocols for OppNets

International Journal of Scientific \& Engineering Research

Vehicle detection and tracking from video frame sequence

With the increase of ubiquitous data all over the internet, intelligent classroom systems that integrate traditional learning techniques with modern e-learning tools have become quite popular and necessary today. Although a substantial amount of work has been done in the field of e-learning, specifically in automation of objective question and answer evaluation, personalized learning, adaptive evaluation systems, the field of qualitative analysis of a student's subjective paragraph answers remains unexplored to a large extent. The traditional board, chalk, talk based classroom scenario involves a teacher setting question papers based on the concepts taught, checks the answers written by students manually and thus evaluates the students' performance. However, setting question papers remains a time consuming process with the teacher having to bother about question quality, level of difficulty and redundancy. In addition the process of manually correcting students' answers is a cumbersome and tedious task. In this paper, we put forth the design, analysis and implementation details along with some preliminary results to build a system that integrates all the above mentioned tasks with minimal teacher involvement that not only automates the traditional classroom scenario but also overcomes its inherent shortcomings and fallacies. © 2013 IEEE.

2013 6th International Conference on Emerging Trends in Engineering and Technology

Intelligent Classroom System for Qualitative Analysis of Students' Conceptual Understanding

Fault diagnosis is a central aspect of network fault management. Since faults are unavoidable in communication systems, their quick detection and isolation is essential for the robustness, reliability, and accessibility of a system. Probing technique for fault localization involves placement of probe stations (Probe stations are specially instrumented nodes from where probes can be sent to monitor the network) which affects the diagnosis capability of the probes sent by the probe stations. Probe station locations affect probing efficiency, monitoring capability, and deployment cost. At the same time, probe station selection affects the selection of probe set for fault localization. We are presenting a novel approach for minimal probe station selection with an objective to reduce probe set size that will be used for fault localization. The probe station selected through this approach results into reduced deployment cost as well as it helps in producing smaller probe set for fault localization reducing overall operation cost. We provide experimental evaluation of the proposed algorithms through simulation results. © 2013 IEEE.

Proceedings of the 2013 International Conference on Information Systems and Computer Networks, ISCON 2013

Probe station placement algorithm for probe set reduction in network fault localization