&ldquo;IIT Jodhpur is committed to impart quality education to facilitate the creation of qualified, competent and responsible human resources to meet the emerging technological challenges of the world. It is working towards creating an equitable learning platform that is positive, accessible and effective in the face of the modern societal and scientific advancements.

Flexibility in curriculum, in all its academic programs, encompassing elements of teaching, research, creativity, innovation and entrepreneurship is the most unique feature of IIT Jodhpur. The Department of Science and Technology (DST), under the National Mission on Cyber Physical Systems, has identified IIT Jodhpur as a Technology &amp; Innovation Hub in the area of Augmented Reality and Virtual Reality. The institute has also been nominated as the coordinator for the Jodhpur City and Knowledge Cluster by the Office of Principal Scientific Adviser, Government of India.

The sprawling 852-acre IIT Jodhpur campus is a majestic tribute to the deep-rooted diverse cultural heritage of the region. The campus is an architectural masterpiece, which is slated to become an international exemplar of sustainability with net-zero energy, and advanced water and waste management strategies.&rdquo;

IIT Jodhpur

Social network being one of the most disruptive innovation has gathered a huge amount of attention of the people within the last decade. The posts of the users on the social media are used by many companies in the world to find the mentality of the users, the current trend of the market and many more things. But still there is a latent potential in social network. One of the aspect that we were able to discover was of finding the relationship between the users (especially, the negative link) on the social network using the posts that the users make and the reaction of the other users towards it. The prediction of negative link can be applied in cyber-security field, to observe the aberrations in the network and further find the malicious nodes in the social network; say, if two nodes are are having a link between them even though there is no relation between them. It can also be used for improving the recommendation system in social media, as if there is some probability between the two nodes of being enemy or disliking each other then we can remove them from each other's recommendation list or could assign a lower weight to them in our recommendation algorithm. To achieve all this relationship between the nodes we first need to find whether the user is posting posts with positive emotion (like happy, excited, etc.) or negative emotion (like angry, sad, etc.) so that we can further analyze the mentality of the user and use it to recommend the people who we have previously classified with the similar personality. For that we have used the sentimental analysis which divides the users into five simple categories: Highly Positive, Positive, Neutral, Negative and Highly Negative. This research paper explains the methodologies that we have used to achieve the prediction of negative links between the nodes in the social network. © 2016 ACM.

World University root node

Department of Computer Science & Engineering

ACM International Conference Proceeding Series

Algorithm for prediction of links using sentiment analysis in social networks

Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to which several problems arise during broadcasting. Two major problems faced are namely, Broadcast Storm Problem and Disconnected network problem. In a highly dense network, if information is being flooded in a loop, it could lead to broadcast storm. The broadcast storm may eventually crash the entire network and lead to loss of information. Mobility of the nodes may lead to the problem of Disconnected Network. If the two nodes sending and receiving information are mobile with different speeds, it could lead to a disconnection between them as soon as the receiver moves out of the communication range. In this paper, we are trying to solve both the problems based on our proposed algorithms. © 2015 IEEE.

International Conference on Electrical, Electronics, Signals, Communication and Optimization, EESCO 2015

Improvised broadcast algorithm for wireless networks

Geographic routing scheme (such as Greedy perimeter stateless routing) makes use of location information to forward packets greedily. Nodes need to keep only this location information in stateless routing. When the greedy forwarding fails, routing switches to perimeter forwarding based on either planar graph (GG and RNG) or cross link detection protocol approaches. However, it has drawback in terms of cost and computational overheads. We propose a coverage-tree heuristic based routing instead of face routing in geographic routing schemes when greedy forwarding fails. We prove that the coverage tree based routing problem is NP hard by reduction using minimum rooted spanning tree of depth 2 (RST 2). We also show that coverage-tree based geographic routing problem is APX hard and not approximable with a factor of (1-∈)lnn for any fixed (Formula Presented.). Our proposed scheme of coverage-tree heuristics based geographic routing is (Formula Presented.)-approximation algorithm, a polynomial time algorithm using minimum distance topology knowledge. On performance comparison using simulation, our proposed scheme outperforms with the competitive schemes in term of success rate, network overhead and success rate against varying node density. © 2014, Springer Science+Business Media New York.

Wireless Networks

Approximating geographic routing using coverage tree heuristics for wireless network

The vehicular ad-hoc networks (VANETs) encountered frequent handoff due to high mobility of vehicles. The existing schemes are based on the context transfer for fast handoff, but needs to reduce the latency of handoff for VANETs. Fast handoffs in vehicle scans at any instance of time depends upon the association pattern of the AP. In this paper, we have proposed proactive approach for fast handoff using access point (AP) in VANETs. The fast handoff algorithm using AP graph with multiple vehicles for VANETs improves the re-association latency and context transfer procedure must be singled out from re-association process. From the simulation studies, we find that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases. The protocol for context transfer is defined in inter-access point protocol (IAPP), which infuses proactive transfer technique for frequent handoffs. Copyright © 2015 Inderscience Enterprises Ltd.

