Performance of Algorithms using Domination Theory in Wireless Sensor Network with NS2
Venugeetha Y1, Mallikarjunaswamy2

1Venugeetha Y*, Professor, Department of Computer Science and Engineering, Global Academy of Technology, Bengaluru., Karnataka, India.
2Dr B P Mallikarjunaswamy, Professor & Head, Department of Mathematics, Sri Siddhartha Institute of Technology, Tumkuru, Karnataka, India.
Manuscript received on December 15, 2019. | Revised Manuscript received on December 20, 2019. | Manuscript published on January 10, 2020. | PP: 3671-3677 | Volume-9 Issue-3, January 2020. | Retrieval Number: C9022019320/2020©BEIESP | DOI: 10.35940/ijitee.C9022.019320
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: To prologue about a wireless sensor network let us understand network originally; how to connect host computers as well as communicate. Computers that are connected together are represented as topology, there are different types to name them star, bus, mesh, and grid. Researchers represented it as TCP i.e., transmission control protocol that has to be a wired connection through the network. As researcher worked, even without wired connection to the host computers could even be communicated through UDP called user datagram protocol. UDP gave nativity to the wireless sensor network, it has its own pros and cons. Now a day, there are a number of types of wireless sensor network like adhoc network, under water sensor network and vehicular sensor network. An organized design of routing protocol is available in wireless sensor network, and then Connected Dominating Set (CDS) is broadly used as a essential part as a backbone. To construct the Connected Dominating Set with its size as minimum, meta-heuristic, greedy, approximation, heuristic and distributed algorithmic approaches are predictable. These approaches are concentrated on deriving independent set and then constructing the Connected Dominating Set using Steiner tree, Unit Disk Graph and algorithms gives better result when graph has lesser number of nodes. For the networks that are generated in a fixed simulation area. A new approach is used for building Connected Dominating Set based on the concept of Edge Dominating Set. 
Keywords: WSN, EDS, CEDS.
Scope of the Article: Web Algorithms