Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Ad-hoc on-demand distance vector routing
19997.1k citationsCharles E. Perkins, E.M. Royerprofile →
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
19944.5k citationsCharles E. Perkins et al.profile →
Countries citing papers authored by Charles E. Perkins
Since
Specialization
Citations
This map shows the geographic impact of Charles E. Perkins's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Charles E. Perkins with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Charles E. Perkins more than expected).
Fields of papers citing papers by Charles E. Perkins
This network shows the impact of papers produced by Charles E. Perkins. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Charles E. Perkins. The network helps show where Charles E. Perkins may publish in the future.
Co-authorship network of co-authors of Charles E. Perkins
This figure shows the co-authorship network connecting the top 25 collaborators of Charles E. Perkins.
A scholar is included among the top collaborators of Charles E. Perkins based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Charles E. Perkins. Charles E. Perkins is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Vogt, Christian & Charles E. Perkins. (2008). The internet diary. ACM SIGMOBILE Mobile Computing and Communications Review. 12(2). 67–71.1 indexed citations
Koodli, Rajeev S. & Charles E. Perkins. (2007). Mobile Internetworking with IPv6: Concepts, Principles and Practices. Wiley-Interscience eBooks.16 indexed citations
8.
Engelstad, Paal, Zheng Yan, Rajeev S. Koodli, & Charles E. Perkins. (2006). Service Discovery Architectures for On-Demand Ad Hoc Networks. Ad Hoc & Sensor Wireless Networks. 2. 27–58.20 indexed citations
9.
Perkins, Charles E., et al.. (2005). WIRELESS OVERLAY NETWORKS BASED ON MOBILE IPv6.
Perkins, Charles E. & Jim Bound. (2002). DHCP for IPv6. 493–497.3 indexed citations
13.
Das, S.R., Charles E. Perkins, & E.M. Royer. (2002). Performance comparison of two on-demand routing protocols for ad hoc networks. 1. 3–12.688 indexed citations breakdown →
14.
Perkins, Charles E.. (2001). Mobile IPv6. 6.2 indexed citations
15.
Perkins, Charles E.. (2000). Mobile IP and the IETF. ACM SIGMOBILE Mobile Computing and Communications Review. 4(4). 7–11.3 indexed citations
16.
Perkins, Charles E.. (1999). Mobile networking with mobile IP. 378–387.
17.
Royer, E.M. & Charles E. Perkins. (1999). Multicast operation of the ad-hoc on-demand distance vector routing protocol. 207–218.783 indexed citations breakdown →
18.
Perkins, Charles E. & David Johnson. (1998). Route Optimization for Mobile IP. Cluster Computing. 1(2). 161–176.252 indexed citations
Perkins, Charles E.. (1994). Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV).171 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.