期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2018
卷号：96
期号：1
页码：51
出版社：Journal of Theoretical and Applied
摘要：In this work, we identify, analysis and evaluate the role of mobile agent to solve the problem of selecting the minimum connected dominating set CDS better alternative approach than the exchange messages approach. The first problem concerns the nature of the CDS construction algorithms in question. Their design is justified as the purpose to construct a virtual infrastructure for wireless network with varied high cost in the permanent exchanged messages to select the CDS. The redundant broadcasting of the packets effects the overall network performance, increases the latency, the collision and the need of synchronization mechanism. Common techniques and algorithms such as marking process, Greedy Algorithms, Maximal Independent Set MIS, Pruning process, and Multipoint Relaying are exploited to select the potential nodes of the connected dominating set. We analyzed and implemented some of these techniques from the using perspective of the mobile agent. We shall argue that the mobile agent implements the CDS algorithms with less cost in its moves comparing with the cost of exchanged messages. Mobile agent just requires local information and a limited number of iterative rounds instead of the redundant broadcasting packets that imposed by other techniques. There is no work similar to our work that discusses the using of mobile agent to construct the connected dominating set based on those common techniques. We have made slight modifications on those algorithms, their notations and parameters to be appropriate through the implementation by the mobile agent. Using the mobile agent shows encouraging results for constructing connected dominating set with few iterations, eliminates the overhead caused by the large volume of message exchange, and improve the structure of the computed CDS. However, the agent by implementing those algorithms successfully constructs the connected dominating set; the constructed connected dominating nodes are still large set. The agent by implementing those algorithms could not construct the minimum CDS.
