Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

JPDC

2007

2007

We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CDSTop which take into account the eﬀect of wireless interference and the consequent loss of messages during the execution of the algorithm. These algorithms produce a CDS of constant size and constant stretch ratio with high probability, and converge in polylogarithmic running time. Speciﬁcally, algorithm CDSColor requires the nodes to know (estimates of) the maximum degree ∆ and the size of the network n and converges in O(∆ log2 n) time. Algorithm CDSTop requires the nodes to know their three-hop topology and (an estimate of) the network size n and converges in O(log2 n) time. To the best of our knowledge, these are the ﬁrst distributed interference-aware CDS algorithms for wireless ad hoc networks which break the linear running-time barrier.

Related Content

Added |
16 Dec 2010 |

Updated |
16 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
JPDC |

Authors |
Rajiv Gandhi, Srinivasan Parthasarathy 0002 |

Comments (0)