A new RREQ message forwarding technique based on Bayesian probability theory

被引:9
作者
Kanakaris, Venetis [1 ]
Ndzi, David L. [1 ]
Ovaliadis, Kyriakos [1 ]
Yang, Yanyan [1 ]
机构
[1] Univ Portsmouth, Sch Engn, Portsmouth PO1 3DJ, Hants, England
关键词
Mobile ad-hoc network; Routing message overhead; Route discovery; Broadcast; Bayesian probability; Flooding; Power-aware routing; Routing protocols; AODV; AODV_EXT; AODV_EXT_BP; DSDV; DSR; OLSR;
D O I
10.1186/1687-1499-2012-318
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The flooding method, which is used by many mobile ad-hoc routing protocols, is a process in which a route request packet (RREQ) is broadcasted from a source node to other nodes in the network. This often results in unnecessary re-transmissions, causing packet collisions and congestion in the network, a phenomenon called broadcast storm. This article presents firstly the impact of a different message forwarding probability on the RREQ and secondly a RREQ message forwarding scheme which is implemented on Ad-hoc On-Demand Distance Vector Routing (AODV) routing protocol, a Bayesian probability based the AODV extended version based on a modified version of Bayesian probability (AODV_EXT_BP) that reduces routing overheads, by calculating the probability with respect to the neighbour density as well as the posterior probability. The performance of the AODV_EXT_BP is compared to that of extended version of AODV (AODV_EXT), AODV, Destination Sequenced Distance Vector, dynamic source routing and Optimized Link State Routing protocols and the simulation results show that the AODV_EXT_BP protocol achieves better results in all sectors.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 27 条
[1]  
[Anonymous], SURVEY BROADCASTING
[2]  
[Anonymous], EUR J SCI RES
[3]  
[Anonymous], INT J WIREL MOB NETW
[4]  
[Anonymous], P INT MULTICONFERENC
[5]  
[Anonymous], 22 ANN JOINT C IEEE
[6]  
[Anonymous], THESIS U GLASGOW
[7]  
[Anonymous], 2010, 2010 5 INT S 4 COMM, DOI DOI 10.1109/ISVC.2010.5656146
[8]  
[Anonymous], S WIR PERV COMP ESP
[9]  
[Anonymous], AD HOC DEMAND DISTAN
[10]  
[Anonymous], 3 INT C COMM SYST NE