Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
Search Results
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.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.Item A novel meta-heuristic differential evolution algorithm for optimal target coverage in wireless sensor networks(Springer Verlag service@springer.de, 2019) Naik, C.; Shetty D, D.A wireless sensor network (WSN) faces various issues one of which includes coverage of the given set of targets under limited energy. There is a need to monitor different targets in the sensor field for effective information transmission to the base station from each sensor node which covers the target. The problem of maximizing the network lifetime while satisfying the coverage and energy parameters or connectivity constraints is known as the Target Coverage Problem in WSN. As the sensor nodes are battery driven and have limited energy, the primary challenge is to maximize the coverage in order to prolong network lifetime. The problem of assigning a subset of sensors, such that all targets are monitored is proved to be NP-complete. The Objective of this paper is to assign an optimal number of sensors to targets to extend the lifetime of the network. In the last few decades, many meta-heuristic algorithms have been proposed to solve clustering problems in WSN. In this paper, we have introduced a novel meta-heuristic based differential evolution algorithm to solve target coverage in WSN. The simulation result shows that the proposed meta-heuristic method outperforms the random assignment technique. © 2019, Springer Nature Switzerland AG.Item ECABBO: Energy-efficient clustering algorithm based on Biogeography optimization for wireless sensor networks(Institute of Electrical and Electronics Engineers Inc., 2019) Nomosudro, P.; Mehra, J.; Naik, C.; Shetty D, D.Cluster-based communication design is an assuring technique in wireless sensor networks to reduce energy consumption and enhance scalability. The requirement of data collection from neighbor nodes, data gathering, and data forwarding to the sink overloads each cluster head. Therefore, it is a highly significant issue to elect a set of optimal cluster heads from the normal sensor nodes. In this paper, the Biogeography Based Optimization for energy-efficient clustering is introduced for cluster head selection. The simulation outcomes show that the algorithm improves the network endurance as compared to other protocols such as Genetic algorithm, Low energy adaptive clustering hierarchy, and Clustered Routing for Selfish Sensors. © 2019 IEEE.