Journal article · 2007

A low overhead dynamic route repairing mechanism for mobile ad hoc networks

Chang Wu Yu, Tung‐Kuang Wu, Rei-Heng Cheng

Computer Communications, 30(5), 1152–1163 · Published 13 January 2007 · DOI 10.1016/j.comcom.2006.12.008

View at the publisherCite this paper

In brief

“A low overhead dynamic route repairing mechanism for mobile ad hoc networks” is a 2007 journal article by Chang Wu Yu and 2 co-authors, published in Computer Communications. OpenAlex counts 36 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
36
Most cited in
2012 (4)
Field-weighted impact
4.26
References
33
Authors
3

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Yu, C. W., Wu, T., & Cheng, R.-H. (2007). A low overhead dynamic route repairing mechanism for mobile ad hoc networks. Computer Communications, 30(5), 1152–1163. https://doi.org/10.1016/j.comcom.2006.12.008

MLA 9

Yu, Chang Wu, et al. “A low overhead dynamic route repairing mechanism for mobile ad hoc networks.” Computer Communications, vol. 30, no. 5, 2007, pp. 1152–1163. https://doi.org/10.1016/j.comcom.2006.12.008.

Chicago

Yu, Chang Wu, Tung‐Kuang Wu, and Rei-Heng Cheng. 2007. “A low overhead dynamic route repairing mechanism for mobile ad hoc networks.” Computer Communications 30 (5): 1152–1163. https://doi.org/10.1016/j.comcom.2006.12.008.

Harvard

Yu, C. W., Wu, T. and Cheng, R.-H. (2007) ‘A low overhead dynamic route repairing mechanism for mobile ad hoc networks’, Computer Communications, 30(5), pp. 1152–1163. doi:10.1016/j.comcom.2006.12.008.

IEEE

C. W. Yu, T. Wu, and R.-H. Cheng, “A low overhead dynamic route repairing mechanism for mobile ad hoc networks,” Computer Communications, vol. 30, no. 5, pp. 1152–1163, 2007, doi: 10.1016/j.comcom.2006.12.008.

BibTeX

@article{yu2007overhead,
  title     = {{A low overhead dynamic route repairing mechanism for mobile ad hoc networks}},
  author    = {Yu, Chang Wu and Wu, Tung‐Kuang and Cheng, Rei-Heng},
  journal   = {Computer Communications},
  year      = {2007},
  volume    = {30},
  number    = {5},
  pages     = {1152--1163},
  doi       = {10.1016/j.comcom.2006.12.008},
  url       = {https://doi.org/10.1016/j.comcom.2006.12.008}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201244
201344
201411
201544
201611
201733
201811
201911
202211

Its field-weighted citation impact is 4.26: it has been cited 4.26 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
  • link failure recovery
  • backup routing
  • routing protocols
  • control overhead
  • packet delivery ratio
  • communication delay
  • topology change

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Yu, C. W., Wu, T., & Cheng, R.-H. (2007). A low overhead dynamic route repairing mechanism for mobile ad hoc networks. Computer Communications, 30(5), 1152–1163. https://doi.org/10.1016/j.comcom.2006.12.008

How many times has this paper been cited?

36 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?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Chang Wu Yu, Tung‐Kuang Wu, Rei-Heng Cheng.

What is the DOI of this paper?

10.1016/j.comcom.2006.12.008, permanently at https://doi.org/10.1016/j.comcom.2006.12.008. 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.