Maintaining CDS in mobile ad hoc networks

Kazuya Sakai, Min Te Sun, Wei Shinn Ku, Hiromi Okada

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

The connected dominating set (CDS) has been generally used for routing and broadcasting in mobile ad hoc networks (MANETs). To reduce the cost of routing table maintenance, it is preferred that the size of CDS to be as small as possible. A number of protocols have been proposed to construct CDS with competitive size, however only few are capable of maintaining CDS under topology changes. In this research, we propose a novel extended mobility handling algorithm which will not only shorten the recovery time of CDS mobility handling but also keep a competitive size of CDS. Our simulation results validate that the algorithm successfully achieves its design goals. In addition, we will introduce an analytical model for the convergence time and the number of messages required by the CDS construction.

Original languageEnglish
Title of host publicationWireless Algorithms, Systems, and Applications - Third International Conference, WASA 2008, Proceedings
PublisherSpringer Verlag
Pages141-153
Number of pages13
ISBN (Print)3540885811, 9783540885818
DOIs
StatePublished - 2008
Event3rd International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008 - Dallas, TX, United States
Duration: 26 Oct 200828 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5258 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008
Country/TerritoryUnited States
CityDallas, TX
Period26/10/0828/10/08

Fingerprint

Dive into the research topics of 'Maintaining CDS in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this