Maintaining CDS in Mobile Ad Hoc Networks
Maintaining CDS in Mobile Ad Hoc Networks
复制标题
DOI：
10.1007/978-3-540-88582-5_16
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku;H. Okada
中科院分区：
文献类型：
--
作者：
Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku;H. Okada
在移动的ad hoc网络中，连通支配集（CDS）已被广泛用于路由和广播。为了降低路由表维护的成本，优选地，CDS的大小尽可能小。已经提出了许多协议来构建具有竞争力的大小的CDS，但是只有少数能够在拓扑变化下保持CDS。在这项研究中，我们提出了一种新型的扩展移动性处理算法，该算法不仅可以缩短CDS移动性处理的恢复时间，而且还可以保持具有竞争力的CDS规模。仿真结果验证了算法的有效性。此外，我们将介绍CDS构建所需的收敛时间和消息数量的分析模型。
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.