Journal article · 2011

A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks

Trung-Dinh Han, Hoon Oh

Journal of Communications and Networks, 13(4), 385–392 · Published 1 August 2011 · DOI 10.1109/jcn.2011.6157458

View at the publisherCite this paper

In brief

“A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks” is a 2011 journal article by Trung-Dinh Han and Hoon Oh, published in Journal of Communications and Networks. OpenAlex counts 5 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
5
Most cited in
2013 (1)
Field-weighted impact
0.36
References
18
Authors
2

Abstract

A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an identical message repeatedly within the same loop. Therefore, the loop should be resolved to revert… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Han, T.-D., & Oh, H. (2011). A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks. Journal of Communications and Networks, 13(4), 385–392. https://doi.org/10.1109/jcn.2011.6157458

MLA 9

Han, Trung-Dinh, and Hoon Oh. “A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks.” Journal of Communications and Networks, vol. 13, no. 4, 2011, pp. 385–392. https://doi.org/10.1109/jcn.2011.6157458.

Chicago

Han, Trung-Dinh and Hoon Oh. 2011. “A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks.” Journal of Communications and Networks 13 (4): 385–392. https://doi.org/10.1109/jcn.2011.6157458.

Harvard

Han, T.-D. and Oh, H. (2011) ‘A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks’, Journal of Communications and Networks, 13(4), pp. 385–392. doi:10.1109/jcn.2011.6157458.

IEEE

T.-D. Han and H. Oh, “A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks,” Journal of Communications and Networks, vol. 13, no. 4, pp. 385–392, 2011, doi: 10.1109/jcn.2011.6157458.

BibTeX

@article{han2011looping,
  title     = {{A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks}},
  author    = {Han, Trung-Dinh and Oh, Hoon},
  journal   = {Journal of Communications and Networks},
  year      = {2011},
  volume    = {13},
  number    = {4},
  pages     = {385--392},
  doi       = {10.1109/jcn.2011.6157458},
  url       = {https://doi.org/10.1109/jcn.2011.6157458}
}

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

Citations by year

YearCitationsShare of the best year
201311
201511
201911
202011
202611

Its field-weighted citation impact is 0.36: it has been cited 0.36 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

  • loop detection
  • Mobile IP
  • mobile ad hoc networks
  • network topology changes
  • bandwidth degradation

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?

Han, T.-D., & Oh, H. (2011). A looping problem in the tree-based mobility management for mobile IP supported ad hoc networks. Journal of Communications and Networks, 13(4), 385–392. https://doi.org/10.1109/jcn.2011.6157458

How many times has this paper been cited?

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

Trung-Dinh Han, Hoon Oh.

What is the DOI of this paper?

10.1109/jcn.2011.6157458, permanently at https://doi.org/10.1109/jcn.2011.6157458. 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.