CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Energy efhcient DSR Algorithm based on topology for Mobile Ad-Hoc Network

by Ahlem Drif, Abdellah Boukerram
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 83 - Number 11
Year of Publication: 2013
Authors: Ahlem Drif, Abdellah Boukerram
10.5120/14489-2849

Ahlem Drif, Abdellah Boukerram . Energy efhcient DSR Algorithm based on topology for Mobile Ad-Hoc Network. International Journal of Computer Applications. 83, 11 ( December 2013), 1-4. DOI=10.5120/14489-2849

@article{ 10.5120/14489-2849,
author = { Ahlem Drif, Abdellah Boukerram },
title = { Energy efhcient DSR Algorithm based on topology for Mobile Ad-Hoc Network },
journal = { International Journal of Computer Applications },
issue_date = { December 2013 },
volume = { 83 },
number = { 11 },
month = { December },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume83/number11/14489-2849/ },
doi = { 10.5120/14489-2849 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:59:03.499405+05:30
%A Ahlem Drif
%A Abdellah Boukerram
%T Energy efhcient DSR Algorithm based on topology for Mobile Ad-Hoc Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 83
%N 11
%P 1-4
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The nodes in the mobile ad hoc networks use typically autonomous sources of energy that have a limited battery lifetime. It is therefore important to minimize the energy consumption of nodes in the wireless networks. This paper propose a new energy efficient algorithm for the dynamic source routing protocol (DSR) which is based on the network topology precisely the approach of enclosure graph and relay region in which communicating through the relay node is more energy efficient than direct communication. In this topology, the network is strongly connected if each node maintains connections with all the existing nodes in its closure. The proposed method investigates distance between the nodes which is proportional with a transmission power used by a node and with the idle listening energy consumption. Our proposition contributes to preserve energy of mobiles units and ensure their connectivity in the routing process.

References
  1. Mohammad Ilyas, The handbook of ad hoc wireless networks, CRC PRESS LLC, Boca Raton Florida, 2003.
  2. A. Drif, A. Boukerram, Optimisation de la consommation d'nergie dans les rseaux mobiles ad hoc, Doctoriales de Sciences et technologies de l'information et de la communication STIC'11, 20-21 Avril 2011, Tbessa, Algrie.
  3. K. Scott and N. Bambos, Routing and Channel Assignment for Low Power Transmission, in PCS, Proc. ICUPC'96, Oct. 1996, vol. 2, pp. 498-502.
  4. Singh, s. , Woo M, and Raghavendra C. S, Power Aware Routing in mobile Ad hoc networks, proceeding of mobicom project'98, Dallas, Texas, Oct. 1998.
  5. K. Toh, Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks, IEEE Communications Magazine, June 2001.
  6. A. Srinivas, E. Modiano, Minimum energy disjoint path routing in wireless ad-hoc networks, in: Proc. MOBICOM PROJECT' 03, ACM, 2003.
  7. A. Srinivas, E. Modiano, Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks, in: Springer Science, Wireless Networks 11, 2005, pp. 401-417.
  8. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, On the Construction of Energy-Efficient Broadcast and Mul-ticast Trees inWireless Networks, Proc. IEEE INFOCOM 2000, Tel Aviv, Isreal, Mar. 2000, pp. 585-94.
  9. Weifa Liang, Liu Yuzhen, On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks. Ad Hoc Networks 5, 2007, pp. 272-285.
  10. M. I Channa , A. H Jalbani , P. K. Harani A Survey of Power Aware Routing Schemes for Mobile Ad Hoc Networks. International Journal of Computer Applications 58(11):48-50, November 2012.
  11. H. Moustafa and H. Labiod, Adaptive Path Energy Wireless Networks: an International Journal, Old City Publishing, Volume 1: issue 2 , 2005.
  12. Mohammed Tarique and Rumana Islam, Minimum Energy Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, IJCSNS International Journal of Computer Science and Network Security, Vol 7, N 11 (2007).
  13. Yang Tao and Wei Luo, Modified Energy-Aware DSR Routing for Ad hoc Network , International Conference on Wireless Communications, Networking and Mobile Computing, 2007. WiCom, pp: 1601-1603 (2007).
  14. Rodoplu V , Meng T, Minimum energy mobile wireless networks, IEEE Journal Selected Areas in Communication 17 (8), 1333-1344, 1999.
  15. T. S. Rappaport, Wireless Communications: Principles and Practices, Prentice Hall, 1996.
  16. K. FALL, K. VARADHAN. The NS manual. Lawrence Berkeley National Laboratory LBL, University of Southern California, USC, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

MANETs routing algorithm DSR Energy consumption optimization topology enclosure graph

Powered by PhDFocusTM