research-article

Minimizing flow time in the wireless gathering problem

Authors:

Vincenzo Bonifaci,

Peter Korteweg,

Alberto Marchetti-Spaccamela,

Leen StougieAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 7, Issue 3

Article No.: 33, Pages 1 - 20

https://doi.org/10.1145/1978782.1978788

Published: 15 July 2011 Publication History

Abstract

We address the problem of efficient data gathering in a wireless network through multihop communication. We focus on two objectives related to flow times, that is, the times spent by data packets in the system: minimization of the maximum flow time and minimization of the average flow time of the packets. For both problems we prove that, unless P=NP, no polynomial-time algorithm can approximate the optimal solution within a factor less than Ω(m¹−ε) for any 0<ε<1, where m is the number of packets. We then assess the performance of two natural algorithms by proving that their cost remains within the optimal cost of the respective problem if we allow the algorithms to transmit data at a speed 5 times higher than that of the optimal solutions to which we compare them.

References

[1]

Anil Kumar, V. S., Marathe, M. V., Parthasarathy, S., and Srinivasan, A. 2004. End-to-end packet-scheduling in wireless ad-hoc networks. In Proceedings of the 15th Symposium on Discrete Algorithms, J. I. Munro, Ed. SIAM, Philadelphia, PA, 1021--1030.

Digital Library

[2]

Anil Kumar, V. S., Marathe, M. V., Parthasarathy, S., and Srinivasan, A. 2005. Algorithmic aspects of capacity in wireless networks. In Proceedings of the Conference on Measurement and Modeling of Computer Systems. ACM, New York, 133--144.

Digital Library

[3]

Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., and Cayirci, E. 2002. Wireless sensor networks: A survey. Comput. Netw. 38, 4, 393--422.

Digital Library

[4]

Bar-Yehuda, R., Goldreich, O., and Itai, A. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 1, 104--126.

Digital Library

[5]

Bar-Yehuda, R., Israeli, A., and Itai, A. 1993. Multiple communication in multihop radio networks. SIAM J. Comput. 22, 4, 875--887.

Digital Library

[6]

Bender, M. A., Chakrabarti, S., and Muthukrishnan, S. 1998. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 270--279.

Digital Library

[7]

Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., and Pérennes, S. 2006. Hardness and approximation of gathering in static radio networks. Parall. Process. Lett. 16, 2, 165--183.

[8]

Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., and Stougie, L. 2008. An approximation algorithm for the wireless gathering problem. Oper. Res. Lett. 36, 5, 605--608.

Digital Library

[9]

Borodin, A. and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, UK.

Digital Library

[10]

Chan, H.-L., Lam, T. W., and Liu, K.-S. 2006. Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. In Proceedings of the 17th Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 334--343.

Digital Library

[11]

Chekuri, C., Goel, A., Khanna, S., and Kumar, A. 2004. Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In Proceedings of the 36th Symposium on Theory of Computing. ACM, New York, 363--372.

Digital Library

[12]

Clark, B. N., Colbourn, C. J., and Johnson, D. S. 1990. Unit disk graphs. Discr. Math. 86, 1-3, 165--177.

Digital Library

[13]

Florens, C., Franceschetti, M., and McEliece, R. J. 2004. Lower bounds on data collection time in sensory networks. IEEE J. Select. Areas Comm. 22, 1110--1120.

Digital Library

[14]

Gargano, L. and Rescigno, A. A. 2006. Optimally fast data gathering in sensor networks. In Proceedings of the 31st Symposium on Mathematical Foundations of Computer Science. Springer, 399--411.

Digital Library

[15]

Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discr. Math. 5, 287--326.

[16]

Kalyanasundaram, B. and Pruhs, K. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4, 617--643.

Digital Library

[17]

Ko, C. W. and Shepherd, F. B. 2003. Bipartite domination and simultaneous matroid covers. SIAM J. Discr. Math. 16, 4, 517--523.

Digital Library

[18]

Korteweg, P. 2008. Online gathering algorithms for wireless networks. Ph.D. thesis, Technische Universiteit Eindhoven.

[19]

Leonardi, S. and Raz, D. 2007. Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73, 6, 875--891.

Digital Library

[20]

Leung, J. Y.-T., Ed. 2004. Handbook of Scheduling. CRC Press, Boca Raton, FL.

[21]

Linial, N. 1992. Locality in distributed graph algorithms. SIAM J. Comput. 21, 1, 193--201.

Digital Library

[22]

Pahlavan, K. and Levesque, A. H. 1995. Wireless Information Networks. Wiley, New York.

Digital Library

[23]

Pelc, A. 2002. Broadcasting in radio networks. In Handbook of Wireless Networks and Mobile Computing. Wiley, New York, 509--528.

Digital Library

[24]

