Efficient Algorithms for Multicast Tree Constructionin randomly placed WSN

Conference: Third International Conference on Current Trends in Engineering Science and Technology
Author(s): Manjunath C R, Nagaraja G S Year: 2017
Grenze ID: 02.ICCTEST.2017.1.141 Page: 813-817

Abstract

In wireless sensor networks where nodes are deployed in an environmental field equivalent to a battlefield or positioned at distinct areas where gathering of know-how or resource for difficult task. Construction of Multicast tree is major issue in randomly placed WSN, The Nodes are displayed in static and deterministic manner. Using MATLAB as simulator tool multicast tree construction is studied and constructed for different application study, It is observed that based on the number of nodes and iterations combinations added in the wireless sensor network kruskal algorithm is the most efficient one with less energy consumption for smaller and medium scale network size, WSN with randomly placed nodes are deployed across the network topology and then a source node is selected inturn to find the shortest distance to all the destination nodes in the network. In this paper a different tree construction algorithm is simulated and studied by varying the number of nodes in the mesh based wireless sensor network.

<< BACK

ICCTEST - 2017