Optimized Power Efficient Routing in Ad-hoc Networks

##plugins.themes.academic_pro.article.sidebar##

Published Jul 1, 2014
https://doi.org/10.47164/ijngc.v5i2.67
Download
PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 5, Issue 2, July 2014

##plugins.themes.academic_pro.article.main##

Jaspal Kumar Jindal
M Kulkarni
Daya Gupta
S Indu
Shashi Kumar

Abstract

Energy-ecient routing in Ad-hoc networks is an important research issue since it directly impacts network lifetime. This paper proposes a novel optimmzed power ecient routing algorithm (OPERA) considering the network parameters like node density, power consumption, trac congestion and node status. The proposed work ranks the network communication parameters based on dierent trac congestien zones like maximum, moderate and minimum, using Analytical Hierarchy Process (AHP) and selects optimal path. The OPERA is adaptive and power ecient. A simulation study is performed to compare the performance of OPERA with AODV protocol. Our results indicate that OPERA consumes less power than AODV.

##plugins.themes.academic_pro.article.details##

How to Cite
Jaspal Kumar Jindal, M Kulkarni, Daya Gupta, S Indu, & Shashi Kumar. (2014). Optimized Power Efficient Routing in Ad-hoc Networks. International Journal of Next-Generation Computing, 5(2), 191–199. https://doi.org/10.47164/ijngc.v5i2.67
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Acampora, G., G. M. L. V. and Vasilakos, A. 2010. Interoperable and adaptive fuzzy services for ambient intelligence applications. ACM Transactions on Autonomous and Adaptive Systems.
  2. A.M. Akhtar, M. N. and Aghvam, A. H. 2012. Energy efficient adaptive routing in wire-less ad-hoc and mesh networks. IET Networks Vol.1, pp.246-249 (July).
  3. Beatrice Ombuki, B. J. R. and Hanshar, F. 2006. Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Applied Intelligence, vol. 24. Springer.
  4. Benamar K., M. F. and M.H., A. 2008. Weight based dsr for ad hoc networks. In 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA. pp.1–6.
  5. Chen, H. and Baras, J. Distributed opportunistic scheduling for wireless ad-hoc networks with block fading.IEEE Vol.31, pp.2324–2337.
  6. Dillip Kumar, S. and Vijay Kumar, B. 2008. Energy aware multicasting routing in manets based on genetic algorithms. In 16th International Conference on Networks (ICON-2008). IEEE, pp.1–5.
  7. Flair, L. 1995. Student peers evacuations using the analytic hierarchy process method. In Frontiers in Education Conference. University of Alabama Tuscaloosa, IEEE.
  8. Ganesh, S. and Amutha, R. 2013. Efficient and secure routing protocol for wireless sensor networks through snr based dynamic clustering mechanism. IEEE, pp.422–429.
  9. Kulturel-Konak, S., N. A. and Coit, D. 2003. Efficiently solving the redundancy allocation problem using tabu search. IIE Transactions 35, pp.515–526.
  10. Pushpavalli, M. and Natarajan, A. Performance evaluation of mobile ad hoc networks using genetic algorithm.Journal of Theoretical and Applied Information Technology, pp.596–603.
  11. Saaty and Thomas, L. 1990. How to make a decision: The analytic hierarchy process. European Journal of Operations Research 48, pp.9–26.
  12. Sinha, J. and Braman, S. 2012. Energy efficient routing mechanism in wireless sensor networks. In International Conference Recent Advances In Information Technology(RAIT). pp.300–305.
  13. Sonawalker, M. S. and Havinal, R. S. 2013. Minimum energy multicast routing in mobile ad-hoc networks. International Journal of Computer Applications Vol.64, pp.5.
  14. W Chee-Wah Tan, S. K. and Cheg, T. 2012. Power and mobility aware routing in wireless ad hoc networks. IET Communications Vol.6, pp.1425–1437.
  15. Wook, C. and Ramakrishna, R. 2002. A genetic algorithm for shortest path routing problem and sizing of populations. IEEE Transaction on Evolutionary Computation Vol.6, No.6, pp.566–578.