GDL

Enhancing the Performance of the DNDP Algorithm

ISSN : 0975-3834
Journal from gdlhub / 2017-08-14 11:52:33
Oleh : Hussein Al-Bahadili , Ghassan Issa , Alia Sabri, International Journal of Wireless & Mobile Networks (IJWMN)
Dibuat : 2012-06-25, dengan 1 file

Keyword : MANETs, dynamic routing protocols, route discovery, flooding optimization algorithms, probabilistic algorithm, the DNDP algorithm.
Subjek : Enhancing the Performance of the DNDP Algorithm
Url : http://airccse.org/journal/jwmn/0411wmn10.pdf
Sumber pengambilan dokumen : Internet

A novel dynamic noise-dependent probabilistic (DNDP) route discovery algorithm was recently


developed to enhance the performance of the dynamic probabilistic algorithm in noisy mobile ad hoc


networks (MANETs). In this algorithm, the mathematical model for calculating node retransmission


probability (pt) is calculated as a function of two independent variables: number of first-hop neighbors


(k) and probability of reception (pc). The model also shows another independent variable, namely, the


maximum retransmission probability that can be assigned to the transmitting node (pt,pcmin), which is


assumed to be a fixed value. In this paper, we propose a new mathematical model for calculating pt. In


this new model pt,pcmin is calculated as a function of k. The performance of the DNDP algorithm using


fixed and k-dependent pt,pcmin is evaluated through simulations. The simulation results showed that the


new model enhances the performance of the DNDP algorithm as it significantly reduces the number of


retransmissions at an insignificant reduction in the network reachability.

Deskripsi Alternatif :

A novel dynamic noise-dependent probabilistic (DNDP) route discovery algorithm was recently


developed to enhance the performance of the dynamic probabilistic algorithm in noisy mobile ad hoc


networks (MANETs). In this algorithm, the mathematical model for calculating node retransmission


probability (pt) is calculated as a function of two independent variables: number of first-hop neighbors


(k) and probability of reception (pc). The model also shows another independent variable, namely, the


maximum retransmission probability that can be assigned to the transmitting node (pt,pcmin), which is


assumed to be a fixed value. In this paper, we propose a new mathematical model for calculating pt. In


this new model pt,pcmin is calculated as a function of k. The performance of the DNDP algorithm using


fixed and k-dependent pt,pcmin is evaluated through simulations. The simulation results showed that the


new model enhances the performance of the DNDP algorithm as it significantly reduces the number of


retransmissions at an insignificant reduction in the network reachability.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Wireless & Mobile Networks (IJWMN)
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com