Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph

Wireless Sensor Networks (WSNs) is a distributed wireless network which consists of a large number of small (sensor) nodes with sensing, computation and wireless communication capabilities. These sensor nodes work together to monitor various applications and they communicate with each other in multiple hops or directly, with the objective of handing over the processed data to the sink node or access point (AP). WSNs have many issues like self-configuration, faulttolerance, adaptation, flexibility, energy efficiency, security, scalability, interference, architectural issues, mobility and delay tolerance but the most critical and important issue is to reduce energy wastage and interference and increasing network lifetime [1,2, 3]. In order to manage these issues, WSNs require some virtual backbone. A Connected Dominating Set (CDS) can be used to create a virtual backbone in WSNs [5,6,7,8, 9,10]. The CDS is a dominating set which induces a connected subgraph. A maximal independent set is an independent set that is not a subset of any other independent set [7,8]. In this paper, proposed a MICDS (Maximal Independent Connected Dominating Set) algorithm for the WSNs, which are based on the construction of the maximal independent set (MIS) of the representing network graph. There are two different steps in the implementation of MICDS algorithm. In the first phase, the maximal independent set of the network is constructed. In second phase, the dominating set and connectors for the dominating set are constructed using MIS. Using the dominating set and connectors, all the data is transmitted to the sink node or access point (AP). The simulation results indicate that the MICDS algorithm reduce the interference and energy wastage in the network graph, further it also increases the lifetime of the network.