{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:05:37Z","timestamp":1754481937454},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030031008"},{"type":"electronic","value":"9783030031015"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-03101-5_5","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T11:03:03Z","timestamp":1547290983000},"page":"42-53","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks"],"prefix":"10.1007","author":[{"given":"Ahc\u00e8ne","family":"Bounceur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madani","family":"Bezoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loic","family":"Lagadec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhardt","family":"Euler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laouid","family":"Abdelkader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Hammoudeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.adhoc.2016.11.010","volume":"56","author":"M Saoudi","year":"2017","unstructured":"Saoudi, M., et al.: D-LPCN: a distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network. Ad Hoc Netw. 56(1), 56\u201371 (2017)","journal-title":"Ad Hoc Netw."},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38123-2","volume-title":"Distributed Algorithms for Message-Passing Systems","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Distributed Algorithms for Message-Passing Systems, vol. 500. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38123-2"},{"issue":"11","key":"5_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"DS Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema finding in circular configuration of processors. Commun. ACM 23(11), 627\u2013628 (1980)","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D., Klawe, M., Rodeh, M.: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms 3(3), 245\u2013260 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. (TOPLAS) 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0743-7315(90)90074-Y","volume":"8","author":"D Peleg","year":"1990","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96\u201399 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR7","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 Communications, pp. 96\u2013103. ACM (2000)","DOI":"10.1145\/345848.345871"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: The Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, vol. 3, pp. 1405\u20131413 (1997)","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Vasudevan, S., DeCleene, B., Immerman, N., Kurose, J., Towsley, D.: Leader election algorithms for wireless ad hoc networks. In: The Proceedings of the IEEE DARPA Information Survivability Conference and Exposition 2003, vol. 1, pp. 261\u2013272 (2003)","DOI":"10.1109\/DISCEX.2003.1194890"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Vasudevan, S., Kurose, J., Towsley, D.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: The Proceedings of the 12th IEEE International Conference on Network Protocols. ICNP 2004, pp. 350\u2013360 (2004)","DOI":"10.1109\/ICNP.2004.1348124"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Boukerche, A., Abrougui, K.: An efficient leader election protocol for mobile networks. In: Proceedings of the ACM International Conference on Wireless Communications and Mobile Computing, pp. 1129\u20131134 (2006)","DOI":"10.1145\/1143549.1143775"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, pp. 1\u201312 (2009)","DOI":"10.1109\/IPDPS.2009.5161028"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-540-87405-8_42","volume-title":"Graph Transformations","author":"M Hammoudeh","year":"2008","unstructured":"Hammoudeh, M.: Modelling clustering of sensor networks with synchronised hyperedge replacement. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 490\u2013492. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87405-8_42"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-22875-9_53","volume-title":"Smart Spaces and Next Generation Wired\/Wireless Networking","author":"M Hammoudeh","year":"2011","unstructured":"Hammoudeh, M., Alsbou\u2019i, T.A.A.: Building programming abstractions for wireless sensor networks using watershed segmentation. In: Balandin, S., Koucheryavy, Y., Hu, H. (eds.) NEW2AN\/ruSMART -2011. LNCS, vol. 6869, pp. 587\u2013597. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22875-9_53"},{"key":"5_CR15","volume-title":"Design and Analysis of Distributed Algorithms","author":"N Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms, vol. 56. Wiley, Hoboken (2007)"},{"key":"5_CR16","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"key":"5_CR17","unstructured":"CupCarbon simulator. \nhttp:\/\/www.cupcarbon.com"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Mehdi, K., Lounis, M., Bounceur, A., Kechadi, T.: CupCarbon: a multi-agent and discrete event wireless sensor network design and simulation tool. In: IEEE 7th International Conference on Simulation Tools and Techniques (SIMUTools 2014), Lisbon, Portugal (2014)","DOI":"10.4108\/icst.simutools.2014.254811"},{"key":"5_CR19","first-page":"368","volume-title":"Computer Networks","author":"AS Tanenbaum","year":"2010","unstructured":"Tanenbaum, A.S., Wetherall, D.J.: Computer Networks, 5th edn, pp. 368\u2013370. Pearson Education, London (2010)","edition":"5"}],"container-title":["Lecture Notes in Computer Science","Mobile, Secure, and Programmable Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03101-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T11:04:56Z","timestamp":1547291096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03101-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030031008","9783030031015"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03101-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MSPN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mobile, Secure, and Programmable Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mspn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mspn\/Home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}