Conference Papers

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

Browse

Subject: search.filters.subject.Minimum spanning tree

Search Results

Now showing 1 - 3 of 3
  • 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
    Novel schemes for energy-efficient IoT
    (Springer Verlag service@springer.de, 2019) Venkateshwarlu, K.; Shetty D, D.
    Internet of things (IoT) is a global infrastructure for the information society which enables advanced services by interconnecting physical and virtual things based on existing and evolving inter-operable information and communication technologies. Developing green IoT is a difficult task because IoT has more devices and has complex structure, so most of the current schemes for deploying nodes in wireless sensor networks (WSNs) cannot be applied directly in IoT. In this paper, we propose a scheme which gives an energy-efficient IoT. Here, we propose two schemes for framework structure of a network, and then we propose clustering algorithms and routing algorithms for network formation which is based on minimum spanning tree. After numerous simulations, we show that these schemes result in minimal energy consumption and enhance the network lifetime. Thus, the proposed schemes are more energy-efficient compared to a typical WSN deployment scheme; hence, these schemes are applicable to the green IoT deployment. We show that in the proposed schemes, the nodes are alive for more number of rounds as compared to the existing algorithms. © 2019, Springer Nature Singapore Pte Ltd.
  • 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.