INTEGRATED DISTRIBUTED GRAPH THEORETICAL ALGORITHMS FOR COMPLEX WIRELESS NETWORKS
Project no. 187 · Status: Kapanmış · 2015
Summary
wireless sensor networks (WSNs) contain devices that can collect data from the environment with the help of sensors on it and can process these data and communicate with radio signals between each other. Since these devices are receiving energy from their batteries, it is very important to use their energy in a wise manner. It is very important to determine certain paths in TDA and to provide information to the root node. Topology control algorithms are algorithms that aim to create a backbone by reducing the connections between nodes in the network. In this context, creating a Breadth-First Search Tree (BFS) can reduce message traffic on the network. Vertex cover is one of the major problems of graph theory. In the case of the vertex cover problem, the edges of the graphs are covered by selecting nodes. With the help of the vertex cover, secure points are found in the TDA and the connections are monitored. In this study, the design of new algorithms for constructing BFS and vertex cover in WSN is presented. The goal is to provide energy efficiency by forming these two structures together. The theoretical complexities of the two proposed algorithms are calculated and compared with the existing two algorithms and compared with the help of simulations.