{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:13Z","timestamp":1725516013811},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_9","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"72-83","source":"Crossref","is-referenced-by-count":2,"title":["The Distributed Wireless Gathering Problem"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Bonifaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Korteweg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"I.F. Akyildiz","year":"2002","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks\u00a038(4), 393\u2013422 (2002)","journal-title":"Computer Networks"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M. Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention resolution protocols. Journal of the ACM\u00a048(1), 39\u201369 (2001)","journal-title":"Journal of the ACM"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multihop radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences\u00a045(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing\u00a022(4), 875\u2013887 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S0129626406002551","volume":"16","author":"J. Bermond","year":"2006","unstructured":"Bermond, J., Galtier, J., Klasing, R., Morales, N., P\u00e9rennes, S.: Hardness and approximation of gathering in static radio networks. Parallel Processing Letters\u00a016(2), 165\u2013183 (2006)","journal-title":"Parallel Processing Letters"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An approximation algorithm for the wireless gathering problem. In: Proc. of the 10th Scandinavian Workshop on Algorithms and Theory, pp. 328\u2013338 (2006)","DOI":"10.1007\/11785293_31"},{"key":"9_CR7","unstructured":"Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Minimzing flow time in the wireless gathering problem. In: Proc. of the 25th Int. Symp. on Theoretical Aspects of Computer Science (2008)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A. Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. Journal of the ACM\u00a048(1), 13\u201338 (2001)","journal-title":"Journal of the ACM"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1109\/JSAC.2004.830927","volume":"22","author":"F.C. Florens","year":"2004","unstructured":"Florens, F.C., McEliece, R.M.: Lower bounds on data collection time in sensory networks. IEEE J. on Selected Areas in Communications\u00a022, 1110 (2004)","journal-title":"IEEE J. on Selected Areas in Communications"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Goel, A., Khanna, S., Kumar, A.: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: Proc. of the ACM Symp. on the Theory of Computing, pp. 363\u2013372 (2004)","DOI":"10.1145\/1007352.1007411"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Leighton, F.T., Rogoff, B.: Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing\u00a025(4) (1996)","DOI":"10.1137\/S0097539792233828"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"Journal of the ACM"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kar, K., Kodialam, M.S., Lakshman, T.V., Tassiulas, L.: Routing for network capacity maximization in energy-constrained ad-hoc networks. In: Proc. IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208717"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kodialam, M.S., Nandagopal, T.: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. In: Proc. MOBICOM, pp. 42\u201354 (2003)","DOI":"10.1145\/938985.938991"},{"key":"9_CR15","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pp. 1021\u20131030 (2004)"},{"key":"9_CR16","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks. In: Proc. Dial-M\/POMC (2007)"},{"key":"9_CR17","unstructured":"Lu, G., Krishnamachari, B., Raghavendra, C.S.: An adaptive energy-efficient and low-latency mac for data gathering in wireless sensor networks. In: Proc. IEEE IPDPS (2004)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proc. IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"9_CR19","volume-title":"Wireless information networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.H.: Wireless information networks. Wiley, Chichester (1995)"},{"key":"9_CR20","volume-title":"Ad hoc networking","author":"C.E. Perkins","year":"2001","unstructured":"Perkins, C.E.: Ad hoc networking. Addison-Wesley, Reading (2001)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Polastre, J., Hill, J.L., Culler, D.E.: Versatile low power media access for wireless sensor networks. In: Proc. SenSys., pp. 95\u2013107 (2004)","DOI":"10.1145\/1031495.1031508"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. IEEE IPDPS (2006)","DOI":"10.1109\/IPDPS.2006.1639417"},{"issue":"7","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1109\/TCOMM.2004.831346","volume":"52","author":"L. Xiao","year":"2004","unstructured":"Xiao, L., Johansson, M., Boyd, S.P.: Simultaneous routing and resource allocation via dual decomposition. IEEE Transactions on Communications\u00a052(7), 1136\u20131144 (2004)","journal-title":"IEEE Transactions on Communications"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:17:11Z","timestamp":1620001031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}