Call for Paper - April 2023 Edition
IJCA solicits original research papers for the April 2023 Edition. Last date of manuscript submission is March 20, 2023. Read More

Cluster based Optimization Routing Strategy for Data Communication in Mobile Computing

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 99 - Number 2
Year of Publication: 2014
Authors:
Faizul Navi Khan
Kapil Govil
10.5120/17345-6758

Faizul Navi Khan and Kapil Govil. Article: Cluster based Optimization Routing Strategy for Data Communication in Mobile Computing. International Journal of Computer Applications 99(2):19-24, August 2014. Full text available. BibTeX

@article{key:article,
	author = {Faizul Navi Khan and Kapil Govil},
	title = {Article: Cluster based Optimization Routing Strategy for Data Communication in Mobile Computing},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {99},
	number = {2},
	pages = {19-24},
	month = {August},
	note = {Full text available}
}

Abstract

Mobile computing facilitates users to keep the information handy and also continuous access to the application by using mobile computing devices (i. e. Smart phones, palmtop, laptop and tablets) without using wired network. It provides flexible communication to network users; they can access network applications anytime and anywhere. Communication between these devices and mobile network application is possible through the network routing. Network routing plays a significant role to improve the performance in Mobile computing. A routing algorithm is required to choose the communication path to travel data packets from source to destination in Mobile computing network. Routing in a mobile network typically involves a rather complex collection of algorithms that work more or less independently and yet support each other by exchanging services or information. In mobile communication network multiple data packets need to transmit in order to execute on available processing nodes with minimum transmission time. This research paper implies a cluster based routing strategy to help route data packets from source device to destination point.

References

  • Shajin Nargunam, M. P. Sebastian, "Hierarchical Multicast Routing Scheme for Mobile Ad Hoc Network", Vol. 4873, pp 464-475, 2007
  • Abraham, C. Gavoille, A. V. Goldberg, D. Malkhi, "Routing in networks with low doubling dimension", In Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS), page 75, 2006
  • Ashish Pandey, Md. Nasir Ahmed, Nilesh Kumar, P. Gupta, "A Hybrid Routing Scheme for Mobile Ad Hoc Networks with Mobile Backbones", High performance computing, Vol. 4297, 411-423, 2006
  • BagerZarei, M. R. Meybodi, "A Hybrid method for Solving Traveling Salesman Problem", ICIS 2007, pp. 394-399, 2007
  • Gavoille, M. Gengler, "Space-efficiency for routing schemes of stretch factor three", J. Parallel Distrib. Comput. ", Vol. 61, issue 5, pp. 679–687, 2001
  • Li, L. Li, "Utility-based scheduling for grid computing under constraints of energy budget and deadline", In: Comput. Stand. Inter, Vol. 31, Issue 6, pp. 1131-1142, 2009
  • F. F. Dragan. "Estimating all pairs shortest paths in restricted graph families: a unified Approach", J. Algorithms, Vol. 57, issue 1, pp. 1–21, 2005
  • F. Gonzalez-Castano, J. Vales-Alonso, M. Livny, "Condor grid computing from mobile handheld devices" ACM SIGMOBILE Mobile Computing and Communications Review, Vol. 7, Issue 1, pp 117–126, 2003
  • Faizul Navi Khan, Kapil Govil, "Distributed Task Allocation Scheme for Performance Improvement in Mobile Computing Network", International Journal of Trends in Computer Science, Vol. 2 Issue 3, pp: 809-817, 2013
  • H. Liu, T. Roeder, K. Walsh, R. Barr, E. G. Sire, "Design and implementation of a single system image operating system for ad hoc network", In: Proc. 3rd Int. Conference on Mobile Systems, Applications, and Services, pp. 149–162, 6-8 June 2005
  • Ioannis A Moschakis, Helen D Karatza , "Evaluation of gang scheduling performance and cost in a cloud computing system", Journal of Supercomputing, Vol. 59, Issue: 2, pp: 975-992 , 2012
  • J. Yang, Y. Bai, Y. Qiu, "A decentralized resource allocation policy in mini grid", In: Journal of Future Generation Computer Systems, Vol. 23, pp. 359–366, 2007
  • K. A. Hummel, G. Jelleschitz, "Robust de-centralized job scheduling approach for mobile peers in ad hoc grid", In: 7th IEEE Int. Symp. on Cluster Computing and the Grid, pp. 461-470, 14-17 May 2007
  • P. Ghosh, N. Roy, S. K. Das, "Mobility – aware efficient job scheduling in mobile grids", In: 7th IEEE Int. Symp. On Cluster Computing and the Grid, pp. 701-706, 14-17 May 2007
  • Pankaj Saxena, Kapil Govil, "An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System", International Journal of Computer Applications, Vol. 82, Issue 5, pp 30-34, 2013
  • R. K. Balan, M. Satyanarayanan, S. Y. Park, T. Okoshi, "Tactics-based remote execution for mobile computing". In: Proc. MobiSys 2003, 1st Conf. on Mobile Systems, Application and Services, pp. 273-286, 5-8 may 2003
  • S. C. Shah, M. -S. Park, "An energy-efficient resource allocation scheme for mobile ad hoc computational grids", J. Grid Comput, Vol. 9, Issue 3, pp 303–323, 2011
  • Sayed Chhattan Shah, Myong-Soon Park, Wan Sik Choi, Zeeshan Hameed Mir, Sajjad Hussain Chauhdary, Ali Kashif Bashir, Fida Hussain Chandio, "An Adaptive and Distance-based Resource Allocation Scheme for Interdependent Tasks in Mobile Ad Hoc Computational Grids", Informational Technology and Control, Vol. 41, Issue 4, pp. 307-315, 2012
  • Tamar Eilam, Cyril Gavoille, David Peleg, "Average stretch analysis of compact routing schemes", Discrete Applied Mathematics, Vol. 155, Issue 5, pp. 598–610, 2007
  • Y. Dourisboure, "Compact routing schemes for generalisedchordal graphs", Journal of Graph Algorithms and Applications", Vol. 9, Issue 2, pp. 277–297, 2005