CFP last date
22 July 2024
Reseach Article

Energy Optimal Path Algorithm for routing in Static Adhoc Network using Greedy Approach (EOGR)

by Anshu Chaturvedi, D. N. Goswami, Tripti Sharma
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 24
Year of Publication: 2012
Authors: Anshu Chaturvedi, D. N. Goswami, Tripti Sharma
10.5120/7529-0589

Anshu Chaturvedi, D. N. Goswami, Tripti Sharma . Energy Optimal Path Algorithm for routing in Static Adhoc Network using Greedy Approach (EOGR). International Journal of Computer Applications. 48, 24 ( June 2012), 23-28. DOI=10.5120/7529-0589

@article{ 10.5120/7529-0589,
author = { Anshu Chaturvedi, D. N. Goswami, Tripti Sharma },
title = { Energy Optimal Path Algorithm for routing in Static Adhoc Network using Greedy Approach (EOGR) },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 24 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 23-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number24/7529-0589/ },
doi = { 10.5120/7529-0589 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:44:57.118195+05:30
%A Anshu Chaturvedi
%A D. N. Goswami
%A Tripti Sharma
%T Energy Optimal Path Algorithm for routing in Static Adhoc Network using Greedy Approach (EOGR)
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 24
%P 23-28
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless adhoc networks are excellent area for researchers with an algorithm background. In this paper we have given an algorithmic approach to the problem of routing with minimum energy consumption by the ad hoc network. we have proposed an energy optimal path algorithm used for routing in static adhoc networks using greedy approach of algorithm design. We have given the mathematical proof of correctness of proposed algorithm. We also performed simulation to show the effectiveness & correctness of our algorithm. Simulation results show that the proposed algorithm perform well in comparison to the GPSR algorithm in terms of energy, throughput & other factors.

References
  1. D. Beyer, M. D. Vestrich, and J. J. Garcia-Luna-Aceves, The Rooftop Community Network: Free, High-Speed Network Access for Communities, Hurley and Keller, Edrs. , The First 100: New Options for Internet and Broadband Access, MIT Press, 1999, pp. 75–91.
  2. R. Jain, A. Puri and R. Sengupta, Geographical Routing Using Partial Information for Wireless Ad hoc Networks, In IEEE Personal Communication, pp. 48–57 (2001).
  3. J. Li, J. Janotti, D. S. J. De Couto, D. R. Karger, and R. Morris, Scalable Location Service for Geographic Ad hoc Routing, In Proceedings ofIEEE/ACM, MOBICOM, pp. 120–130 (2000).
  4. E. Royer and C. K. Toh, Review of Current Routing Protocols for Mobile Ad hoc Networks, In IEEE Personal Communication, pp. 85–97 (1999).
  5. T. H. Clausen, G. Hansen, L. Cristensen and G. Behermann, The Optimized Link State Routing Protocol Evaluation through Experiments and Simulations, In IEEE Personal Communication (2001).
  6. C. Perkins, and P. Bhagwat, Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers, In Proceedings of ACM SIGCOMM, pp. 234–244 (1994).
  7. B. Karp and H. T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, In Proceedings of IEEE/ACM MOBICOM, pp. 243–254 (2000).
  8. C. Liu and J. Wu, SWING: Small World Iterative Navigation Greedy.
  9. Mahboobeh Abdoos, Karim Faez, and Masoud Sabaei: Position Based Routing Protocol with More Reliability in Mobile Ad Hoc Network in World Academy of Science, Engineering and Technology 49 2009
  10. S. Singh, M. Woo, C. Raghvendra, Power Aware Routing in Mobile Ad hoc Networks, In Proceedings of IEEE/ACM MOBICOM, pp. 181–190 (1998).
  11. K. Woo, C. Yu, H. Y. Youn, and B. Lee, Non-blocking Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad hoc Networks, In Proceedings of MASCOTS, pp. 117–124 (2001).
  12. B. Chen, K. Jamieson, H. Balakrishnan and R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad hoc Networks, In ACM Wireless Networks Journal, Vol. 8, No. 5, pp. 481–494 (2002).
  13. L. Romdhani and C. Bonnet, Energy Consumption Speed-Based Routing for Mobile Ad hoc Networks, In Proceedings of ICDCSW,pp. 729–734 (2004).
  14. P. C Kokkinos, C. A. Papageorgiou and E. A. Varvarigos, Energy Aware Routing in Wireless Ad hoc Networks, In Proceedings of WoWMoM,pp. 306–311 (2005).
  15. R. Haider, M. Y. Javed, N. S. Khattak, EAGR: Energy Aware Greedy Routing in Sensor Networks, In Proceedings of Future Generation Communication and Networking, Vol. 2, 344–349 (2007).
  16. Y. Yu, R. Govindan, D. Estrin: Geographical & Energy Aware Routing: a recursive data dissemination protocol for wireless sensor network.
  17. S. Sharma, H. M. Gupta, S. Dharmaraja: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks in SPECTS 2008.
  18. F. Kuhn, R. Wattenhofer, A. Zollinger: An algorithmic Approach to Geographic routing in Ad hoc and Sensor Networks in the Networking, IEEE/ACM , volume 16, pp 51-62
  19. E. Horowitz, S. Sahni and S. Rajasekaran,:Fundamental of Computer Algorithm II edition pp 210-222.
  20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein :Introduction to Algorithm II edition , pp 581-582.
  21. K. fall, K. Vardhan, NS notes and Documentation, the VINT Project, UC Barkeley, LBL, USC/ISI and Xerox PARC (2000),http://www. isi. edu/nsnam/ns/ns-documentation. html.
  22. GPSR Code Help: http://www. cs. binghamton. edu/ //kliu/research/ns2code/index. html.
Index Terms

Computer Science
Information Sciences

Keywords

Adhoc Network greedy Method Energy Consumption Optimization