Optimal resource allocation for route selection in ad-hoc networks

Marwa K. Farhan, Muayad S. Croock


Nowadays, the selection of the optimum path in mobile ad hoc networks (MANETS) is being an important issue that should be solved smartly. In this paper, an optimal path selection method is proposed for MANET using the Lagrange multiplier approach. The optimization problem considers the objective function of maximizing bit rate, under the constraints of minimizing the packet loss, and latency. The obtained simulation results show that the proposed Lagrange optimization of rate, delay, and packet loss algorithm (LORDP) improves the selection of optimal path in comparison to ad-hoc on-demand distance vector protocol (AODV). We increased the performance of the system by 10.6 Mbps for bit rate and 0.133 ms for latency.


AODV; lagrange multipliers; MANET; Optimization;

Full Text:


DOI: http://dx.doi.org/10.12928/telkomnika.v19i4.18521

Article Metrics

Abstract view : 0 times
PDF - 0 times


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604