This program simulates the greedy algorithm for balanced set load equilibria proposed by J He et al. Whose basic purpose is to serve as a virtual backbone for the wireless sensor network.
In an efficient design of routing protocols in ad hoc wireless networks, the connected set of dominant (CDS) is widely used as a virtual backbone. In order to construct the CDS with its size at least, in the last years many heuristic, metaheuric, greedy approaches and distributed algorithms have been proposed. These approaches were mainly focused on obtaining an independent set and then building the CDS using Steiner tree and also these algorithms work well only for graphics that have fewer nodes and also for the nets that are generated in A 2D simulation area. This paper provides a new approach to the construction of CDS, based on the concept of total set of dominant and bipartite theory of graphics. Since the total dominator set is the best lower limit for the CDS, the proposed approach reduces the computational complexity to construct the CDS through the number of iterations. In addition, the simulation conducted reveals that the proposed approach finds a better solution than the newly developed approaches when the three important factors of the ad hoc network, such as number of nodes, transmission radius and network density area, vary.