CFP last date
20 May 2024
Reseach Article

Optimized routing in Mobile Ad Hoc Networks using Evolutionary Location Intelligence

Published on None 2010 by J.Arunadevi, Dr.V.Rajamani
Mobile Ad-hoc Networks
Foundation of Computer Science USA
MANETS - Number 3
None 2010
Authors: J.Arunadevi, Dr.V.Rajamani
7b49efed-d875-46dc-9934-6245788b066d

J.Arunadevi, Dr.V.Rajamani . Optimized routing in Mobile Ad Hoc Networks using Evolutionary Location Intelligence. Mobile Ad-hoc Networks. MANETS, 3 (None 2010), 120-123.

@article{
author = { J.Arunadevi, Dr.V.Rajamani },
title = { Optimized routing in Mobile Ad Hoc Networks using Evolutionary Location Intelligence },
journal = { Mobile Ad-hoc Networks },
issue_date = { None 2010 },
volume = { MANETS },
number = { 3 },
month = { None },
year = { 2010 },
issn = 0975-8887,
pages = { 120-123 },
numpages = 4,
url = { /specialissues/manets/number3/1028-73/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Mobile Ad-hoc Networks
%A J.Arunadevi
%A Dr.V.Rajamani
%T Optimized routing in Mobile Ad Hoc Networks using Evolutionary Location Intelligence
%J Mobile Ad-hoc Networks
%@ 0975-8887
%V MANETS
%N 3
%P 120-123
%D 2010
%I International Journal of Computer Applications
Abstract

Evolutionary Location Intelligence on implementing a position based routing, that make forwarding decision based on the geographical position of a packet's destination is concentrated in this paper. One distinct advantage of this model is not necessary to maintain explicit routes. Position based routing does scale well even if the network is highly dynamic. We use greedy forwarding approach with the hybrid evolutionary optimization provided to the spatial clustering algorithm. The results are demonstrated and it is appreciable.

References
  1. M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” IEEE Networks Magazine, vol. 15, no. 6, pp. 30- 39, 2001.
  2. J. Hightower and G. Borriello, “Location Systems for Ubiquitous Computing,” IEEE Comp., Aug. 2001, pp. 57–66.
  3. S. Basagni, I. Chlamatac, V. Syrotiuk, and B. Wood, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. ACM MobiCom ’98, pp. 76-84, 1998.
  4. Y. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Mobile Computing and Networking, pp. 66-75, 1998.
  5. X. Lin, M. Lakshdisi, and I. Stojmenovic, “Location Based Localized Alternate, Disjoint, Multipath and Component Routing Schemes for Wireless Networks,” Proc. ACM MobiHoc ’01, pp. 287-290, Oct. 2001.
  6. G. G. Finn, “Routing and addressing problems in large metropolitan-scale internet works,” Institute for Scientific Information, Tech. Rep. ISU/RR-87-180, March 1987.
  7. Xueping Zhang, Jiayao wang and fang wu, “ Spatial Clustering with obstacles based on genetic algorithms and K- medoids”, International Journal of Computer science and Network security, Vol. 6 No, 10, October 2006.
  8. F. Araujo, “Position-based distributed hash tables,” Ph.D. dissertation, University of Lisbon, Lisbon, Portugal, 2005.
  9. Y. Xu, J. S. Heidemann, and D. Estrin, “Geography-informed energy conservation for ad hoc routing,” in Mobile Computing and Networking, 2001, pp. 70–84.
  10. Maulik.U and bandyopadhyay.s, “Genetic algorithm based clustering technique”, Pattern Recongnition, Vol.33,pp.1455 1465, 2000
  11. Liu.Y, Chen.K, Liao.X and Zhang W, “ A genetic clustering method for intrusion detection”, Pattern Recongnition, Vol.37,pp.927-942, 2004.
  12. K. Premalatha, A.M. Natarajan,” A New Approach for Data Clustering Based on PSO with Local Search”, Computer and Information Science, Vol. 1, No. 4, 2008, pp 139-145.
  13. Tarsitano, A. “A computational study of several relocation methods for k-means Algorithms”, Pattern Recognition, 2003,Vol. 36, pp.2955–2966.
  14. Marinakis, Y., Marinaki, M. and Matsatsinis, N.”A stochastic nature inspired metaheuristic for clustering analysis”, Int. J. Business Intelligence and Data Mining, 2008, Vol. 3, No. 1, pp.30–44.
  15. Deneubourg J.L., Goss S., Franks, N. Sendova- Franks A., Detrain C., and Chétien L. The Dynamics of Collective Sorting: Robot-like Ants and Ant-like Robots, In Proceedings of the 1st International Conference on Simulation of Adaptive Behavior: From Animals to Animats,.1991, MIT Press, Cambridge, MA, USA, 1:356-363.
  16. Lumer E., and Faieta B. Diversity and adaptation in populations of clustering ants. In Proceedings of the Third International Conference on Simulation of Adaptive Behaviour: From Animals to Animats.1994, MIT Press, Cambridge, MA, 3:501–508.
  17. Lumer E., and Faieta B. Exploratory database analysis via self-organization, 1995.
  18. Handl J., Knowles J., and Dorigo M. “On the Performance of Ant-based Clustering”, In Design and Application of Hybrid Intelligent Systems, Frontiers in Artificial Intelligence and Applications,. Amsterdam, the Netherlands,IOS Press, 104:204-213, 2003.
  19. K Vijayalakshmi and S Radhakrishnan, “Dynamic Routing to Multiple Destinations in IP Networkin using Hybrid Genetic Algorithm (DRHGA), International Journal of Information Technology, Vol 4, No 1, PP 45-52. 2008.
  20. Aluizio F. R. Araújo, Cícero Garrozi and André R.G.A. Leitão Maury M. Gouvêa Jr, “Multicast Routing Using Genetic Algorithm Seen as a Permutation Problem”, Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA’06).
  21. www.eng.tau.ac.il/~shavitt/pub/NEAR.ps
Index Terms

Computer Science
Information Sciences

Keywords

Ad-hoc routing spatial clustering PSO ACO GA