International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 45 - Issue 9 |
Published: May 2012 |
Authors: A. Sudhakaraiah, V. Rama Latha |
![]() |
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 }, year = { 2012 }, volume = { 45 }, number = { 9 }, pages = { 31-34 }, doi = { 10.5120/6809-9154 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A A. Sudhakaraiah %A V. Rama Latha %T Connected Network Dominating Set of an Interval Graph%T %J International Journal of Computer Applications %V 45 %N 9 %P 31-34 %R 10.5120/6809-9154 %I Foundation of Computer Science (FCS), NY, USA
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