{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T12:31:13Z","timestamp":1780403473236,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,6]],"date-time":"2010-10-06T00:00:00Z","timestamp":1286323200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11276-010-0287-6","type":"journal-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T07:01:14Z","timestamp":1286262074000},"page":"397-410","source":"Crossref","is-referenced-by-count":14,"title":["Novel algorithms for the network lifetime problem in wireless settings"],"prefix":"10.1007","volume":"17","author":[{"given":"Michael","family":"Elkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Lando","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanan","family":"Shpungin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,10,6]]},"reference":[{"key":"287_CR1","doi-asserted-by":"crossref","unstructured":"Adamou, M., & Sarkar, S. (2002). A framework for optimal battery management for wireless nodes. In INFOCOM\u201902, 3, 1783\u20131792.","DOI":"10.1109\/INFCOM.2002.1019432"},{"key":"287_CR2","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C. (2005). An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks. In ICALP\u201905, pp. 1139\u20131150.","DOI":"10.1007\/11523468_92"},{"issue":"1","key":"287_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480192240226","volume":"8","author":"T. Andreae","year":"1995","unstructured":"Andreae, T., & Bandelt, H. -J. (1995). Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal of Discrete Mathematics, 8(1), 1\u201316","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"287_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B. (1987). Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Annual ACM symposium on theory of computing, New York, USA, July 1987, pp. 230\u2013240.","DOI":"10.1145\/28395.28421"},{"issue":"4","key":"287_CR5","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/080734340","volume":"39","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Khandekar, R., & Nagarajan, V. (2009). Additive gurantees for degree bounded directed network design. SIAM Journal of Computer, 39(4), 1413\u20131431.","journal-title":"SIAM Journal of Computer"},{"key":"287_CR6","doi-asserted-by":"crossref","unstructured":"Bao, L., & Garcia-Luna-Aceves, J. J. (2001). Channel access scheduling in ad hoc networks with unidirectional links. In DIALM\u201901, pp. 9\u201318.","DOI":"10.1145\/381448.381450"},{"issue":"1","key":"287_CR7","first-page":"61","volume":"10","author":"D. Berend","year":"2010","unstructured":"Berend, D., Segal, M., & Shpungin, H. (2010). Energy and lifetime efficient connectivity in wireless ad-hoc networks. Ad Hoc & Sensor Wireless Networks, 10(1), 61\u201387.","journal-title":"Ad Hoc & Sensor Wireless Networks"},{"key":"287_CR8","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., & Zelikovsky, A. (2003). Network lifetime and power assignment in ad hoc wireless networks. In ESA\u201903, pp. 114\u2013126","DOI":"10.1007\/978-3-540-39658-1_13"},{"key":"287_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., & Moscardelli, L. (2007). An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks. In ICALP\u201907, pp. 447\u2013458","DOI":"10.1007\/978-3-540-73420-8_40"},{"key":"287_CR10","doi-asserted-by":"crossref","unstructured":"Chandrakasan, A., Amirtharajah, R., Cho, S., Goodman, J., Konduri, G., Kulik, J., Rabiner, W., & Wang, A. (1999). Design considerations for distributed microsensor systems. In CICC\u201999, pp. 279\u2013286.","DOI":"10.1109\/CICC.1999.777291"},{"key":"287_CR11","unstructured":"Chang, J. -H., & Tassiulas, L. (2000). Energy conserving routing in wireless ad-hoc networks. In INFOCOM\u201900, pp. 22\u201331"},{"issue":"3","key":"287_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W. -T. Chen","year":"1989","unstructured":"Chen, W. -T., & Huang, N. -F. (1989). The strongly connecting problem on multihop packet radio networks. IEEE Transactions on Communications, 37(3), 293\u2013295.","journal-title":"IEEE Transactions on Communications"},{"key":"287_CR13","first-page":"185","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"Edmonds, J. (1979). Matroid intersection. Annals of discrete Mathematics, 4, 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"287_CR14","doi-asserted-by":"crossref","unstructured":"Garg, N., & K\u00f6nemann, J. (1998). Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS\u201998, pp. 300\u2013309.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"287_CR15","doi-asserted-by":"crossref","unstructured":"Gerla, M., Lee, Y. -Z., Park, J. -S., & Yi, Y. (2005). On demand multicast routing with unidirectional links. In WCNC\u201905, pp. 2162\u20132167.","DOI":"10.1109\/WCNC.2005.1424852"},{"key":"287_CR16","doi-asserted-by":"crossref","unstructured":"Kalpakis, K., Dasgupta, K., & Namjoshi, P. (2003). Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks Journal, 42(6), 697\u2013716.","DOI":"10.1016\/S1389-1286(03)00212-3"},{"issue":"6","key":"287_CR17","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s11036-005-4445-5","volume":"10","author":"I. Kang","year":"2005","unstructured":"Kang, I., & Poovendran, R. (2005). Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks. Mobile Networks and Applications, 10(6), 879\u2013896.","journal-title":"Mobile Networks and Applications"},{"issue":"1-2","key":"287_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. M. Kirousis","year":"2000","unstructured":"Kirousis, L. M., Kranakis, E., Krizanc, D., & Pelc, A. (2000). Power consumption in packet radio networks. Theoretical Computer Science, 243(1\u20132), 289\u2013305.","journal-title":"Theoretical Computer Science"},{"key":"287_CR19","unstructured":"Krishnamachari, B., Estrin, D., & Wicker, S. (2002). Modelling data-centric routing in wireless sensor networks. In INFOCOM\u201902."},{"issue":"1","key":"287_CR20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TMC.2007.250667","volume":"6","author":"W. Liang","year":"2007","unstructured":"Liang, W., & Liu, Y. (2007). Online data gathering for maximizing network lifetime in sensor networks. IEEE Transactions on Mobile Computing, 6(1), 2\u201311.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"287_CR21","doi-asserted-by":"crossref","unstructured":"Lin, C. -H., Liu, B. -H., Yang, H. -Y., Kao, C. -Y., & Tsai, M. -J. (2008). Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks with unidirectional links. In INFOCOM\u201908, pp. 351\u2013355.","DOI":"10.1109\/INFOCOM.2008.79"},{"key":"287_CR22","doi-asserted-by":"crossref","unstructured":"Orda, A., & Yassour, B. -A. (2005). Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas. In MobiHoc\u201905, pp. 426\u2013437.","DOI":"10.1145\/1062689.1062742"},{"key":"287_CR23","volume-title":"Wireless information networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., & Levesque, A. H. (1995). Wireless information networks. NY: Wiley-Interscience."},{"issue":"9","key":"287_CR24","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1109\/TC.2005.148","volume":"54","author":"J. Park","year":"2005","unstructured":"Park, J., & Sahni, S. (2005). Maximum lifetime broadcasting in wireless networks. IEEE Transactions on Computers, 54(9), 1081\u20131090.","journal-title":"IEEE Transactions on Computers"},{"key":"287_CR25","doi-asserted-by":"crossref","unstructured":"Rajendran, V., Obraczka, K., & Garcia-Luna-Aceves, J. J. (2003). Energy-efficient collision-free medium access control for wireless sensor networks. In SenSys\u201903, pp. 181\u2013192.","DOI":"10.1145\/958491.958513"},{"key":"287_CR26","unstructured":"Ramasubramanian, V., Chandra, R., & Moss\u00e9, D. (2002). Providing a bidirectional abstraction for unidirectional adhoc networks. In INFOCOM."},{"key":"287_CR27","unstructured":"Segal, M. (2007). Fast algorithm for multicast and data gathering in wireless networks. Information Processing Letters."},{"key":"287_CR28","first-page":"137","volume":"412","author":"M. Sekanina","year":"1960","unstructured":"Sekanina, M. (1960). On the ordering of the set of vertices of a connected graph. Publication of the Faculty of Sciences of the University of Brno, 412, 137\u2013142.","journal-title":"Publication of the Faculty of Sciences of the University of Brno"},{"key":"287_CR29","unstructured":"Shpungin, H., & Segal, M. (2007). Low energy construction of fault tolerant topologies in wireless networks. In DIALM-POMC\u201907."},{"key":"287_CR30","doi-asserted-by":"crossref","unstructured":"Stanford, J., & Tongngam, S. (2006). Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation. In SNPD\u201906, pp. 273\u2013277.","DOI":"10.1109\/SNPD-SAWN.2006.22"},{"key":"287_CR31","unstructured":"van Hoesel, L., & Havinga, P. (2004). A lightweight medium access protocol (lmac) for wireless sensor networks: reducing preamble transmissions and transceiver state switches. In INSS\u201904, pp. 205\u2013208."},{"key":"287_CR32","doi-asserted-by":"crossref","unstructured":"Wan, P. -J., Calinescu, G., Li, X., & Frieder, O. (2001). Minimum-energy broadcast routing in static ad hoc wireless networks. In INFOCOM\u201901, pp. 1162\u20131171.","DOI":"10.1109\/INFCOM.2001.916310"},{"issue":"6","key":"287_CR33","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s11036-005-4443-7","volume":"10","author":"Y. Xue","year":"2005","unstructured":"Xue, Y., Cui, Y., & Nahrstedt, K. (2005). Maximizing lifetime for data aggregation in wireless sensor networks. Mobile Networks and Applications, 10(6), 853\u2013864.","journal-title":"Mobile Networks and Applications"},{"key":"287_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Gu, D., & Preneel, B. (2008). Reliable key establishment scheme exploiting unidirectional links in wireless sensor networks. In EUC\u201908, pp. 272\u2013279.","DOI":"10.1109\/EUC.2008.10"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-010-0287-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-010-0287-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-010-0287-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T06:54:10Z","timestamp":1559717650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-010-0287-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s11276-010-0287-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,6]]}}}