Kishor Kolhe

Bio: Kishor Kolhe is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Routing protocol & The Internet. The author has an hindex of 2, co-authored 6 publications receiving 11 citations. Previous affiliations of Kishor Kolhe include College of Engineering, Pune.

High Performance Lossless Multimedia Data Compression through Improved Dictionary

Abstract: The advent of modern electronic world has opened up various fronts in multimedia interaction. They are used in various fields for various purposes of education, entertainment, research and many more. This has led to storage and retrieval of multimedia content regularly. But due to limitations of current technology the disk space and the transmission bandwidth fall behind in the race with the requirement of multimedia content. This imposes a need to compress multimedia content so that they can be easily stored requiring lesser space and easily transferred from one point to another. Some online dictionary based compression technique can be applied to reduce the data packet size. When the repetition rate of the same symbols within the data are high the compression techniques works very well. During the process of encoding and decoding, the building of online dictionary in the primary memory ensures the single pass over the data, and the dictionary need not to be transmitted over the network. Our proposed Improved Dictionary technique scans the data byte-wise, so that the chances of repetition of individual symbols are higher for text messages. Fixed length coding transmits fixed length codes for all dictionary entries. For bigger messages better optimization in terms of size reduction can be achieved through variable length coding with L-Z technique, where transmitted code length corresponding to individual dictionary entries will vary according to the requirement dynamically.

Smart Approach to Crawl Web Interfaces Using a Two Stage Framework of Crawler

Abstract: In present scenario, internet is very important part of our life. User searches a query according to his requirement using internet. There are large numbers of web resources are present on internet as well as its nature is dynamic, so providing better result, relevant to searched query and personalizing the search are the challenging issues in information retrieval. To handle these challenges, we propose a two-stage framework of crawler. In first stage, Smart crawler performs “Reverse searching” that matches user query with the URL of link from site database. In second stage, crawler performs “Incremental prioritizing” that matches the query content with web document. Then according to match frequency crawler classifies relevant and irrelevant pages and rank this page. Proposed crawler performs searching through personalized searching which is based on profession profile of user for searching data in your work field efficiently. The crawler performs the domain classification which allow user to know the contribution of standard resources in terms of documents searched by user. A separate log file is maintained by crawler considering a searching time issue. User will get pre-query result based on past search results while entering cursor in search box. Our objective is to design a Focused Crawler to efficiently search the site database and provide better result to the user.

Energy efficiency in wireless sensor network using Fuzzy rule and tree based routing protocol

Abstract: As the wireless sensor network (WSN) is consider, it is the huge network of low-cost micro sensors deploy in the environment. The main challenge in the design of WSN is to improve the lifetime of the network. Various activities are done in the sensor node which consumes lots of energy due to which there is a need to save energy of node. The battery of the node is difficult to recharge in wireless scenarios, due to this problem the energy efficient routing is used to solve these problems. To achieve the aim, we need not only to minimize total energy consumption along with this balance therouting loading WSN. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. We are proposing a Fuzzy rule based General Self-Organized Tree-Based Energy-Balance routing protocol (FGSTEB) which is based on the GSTEB, in this work we builds a routing tree for data transmission by selecting the appropriate routing path and relay node using fuzzy rules, fuzzy rules finds relaying node depending on their residual energy and the load on the node. Due to the dynamic nature of the FGSTEB protocol and performs the simulation according to different parameter in consideration. The main goal of the work is to improve the performance of GSTEB protocols by balancing energy consumption which prolonging the lifetime of WSN.

Millimeter-Wave Communication for Internet of Vehicles: Status, Challenges, and Perspectives

Abstract: The Internet of Vehicles has attracted a lot of attention in the automotive industry and academia recently. We are witnessing rapid advances in vehicular technologies that comprise many components, such as onboard units (OBUs) and sensors. These sensors generate a large amount of data, which can be used to inform and facilitate decision making (e.g., navigating through traffic and obstacles). One particular focus is for automotive manufacturers to enhance the communication capability of vehicles to extend their sensing range. However, the existing short-range wireless access, such as dedicated short-range communication (DSRC), and cellular communication, such as 4G, is not capable of supporting the high volume data generated by different fully connected vehicular settings. Millimeter-wave (mmWave) technology can potentially provide terabit data transfer rates among vehicles. Therefore, we present an in-depth survey of the existing research, published in the last decade, and we describe the applications of mmWave communications in vehicular communications. In particular, we focus on MAC and physical layers and discuss related issues, such as sensing-aware MAC protocol, handover algorithms, link blockage, and beamwidth size adaptation. Finally, we highlight various aspects related to smart transportation applications, and we discuss future research directions and limitations.

Review on different control techniques for induction motor drive in electric vehicle

