CAJ | 학술논문

基于最小连通支配集的虚拟骨干网技术广泛应用于移动自组织网的路由优化和拓扑控制中。许多文献所提出的算法虽能用少量开销生成较小的连通支配集，但在处理节点移动性方面仍缺乏有效措施。为保证拓扑频繁变化下的路由稳定，维持骨干网的连通性成为关键。在分簇的移动自组织网中，本文基于计时器思想提出最小连通支配集生成算法，实现动态拓扑下骨干网的构建与重构。该算法分为分为三个阶段：区域形成、区域扩展、区域连通，能够在拓扑变化时快速维护骨干网的连通性。仿真结果表明，该算法能以少量消息开销，生成区域化的连通支配集，高效调整骨干网适应拓扑变化。
기우최소련통지배집적허의골간망기술엄범응용우이동자조직망적로유우화화탁복공제중。허다문헌소제출적산법수능용소량개소생성교소적련통지배집，단재처리절점이동성방면잉결핍유효조시。위보증탁복빈번변화하적로유은정，유지골간망적련통성성위관건。재분족적이동자조직망중，본문기우계시기사상제출최소련통지배집생성산법，실현동태탁복하골간망적구건여중구。해산법분위분위삼개계단：구역형성、구역확전、구역련통，능구재탁복변화시쾌속유호골간망적련통성。방진결과표명，해산법능이소량소식개소，생성구역화적련통지배집，고효조정골간망괄응탁복변화。
The connected dominating set (CDS) based virtual backbone has been widely used for routing in mobile adhoc networks (MANETs). Although many previous CDS protocols can successfully construct CDS of small size with low overhead, they either lack efficient recovery procedure to deal with node mobility. In this paper, we present a novel area-based distributed CDS algorithm using the concept of timer. This proposed algorithm can be divided into three main phases under control of timers: (a) area partition (b) area expansion (c) area connection. We illustrate that our algorithm can effectively maintain CDS connectivity in the presence of topology changes by utilizing simple timer-based mechanism. The simulation results demonstrate that our algorithm can not only produce a zoning CDS of competitive size with acceptable message overhead, but also recover the visual backbone quickly from dynamic topologies.