Please use this identifier to cite or link to this item:
|Title:||Range assignment with k-power levels in a Wireless Sensor Network|
|Citation:||2018 IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2018 - Proceedings, 2019, Vol., , pp.18-23|
|Abstract:||Energy minimization in Wireless Sensor Network (WSN) has gained the attention of several researchers because of its diverse applications in the real world. Optimization in power assignment increases the lifetime of a network. Available sensor nodes operate with a set of discrete power levels in which each sensor node can be assigned with one of the power levels from the given set. Dual power assignment problem was studied by researchers in which only two power levels are available for assignment in a WSN. As the Dual power assignment problem is proved to be NP-hard, several approximation algorithms were proposed. We consider k-power level assignment problem for a given set of sensor nodes with the objective of minimizing the total power assigned to the network provided each sensor node is assigned a power level only from the given set. We propose two heuristic algorithms; one is based on Euclidean Minimum Spanning Tree (MST) and the other is an Incremental Heuristic which runs in polynomial time. We present the simulation results to compare and analyze the proposed algorithms. We also conduct the experiments for various number of nodes by varying the number of power levels. � 2018 IEEE.|
|Appears in Collections:||2. Conference Papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.