Probabilistic Routing Using Queuing Theory for Manets

Khandelwal, Gaurav; Prasanna, G. Vani; Hota, Chittaranjan

doi:10.5121/ijwmn.2011.3410

Cited by 4 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Banyaknya pengguna yang berkomunikasi di jaringan mengakibatkan lalu lintas data yang padat sehingga menyebabkan waktu tunda atau antrian yang lama (Khandelwal, G., Prasanna, G. & Hota, C., 2011). Seiring pengembangan teknologi jaringan dan meningkatkan aplikasi berbasis jaringan, jaringan komputer saat ini banyak digunakan dalam penelitian ilmiah, bisnis, pendidikan industri, pertahanan nasional dan lainnya.…”

Section: Pendahuluanunclassified

Optimasi Jaringan Serat Optik Menggunakan Metode Algoritma Genetika (Studi Kasus Unisma)

Okiandri¹,

Pramono²,

Yudaningtyas³

2016

JTIIK

View full text Add to dashboard Cite

Section: Pendahuluanunclassified

Optimasi Jaringan Serat Optik Menggunakan Metode Algoritma Genetika (Studi Kasus Unisma)

Okiandri¹,

Pramono²,

Yudaningtyas³

2016

JTIIK

View full text Add to dashboard Cite

“…The probability of a node being stable in the path is modeled by queueing theory where the stability of a node is measured by number of packets arrived at a node and the number of packets being serviced by the node per unit time. Khandelwal et al (2011) proposed a probablistic routing protocol (PAODV) by introducing a queueing model for infinite packet arrivals at a node and they have established that in all aspects such as node density, coverage area size and node mobility of networks characteristics of PAODV is more efficient than AODV. The proposed routing protocol uses M/M/C:∞/FIFO queueing model for each node in the data transmission path so that it can transmit the packets to the destination quickly.…”

Section: Introductionmentioning

confidence: 99%

Queueing Models in Mobile Ad-Hoc Networks

Baskar¹

2014

American Journal of Applied Sciences

View full text Add to dashboard Cite

The Mobile Ad-hoc Networks (MANETs) has gain an essential part of the attention of researchers and become very well-liked in last few years. MANETs can operate with no fixed communications and can live rapid changes in the network topology. They can be studied officially as graphs in which the set of boundaries varies in time. One of the main methods to determine the presentation of MANETs is simulation. This study proposes Enhanced Probabilistic Adhoc on Demand Distance Vector (EPAODV) routing protocol, which solves the broadcast storm problem of Adhoc on Demand Distance Vector (AODV). Our evaluation of MANETs is based on the evaluation of the throughput, end to end delay and packet delivery ratio. We evaluated the end to end delay as it is one of the most important characteristic evaluation metric in computer networks. In our proposed algorithm, using a queueing model M/M/C: ∞/FIFO, we are able to enhance that better results are obtained in the case EPAODV protocol such as increasing throughput, data delivery ratio and then decreasing the end delay compare to the existing protocols.

show abstract