CFP last date
20 January 2025
Reseach Article

Optimization of Dynamic Source Routing Protocol with Effective Resource Management

by Lokesh Kumar Laddhani, Umesh Kumar Singh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 128 - Number 18
Year of Publication: 2015
Authors: Lokesh Kumar Laddhani, Umesh Kumar Singh
10.5120/ijca2015906655

Lokesh Kumar Laddhani, Umesh Kumar Singh . Optimization of Dynamic Source Routing Protocol with Effective Resource Management. International Journal of Computer Applications. 128, 18 ( October 2015), 10-13. DOI=10.5120/ijca2015906655

@article{ 10.5120/ijca2015906655,
author = { Lokesh Kumar Laddhani, Umesh Kumar Singh },
title = { Optimization of Dynamic Source Routing Protocol with Effective Resource Management },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 128 },
number = { 18 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 10-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume128/number18/22972-2015906655/ },
doi = { 10.5120/ijca2015906655 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:22:01.709900+05:30
%A Lokesh Kumar Laddhani
%A Umesh Kumar Singh
%T Optimization of Dynamic Source Routing Protocol with Effective Resource Management
%J International Journal of Computer Applications
%@ 0975-8887
%V 128
%N 18
%P 10-13
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposes optimization of DSR (Dynamic Source Routing) protocol in aspect of cache size and cache expiry time to meet Quality of Service requirements between source and destination node pairs. The nodes are assumed to use a TDMA (Time Division Multiple Access) based MAC (Medium Access Control) layer. Given a set of Q o S requirements, a set of wireless nodes and their initial positions, the goal is to find a topology of the nodes by adjusting the transmitting power, which will meet the QoS requirements under the presence of interference and at the same time minimize the energy consumed. The Cache size and Cache Expiry time are two parameter for an optimization problem and techniques. We use Genetic Algorithms (GA) is used to solve it. After the optimization routing overhead, end to end delay and route discovery time may be reduces.

References
  1. D. Johnson, D. Maltz and Y. Hu. “The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks forIPv4”,IETFRFC4728.http://www.ietf.org/rfc/rfc4728.txt?number=4728,accessed April 2007.
  2. Abhishek Roy, Nilanjan Banerjee, Sajal K. Das, “An efficient multi objective QoS-routing algorithm for wireless multicasting”, Vehicular Technology Conference, VTC Spring 2002, IEEE 55th, vol. 3, pp. 1160-1164, August 2002.
  3. M. Marina and S. Das. “Performance of Route Caching Strategies in Dynamic Source Routing”, In Proceedings of IEEE International Workshop on Distributed Computing Systems, pp. 425 – 432, Mesa Arizona, 2001.
  4. X. Yu and Z. Kedem. “A Distributed Adaptive Cache Update Algorithm for the Dynamic Source Routing Protocol”, In Proceedings of the 24th Joint Conference (INFOCOM 2005) of the IEEE Computer and Communications Societies, Vol. 1, pp. 730 – 739, 2005.
  5. J. Garrido and M. Marandin. “A Link Cache Invalidation Mechanism for Dynamic Source Routing (DSR) in Ad Hoc Networks”, in Proceedings of IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 1 -5, 2007.
  6. L. Laddhani and Umesh Singh “Optimization of Dynamic Source Routing Protocol Considering the Mobility Effect of Nodes in Cache parameter using OPNET”, in International Journal of Scientific and Engineering Research, Vol.6, Issue.6 August 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Ad-hoc Wireless Networks Genetic Algorithm Quality of Service Requirement Cache Size and Cache Expiry time.