Domination in Semigraphs

Kamath, S. S.; Bhat, Radhakrishna

doi:10.1016/s1571-0653(04)00548-7

Cited by 13 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 2 (connected dominating set [19]). A connected dominating set (CDS) is a connected subgraph of a dominating set.…”

Section: Semigraph Virtual Backbone Modelmentioning

confidence: 99%

“…Definition 3 (semigraph [19]). A semigraph for the network is determined as SG � (V, X) for an edge E ∈ X and the node v ∈ V, and the edge degree ed(E) for "E" is determined by the following function:…”

Section: Semigraph Virtual Backbone Modelmentioning

confidence: 99%

“…e battery level of one of the node v ∈ E i should be higher (15) en add E i to F (16) end if (17) end for (18) end for (19) return F e DSDV routing protocol uses the table-oriented approach, in which identifying an alternate route causes delay. It may reduce the performance of the entire network.…”

Section: Simulation Of S-ceds Using Ns-2mentioning

confidence: 99%

See 2 more Smart Citations

Energy Measure Semigraph-Based Connected Edge Domination Routing Algorithm in Wireless Sensor Networks

Praba

Sethukarasi²,

Saravanan

2019

Mobile Information Systems

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), batteries are used as power source which is limited, and replacement of the battery is difficult. Since communication between nodes consumes most of the node power, topology-based power control is essential for reducing energy consumption. It is necessary to use optimized topology-based energy control model, so the selected nodes are used to generate a virtual backbone, which reduces unwanted routing of data. The virtual backbone for optimized topology can be created by connected dominating set (CDS) of graph theory. However, generating the virtual backbone by using the CDS algorithm is an NP-hard problem because of larger network size. To overcome this problem, in this paper, a novel distributed connected edge dominating set-based semigraph model (S-CEDS) is proposed. The performance ratio of the proposed S-CEDS is measured as (4 + ln∆′) |opt|, where |opt| represents the network size. The proposed S-CEDS is implemented using the ns-2 simulator and evaluated with conventional routing protocols such as AODV and DSDV. The results show that the proposed S-CEDS approach increases throughput and network lifetime. Also, it reduces energy consumption and average number of hops required for data transmission.

show abstract

“…Definition 2 (connected dominating set [19]). A connected dominating set (CDS) is a connected subgraph of a dominating set.…”

Section: Semigraph Virtual Backbone Modelmentioning

confidence: 99%

Section: Semigraph Virtual Backbone Modelmentioning

confidence: 99%

See 1 more Smart Citation

Energy Measure Semigraph-Based Connected Edge Domination Routing Algorithm in Wireless Sensor Networks

Praba

Sethukarasi²,

Saravanan

2019

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…Bhat and S.R. Hebbar [21,22], Bipartite theory of semigraphs and Hyper domination in semigraphs by Y.B.Venkatakrishnan and V. Swaminathan [23,24], (m,e)-domination in semigraphs by S. Gomathi [20], Adjacency matrix and Incidence matrix of a semigraph by C.M.Deshpande, Y.S. Gaidhani and B.P.Athawale [3,4], Factorization and Genus of semigraphs by P. Das and Surajith Kr.…”

Section: Introductionmentioning

confidence: 99%