The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Topology control and routing in ad hoc networks: a survey
Abstract
An ad hoc wireless network, or simply an ad hoc network, consists of a collection of geographically distributed nodes that communicate with one other over a wireless medium. An ad hoc network differs from cellular networks in that there is no wired infrastructure and the communication capabilities of the network are limited by the battery power of the network nodes. One of the original motivations for ad hoc networks is found in military applications. A classic example of ad hoc networking is network of war fighters and their mobile platforms in battlefields. Indeed, a wealth of early research in the area involved the development of packet-radio networks (PRNs) and survivable radio networks [16]. While military applications still dominate the research needs in ad hoc networking, the recent rapid advent of mobile telephony and plethora of personal digital assistants has brought to the fore a number of potential commercial applications of ad hoc networks. Examples are disaster relief, conferencing, home networking, sensor networks, personal area networks, and embedded computing applications [37].The lack of a fixed infrastructure in ad hoc networks implies that any computation on the network needs to be carried out in a decentralized manner. Thus, many of the important problems in ad hoc networking can be formulated as problems in distributed computing. However, there are certain characteristics of ad hoc networks that makes this study somewhat different than traditional work in distributed computing. In this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. This article is not intended to be a comprehensive survey on ad hoc networking. The choice of the problems discussed in this article are somewhat biased by the research interests of the author.The remainder of this article is organized as follows. In Section 2, we describe various aspects relevant to modeling ad hoc networks. In Section 3, we discuss topology control. Since the nodes of an ad hoc network are often associated with points in 2-dimensional space, topology control is closely tied to computational geometry; we will briefly review this relationship and extant work in the area. In Section 4, we discuss routing protocols for ad hoc networks. After a brief overview of the many protocols that have been proposed, we discuss alternative approaches based on the adversarial network model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Cited by
Energy-Efficient Cloud Computing
Berl, A., Gelenbe, E., Di Girolamo, M., Giuliani, G., De Meer, H., Dang, M. Q., & Pentikousis, K. (2010) · The Computer Journal · doi:10.1093/comjnl/bxp080 · Cited by 650
Enabling ubiquitous patient monitoring: Model, decision protocols, opportunities and challenges
Sneha, S., & Varshney, U. (2009) · Decision Support Systems · doi:10.1016/j.dss.2008.11.014 · Cited by 153
Topology-aware Federated Learning in Edge Computing: A Comprehensive Survey
Wu, J., Dong, F., Leung, H., Zhu, Z., Zhou, J., & Drew, S. (2024) · ACM Computing Surveys · doi:10.1145/3659205 · Cited by 130
Metadata
- Authors
- Rajaraman, R.
- Venue
- ACM SIGACT News
- Published
- 2002-06
- Volume
- 33
- Issue
- 2
- Pages
- 60-73
- ISSN
- 0163-5700 (ISSN-L)
- OpenAlex
- W2030726651
- Cited by
- 396
- References
- 25
- FWCI
- 22.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Topology control and routing in ad hoc networks: a survey. https://app.cochat.ai/papers/10.1145/564585.564602
- The paper
- Rajaraman, R. (2002). Topology control and routing in ad hoc networks: a survey. ACM SIGACT News. https://doi.org/10.1145/564585.564602
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.