Most cited papers in Opportunistic and Delay-Tolerant Networks
What are the most cited papers in Opportunistic and Delay-Tolerant Networks?
The most cited paper in Opportunistic and Delay-Tolerant Networks is "Consensus Problems in Networks of Agents With Switching Topology and Time-Delays" (Reza Olfati‐Saber, Richard M. Murray, 2004), with 12,915 citations. Next come "An application-specific protocol architecture for wireless microsensor networks" (10,610) and "Ad-hoc on-demand distance vector routing" (10,342).
Showing 50 of 98 papers. Every paper with more than 1,313 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Consensus Problems in Networks of Agents With Switching Topology and Time-Delays Reza Olfati‐Saber, Richard M. Murray · IEEE Transactions on Automatic Control | Sep 2004 | 12,915 |
| 2 | An application-specific protocol architecture for wireless microsensor networks Wendi Heinzelman, Anantha P. Chandrakasan, Hari Balakrishnan · IEEE Transactions on Wireless Communications | Oct 2002 | 10,610 |
| 3 | Ad-hoc on-demand distance vector routing Charles E. Perkins, E.M. Royer | 1999 | 10,342 |
| 4 | Chord Ion Gabriel Stoica, Robert Morris, David R. Karger et al. | 27 Aug 2001 | 9,673 |
| 5 | Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson, David A. Maltz | 25 Aug 2007 | 8,548 |
| 6 | Error and attack tolerance of complex networks Réka Albert, Hawoong Jeong, Albert-László Barabási · Nature | 27 Jul 2000 | 7,387 |
| 7 | Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems Antony I.T. Rowstron, Peter Druschel · Lecture notes in computer science | 2001 | 7,322 |
| 8 | GPSR Brad Karp, H. T. Kung | Aug 2000 | 7,072 |
| 9 | Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers Charles E. Perkins, Pravin Bhagwat · ACM SIGCOMM Computer Communication Review | Oct 1994 | 6,708 |
| 10 | A scalable content-addressable network Sylvia Ratnasamy, Paul Francis, Mark James Handley et al. | 27 Aug 2001 | 6,406 |
| 11 | Directed diffusion Chalermek Intanagonwiwat, Ramesh Govindan, Deborah L. Estrin | Aug 2000 | 5,406 |
| 12 | HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks Ossama Mohamed Younis, Sonia Fahmy · IEEE Transactions on Mobile Computing | Oct 2004 | 5,041 |
| 13 | A survey of mobility models for ad hoc network research Tracy K. Camp, Jeff L. Boleng, Vanessa Davies · Wireless Communications and Mobile Computing | Aug 2002 | 4,638 |
| 14 | Wireless sensor networks for habitat monitoring Alan M. Mainwaring, David Culler, Joseph Polastre et al. | 28 Sep 2002 | 4,182 |
| 15 | Epidemic routing for partially-connected ad hoc networks Amin M. Vahdat | 2000 | 4,148 |
| 16 | Networking named content Van L. Jacobson, Diana K. Smetters, James D. Thornton et al. | Dec 2009 | 4,054 |
| 17 | Wireless mesh networks: a survey Ian Fuat Akyildiz, Xudong Wang, Weilin Wang · Computer Networks | 4 Jan 2005 | 4,024 |
| 18 | A review of current routing protocols for ad hoc mobile wireless networks E.M. Royer, Chai-Keong Toh · IEEE Personal Communications | Apr 1999 | 3,775 |
| 19 | PEGASIS: Power-efficient gathering in sensor information systems Stephanie Lindsey, Cauligi S. Raghavendra · Proceedings - IEEE Aerospace Conference | 25 Jun 2003 | 3,707 |
| 20 | A survey on routing protocols for wireless sensor networks Kemal Akkaya, Mohamed Younis · Ad Hoc Networks | 2 Dec 2003 | 3,499 |
| 21 | Mitigating routing misbehavior in mobile ad hoc networks Sergio Marti, TJ Giuli, Kevin Lai et al. | Aug 2000 | 3,439 |
| 22 | Context-Aware Computing Applications Bill N. Schilit, Norman I. Adams, Roy Want | Dec 1994 | 3,215 |
| 23 | A delay-tolerant network architecture for challenged internets Kevin Fall | 25 Aug 2003 | 3,091 |
| 24 | Kademlia: A Peer-to-Peer Information System Based on the XOR Metric Petar Maymounkov, David Mazières · Lecture notes in computer science | 2002 | 3,020 |
| 25 | Friendship and mobility Eunjoon Cho, Seth A. Myers, Jure Leskovec | 21 Aug 2011 | 2,952 |
| 26 | Geography-informed energy conservation for Ad Hoc routing Ya Xu, John Heidemann, Deborah L. Estrin | 16 Jul 2001 | 2,843 |
| 27 | Towards a Better Understanding of Context and Context-Awareness Gregory D. Abowd, Anind K. Dey, Peter J. Brown et al. · Lecture notes in computer science | 1999 | 2,611 |
| 28 | Energy conservation in wireless sensor networks: A survey Giuseppe Anastasi, Marco Conti, Mario Di Francesco et al. · Ad Hoc Networks | 30 Jul 2008 | 2,588 |
| 29 | SPINS Adrian Perrig, Robert Szewczyk, Victor S. H. Wen et al. | 16 Jul 2001 | 2,542 |
| 30 | Randomized gossip algorithms Stephen Boyd, Aritra Ghosh, Balaji Prabhakar et al. · IEEE Transactions on Information Theory | Jun 2006 | 2,538 |
| 31 | Network Robustness and Fragility: Percolation on Random Graphs Duncan S. Callaway, Mark E. J. Newman, Steven H. Strogatz et al. · Physical Review Letters | 18 Dec 2000 | 2,517 |
| 32 | Real-time status: How often should one update? Sanjit K. Kaul, Roy D. Yates, Marco Gruteser | Mar 2012 | 2,514 |
| 33 | Pervasive computing: vision and challenges Mahadev Satyanarayanan · IEEE Personal Communications | 2001 | 2,429 |
| 34 | Survey of Important Issues in UAV Communication Networks Lav Gupta, Raj Kumar Jain, Gabor Vaszkun · IEEE Communications Surveys & Tutorials | 3 Nov 2015 | 2,383 |
| 35 | Directed diffusion for wireless sensor networking Chalermek Intanagonwiwat, Ramesh Govindan, Deborah L. Estrin et al. · IEEE/ACM Transactions on Networking | Feb 2003 | 2,358 |
| 36 | Securing ad hoc networks Lidong Zhou, Zygmunt J. Haas · IEEE Network | 1999 | 2,347 |
| 37 | DSR: the dynamic source routing protocol for multihop wireless ad hoc networks David B. Johnson, David A. Maltz, Josh Broch | Mar 2001 | 2,338 |
| 38 | Adaptive protocols for information dissemination in wireless sensor networks Wendi Heinzelman, Joanna Kulik, Hari Balakrishnan | Aug 1999 | 2,312 |
| 39 | Probabilistic routing in intermittently connected networks Anders Lindgren, Avri Doria, Olov Schelén · ACM SIGMOBILE Mobile Computing and Communications Review | Jul 2003 | 2,296 |
| 40 | TEEN: a routing protocol for enhanced efficiency in wireless sensor networks A. Manjeshwar, Dharma Prakash Agrawal | 29 Aug 2005 | 2,259 |
| 41 | SPINS: Security Protocols for Sensor Networks Adrian Perrig, Robert Szewczyk, J. D. Tygar et al. · Wireless Networks | Sep 2002 | 2,259 |
| 42 | A highly adaptive distributed routing algorithm for mobile wireless networks V.D. Park, M. Scott Corson | 22 Nov 2002 | 2,246 |
| 43 | Energy-Efficient UAV Communication With Trajectory Optimization Yong Zeng, Rui Zhang · IEEE Transactions on Wireless Communications | 28 Mar 2017 | 2,200 |
| 44 | Applications of Deep Reinforcement Learning in Communications and Networking: A Survey Nguyen Cong Luong, Dinh Thai Hoang, Shimin Gong et al. · IEEE Communications Surveys & Tutorials | 2019 | 2,118 |
| 45 | Protocols for self-organization of a wireless sensor network Katayoun Sohrabi, Jhih-Siao Gao, V. Ailawadhi et al. · IEEE Personal Communications | 2000 | 2,068 |
| 46 | MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks John R. Burgess, Brian J. Gallagher, David D. Jensen et al. | 2006 | 2,045 |
| 47 | Location-aided routing (LAR) in mobile ad hoc networks Young‐Bae Ko, Nitin H. Vaidya | 25 Oct 1998 | 2,015 |
| 48 | TOSSIM Philip A. Levis, Nelson L.S. Lee, Matt Welsh et al. | 5 Nov 2003 | 2,007 |
| 49 | Power-aware routing in mobile ad hoc networks Suresh Singh, Mike Woo, Cauligi S. Raghavendra | 25 Oct 1998 | 1,959 |
| 50 | Chord Ion Gabriel Stoica, Robert Morris, David R. Karger et al. · ACM SIGCOMM Computer Communication Review | 27 Aug 2001 | 1,920 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.