K. Suresh Joseph

Handling hidden and exposed terminal problems using agent based access schema

Ad hoc network is a collection of wireless nodes dynamically forming a topology without any existing infrastructure. Because of the absence of locality, it is highly open to number of hidden and exposed terminal problems. Hence it is essential to design a MAC protocol with more consideration. In this paper, a mobile agent based MAC is introduced which roaming across the network, gathering information about dynamically changing environment. The main purpose of this paper is to ease the hidden and exposed terminal problems.

Variants of travelling salesman problem: A survey

The Travelling Salesman Problem (TSP) is a well-known NP-hard problem exceedingly studied in the fields of operations research and computer science. In TSP, a salesman wants to visit each of a set of cities exactly once and return to the starting city with minimal distance travelled. The significance of the TSP is that it can be pertained on many practical applications in real life scenario. But, it is not always possible to apply TSP for all the real world applications because of different constraints and also variations of TSP might be desired in such real-life scenarios. Therefore, several variants of TSP have been proposed to manage with the application specific constraints. In this work, a comprehensive study on various categories of TSP variants such as Profit Based, Time Windows based, Maximal Based and Kinetic Based has been studied with respect to the problem formulation and applications.

A hybrid population seeding technique based Genetic Algorithm for stochastic Multiple Depot Vehicle Routing Problem

Vehicle Routing Problem (VRP) has wide applications in logistics and supply chain management and thus is one of the widely studied problems in the field of Operational Research. It is also a NP-hard combinatorial optimization problem and many different kinds of algorithms and techniques have been proposed to solve VRP. There are many types of VRP and this paper concentrates on two variants: Multiple-Depot Vehicle Routing Problem (MDVRP) and Stochastic Vehicle Routing problem (SVRP). While both MDVRP and SVRP enjoy wide popularity in literature, a combination of these two is not yet explored. The objective of this paper is to solve for MDVRP with stochastic travel times using a metaheuristic procedure in Evolutionary Computation called Genetic Algorithms (GA). A new hybrid population seeding technique is proposed for generating feasible solutions in the initial population. A randomized initial population generation technique is used to compare with the proposed hybrid population seeding technique and the results are compared. The results clearly conclude that the hybrid population seeding technique clearly yields better solutions in terms of time needed and distance travelled to serve the customers.

Page ranking algorithms used in Web Mining

The world wide web is expanding, everyday huge amount of data is added to the web. Finding relevant information in the web is becoming a difficult task. Web Mining is the process of analysing and mining the web to find useful information. By web mining we extract information that are implicitly present in the web. Web Mining is classified into Web Content Mining (WCM), Web Structure Mining (WSM), Web Usage Mining (WUM) based on the type of data mined. Web Structure Mining analyses the structure of the web considering it as a graph. WSM can be used to rank pages present in the web, to improve the efficiency of search engines. This paper discusses about Web Mining, its types, and various ranking algorithms used in Web structure Mining.

Research on QoS aware dynamic reconfiguration and performance measures in VANET

Vehicular Ad-Hoc Network (VANET) became known in wireless networks to influence the importance in growth of the transportation system. In VANET several QoS related routing protocols are available. At the moment, VANET be-comes a worlds biggest ad-hoc network. The parameters of Quality of Service (QoS) generally depends on layers such as MAC layer and physical layer in Vehicular Ad-Hoc Network. Managing the QoS in VANET is critical due to the movement of nodes. Many challenges are available in vehicular communication among them the most important issue is attaining the QoS. QoS advances the level of implementation. It specifies strong paths between the vehicles. QoS disputes are communication time span and packet delivery ratio. The safety and other major applications in VANET depends on QoS. In this paper, we survey some of the QoS parameters and QoS associated protocols and algorithms.

A survey on stochastic vehicle routing problem

In this paper, a literature survey has been conducted on a specific type of vehicle routing problem called as the stochastic vehicle routing problem (SVRP). SVRP is of great importance because it models most of the real world applications in vehicle routing. This paper reviews the two widely used modeling paradigms used to solve SVRP - the re-optimization model and the a-priori optimization model along with the different classes of algorithms used to realize these models.

