The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Trading structure for randomness in wireless opportunistic routing
Open accessAbstract
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on routers' access to the medium. Although the scheduler delivers opportunistic gains, it misses some of the inherent features of the 802.11 MAC. For example, it prevents spatial reuse and thus may underutilize the wireless medium. It also eliminates the layering abstraction, making the protocol less amenable to extensions to alternate traffic types such as multicast.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
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
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
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
Routing in multi-radio, multi-hop wireless mesh networks
Draves, R., Padhye, J., & Zill, B. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023732 · Cited by 2,456
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
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
Self-citationNetwork coding for large scale content distribution
Gkantsidis, C., & Rodriguez, P. R. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498511 · Cited by 1,051
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
Polynomial Time Algorithms for Multicast Network Code Construction
Jaggi, S., Sanders, P., Chou, P. A., Effros, M., Egner, S., Jain, K., & Tolhuizen, L. M. G. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847712 · Cited by 940
Architecture and evaluation of an unplanned 802.11b mesh network
Bicket, J., Aguayo, D., Biswas, S., & Morris, R. (2005) · Proceedings of the 11th annual international conference on Mobile computing and networking · doi:10.1145/1080829.1080833 · Cited by 752
Opportunistic routing in multi-hop wireless networks
Biswas, S., & Morris, R. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972387 · Cited by 673
Cai, N., & Yeung, R. W. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023595 · Cited by 444
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
Self-citationAchieving single channel, full duplex wireless communication
Choi, J. I., Jain, M., Srinivasan, K., Levis, P., & Katti, S. (2010) · Proceedings of the sixteenth annual international conference on Mobile computing and networking · doi:10.1145/1859995.1859997 · Cited by 1,524
Self-citationTrading 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
Self-citationAn empirical study of low-power wireless
Srinivasan, K., Dutta, P., Tavakoli, A., & Levis, P. (2010) · ACM Transactions on Sensor Networks · doi:10.1145/1689239.1689246 · Cited by 333
Network Coding Meets TCP: Theory and Implementation
Sundararajan, J. K., Shah, D., Médard, M., Jakubczak, S., Mitzenmacher, M., & Barros, J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2093850 · Cited by 277
Metadata
- Authors
- Chachulski, S., Jennings, M., Katti, S., & Katabi, D.
- Venue
- Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2007-08-27
- Pages
- 169-180
- OpenAlex
- W2127350146
- Cited by
- 1,082
- References
- 15
- FWCI
- 68.24
- Type
- conference paper
- 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.