Distributed algorithms to improve reliability in wireless ad hoc networks using connected dominating set

Abstract

Wireless ad hoc network plays a significant role in the field of communication. Due to the dynamic movement of nodes, the network infrastructure is frequently changed and the topology is unpredictable. The fundamental problem with the wireless ad hoc network is the topology control, where the reliability and efficiency of network can be obtained by constructing a virtual backbone using a connected dominating set. The main goal of the thesis is to study and provide distributed algorithms that satisfy multiple objectives for obtaining fault tolerant network. Initially, the dominating set is obtained by the repeated deletion of nodes from the network and thereby, the nodes with high reliability factor are considered as the Connected Dominating Set (CDS) nodes obtained by the marking process (the nodes are marked as WHITE, BLACK and GRAY). The node reliability is calculated based on the residual energy of different dominating sets. Then, the redundant nodes are removed by the pruning technique considering node ID and node degree. The resulting black nodes (dominator node) form the CDS nodes named R CDS, through which routing process is carried out efficiently. Experimental results show that this technique yields best solutions to increase the network lifetime with reduced CDS size. newlineNext, a distributed algorithm to reduce frequent route failures is developed by incorporating route stability into routing which helps to sustain network operations over an extended period of time. Here, a subset of network node named Weighted Connected Dominating Set (W CDS) is selected based on the stability factor, which consists of link stability, node degree and mobility to achieve the maximum network lifetime. Then, the redundant nodes are removed by the pruning technique considering energy parameter. newline