Score level fusion of iris and Finger knuckle print

Multimodal biometrics is an evolving technology in the fields of security. Biometrics system reduces the effort of remember a memorable password. Multimodal biometrics system uses two or more traits for efficient recognition. In this paper, a novel idea is proposed by combining IRIS and Finger knuckle print for recognition. The texture pattern present in IRIS and Finger Knuckle print are distinct when combining both the patterns will become highly distinctive. The two traits were captured using sensors and the features were extracted using Haar Wavelet for IRIS and Linear Discriminant Analysis for Finger Knuckle Print. Both the extracted features were fused at score level. The experimental results has been observed in terms of False Acceptance Rate, False Rejection Rate, Genuine Acceptance Rate and Total Error Rate.

PSO assisted OLSR Routing for Cognitive Radio Vehicular Sensor Networks

The recent advances in Wireless Sensor Network (WSN) has paved the way for Vehicular Sensor Network (VSN) for the effective functioning of urban environment monitoring and enabling sharing of sensitive sensor information among vehicles for safety assistance and other commercial applications. The delivery of relevant sensor information in these applications is time constrained and requires efficient data dissemination techniques to route the packet to appropriate destinations. VSNs frequently suffer from topology modifications due to the high mobile nature of vehicles. The existing reactive routing protocols in vehicular networks that work on-demand fails due to its functional limitations and existing table-driven routing protocols such as OLSR that work proactively to reduce the frequency of rerouting are unable to match the huge requirements of high mobile vehicular applications. Generally data transmissions in sensor networks experience frequent fluctuations in its operating licensed spectrum and obtain multiple channels for transmission of high bandwidth data. The overutilization of the spectrum band results in scarcity of the accessible spectrum resources. Current experiments with OLSR do not consider channel conditions and channel utilization during route calculation. One possible solution to this routing problem is to exploit the spectrum hole, which is the frequency bands not in use and opportunistically utilize them by providing Cognitive Radio (CR) assistance to OLSR for deciding the optimal path. This paper presents a PSO assisted optimal OLSR routing for efficient data communication using Cognitive Radio enabled Vehicular Sensor Networks (CR-VSNs), which takes into account of the user mobility and PU interference during the calculation of link duration among the forwarders. The proposed model was tested under simulated traffic of Chennai urban road map. Delay is observed to be minimal for data communications in CR-VSN.

Hybrid bat inspired algorithm for multiprocessor real-time scheduling preparation

Real Time Processor Scheduling with no preemption of tasks is a class NP-hard problem. We have attempted to get the best task allocation schedule for sporadic tasks, such that all the tasks are being scheduled without missing its deadline. Bat algorithm was proposed from the motivation behind the bats echolocation behaviour. Bat Searches for the prey in the given search location once found it tries to catch it by converging towards the direction of the prey. The existing system comprises of multiprocessor scheduling using bat algorithm which has been proved to be very efficient. Based on it we have proposed a modernistic algorithm to solve the Multi-objective multiprocessor scheduling algorithm of a soft real time scheduling system for both periodic and sporadic tasks that is completely scalable in nature. We have considered two objectives which are the maximum processor utilisation and minimised deadline miss. We have conducted experiments with several instances and found out that we are able to schedule the tasks by balancing both the objectives with the probability of 100% in arriving to the optimised schedule of the given tasks.

An Iris Based Reversible Watermarking system for the security of teleradiology

To improve the security of medical data and also transfer the medical images and their information among, the radiologist and physicians for concerning is termed as Teleradiology. Maintaining a secure environment is a challenging for Teleradiology from various issues like malpractice liability and Image Retention etc. To overcome these issues and also to maintain secure transformation of medical data, we propose a combined novel system using Biometrics, encryption and watermarking method termed as, “An Iris Based Reversible Watermarking for the security of Teleradiology”. Here, we use CIA mechanism for medical information and also for medical image transformation. Enrollment and Embedding process is carried out for the addition of users and their information. Verification and Extraction process is carried out for the authentication of information identity.