{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:26:01Z","timestamp":1725539161764},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054334"},{"type":"electronic","value":"9783642054341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05434-1_10","type":"book-chapter","created":{"date-parts":[[2009,10,14]],"date-time":"2009-10-14T10:08:35Z","timestamp":1255514915000},"page":"88-101","source":"Crossref","is-referenced-by-count":3,"title":["Link Reversal: How to Play Better to Work Less"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Widder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"29","author":"E.M. Gafni","year":"1981","unstructured":"Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications\u00a029, 11\u201318 (1981)","journal-title":"IEEE Transactions on Communications"},{"key":"10_CR2","first-page":"1405","volume-title":"IEEE Infocom 1997 - 16th Conference on Computer Communications","author":"V.D. Park","year":"1997","unstructured":"Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: IEEE Infocom 1997 - 16th Conference on Computer Communications, pp. 1405\u20131413. IEEE, Los Alamitos (1997)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1012363200403","volume":"7","author":"J.E. Walter","year":"2001","unstructured":"Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks\u00a07, 585\u2013600 (2001)","journal-title":"Wireless Networks"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Malpani, N., Welch, J.L., Vaidya, N.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communication (2000)","DOI":"10.1145\/345848.345871"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: Proc. of the IEEE International Parallel & Distributed Processing Symposium (to appear, 2009)","DOI":"10.1109\/IPDPS.2009.5161028"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TPDS.2007.70792","volume":"19","author":"A. Derhab","year":"2008","unstructured":"Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. Parallel Distrib. Syst.\u00a019, 926\u2013939 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Gaillard, A., Welch, J.L., Widder, J.: Routing without ordering. In: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (to appear, 2009)","DOI":"10.1145\/1583991.1584034"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Busch, C., Surapaneni, S., Tirthapura, S.: Analysis of link reversal routing algorithms for mobile ad hoc networks. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 210\u2013219 (2003)","DOI":"10.1145\/777412.777446"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/S0097539704443598","volume":"35","author":"C. Busch","year":"2005","unstructured":"Busch, C., Tirthapura, S.: Analysis of link reversal routing algorithms. SIAM Journal on Computing\u00a035, 305\u2013326 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. The Annals of Mathematics\u00a054, 286\u2013295 (1951)","journal-title":"The Annals of Mathematics"},{"key":"10_CR12","volume-title":"An Introduction to Game Theory","author":"M.J. Osborne","year":"2003","unstructured":"Osborne, M.J.: An Introduction to Game Theory. Oxford University Press, Oxford (2003)"},{"volume-title":"Algorithmic Game Theory","year":"2007","key":"10_CR13","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y.: Beyond Nash equilibrium: solution concepts for the 21st century. In: Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201310 (2008)","DOI":"10.1145\/1400751.1400752"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05434-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:32:14Z","timestamp":1619782334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05434-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054334","9783642054341"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05434-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}