Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
2 results
Search Results
Item Improved Algorithm for Minimum Power 2-Connected Subgraph Problem in Wireless Sensor Networks(Institute of Electrical and Electronics Engineers Inc., 2018) Lakshmi, M.; Shetty D, D.A Wireless Sensor Network (WSN) consists of small sensor nodes which communicate with each other using wireless radio channel and are used to monitor certain environmental parameters. Since the nodes are powered by a small battery of limited capacity, it is important to minimize the energy consumption in a WSN. By using an appropriate topology the energy utilization of the network can be minimized which results in an increased lifetime of a WSN. In practice, the transmission power of a sensor node can be tuned to obtain a required topology that satisfies certain connectivity constraints and this problem is known as Range Assignment Problem. For a given network, a reduced topology is constructed satisfying some connectivity constraints like k-connectivity, bounded diameter etc. Fault tolerance addresses the issue of node or link failure which aims at k-connectivity so that, the network has at least k vertex disjoint paths between any two nodes of the network. With the motivation of achieving fault tolerant network with minimum transmission energy, we consider Minimum power 2-connected subgraph (MP2CS) problem which is proved to be NP-hard. A polynomial time heuristic is proposed in this paper for the MP2CS problem and simulation is performed to compare with the existing algorithm. © 2018 IEEE.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.