文章基本信息

标题：Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
本地全文：下载
作者：Mallikarjun Avula ; Seong-Moo Yoo ; Seungjin Park 等
期刊名称：International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
印刷版ISSN：0975-7260
电子版ISSN：0975-7031
出版年度：2012
卷号：4
期号：2/3
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
关键词：Connected dominating set; mobile ad hoc network; message overhead; node mobility