Construction of an Energy-Efficient Detour Non-Split Dominating Set in WSN

Abstract

Wireless sensor networks (WSNs) are one of the most important improvements due to their remarkable capacities and their continuous growth in various applications. However, the lifetime of WSNs is very confined because of the delimited energy limit of their sensor nodes. This is the reason why energy conservation is considered the main exploration worry for WSNs. For this energy-efficient routing is required to save energy and to subsequently drag out the lifetime of WSNs. In this report we use the Ant Colony Optimization (ACO) method and are evaluated using the Genetic Algorithm (GA), based on the Detour non-split dominant set (GA) In this research, we use the energy efficiency returnee non-split dominating set (DNSDS). A set S ⊆ V is supposed to be a DNSDS of G when the graph G = (V, E) is expressed as both detours as well as a non-split dominating set of G. Let the detour non-split domination number be addressed as γ _dns (G) and is the minimum order of its detour non-split dominating set. Any DNSDS of order γdns(G) is a γdns-set of G. Here, the γ _dns (G) of various standard graphs is resolved and some of its general properties are contemplated. A connected graph usually has an order n with detour non-split domination number as n or n – 1 are characterized. Also connected graphs of order n ≥ 4 and detour diameter D ≤ 4 with detour non-split dominating number n or n − 1 or n − 2 are additionally portrayed. While considering any pair of positive integers to be specific a and b, there exists a connected graph G which is normally indicated as dn(G) = a, γ (G) = b and γdns(G) = a + b − 2, here γdns(G) indicates the detour domination number and dn(G) indicates the detour number of a graph. The time is taken for the construction and the size of DNSDS are considered for examining the performance of the proposed method. The simulation result confirms that the DNSDS nodes are energy efficient.