International Journal of Communication Networks and Distributed Systems

Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs

Apriori Algorithm is one of the most important algorithm which is used to extract frequent itemsets from large database and get the association rule for discovering the knowledge. It basically requires two important things: minimum support and minimum confidence. First, we check whether the items are greater than or equal to the minimum support and we find the frequent itemsets respectively. Secondly, the minimum confidence constraint is used to form association rules. Based on this algorithm, this paper indicates the limitation of the original Apriori algorithm of wasting time and space for scanning the whole database searching on the frequent itemsets, and present an improvement on Apriori. © 2015 The Authors.

Fulltext

Procedia Computer Science

Improvised apriori algorithm using frequent pattern tree for real time applications in data mining

This paper attempts to find an optimization algorithm to reduce number of iterations required for a node to be searched in a MultiCast Tee network. After effectively searching the node, it applies this technique in cloud computing, more exactly, cloud information security so that data is safely transferred from one user to another, without any hindrance. The basic idea to incorporate the concept of MultiCast Tree is because it always supports reliable transmission of information, if by any chance, there is a link failure, it does not reduce the availability of resources, nor does it increase any delay in transmission of information, and at the same time minimizes work load. Thus, we can effectively use it in cloud computing, which is nothing but provision of resources to a pool of users through some kind of an interface, for example, Internet. While monitoring the distributed foundation establishment of cloud computing, it becomes extremely important to take into consideration the security of the information provided by users. If we use a vast number of nodes or links, it becomes practically impossible to trace the reliability of transmission, and which might result in important information getting lost. Hence to avoid such a consequence, it becomes necessary to optimize the number of these links, so that it becomes easier to search them in a minimum amount of time. Our main attempt has been to optimize these links and effectively use it in a communication network which has characteristics of a MultiCast Tree incorporated in it. This not only helps in efficient use of cloud computing system, but also ensures users that their data is in safe hands. © 2015 IEEE.

Application of MultiCast Tree concept to cloud security with optimization algorithm for node search technique

The Geographic Perimeter Stateless Routing (GPSR)use location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. When Greedy Forwarding is fails, the algorithm recovers by switching to face routing, which is based on the right-hand rule in planarized node graph, to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for planarization but may lead to graph partitioning. Alternatively, instead of switching to face routing and planarizition, the existing Greedy Distributed Spanning Tree Routing(GDSTR) scheme enables nodes to continue routing by traversing on a spanning tree until it reaches a point where greedy forwarding can take place. GDSTR sometimes incorporates two spanning trees although it uses only one. So, in this work, we proposed new tree selection algorithm in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes. © 2014 IEEE.

2014 Recent Advances in Engineering and Computational Sciences, RAECS 2014

Improvised tree selection algorithm in Greedy Distributed Spanning Tree Routing

An inter-vehicle communication (IVC) systems has the potential to increase the safety, efficiency and comfort of everyday road travel in VANETs. In this paper we proposed a efficient Vehicle-to-Vehicle(V2V) communication protocol for avoid the collisions in VANETs. This protocol reduces the number of road accidents by providing early warnings messages and it also reduces the latency in delivering emergency warnings messages in various road situations in VANETs. We have given simulations results for the proposed protocol reducing latency in delivering emergency warnings messages and efficient bandwidth usage in stressful road scenarios in VANETs because we use the vehicle-to-vehicle communication concept. © 2014 IEEE.

Efficient vehicle to vehicle communication protocol for VANETs

A Cellular Automata (CA) is a computing model of complex System using simple rules. In this paper the problem space is divided into number of cells and each cell can be constituted of one or several final state. Cells are affected by neighbors with the application of simple rule. Cellular Automata are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of local relation. In this paper CA is applied to solve a bridge traffic control problem. Vehicular travel which demands on the concurrent operations and parallel activities is used to control bridge traffic based on Cellular Automata technique. © Springer International Publishing Switzerland 2014.

Smart Innovation, Systems and Technologies

Parallel Processing Concept Based Vehicular Bridge Traffic Problem

Geographic Perimeter Stateless Routing (GPSR) use local information to forward packets greedily. Nodes need to keep only this information, hence called as stateless. When not possible the algorithm and Greedy forwarding recovers to this scenario by switching to face routing, which is further based on the right-hand rule in the planarized node graph, in order to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for the planarization, but results in graph partitioning. In this work, we propose an improvised RNG-GG algorithm which makes sure to avoid the partitioning of the underlying connected graph and the cross-link, which remain in the node connectivity graph. We have given simulation results for the performance analysis of our proposed protocol compared to the competitive schemes and found improvement in terms of an increased packet delivery success rate, reducing routing protocol overhead and increased the path length. © 2013 IEEE.

