Maintaining CDS in mobile ad hoc networks

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

研究成果: 書貢獻/報告類型會議論文篇章同行評審

14 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
主出版物標題Wireless Algorithms, Systems, and Applications - Third International Conference, WASA 2008, Proceedings
發行者Springer Verlag
頁面141-153
頁數13
ISBN(列印)3540885811, 9783540885818
DOIs
出版狀態已出版 - 2008
事件3rd International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008 - Dallas, TX, United States
持續時間: 26 10月 200828 10月 2008

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5258 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???3rd International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008
國家/地區United States
城市Dallas, TX
期間26/10/0828/10/08

指紋

深入研究「Maintaining CDS in mobile ad hoc networks」主題。共同形成了獨特的指紋。

引用此