{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:46:40Z","timestamp":1743043600280,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148484"},{"type":"electronic","value":"9783642148491"}],"license":[{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-14849-1_20","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T15:47:28Z","timestamp":1303919248000},"page":"621-653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[]},{"given":"Nir","family":"Tzachar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,8]]},"reference":[{"key":"20_CR1","unstructured":"The virtual infrastructure project. http:\/\/groups.csail.mit.edu\/tds\/vi-project."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00446-005-0139-2","volume":"2","author":"I. Abraham","year":"2005","unstructured":"I. Abraham, and D. Malkhi. Probabilistic quorums for dynamic systems. Distributed Computing 18, 2:113\u2013124, (2005).","journal-title":"Distributed Computing 18"},{"key":"20_CR3","unstructured":"N. Alon, C. Avin, M. Kouck\u00fd, G. Kozma, Z. Lotker, and M. R. Tuttle. Many random walks are faster than one. In SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, Munich, Germany, June 14\u201316, 2008 F. M. auf der Heide and N. Shavit(Eds.,) ACM, pages 119\u2013128, (2008)."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1142\/S0129626491000161","volume":"1","author":"A. Arora","year":"1991","unstructured":"A. Arora, S. Dolev, and M. Gouda. Maintaining digital clocks in step. Parallel Processing Letters 1, 1:11\u201318, (1991).","journal-title":"Parallel Processing Letters 1"},{"key":"20_CR5","unstructured":"B. Awerbuch, and G. Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols (Extended Abstract). In: Annual Symposium on Foundations of Computer Science (FOCS), San Juan, pages 258\u2013267, 1991."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"A. Beimel","year":"2003","unstructured":"A. Beimel, and S. Dolev. Buses for anonymous message deliver. Journal Cryptology, 16(1):25\u201339, 2003.","journal-title":"Journal Cryptology"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1462187.1462193","volume":"4","author":"A. Cournier","year":"2009","unstructured":"A. Cournier, S. Devismes, and V. Villain. Light enabling snap-stabilization of fundamental protocols. ACM Transactions on Autonomous and Adaptive Systems, 4(1):27, 2009.","journal-title":"ACM Transactions on Autonomous and Adaptive Systems"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"A. Czumaj, and C. Sohler. Testing expansion in bounded-degree graphs. In FOCS (2007), IEEE Computer Society, pages. 570\u2013578.","DOI":"10.1109\/FOCS.2007.33"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"11","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications ACM 17, 11 643\u2013644, 1974.","journal-title":"Communications ACM 17"},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"S. Dolev. Self-Stabilization. MIT Press, Cambridge, MA, 2000."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"S. Dolev, J.A. Garay, N. Gilboa, and V. Kolesnikov. In: 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, pages 1438\u20131445, 2009. Also brief Announcement in ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 231\u2013232, 2010.","DOI":"10.1109\/ALLERTON.2009.5394507"},{"key":"20_CR12","unstructured":"S. Dolev, J. Garay, N. Gilboa, and V. Kolesnikov. Secret sharing Krohn-Rhodes: Private and perennial distributed computation. In: Innovations in Computer Science (ICS), Beijing, China, January 2011."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"S. Dolev, S. Gilbert, R. Guerraoui, F. Kuhn, and C. C. Newport. The wireless synchronization problem. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Portland, pages 190\u2013199, 2009.","DOI":"10.1145\/1582716.1582749"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"S. Dolev, S. Gilbert, R. Guerraoui, and C. C. Newport. Gossiping in a multi-channel radio network. In: International Symposium on Distributed Computing (DISC). Workshop on Distributed Algorithms (WDAG), pages 208\u2013222, 2007.","DOI":"10.1007\/978-3-540-75142-7_18"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"S. Dolev, S. Gilbert, R. Guerraoui, and C. C. Newport. Secure communication over radio channels. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Napoli, Italy, pages 105\u2013114, 2008.","DOI":"10.1145\/1400751.1400767"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00446-005-0140-9","volume":"2","author":"S. Dolev","year":"2005","unstructured":"S. Dolev, S. Gilbert, N. A. Lynch, A. A. Shvartsman, and J. L. Welch. GeoQuorums: Implementing atomic memory in mobile ad hoc networks, Distributed Computing 18 2:125\u2013155, 2005.","journal-title":"Distributed Computing 18"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"S. Dolev, S. Gilbert, L. Lynch, E. Schiller, A. A. Shvartsman, and J. L. Welch. Virtual mobile nodes for mobile Ad Hoc networks, In: International Conference on Principles of DIStributed Computing, (DISC 2007), pages 230\u2013244.","DOI":"10.1007\/978-3-540-30186-8_17"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"S. Dolev, S. Gilbert, E. Schiller, A. A. Shvartsman, and J. L. Welch. Autonomous virtual mobile nodes, In DIALM-POMC (2005), pages 62\u201369.","DOI":"10.21236\/ADA466762"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.adhoc.2005.01.003","volume":"4","author":"S. Dolev","year":"2006","unstructured":"S. Dolev, T. Herman, and L. Lahiani. Polygonal broadcast, secret maturity, and the firing sensors, Ad Hoc Networks, 4:447\u2013486, 2006.","journal-title":"Ad Hoc Networks"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"S. Dolev, L. Lahiani, and M. Yung. Secret swarm unitreactive k-secret sharing, In INDOCRYPT, pages 123\u2013137, 2007.","DOI":"10.1007\/978-3-540-77026-8_10"},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0140-3664(96)01071-7","volume":"19","author":"S. Dolev","year":"1996","unstructured":"S. Dolev, K. D. Pradhan, and J. L. Welch. Modified tree structure for location management in mobile environments, Computer Communication 19(4):335\u2013345, 1996.","journal-title":"Computer Communication"},{"key":"20_CR22","unstructured":"S. Dolev, M. Segal, H. Shpungin. Stretchable topology control, bounded-hop strong connectivity for flocking Swarms, 2009."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"S. Dolev, E. Schiller, and J. L. Welch. Random walk for self-stabilizing group communication in ad hoc networks, IEEE Transactions Mobile Computing 5, (7):893\u2013905, 2006.","DOI":"10.1109\/TMC.2006.104"},{"issue":"6\u20137","key":"20_CR24","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.tcs.2008.10.006","volume":"410","author":"S. Dolev","year":"2009","unstructured":"S. Dolev, and N. Tzachar. Empire of colonies: Self-stabilizing and self-organizing distributed algorithms, Theoretical Computer Science, Volume 410 (6\u20137) pages 514\u2013532, Special issue of OPODIS06, 2009.","journal-title":"Theoretical Computer Science"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"S. Dolev and N. Tzachar. Spanders: Distributed spanning expanders. In: Proceedings of the 25th ACM Symposium on Applied Computing (SAC-SCS), Nagoya, Japan, pages 1309\u20131314, 2010.","DOI":"10.1145\/1774088.1774369"},{"key":"20_CR26","unstructured":"S. Dolev, and N. Tzachar. SPANDERS: Distributed spanning expanders. TR 08-02, Department of Computer Science, Ben-Gurion University of the Negev, 2007."},{"key":"20_CR27","unstructured":"O. Goldreich, and D. Ron. On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC) 7:(20), 2000."},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"4","author":"S. Hoory","year":"2006","unstructured":"S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications, Bulletin of the AMS, volume 43, 4:439\u2013561, 2006.","journal-title":"Bulletin of the AMS"},{"key":"20_CR29","unstructured":"S. Kale, and C. Seshadrhi. Testing expansion in bounded degree graphs. ECCC report TR07\u2013076, 2007."},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, (7):558\u2013565, 1978.","DOI":"10.1145\/359545.359563"},{"key":"20_CR31","unstructured":"C. Law, and K.-Y. Siu. Distributed construction of random expander networks. In: INFOCOM, 2003."},{"key":"20_CR32","unstructured":"L. Lovasz. Random walks on graphs: A survey."},{"key":"20_CR33","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"2006","unstructured":"R. Motwani, and P. Raghavan. Randomized Algorithms. Cambridge university press, Cambridge, 2006."},{"key":"20_CR34","unstructured":"A. Nachmias, and A. Shapira. \u201cTesting the expansion of graphs\u201d. ECCC report TR07\u2013118, 2007."},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"M.K. Reiter, A. Samar, and C. Wang. Distributed construction of a fault-tolerant network from a tree. In: SRDS 05: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems, IEEE Computer Society, Washington, DC, USA, pages 155\u2013165, 2005.","DOI":"10.1109\/RELDIS.2005.16"},{"key":"20_CR36","unstructured":"S. A. Wright. \u201cRegistration of mobile packet data terminals after disaster,\u201d, US Patent 6157633, 1996."}],"container-title":["Monographs in Theoretical Computer Science. An EATCS Series","Theoretical Aspects of Distributed Computing in Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14849-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:37:25Z","timestamp":1741163845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14849-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,8]]},"ISBN":["9783642148484","9783642148491"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14849-1_20","relation":{},"ISSN":["1431-2654"],"issn-type":[{"type":"print","value":"1431-2654"}],"subject":[],"published":{"date-parts":[[2010,11,8]]},"assertion":[{"value":"8 November 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}