CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Connected Network Dominating Set of an Interval Graph

by A. Sudhakaraiah, V. Rama Latha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 45 - Number 9
Year of Publication: 2012
Authors: A. Sudhakaraiah, V. Rama Latha
10.5120/6809-9154

A. Sudhakaraiah, V. Rama Latha . Connected Network Dominating Set of an Interval Graph. International Journal of Computer Applications. 45, 9 ( May 2012), 31-34. DOI=10.5120/6809-9154

@article{ 10.5120/6809-9154,
author = { A. Sudhakaraiah, V. Rama Latha },
title = { Connected Network Dominating Set of an Interval Graph },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 45 },
number = { 9 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 31-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume45/number9/6809-9154/ },
doi = { 10.5120/6809-9154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:37:10.836102+05:30
%A A. Sudhakaraiah
%A V. Rama Latha
%T Connected Network Dominating Set of an Interval Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 45
%N 9
%P 31-34
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Connected dominating sets are useful in the computation of routing for mobile ad-hoc networks. A connected dominating set is used as a backbone for communications, and nodes that are not in this set communicate by passing messages through neighbors that are in the set. Recent advances in technology have made possible the creation of Wireless Sensor Networks. Although there is no physical backbone infrastructure, a virtual backbone can be formed by constructing a Connected Dominating Set (CDS). In this paper we present an algorithm for finding minimal connected network dominating set(MCNDS) of an interval graph

References
  1. Teresa W. ; Hedetniemi, Stephen; Slater, Peter (1998a), Fundamentals of Domination in Graphs, Marcel Dekke.
  2. Haynes, Teresa W. ; Hedetniemi, Stephen; Slater, Peter (1998b), Domination in Graphs: Advanced Topics, Marcel Dekker.
  3. Hedetniemi, S. T. ; Laskar, R. C. , "Bibliography on domination in graphs and some basic definitions of domination parameters", Discrete Mathematics 86 (1–3): 257–277, 1990.
  4. Sampathkumar, E. ; Walikar, HB, "The connected domination number of a graph", J. Math. Phys. Sci 13 (6): 607-613, 1979.
  5. K. M. Alzoubi, P. J. Wan, and O. Frieder. Message-optimal connected-dominating- set construction for routing in mobile ad hoc networks. In MOBIHOC' 02,pages 157-164, 2002.
  6. C. Adjih,P. Jacquet,and L. Viennot " Computing connected Dominated sets with multipoint relays," Technical Report 4597, INRIA-Rapport de recherché, Oct. 2002.
  7. Maheswari. B, Lakshmi Naidu. Y, Naga muni Reddy. L, and A. Sudhakaraiah, "A polynomial time algorithm for finding a minimum independent neighbourhood set of an interval graph", Graph theory Notes of Newyork XLVI, 9-12,2004.
  8. G. Ramalingan and C. Pandu Rangan ; "Unified approach to domination problems on interval graphs". Inform. Process Lett. , 27, 271-274,1989.
  9. Guha, S. ; Khuller, S, "Approximation algorithms for connected dominating sets", Algorithmica 20 (4): 374–387, 1998.
Index Terms

Computer Science
Information Sciences

Keywords

Interval Family Interval Graph Dominating Set Connected Dominating Set Network.

Powered by PhDFocusTM