Abstract: Now a day Electric vehicles (EV) are called future vehicles in place of internal combustion engines because of their working with pollution free and more efficient. This paper reviews various control strategies of induction motor drives (IMD) for EV applications. Efficiency and performance are the major considerations in selecting control algorithms for induction motor drives. Basically there are scalar control and vector control methods for IMDs. Scalar control technique has drawback of low performance. Conventional direct torque control (DTC) technique is one of the most preferable control technique for controlling torque and flux independently. But due the lower switching frequency in direct torque control leads to more flux ripple and torque ripples and it leads lower performance of induction motor drives.

Modified Floyd–Warshall’s Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty

Abstract: The main objective of this paper is to find the duration of maximum time connectivity of sensor nodes under uncertainty utilizing the prespecified voltage/power of each sensor node. Wireless sensor networks (WSNs) are composed of nodes that transmit data between each other over routing. A variety of routing protocols and algorithms exist, each related to a particular set of conditions. There are a variety of routing algorithms available, some of which can be used in WSNs for routing. The goal of the fastest distance routing algorithms in a WSN is to use the least amount of energy possible. In a WSN, Dijkstra’s algorithm is typically used for shortest path routing. The Floyd–Warshall’s algorithm is used to compute the shortest paths between distinct nodes in a regular graph, but due to the absence of a communication mode, this algorithm is not ideal for routing in wireless networks. In this research work, we have considered a WSN to find out the maximum connectivity time utilizing optimum voltage. On the other hand, duration of connectivity and energy/voltage are two vital parameters that are difficult to manage. Because of limited resources and safety concerns, safety implementation is limited. Also, due to the irregular/hazardous environmental situations, the distance between sensor nodes and its voltage to link up the nodes are totally unpredictable. In this work, we employ triangular fuzzy numbers to express unpredictability. Then, utilizing defuzzification of fuzzy numbers, the associated WSN problem was transformed into a crisp one. The widely used signed distance approach has been applied for the defuzzification of fuzzy numbers in this case. To determine the best outcome and to illustrate the usefulness of the suggested technique, a numerical example has been solved using the modified Floyd–Warshall’s algorithm. Finally, concluding remarks on the proposed approach as well as future studies have been provided.

A Real-Time Audit Mechanism Based on the Compression Technique

Abstract: Log management and log auditing have become increasingly crucial for enterprises in this era of information and technology explosion. The log analysis technique is useful for discovering possible problems in business processes and preventing illegal-intrusion attempts and data-tampering attacks. Because of the complexity of the dynamically changing environment, auditing a tremendous number of data is a challenging issue. We provide a real-time audit mechanism to improve the aforementioned problems in log auditing. This mechanism was developed based on the Lempel-Ziv-Welch (LZW) compression technique to facilitate effective compression and provide reliable auditing log entries. The mechanism can be used to predict unusual activities when compressing the log data according to pre-defined auditing rules. Auditors using real-time and continuous monitoring can perceive instantly the most likely anomalies or exceptions that could cause problems. We also designed a user interface that allows auditors to define the various compression and audit parameters, using real log cases in the experiment to verify the feasibility and effectiveness of this proposed audit mechanism. In summary, this mechanism changes the log access method and improves the efficiency of log analysis. This mechanism greatly simplifies auditing so that auditors must only trace the sources and causes of the problems related to the detected anomalies. This greatly reduces the processing time of analytical audit procedures and the manual checking time, and improves the log audit efficiency.

Entropy Adaptive On-Line Compression

Abstract: Self-Organization is based on adaptivity. Adaptivity should start with the very basic fundamental communication tasks such as encoding the information to be transmitted or stored. Obviously, the less signal transmitted the less energy in transmission used. In this paper we present a novel on-line and entropy adaptive compression scheme for streaming unbounded length inputs. The scheme extends the window dictionary Lempel-Ziv compression, is adaptive and is tailored to on-line compress inputs with non stationary entropy. Specifically, the window dictionary size is changed in an adaptive manner to fit the current best compression rate for the input. On-line Entropy Adaptive Compression scheme (EAC), that is introduced and analyzed in this paper, examines all possible sliding window sizes over the next input portion to choose the optimal window size for this portion, a size that implies the best compression ratio. The size found is then used in the actual compression of this portion. We suggest an adaptive encoding scheme, which optimizes the parameters block by block, and base the compression performance on the optimality proof of Lempel Ziv algorithm when applied to blocks. The EAC scheme was tested over files of different types (docx, ppt, jpeg, xls) and over synthesized files that were generated as segments of homogeneous Markov Chains. Our experiments demonstrate that the EAC scheme typically provides a higher compression ratio than LZ77 does, when examined in the scope of on-line per-block compression of transmitted (or compressed) files.