{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:14:20Z","timestamp":1740287660181,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202608"},{"type":"electronic","value":"9783540396116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39611-6_19","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T22:10:23Z","timestamp":1278022223000},"page":"211-222","source":"Crossref","is-referenced-by-count":0,"title":["On the Interaction of Bandwidth Constraints and Energy Efficiency in All-Wireless Networks"],"prefix":"10.1007","author":[{"given":"Tommy","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioanis","family":"Nikolaidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.: Capacity of Wireless Networks. IEEE Transactions on Information Theory\u00a046(2), 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Wieselthier, J.E., Nguygen, G., Ephremides, A.: On the Construction of Energy Efficient Broadcast and Multicast trees in Wireless Networks. In: Proc. of IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000, vol.\u00a02, pp. 585\u2013594 (2000)","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic Matrix Estimation: Existing Techniques and New Directions. In: Proc. of the 2002 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Pittsburgh, Pennsylvania, USA, August 2002, pp. 161\u2013174 (2002)","DOI":"10.1145\/633025.633041"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Marina, M., Kondylis, G., Kozat, U.C.: RBRP: A Robust Broadcast Reservation Protocol for Mobile Ad Hoc Networks. In: Proc. of IEEE\/ICC-2001, Helsinki, Finland, June 2001, vol.\u00a03, pp. 878\u2013885 (2001)","DOI":"10.1109\/ICC.2001.937364"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Tang, Z., Garcia-Luna-Aceves, J.: A Protocol for Topology-Dependent Transmission Scheduling. In: Proc. of IEEE WCNC 1999, New Orleans, Las Angelas, USA, September 1999, vol.\u00a03, pp. 1333\u20131337 (1999)","DOI":"10.1109\/WCNC.1999.796954"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues. In: Proc. of 8th Annual International Conference on Mobile Computing and Networking, Atlanta, Georgia, USA, September 2002, pp. 172\u2013182 (2002)","DOI":"10.1145\/570645.570667"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Near- Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. In: Proc. of the 31stAnnual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, May 1999, pp. 19\u201328 (1999)","DOI":"10.1145\/301250.301262"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1287\/moor.27.2.372.323","volume":"27","author":"V. Tandon","year":"2002","unstructured":"Tandon, V., Frank, A., Vegh, Z.: Node-capacitated Multicommodity Routing for a Ring. Math. of Operations Research\u00a027(2), 372\u2013383 (2002)","journal-title":"Math. of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39611-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T13:53:44Z","timestamp":1740232424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39611-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202608","9783540396116"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39611-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}