The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Congestion control and fairness for many-to-one routing in sensor networks
Abstract
In this paper we propose a distributed and scalable algorithm that eliminates congestion within a sensor network, and that ensures the fair delivery of packets to a central node, or base station. We say that fairness is achieved when equal number of packets are received from each node. Since in general we have many sensors transmitting data to the base station, we consider the scenario where we have manyto-one multihop routing, noting that it can easily be extended to unicast or many-to-many routing. Such routing structures often result in the sensors closer to the base station experiencing congestion, which inevitably cause packets originating from sensors further away from the base station to have a higher probability of being dropped. Our algorithm exists in the transport layer of the traditional network stack model, and is designed to work with any MAC protocol in the data-link layer with minor modifications. Our solution is scalable, each sensor mote requires state proportional to the number of its neighbors. Finally, we demonstrate the effectiveness of our solution with both simulations and actual implementation in UC Berkeley’s sensor motes.
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
An energy-efficient MAC protocol for wireless sensor networks
Ye, W., Heidemann, J., & Estrin, D. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019408 · Cited by 5,361
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844142 · Cited by 2,719
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Chiu, D.-M., & Jain, R. (1989) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(89)90019-6 · Cited by 1,902
Taming the underlying challenges of reliable multihop routing in sensor networks
Woo, A., Tong, T., & Culler, D. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958494 · Cited by 1,512
A transmission control scheme for media access in sensor networks
Woo, A., & Culler, D. (2001) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/381677.381699 · Cited by 962
CODA: congestion detection and avoidance in sensor networks
Wan, C.-Y., Eisenman, S. B., & Campbell, A. T. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958523 · Cited by 895
ESRT: event-to-sink reliable transport in wireless sensor networks
Sankarasubramaniam, Y., Akan, Ö. B., & Akyildiz, I. F. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778437 · Cited by 738
Event-to-sink reliable transport in wireless sensor networks
Akan, O. B., & Akyildiz, I. F. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.857076 · Cited by 522
Stoica, I. G., Shenker, S. J., & Zhang, H. (1998) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/285237.285273 · Cited by 510
Stoica, I. G., Shenker, S. J., & Zhang, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808414 · Cited by 440
Cited by
Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., & Levis, P. (2009) · Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems · doi:10.1145/1644038.1644040 · Cited by 1,404
Sensor networks for medical care
Shnayder, V., Chen, B.-R., Lorincz, K., Jones, T. R. F. F., & Welsh, M. (2005) · Proceedings of the 3rd international conference on Embedded networked sensor systems · doi:10.1145/1098918.1098979 · Cited by 720
Mitigating congestion in wireless sensor networks
Hull, B., Jamieson, K., & Balakrishnan, H. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031512 · Cited by 648
Fair Resource Allocation in Federated Learning
Li, T., Sanjabi, M., Beirami, A., & Smith, V. (2019) · arXiv · doi:10.48550/arxiv.1905.10497 · Cited by 475
A survey of multimedia streaming in wireless sensor networks
Misra, S., Reisslein, M., & Xue, G. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080404 · Cited by 392
Metadata
- Authors
- Ee, C. T., & Bajcsy, R.
- Venue
- Proceedings of the 2nd international conference on Embedded networked sensor systems
- Publisher
- ACM
- Published
- 2004-11-03
- Pages
- 148-161
- OpenAlex
- W2030315897
- Cited by
- 521
- References
- 11
- FWCI
- 11.42
- Type
- conference paper
- 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
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.