Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Has files: NoSubject: search.filters.subject.Graph theory

Search Results

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    A Privacy Preserved Data Mining Approach Based on k-Partite Graph Theory
    (Elsevier, 2015) Bhat, T.P.; Karthik, C.; Chandrasekaran, K.
    Traditional approaches to data mining may perform well on extraction of information necessary to build a classification rule useful for further categorisation in supervised classification learning problems. However most of the approaches require fail to hide the identity of the subject to whom the data pertains to, and this can cause a big privacy breach. This document addresses this issue by the use of a graph theoretical approach based on k-partitioning of graphs, which paves way to creation of a complex decision tree classifier, organised in a prioritised hierarchy. Experimental results and analytical treatment to justify the correctness of the approach are also included. © 2015 The Authors.
  • No Thumbnail Available
    Item
    Algorithms for minimizing the receiver interference in a wireless sensor network
    (Institute of Electrical and Electronics Engineers Inc., 2016) Shetty D, D.P.; Lakshmi, M.P.
    Limiting Interference between the nodes in a Wireless Sensor Network (WSN) is of considerable importance for energy-efficiency of the network. Minimizing the interference in a WSN minimizes the overall energy consumption of the network by reducing the number of conflicting transmissions. We consider Receiver interference minimization problem. Two types of interference are defined in a WSN, namely Sender interference and Receiver interference. In this paper we consider the Receiver interference problem, where the objective is to minimize the maximum Receiver interference. The problem of minimizing the maximum Receiver interference is proved to be NP-hard. In this paper we propose two algorithms named MinMax-RIP and a modified version of the same to minimize the maximum Receiver interference in a WSN. We evaluate the performance of our algorithms through simulation. We then consider the interference minimization problem in a broadcast network. We propose MinMax-BRIP algorithm for optimal range assignment which gives minimum total Receiver interference for connectivity predicate Broadcast. © 2016 IEEE.
  • No Thumbnail Available
    Item
    Optimizing set of paths connecting multiple source-sink pairs
    (Institute of Electrical and Electronics Engineers Inc., 2017) Agrawal, A.; Dixit, B.; Karve, V.U.; Chandavarkar, B.R.
    In this paper we aim to propose an algorithm for finding the most optimal path with some must-include nodes. The algorithm will be used to look for the best path that includes all the required nodes arranged in static topology in the most cost efficient way while keeping in mind the given constraint. We have developed the algorithm for nodes, where information about all nearby nodes is available beforehand. The main aim of the algorithm is to get the optimal paths between nodes with the given constraints. After getting all optimal paths, the algorithm will use a heuristic function to determine the best path out of the all paths as the final path. The main aim of our proposed methodology is to minimize the input resources to achieve the maximum output. For doing this we have proposed a method to combine multiple paths from a source to sink in one single optimal path, thus reducing the number of paths and achieving the same output. For developing this algorithm we have used concepts of graph theory, combinatorial optimizations and well known approach of Knuth for finding exact cover for given graph. © 2016 IEEE.