2013 IEEE Recent Advances in Intelligent Computational Systems, RAICS 2013

Improvised geographic scheme for greedy perimeter stateless routing

Geographic Perimeter Stateless Routing (GPSR) makes use of location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. There are two graphs used for the planarization namely the Gabriel Graph (GG) and the Relative Neighbourhood Graph (RNG) but they were very expensive and had to be run for each node whenever greedy forwarding failed. So it was further replaced by CLDP, however it also suffered from drawbacks both in terms of cost and complications. Here, we propose a cost-effective scheme which makes use of k-hop neighbourhood knowledge and this heuristic is applied when greedy forwarding fails and is used instead of face routing and planarization. Moreover it proves to be better than planarization in most of the cases. © 2013 IEEE.

Proceedings - 2nd International Conference on Advanced Computing, Networking and Security, ADCONS 2013

Improvised k-hop neighbourhood knowledge based routing in wireless sensor networks

In this paper, we have proposed proactive approach for fast-handoff using Access Point (AP) in Vehicular Ad-hoc Network (VANET). The existing schemes are based on context transfer for fast hand-off, but needs to reduce the latency of hand-off for VANETs. Fast hand-off in vehicle scans only the selected AP at any instance of time depending upon the association pattern. The Fast Hand-off Algorithm using AP Graph with Multiple Vehicles for VANET improves the re-association latency and context transfer process must be separated from reassociation process. From experimental and simulation results, we find that the use of AP graphs reduces the handoff latency due to re-association process and that the effectiveness of the approach improves dramatically as user mobility increases. The context transfer process for proactive fashion is used for fast handoff and reducing the context transfer latency of handoffs. The Inter-Access Point Protocol (IAPP) protocol is called the context transfer protocol. © 2013 IEEE.

2013 Annual IEEE India Conference, INDICON 2013

Proactive approach based fast handoff algorithm for VANETs

This paper develops a production-inventory model for a deteriorating item with stock-dependent demand under two storage facilities over a random planning horizon, which is assumed to follow exponential distribution with known parameter. The effects of learning in set-up, production, selling and reduced selling is incorporated. Different inflation rates for various inventory costs and time value of money are also considered. A hybrid genetic algorithm is designed to solve the optimization problem which is hard to solve with existing algorithms due to the complexity of the decision variable. To illustrate the model and to show the effectiveness of the proposed approach a numerical example is provided. A sensitivity analysis of the optimal solution with respect to the parameters of the system is carried out. © 2010 Springer-Verlag.

Central European Journal of Operations Research

Two-warehouse production model for deteriorating inventory items with stock-dependent demand under inflation over a random planning horizon

A Cellular Automata (CA) is a computing model of complex system using simple rule. CA divides the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbors to the simple rule. This paper provides a survey of available literature of some methodologies employed by researchers to utilize the cellular automata for modeling purpose. The literature survey introduces the different type of cellular automata being used for modeling and also tries to present the different fields in which CA have been applied. © 2012 Springer-Verlag.

Communications in Computer and Information Science

A survey on cellular automata and its applications

Programmable Cellular Automata (PCA) employs some control signals on a Cellular Automata(CA) structure. Programmable Cellular Automata were successfully applied for simulation of biological systems, physical systems and recently to design parallel and distributed algorithms for solving task density and synchronization problems. In this paper PCA is applied to develop cryptography algorithms. This paper deals with the cryptography for a parallel AES encryption algorithm based on programmable cellular automata. This proposed algorithm based on symmetric key systems. © 2011 Springer-Verlag.

A parallel AES encryption algorithm based on PCA

A Cellular Automata (CA) is a computing model of complex System using simple rule. In this paper the problem space is divided into number of cell and each cell can be one or several final state. Cells are affected by neighbor's with the application of simple rule. This paper deals with the Cellular Automata in cryptography for a class of Block Ciphers through a new block encryption algorithm based on programmable cellular automata.The proposed algorithm belongs to the class of symmetric key systems. © 2010 Springer-Verlag Berlin Heidelberg.

Encryption algorithm for block ciphers based on programmable cellular automata

Image Segmentation refers to the process of partitioning a digital image into multiple segments. The goal of segmentation is to simplify and change the representation of an image into something that is more meaningful and easier to analyze. A Cellular Automata (CA) is a computing model of complex system using simple rule. It divides the problem space into number of cells and each cell can be in one or several final states. Cells are affected by its neighbor's to the simple rule. Learning Cellular Automata (LCA) is a variant of automata that interact with random environment having as goal to improve its behavior. This paper proposes an image segmentation technique based on LCA using soft computing approach. This proposed method works in two steps, the first step is called as soft segmentation where the input image(s) is/are analyzed through LCA and the second step is called as soft computing approach where the analyzed image is segmented through fuzzy C-means algorithm. © 2010 American Institute of Physics.