Answers are grounded in this paper and cite their sources.
Finding the optimal broadcasting tree is a challenging problem in networks like mobile add-hoc network (MANET). Finding the optimal tree faces engineering problems such as the broadcasting storm problem and the complexity of computations. Therefore, several heuristic approaches have been introduced in order to find a sub-optimal solution. In this work, the creative design approach was adopted in order to provide means to tackle this problem by searching for a structure of a suitable spanning tree. This structure can then be optimised in order to meet the performance indexes related to the broadcasting problem. The proposed model was compared with three main algorithms: simple flooding (SF), counter base scheme (CBS) and minimum spanning tree (MST). The results showed that the proposed approach could create a near optimal solution for the minimum spanning tree (MST) problem at reasonable and reliable computation time. Additionally, it has lower redundancy and the broadcasting overhead than the simple flooding and the counter base scheme.
No takes yet. Share an insight, caveat, or question.
Elaiwat et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: