Graph Based Modeling Approach for Wireless Sensor Networks

Abstract

Wireless Sensor Networks (WSN) combines the wireless communication and the limited computing facility in order to measure the physical phenomenon such as, temperature, pressure, rainfall, smoke, movement etc. In WSN, there are no fixed or predefined infrastructures. Hence nodes in WSN communicate via sharing the medium, either through 1-hop or multi-hops. Such sharing reduces the network performance due to interference and at the same time it raises energy consumption since packet retransmission is needed. Energy consumption can also be increased if do not limit the number of active nodes used for the multi relays. So backbone can be utilized to address the above problem. Backbone will remove unnecessary transmission links by shutting down some of the redundant nodes and still guarantee network connectivity in order to deliver the packet efficiently. A backbone reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption and at last increases network effective lifetime in a WSN. In this report we have summarized a algorithm based on Connected Dominating Set (CDS) to construct a Backbone. We have also classified and compared two Backbone Construction Techniques. Finally in our project we have implemented a Backbone Construction Technique using C language and then we have shown how any node in a network/backbone gets abandoned because of loss of energy and finally we worked on patching technique which solves a connectivity issue of a backbone. Dominating sets have proven to be an e®ective construct within which to solve a variety of problems that arise in wireless networks. Applications that use dominating sets include media access coordination, unicast and multicast routing, and energy effciency. A CDS could perform similar actions through forming a virtual network infrastructure. However, signifcant issues must first be addressed including the real-time assurance of the trustworthiness