Ramanathan, S. and Lloyd, E. L. 1993. Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Netw. 1, 2, 166--177.

Digital Library

[25]

Schmid, S. and Wattenhofer, R. 2006. Algorithmic models for sensor networks. In Proceedings of the 20th International Parallel and Distributed Processing Symposium. IEEE, Los Alamitos, CA.

Digital Library

[26]

Schrage, L. 1968. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16, 3, 687--690.

Digital Library

[27]

Torng, E. and McCullough, J. 2008. SRPT optimally utilizes faster machines to minimize flow time. ACM Trans. Algor. 5, 1.

Digital Library

Cited By

Muñoz ARubio F(2021)Evaluating genetic algorithms through the approximability hierarchyJournal of Computational Science10.1016/j.jocs.2021.10138853(101388)Online publication date: Jul-2021
https://doi.org/10.1016/j.jocs.2021.101388
Saeedi Madani SKiani D(2021)Induced matchings in strongly biconvex graphs and some algebraic applicationsMathematische Nachrichten10.1002/mana.201900472294:6(1160-1174)Online publication date: 29-Mar-2021
https://doi.org/10.1002/mana.201900472
Habib MMouatadid L(2020)Maximum Induced Matching Algorithms via Vertex Ordering CharacterizationsAlgorithmica10.1007/s00453-018-00538-582:2(260-278)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s00453-018-00538-5
Show More Cited By

Recommendations

A distributed clustering method for energy-efficient data gathering in sensor networks

Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable in prolonging the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering method where energy-...
Hierarchical Ring-Based Data Gathering for Dense Wireless Sensor Networks

Data gathering is an essential operation in wireless sensor networks. For periodic data gathering applications, each sensor node has data that must be sent to a distant base station in a round of communication. Due to the limited battery power of sensor ...
Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Recently, there has been increasing interest in Mobile Wireless Sensor Networks MWSNs that are constructed by mobile sensor nodes held by ordinary people, and it has led to a new concept called urban sensing. In such MWSNs, mobile sensor nodes densely ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 7, Issue 3

July 2011

294 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1978782

Issue’s Table of Contents

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 2011

Accepted: 01 August 2010

Revised: 01 November 2009

Received: 01 August 2008

Published in TALG Volume 7, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
300
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Muñoz ARubio F(2021)Evaluating genetic algorithms through the approximability hierarchyJournal of Computational Science10.1016/j.jocs.2021.10138853(101388)Online publication date: Jul-2021
https://doi.org/10.1016/j.jocs.2021.101388
Saeedi Madani SKiani D(2021)Induced matchings in strongly biconvex graphs and some algebraic applicationsMathematische Nachrichten10.1002/mana.201900472294:6(1160-1174)Online publication date: 29-Mar-2021
https://doi.org/10.1002/mana.201900472
Habib MMouatadid L(2020)Maximum Induced Matching Algorithms via Vertex Ordering CharacterizationsAlgorithmica10.1007/s00453-018-00538-582:2(260-278)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s00453-018-00538-5
Kumar VMarathe MParthasarathy SSrinivasan A(2016)Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc NetworksACM Transactions on Algorithms10.1145/281281112:3(1-25)Online publication date: 25-Apr-2016
https://dl.acm.org/doi/10.1145/2812811
TAKAOKA ATAYU SUENO S(2014)Dominating Sets and Induced Matchings in Orthogonal Ray GraphsIEICE Transactions on Information and Systems10.1587/transinf.2014EDP7184E97.D:12(3101-3109)Online publication date: 2014
https://doi.org/10.1587/transinf.2014EDP7184
Chalermsook PLaekhanukit BNanongkai DKhanna S(2013)Graph products revisitedProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627929(1557-1576)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627929
Chalermsook PLaekhanukit BNanongkai D(2013)Independent Set, Induced Matching, and PricingProceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science10.1109/FOCS.2013.47(370-379)Online publication date: 26-Oct-2013
https://dl.acm.org/doi/10.1109/FOCS.2013.47
Marinescu-Ghemeci R(2012)Maximum Induced Matchings in GridsOptimization Theory, Decision Making, and Operations Research Applications10.1007/978-1-4614-5134-1_12(177-187)Online publication date: 19-Sep-2012
https://doi.org/10.1007/978-1-4614-5134-1_12
Milosavljević N(2011)On complexity of wireless gathering problems on unit-disk graphsProceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks10.5555/2032462.2032493(308-321)Online publication date: 18-Jul-2011
https://dl.acm.org/doi/10.5555/2032462.2032493
Bonifaci VKorteweg PMarchetti-Spaccamela AStougie L(2011)The distributed wireless gathering problemTheoretical Computer Science10.1016/j.tcs.2010.10.018412:8-10(633-641)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.tcs.2010.10.018
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents