The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Mobile Element Scheduling with Dynamic Deadlines
Abstract
Wireless networks have historically considered support for mobile elements's an extra overhead. However, recent research has provided the means by which a network can take advantage of mobile elements. Particularly in the case of wireless sensor networks, mobile elements can be deliberately built into the system to improve the lifetime of the network and act as mechanical carriers of data. The mobile element, whose mobility is controlled, visits the nodes to collect their data before their buffers are full. In general, the spatio-temporal dynamics of the sensed phenomenon may require sensor nodes to collect samples at different rates, in which case, some nodes need to be visited more frequently than others. This work formulates the problem of scheduling the mobile element in the network so that there is no data loss due to buffer overflow. The problem is shown to be NP-complete and an integer-linear-programming formulation is given. Finally, some computationally practical algorithms for a single mobile and for the case of multiple mobiles are presented and their performances compared
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Wireless sensor networks for habitat monitoring
Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., & Anderson, J. (2002) · Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications · doi:10.1145/570738.570751 · Cited by 4,166
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605408 · Cited by 1,804
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Data MULEs: modeling a three-tier architecture for sparse sensor networks
Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003) · Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003. · doi:10.1109/snpa.2003.1203354 · Cited by 1,322
Joint mobility and routing for lifetime elongation in wireless sensor networks
Luo, J., & Hubaux, J.-P. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498454 · Cited by 880
Local search in routing problems with time windows
Savelsbergh, M. W. P. (1985) · Annals of Operations Research · doi:10.1007/bf02022044 · Cited by 693
Cyclops: in situ image sensing and interpretation in wireless sensor networks
Rahimi, M., Baer, R., Iroezi, O. I., Garcia, J. C., Warrior, J., Estrin, D., & Srivastava, M. (2005) · Proceedings of the 3rd international conference on Embedded networked sensor systems · doi:10.1145/1098918.1098939 · Cited by 507
Self-citationControllably mobile infrastructure for low energy embedded networks
Somasundara, A. A., Kansal, A., Jea, D. D., Estrin, D., & Srivastava, M. B. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.109 · Cited by 346
Self-citationSomasundara, A. A., Ramamoorthy, A., & Srivastava, M. B. (2005) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.2004.31 · Cited by 331
Self-citationA Collaborative Approach to In-Place Sensor Calibration
Bychkovskiy, V., Megerian, S., Estrin, D., & Potkonjak, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36978-3_20 · Cited by 264
Call and response: experiments in sampling the environment
Batalin, M. A., Rahimi, M. H., Yu, Y. P., Liu, D., Kansal, A., Sukhatme, G. S., Kaiser, W. J., Hansen, M. H., Pottie, G. J., Srivastava, M. B., et al. (2004) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/1031495.1031499 · Cited by 160
Self-citation
Cited by
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
Di Francesco, M., Das, S. K., & Anastasi, G. (2011) · ACM Transactions on Sensor Networks · doi:10.1145/1993042.1993049 · Cited by 524
Efficient Informative Sensing using Multiple Robots
Singh, A., Krause, A., Guestrin, C., & Kaiser, W. J. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2674 · Cited by 255
Cognition in UAV-Aided 5G and Beyond Communications: A Survey
Ullah, Z., Al-Turjman, F., & Mostarda, L. (2020) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2020.2968311 · Cited by 226
Metadata
- Authors
- Somasundara, A. A., Ramamoorthy, A., & Srivastava, M. B.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2007-04
- Volume
- 6
- Issue
- 4
- Pages
- 395-410
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2111630330
- Cited by
- 265
- References
- 16
- FWCI
- 29.67
- 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
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.