Mendeley
TY  _  JOUR
ID  -  202007118326
TI  -  A matching probability-based flood algorithm for mobile ad hoc networks
JO  -  Journal of Information and Communication Technology
JA  -  ES
LA  -  fa
SN  -  2717-0411
AU  -  nourazar fateme
AU  -  sabaei sabaei
AD  -  دانشگاه آزاد اسلامی واحد قزوين
AD  -  
Y1  -  2011
PY  -  2011
VL  -  6
IS  -  
SP  -  27
EP  -  35
KW  -  
DO  -  
N2  -  The flood algorithm is one of the most important primary operations and infrastructure for routing protocols in mobile ad hoc networks. However, since this algorithm generates many additional messages, it is very costly, it has caused a waste of network bandwidth, consuming more energy than the nodes need, which may eventually cause an all-broadcast storm. Many methods have been proposed to improve the flood algorithm, which are mainly divided into two categories of deterministic and probabilistic methods, and the second category has received more attention. But these methods mainly cause delay and lack of complete coverage. In this paper, we have proposed a new method to improve the performance of SIL-ASA algorithm. The basis of this probabilistic replay method is based on local observations. In this new method, the probability of message replay by each node is a function of local observations. The results of the simulation have shown that the proposed method provides complete network coverage in comparison with similar methods while significantly reducing the packet delivery delay with an acceptable message overhead.
UR  - rimag.ir/en/Article/8326
L1  - rimag.ir/en/Article/Download/8326
ER  -  
