Journal article · 2011 · Open access
An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks
Procedia Environmental Sciences, 11, 518–524 · Published 1 January 2011 · DOI 10.1016/j.proenv.2011.12.082
In brief
“An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks” is a 2011 journal article by Huang Liang and 3 co-authors, published in Procedia Environmental Sciences. OpenAlex counts 8 citations as of 19 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Procedia Environmental Sciences.
- Citations
- 8
- Most cited in
- 2014 (2)
- Field-weighted impact
- 1.08
- References
- 7
- Authors
- 4
Abstract
In mobile Ad hoc networks, topology changes caused by mobile nodes may lead to the occurrence of link failure and redundant links. The link failure issue can be solved by insert relay nodes, but the latter question is not settled well. This paper presents a dynamic route optimization algorithm DROA which can effectively continue to optimize the path. With the topology changes, the algorithm chooses the optimal route to update the transmission path periodically, thereby reducing the number of hops and delay, avoiding restart the route discovery, saving control traffic and energy cost. The NS2 simulation platform is chosen to verify the performance of our algorithm. Experimental results show that in comparison with AODV, DROA has a better performance in end-to-end delay, path length and route life without more energy consumption.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Liang, H., Wang, F., Yan, G., & Duan, W. (2011). An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks. Procedia Environmental Sciences, 11, 518–524. https://doi.org/10.1016/j.proenv.2011.12.082
MLA 9
Liang, Huang, et al. “An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks.” Procedia Environmental Sciences, vol. 11, 2011, pp. 518–524. https://doi.org/10.1016/j.proenv.2011.12.082.
Chicago
Liang, Huang, Fubao Wang, Guoqiang Yan, and Weijun Duan. 2011. “An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks.” Procedia Environmental Sciences 11: 518–524. https://doi.org/10.1016/j.proenv.2011.12.082.
Harvard
Liang, H. et al. (2011) ‘An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks’, Procedia Environmental Sciences, 11, pp. 518–524. doi:10.1016/j.proenv.2011.12.082.
IEEE
H. Liang, F. Wang, G. Yan, and W. Duan, “An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks,” Procedia Environmental Sciences, vol. 11, pp. 518–524, 2011, doi: 10.1016/j.proenv.2011.12.082.
BibTeX
@article{liang2011efficient,
title = {{An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks}},
author = {Liang, Huang and Wang, Fubao and Yan, Guoqiang and Duan, Weijun},
journal = {Procedia Environmental Sciences},
year = {2011},
volume = {11},
pages = {518--524},
doi = {10.1016/j.proenv.2011.12.082},
url = {https://doi.org/10.1016/j.proenv.2011.12.082}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2013 | 1 | |
| 2014 | 2 | |
| 2016 | 1 | |
| 2017 | 1 | |
| 2019 | 1 | |
| 2021 | 2 |
Its field-weighted citation impact is 1.08: it has been cited 1.08 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- mobile ad hoc networks
- dynamic route optimization
- topology change
- link failure
- redundant links
- relay nodes
- end-to-end delay
- energy consumption
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Liang, H., Wang, F., Yan, G., & Duan, W. (2011). An Efficient Dynamic Route Optimization Algorithm for Mobile Ad hoc Networks. Procedia Environmental Sciences, 11, 518–524. https://doi.org/10.1016/j.proenv.2011.12.082
How many times has this paper been cited?
8 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Procedia Environmental Sciences: sign in and open the full text from this page.
Who wrote this paper?
Huang Liang, Fubao Wang, Guoqiang Yan, Weijun Duan.
What is the DOI of this paper?
10.1016/j.proenv.2011.12.082, permanently at https://doi.org/10.1016/j.proenv.2011.12.082. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.