Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Filters

20192

Settings

Author: search.filters.author.Lakshmi, M.Subject: search.filters.subject.Minimum spanning tree

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Minimizing the total range with two power levels in wireless sensor networks
    (Springer Verlag service@springer.de, 2019) Shetty D, D.; Lakshmi, M.
    Minimizing the total energy consumed by wireless sensor network (WSN) is a significant problem, since the sensor nodes are attached with a small battery of restricted capacity. In a WSN, any pair of sensor nodes must be able to communicate with each other in the network, so bidirectional connectivity of WSN is an important characteristic to be achieved. The range assignment problem in a WSN aims to assign transmission range to each sensor node of the network such that the specified connectivity constraints such as strong connectivity, k-connectivity are to be satisfied by the reduced network. Most sensors in recent days operate with discrete power levels. So, in this paper, we consider the range assignment problem with two power levels. Our aim is to assign each sensor node in the network with one of the available set of power levels such that the reduced topology is strongly connected and the total power consumption is minimized. The dual power assignment problem is well studied in the literature. We present an improved algorithm for dual power assignment problem in which the power levels are taken as input. Performance of the proposed algorithms is analyzed through extensive simulation. We establish the theoretical approximation ratio bound of the proposed algorithm for dual power assignment problem as 2. But, the simulation results indicate that the performance ratio is much less than 2. © 2019, Springer Nature Singapore Pte Ltd.
  • No Thumbnail Available
    Item
    Minimizing the maximum sender interference by deploying additional nodes in a wireless sen- sor network
    (Indonesian Combinatorics Society ebaskoro@math.itb.ac.id, 2019) Shetty D, D.; Lakshmi, M.
    Interference is one of the major challenges faced by communication networks. Since the inter- ference leads to packet loss, packet collision and data re-transmission, higher the interference, higher is the energy consumption. Several algorithms were proposed for reducing the interference in a wireless sensor network (WSN). By deploying additional nodes at an appropriate position in a WSN, it is possible to reduce the interference. We propose an algorithm in which, the main objective is to reduce the maximum Sender interference by deploying the additional nodes in the network, while the connectivity of the network is preserved. We use the properties of Gabriel graph to achieve the reduction in interference. We present the simulation results which show the number of additional nodes to be deployed. The comparison of the maximum Sender interference obtained by the proposed algorithm with that of the Euclidean minimum spanning tree (MST) of the given network is presented through simulation. We show that the additional number of nodes required for deployment has an upper bound of n=2, where n is the number of nodes. We also compute the average reduction in Sender interference of the network for a various number of nodes. © 2019 Indonesian Combinatorics Society.