The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Opportunistic routing in multi-hop wireless networks
Open accessAbstract
This paper describes Extremely Opportunistic Routing (ExOR), a new unicast routing technique for multi-hop wireless networks. ExOR forwards each packet through a sequence of nodes, deferring the choice of each node in the sequence until after the previous node has transmitted the packet on its radio. ExOR then determines which node, of all the nodes that successfully received that transmission, is the node closest to the destination. That closest node transmits the packet. The result is that each hop moves the packet farther (or average) than the hops of the best possible pre-determined route.The ExOR design addresses the challenge of choosing a forwarding node after transmission using a distributed algorithm. First, when a node transmits a packet, it includes in the packet a simple schedule describing the priority order in which the potential receivers should forward the packet. The node computes the schedule based on shared measurements of inter-node delivery rates. ExOR then uses a distributed slotted MAC protocol for acknowledgements to ensure that the receivers agree who the highest priority receiver was.The efficacy of ExOR depends mainly on the rate at which the reception probability falls off with distance. Simulations based on measured radio characteristics [6] suggest that ExOR reduces the total number of transmissions by nearly a factor of two over the best possible pre-determined route.
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
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Ad-hoc on-demand distance vector routing
Perkins, C. E., & Royer, E. M. (1999) · Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.1999.749281 · Cited by 10,313
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 high-throughput path metric for multi-hop wireless routing
De Couto, D. S. J., Aguayo, D., Bicket, J., & Morris, R. (2003) · Proceedings of the 9th annual international conference on Mobile computing and networking · doi:10.1145/938985.939000 · Cited by 3,356
Self-citationWireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
Location-aided routing (LAR) in mobile ad hoc networks
Ko, Y.-B., & Vaidya, N. H. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288252 · Cited by 2,005
A rate-adaptive MAC protocol for multi-Hop wireless networks
Holland, G., Vaidya, N., & Bahl, P. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381700 · Cited by 1,248
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., Liu, C.-G., McCanne, S., & Zhang, L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650139 · Cited by 1,168
Link-level measurements from an 802.11b mesh network
Aguayo, D., Bicket, J., Biswas, S., Judd, G., & Morris, R. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015482 · Cited by 997
Self-citationEnergy-efficient antenna sharing and relaying for wireless networks
Laneman, J. N., & Wornell, G. W. (2002) · 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540) · doi:10.1109/wcnc.2000.904590 · Cited by 846
Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks
Ganesan, D., Estrin, D. L., Woo, A., Culler, D., Krishnamachari, B., & Wicker, S. B. (2002) · Cited by 481
Performance of multihop wireless networks: shortest path is not enough
De Couto, D. S. J., Aguayo, D., Chambers, B. A., & Morris, R. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774776 · Cited by 370
Self-citationSelection diversity forwarding in a multihop packet radio network with fading channel and capture
Larsson, P. (2001) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/509506.509517 · Cited by 163
A Survey of Multi-Way Channels in Information Theory:
Meulen, D. (1977) · Cited by 43
Cited by
XORs in the Air: Practical Wireless Network Coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., & Crowcroft, J. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923722 · Cited by 2,252
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282400 · Cited by 1,082
Trading structure for randomness in wireless opportunistic routing
Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282400 · Cited by 485
Geographic routing made practical
Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. J. (2005) · doi:10.5555/1251203.1251219 · Cited by 373
Drone networks: Communications, coordination, and sensing
Yanmaz, E., Yahyanejad, S., Rinner, B., Hellwagner, H., & Bettstetter, C. (2018) · Ad Hoc Networks · doi:10.1016/j.adhoc.2017.09.001 · Cited by 348
Metadata
- Authors
- Biswas, S., & Morris, R.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2004-01
- Volume
- 34
- Issue
- 1
- Pages
- 69-74
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2104911317
- Cited by
- 673
- References
- 15
- FWCI
- 37.70
- Type
- journal article
- Language
- en
- Open access
- green
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
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.