Centralized Algorithms based on Energy-Aware and Maintained Mechanism for Constructing Connected Dominating Set in Ad Hoc Networks

• Main Authors: Kun-Wei Chen, 陳堃維
• Other Authors: Chuan-Bi Lin
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/27012270816114241089

碩士 === 朝陽科技大學 === 資訊與通訊系 === 102 === There exist some problems in wireless ad hoc networks, such as the limitations of bandwidth, the processing capability of nodes, and the battery power. This is because the network topology may dramatically change due to node mobility in wireless ad hoc networks. To solve the above problems, the design of routing algorithms based on connected dominating set (CDS) has been recognized as a suitable approach for routing in ad hoc networks, because the CDS as a virtual backbone to relay data not only can reduce redundant message and power consumption but also can adapt to the rapid change of network topology. Therefore, in this paper, we propose two novel CDS algorithms, called Maxsufferage Selection CDS (MaxS-CDS) and Maximum Energy-Aware CDS (MEA-CDS). The purpose of MaxS-CDS algorithm is to reduce the transmission time of messages between nodes, waste of bandwidth and power consumption. However, the lifetime of CDS is not considered in MaxS-CDS algorithm. Therefore, the MEA-CDS algorithm is to improve lifetime of CDS by considering powers of nodes when constructing CDS. Furthermore, we also propose Recovery Procedure to replace lower power of node and improve lifetime of CDS. , The proposed two algorithms are simulated and compared with other algorithms. The simulation results show that MaxS-CDS algorithm obtains the smaller size of CDS than others algorithms and MEA-CDS algorithm obtains the longer lifetime of CDS than others algorithms.