{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:21Z","timestamp":1750306041815,"version":"3.41.0"},"reference-count":107,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["A01"],"award-info":[{"award-number":["A01"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Collaborative Research Center","award":["1053 -- MAKI"],"award-info":[{"award-number":["1053 -- MAKI"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2018,7,31]]},"abstract":"<jats:p>Limiting the knowledge of individual nodes is a major concern for the design of distributed algorithms. With the LOCAL model, theoretical research already established a common model of locality that has gained little practical relevance. As a result, practical research de facto lacks any common locality model. The only common denominator among practitioners is that a local algorithm is distributed with a restricted scope of interaction. This article closes the gap by introducing four practically motivated classes of locality that successively weaken the strict requirements of the LOCAL model. These classes are applied to categorize and survey 36 local algorithms from 12 different application domains. A detailed comparison shows the practicality of the classification and provides interesting insights. For example, the majority of algorithms limit the scope of interaction to at most two hops, independent of their locality class. Moreover, the application domain of algorithms tends to influence their degree of locality.<\/jats:p>","DOI":"10.1145\/3092693","type":"journal-article","created":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T12:27:42Z","timestamp":1504268862000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A Classification of Locality in Network Research"],"prefix":"10.1145","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7183-2408","authenticated-orcid":false,"given":"Michael","family":"Stein","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Fischer","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Immanuel","family":"Schweizer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4 Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"M\u00fchlh\u00e4user","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4 Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1016\/j.comcom.2007.05.024"},{"key":"e_1_2_1_2_1","first-page":"98","article-title":"Survey of clustering algorithms for MANET","volume":"1","author":"Agarwal Ratish","year":"2009","unstructured":"Ratish Agarwal and Mahesh Motwani . 2009 . Survey of clustering algorithms for MANET . International Journal on Computer Science and Engineering 1 , 2 (2009), 98 -- 104 . Ratish Agarwal and Mahesh Motwani. 2009. Survey of clustering algorithms for MANET. International Journal on Computer Science and Engineering 1, 2 (2009), 98--104.","journal-title":"International Journal on Computer Science and Engineering"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1109\/MWC.2004.1368893"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 227--233","author":"Amiri Saeed","year":"2016","unstructured":"Saeed Amiri , Stefan Schmid , and Sebastian Siebertz . 2016 . A local constant factor MDS approximation for bounded genus graphs . In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 227--233 . Saeed Amiri, Stefan Schmid, and Sebastian Siebertz. 2016. A local constant factor MDS approximation for bounded genus graphs. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 227--233."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the ACM Symposium on the Theory of Computing (STOC). 82--93","author":"Angluin Dana","year":"1980","unstructured":"Dana Angluin . 1980 . Local and global properties in networks of processors . In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 82--93 . Dana Angluin. 1980. Local and global properties in networks of processors. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 82--93."},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1109\/SURV.2012.031612.00124"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1016\/j.comcom.2014.09.008"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1007\/978-3-319-03850-6_6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1145\/1582716.1582756"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1023\/A:1012319418150"},{"key":"e_1_2_1_11_1","volume-title":"Opportunistic routing in wireless networks: Models, algorithms, and classifications. Computing Surveys 47, 2","author":"Boukerche Azzedine","year":"2014","unstructured":"Azzedine Boukerche and Amir Darehshoorzadeh . 2014. Opportunistic routing in wireless networks: Models, algorithms, and classifications. Computing Surveys 47, 2 ( 2014 ), 22:1--22:36. Azzedine Boukerche and Amir Darehshoorzadeh. 2014. Opportunistic routing in wireless networks: Models, algorithms, and classifications. Computing Surveys 47, 2 (2014), 22:1--22:36."},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/1400751.1400809"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1007\/978-3-540-39611-6_16"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1007\/978-3-540-24606-0_11"},{"key":"e_1_2_1_15_1","volume-title":"Network Theory and Applications","volume":"14","author":"Cheng Xiuzhen","year":"2005","unstructured":"Xiuzhen Cheng , Xiao Huang , and Ding-Zhu Du ( Eds .). 2005 . Ad Hoc Wireless Networking . Network Theory and Applications , Vol. 14 . Springer US. Xiuzhen Cheng, Xiao Huang, and Ding-Zhu Du (Eds.). 2005. Ad Hoc Wireless Networking. Network Theory and Applications, Vol. 14. Springer US."},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1007\/978-3-540-87779-0_6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1007\/s11235-008-9134-9"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS\/DSN). 1--6.","author":"Demirbas Murat","year":"2004","unstructured":"Murat Demirbas , Anish Arora , and Vineet Mittal . 2004 . FLOC: A fast local clustering service for wireless sensor networks . In Proceedings of the Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS\/DSN). 1--6. Murat Demirbas, Anish Arora, and Vineet Mittal. 2004. FLOC: A fast local clustering service for wireless sensor networks. In Proceedings of the Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (DIWANS\/DSN). 1--6."},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1109\/SAHCN.2013.6645020"},{"volume-title":"Distributed Computing in Sensor Systems, Viktor K","author":"Ding Ping","unstructured":"Ping Ding , JoAnne Holliday , and Aslihan Celik . 2005. Distributed energy-efficient hierarchical clustering for wireless sensor networks . In Distributed Computing in Sensor Systems, Viktor K . Prasanna, Sitharama Iyengar, Paul Spirakis, and Matt Welsh (Eds.). Lecture Notes in Computer Science, Vol. 3560 . Springer Berlin , 322--339. Ping Ding, JoAnne Holliday, and Aslihan Celik. 2005. Distributed energy-efficient hierarchical clustering for wireless sensor networks. In Distributed Computing in Sensor Systems, Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis, and Matt Welsh (Eds.). Lecture Notes in Computer Science, Vol. 3560. Springer Berlin, 322--339.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN). 73--84","author":"Ferrari Federico","year":"2011","unstructured":"Federico Ferrari , Marco Zimmerling , Lothar Thiele , and Olga Saukh . 2011 . Efficient network flooding and time synchronization with Glossy . In Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN). 73--84 . Federico Ferrari, Marco Zimmerling, Lothar Thiele, and Olga Saukh. 2011. Efficient network flooding and time synchronization with Glossy. In Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN). 73--84."},{"key":"e_1_2_1_22_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Aspects of Wireless Sensor Networks, Miros\u0142aw Kuty\u0142owski, Jacek Cicho\u0144, and Przemys\u0142aw Kubiak (Eds.)","author":"Flor\u00e9en Patrik","unstructured":"Patrik Flor\u00e9en , Petteri Kaski , Topi Musto , and Jukka Suomela . 2008. Local approximation algorithms for scheduling problems in sensor networks . In Algorithmic Aspects of Wireless Sensor Networks, Miros\u0142aw Kuty\u0142owski, Jacek Cicho\u0144, and Przemys\u0142aw Kubiak (Eds.) . Lecture Notes in Computer Science , Vol. 4837 . Springer Berlin , 99--113. Patrik Flor\u00e9en, Petteri Kaski, Topi Musto, and Jukka Suomela. 2008. Local approximation algorithms for scheduling problems in sensor networks. In Algorithmic Aspects of Wireless Sensor Networks, Miros\u0142aw Kuty\u0142owski, Jacek Cicho\u0144, and Przemys\u0142aw Kubiak (Eds.). Lecture Notes in Computer Science, Vol. 4837. Springer Berlin, 99--113."},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.5555\/3118785.3119242"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1145\/2484239.2484264"},{"doi-asserted-by":"publisher","key":"e_1_2_1_25_1","DOI":"10.2307\/2412323"},{"doi-asserted-by":"publisher","key":"e_1_2_1_26_1","DOI":"10.1016\/j.future.2013.01.010"},{"doi-asserted-by":"publisher","key":"e_1_2_1_27_1","DOI":"10.1109\/TWC.2002.804190"},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_1","DOI":"10.1007\/s00446-013-0202-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_29_1","DOI":"10.1016\/j.jnca.2011.12.002"},{"doi-asserted-by":"publisher","key":"e_1_2_1_30_1","DOI":"10.1109\/EUC.2010.37"},{"doi-asserted-by":"publisher","key":"e_1_2_1_31_1","DOI":"10.1109\/COMST.2015.2410831"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1109\/TVT.2014.2315741"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.1109\/ICCCN.2007.4317793"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 360--371","author":"Jorgic Milenko","year":"2004","unstructured":"Milenko Jorgic , Micha\u00ebl Hauspie , David Simplot-Ryl , Ivan Stojmenovic , and others. 2004 . Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks . In Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 360--371 . Milenko Jorgic, Micha\u00ebl Hauspie, David Simplot-Ryl, Ivan Stojmenovic, and others. 2004. Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks. In Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 360--371."},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1145\/345910.345953"},{"doi-asserted-by":"publisher","key":"e_1_2_1_36_1","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_37_1","volume-title":"A systematic approach to constructing families of incremental topology control algorithms using graph transformation. Software 8 Systems Modeling","author":"Kluge Roland","year":"2017","unstructured":"Roland Kluge , Michael Stein , Gergely Varr\u00f3 , Andy Sch\u00fcrr , Matthias Hollick , and Max M\u00fchlh\u00e4user . 2017. A systematic approach to constructing families of incremental topology control algorithms using graph transformation. Software 8 Systems Modeling ( 2017 ), 1--41. Roland Kluge, Michael Stein, Gergely Varr\u00f3, Andy Sch\u00fcrr, Matthias Hollick, and Max M\u00fchlh\u00e4user. 2017. A systematic approach to constructing families of incremental topology control algorithms using graph transformation. Software 8 Systems Modeling (2017), 1--41."},{"doi-asserted-by":"publisher","key":"e_1_2_1_38_1","DOI":"10.1007\/s00446-012-0174-8"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_1","DOI":"10.1109\/IFIPNetworking.2015.7145317"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_1","DOI":"10.1109\/WOWMOM.2010.5534893"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_1","DOI":"10.1109\/GLOCOM.2010.5683139"},{"doi-asserted-by":"publisher","key":"e_1_2_1_42_1","DOI":"10.1145\/1109557.1109666"},{"doi-asserted-by":"publisher","key":"e_1_2_1_43_1","DOI":"10.1145\/2742012"},{"doi-asserted-by":"publisher","key":"e_1_2_1_44_1","DOI":"10.1145\/570810.570814"},{"doi-asserted-by":"publisher","key":"e_1_2_1_45_1","DOI":"10.1145\/941079.941089"},{"doi-asserted-by":"publisher","key":"e_1_2_1_47_1","DOI":"10.1109\/TNET.2014.2309805"},{"doi-asserted-by":"publisher","key":"e_1_2_1_48_1","DOI":"10.1109\/JPROC.2013.2257631"},{"doi-asserted-by":"publisher","key":"e_1_2_1_49_1","DOI":"10.1109\/TPDS.2003.1239871"},{"doi-asserted-by":"publisher","key":"e_1_2_1_50_1","DOI":"10.1145\/1080829.1080831"},{"doi-asserted-by":"publisher","key":"e_1_2_1_51_1","DOI":"10.1137\/0221015"},{"doi-asserted-by":"publisher","key":"e_1_2_1_52_1","DOI":"10.1145\/1067170.1067187"},{"doi-asserted-by":"publisher","key":"e_1_2_1_53_1","DOI":"10.1145\/1378191.1378213"},{"doi-asserted-by":"publisher","key":"e_1_2_1_54_1","DOI":"10.1109\/TPDS.2008.24"},{"volume-title":"Proceedings of the IEEE Global Communications Conference (GLOBECOM). 4186--4190","author":"Liu Yunhao","unstructured":"Yunhao Liu , Zhenyun Zhuang , Li Xiao , and Lionel M. Ni . 2003. AOTO: Adaptive overlay topology optimization in unstructured P2P systems . In Proceedings of the IEEE Global Communications Conference (GLOBECOM). 4186--4190 . Yunhao Liu, Zhenyun Zhuang, Li Xiao, and Lionel M. Ni. 2003. AOTO: Adaptive overlay topology optimization in unstructured P2P systems. In Proceedings of the IEEE Global Communications Conference (GLOBECOM). 4186--4190.","key":"e_1_2_1_55_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_56_1","DOI":"10.1016\/j.comnet.2006.11.018"},{"doi-asserted-by":"publisher","key":"e_1_2_1_57_1","DOI":"10.1007\/3-540-45748-8_5"},{"doi-asserted-by":"publisher","key":"e_1_2_1_58_1","DOI":"10.1145\/501416.501432"},{"doi-asserted-by":"publisher","key":"e_1_2_1_59_1","DOI":"10.1126\/science.1089167"},{"doi-asserted-by":"publisher","key":"e_1_2_1_60_1","DOI":"10.1126\/science.298.5594.824"},{"doi-asserted-by":"publisher","key":"e_1_2_1_62_1","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the International Conference on Networked Systems (NetSys). 1--8.","author":"Binh Nguyen The An","year":"2017","unstructured":"The An Binh Nguyen , Christian Meurisch , Stefan Niemczyk , Doreen B\u00f6hnstedt , Kurt Geihs , Max M\u00fchlh\u00e4user , and Ralf Steinmetz . 2017 . Adaptive task-oriented message template for in-network processing . In Proceedings of the International Conference on Networked Systems (NetSys). 1--8. The An Binh Nguyen, Christian Meurisch, Stefan Niemczyk, Doreen B\u00f6hnstedt, Kurt Geihs, Max M\u00fchlh\u00e4user, and Ralf Steinmetz. 2017. Adaptive task-oriented message template for in-network processing. In Proceedings of the International Conference on Networked Systems (NetSys). 1--8."},{"unstructured":"NHTSA. 2017. 49 CFR Part 571 [Docket No. NHTSA-2016-0126] RIN 2127-AL55. Proposed rule. National Highway Traffic Safety Administration (NHTSA) Department of Transportation (DOT).  NHTSA. 2017. 49 CFR Part 571 [Docket No. NHTSA-2016-0126] RIN 2127-AL55. Proposed rule. National Highway Traffic Safety Administration (NHTSA) Department of Transportation (DOT).","key":"e_1_2_1_64_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_65_1","DOI":"10.1016\/S1570-8705(03)00005-2"},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 1--8.","author":"Oikonomou Konstantinos","year":"2006","unstructured":"Konstantinos Oikonomou and Ioannis Stavrakakis . 2006 . Scalable service migration: The tree topology case . In Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 1--8. Konstantinos Oikonomou and Ioannis Stavrakakis. 2006. Scalable service migration: The tree topology case. In Proceedings of the Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). 1--8."},{"doi-asserted-by":"publisher","key":"e_1_2_1_67_1","DOI":"10.1109\/WOWMOM.2008.4594891"},{"key":"e_1_2_1_68_1","volume-title":"Localization algorithms in wireless sensor networks: Current approaches and future challenges. Network Protocols 8 Algorithms 2, 1","author":"Pal Amitangshu","year":"2010","unstructured":"Amitangshu Pal . 2010. Localization algorithms in wireless sensor networks: Current approaches and future challenges. Network Protocols 8 Algorithms 2, 1 ( 2010 ), 45--73. Amitangshu Pal. 2010. Localization algorithms in wireless sensor networks: Current approaches and future challenges. Network Protocols 8 Algorithms 2, 1 (2010), 45--73."},{"doi-asserted-by":"publisher","key":"e_1_2_1_69_1","DOI":"10.1007\/978-3-642-38673-2_7"},{"doi-asserted-by":"publisher","key":"e_1_2_1_70_1","DOI":"10.1016\/j.tcs.2007.04.040"},{"doi-asserted-by":"publisher","key":"e_1_2_1_71_1","DOI":"10.1137\/1.9780898719772"},{"doi-asserted-by":"publisher","key":"e_1_2_1_72_1","DOI":"10.1016\/j.ipl.2009.02.017"},{"doi-asserted-by":"publisher","key":"e_1_2_1_73_1","DOI":"10.1007\/978-3-642-23397-5_29"},{"doi-asserted-by":"publisher","key":"e_1_2_1_74_1","DOI":"10.1109\/ICPP.2007.81"},{"doi-asserted-by":"publisher","key":"e_1_2_1_75_1","DOI":"10.1109\/ICC.2016.7510604"},{"doi-asserted-by":"publisher","key":"e_1_2_1_76_1","DOI":"10.1109\/INFOCOM.2006.44"},{"doi-asserted-by":"publisher","key":"e_1_2_1_77_1","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_78_1","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS). 1--9.","author":"Ren Shansi","year":"2004","unstructured":"Shansi Ren , Lei Guo , Song Jiang , and Xiaodong Zhang . 2004 . SAT-match: A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks . In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS). 1--9. Shansi Ren, Lei Guo, Song Jiang, and Xiaodong Zhang. 2004. SAT-match: A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS). 1--9."},{"doi-asserted-by":"publisher","key":"e_1_2_1_79_1","DOI":"10.1109\/TITS.2016.2600504"},{"key":"e_1_2_1_80_1","volume-title":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P). 99--100","author":"Ripeanu Matei","year":"2001","unstructured":"Matei Ripeanu . 2001 . Peer-to-peer architecture case study: Gnutella network . In Proceedings of the International Conference on Peer-to-Peer Computing (P2P). 99--100 . Matei Ripeanu. 2001. Peer-to-peer architecture case study: Gnutella network. In Proceedings of the International Conference on Peer-to-Peer Computing (P2P). 99--100."},{"doi-asserted-by":"publisher","key":"e_1_2_1_81_1","DOI":"10.1145\/1089733.1089736"},{"doi-asserted-by":"publisher","key":"e_1_2_1_82_1","DOI":"10.1145\/2491185.2491198"},{"doi-asserted-by":"publisher","key":"e_1_2_1_83_1","DOI":"10.1145\/501416.501463"},{"doi-asserted-by":"publisher","key":"e_1_2_1_84_1","DOI":"10.1109\/ICCCN.2012.6289318"},{"doi-asserted-by":"publisher","key":"e_1_2_1_85_1","DOI":"10.1109\/LCN.2015.7366341"},{"doi-asserted-by":"publisher","key":"e_1_2_1_86_1","DOI":"10.1007\/s11276-005-6613-8"},{"key":"e_1_2_1_87_1","volume-title":"Simi\u0107 and Shankar Sastry","author":"Slobodan","year":"2002","unstructured":"Slobodan N. Simi\u0107 and Shankar Sastry . 2002 . Distributed Localization in Wireless Ad Hoc Networks. Technical Report. EECS Department, University of California , Berkeley. Slobodan N. Simi\u0107 and Shankar Sastry. 2002. Distributed Localization in Wireless Ad Hoc Networks. Technical Report. EECS Department, University of California, Berkeley."},{"volume-title":"Proceedings of the IEEE International Conference on Communications (ICC). 1860--1866","author":"Singh A.","unstructured":"A. Singh and M. Haahr . 2007. Decentralized clustering in pure P2P overlay networks using Schelling\u2019s model . In Proceedings of the IEEE International Conference on Communications (ICC). 1860--1866 . A. Singh and M. Haahr. 2007. Decentralized clustering in pure P2P overlay networks using Schelling\u2019s model. In Proceedings of the IEEE International Conference on Communications (ICC). 1860--1866.","key":"e_1_2_1_88_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_89_1","DOI":"10.1007\/s11036-005-4447-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_90_1","DOI":"10.1145\/2897053.2897061"},{"doi-asserted-by":"publisher","key":"e_1_2_1_91_1","DOI":"10.1109\/LCN.2015.7366313"},{"doi-asserted-by":"publisher","key":"e_1_2_1_92_1","DOI":"10.1109\/LCN.2016.67"},{"doi-asserted-by":"publisher","key":"e_1_2_1_93_1","DOI":"10.1137\/1.9781611974768.1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_94_1","DOI":"10.1007\/11530657_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_95_1","DOI":"10.1145\/1177080.1177105"},{"key":"e_1_2_1_96_1","volume-title":"Survey of local algorithms. Computing Surveys 45, 2","author":"Suomela Jukka","year":"2013","unstructured":"Jukka Suomela . 2013. Survey of local algorithms. Computing Surveys 45, 2 ( 2013 ), 24:1--24:40. Jukka Suomela. 2013. Survey of local algorithms. Computing Surveys 45, 2 (2013), 24:1--24:40."},{"doi-asserted-by":"publisher","key":"e_1_2_1_97_1","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"e_1_2_1_98_1","volume-title":"QoS routing in wireless sensor networks\u2014A survey. Computing Surveys 45, 1","author":"Annie Uthra R.","year":"2012","unstructured":"R. Annie Uthra and S. V. Kasmir Raja . 2012. QoS routing in wireless sensor networks\u2014A survey. Computing Surveys 45, 1 ( 2012 ), 9:1--9:12. R. Annie Uthra and S. V. Kasmir Raja. 2012. QoS routing in wireless sensor networks\u2014A survey. Computing Surveys 45, 1 (2012), 9:1--9:12."},{"doi-asserted-by":"publisher","key":"e_1_2_1_99_1","DOI":"10.1007\/s11768-010-9187-7"},{"doi-asserted-by":"publisher","key":"e_1_2_1_100_1","DOI":"10.1007\/978-0-387-49592-7_5"},{"doi-asserted-by":"publisher","key":"e_1_2_1_101_1","DOI":"10.1109\/MPRV.2006.2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_102_1","DOI":"10.1007\/978-3-540-30186-8_24"},{"doi-asserted-by":"publisher","key":"e_1_2_1_103_1","DOI":"10.1109\/IPDPS.2004.1303248"},{"doi-asserted-by":"publisher","key":"e_1_2_1_104_1","DOI":"10.1109\/PERCOM.2008.43"},{"key":"e_1_2_1_105_1","volume-title":"Internet of Things. Business 8 Information Systems Engineering 57, 3","author":"Wortmann Felix","year":"2015","unstructured":"Felix Wortmann and Kristina Fl\u00fcchter . 2015. Internet of Things. Business 8 Information Systems Engineering 57, 3 ( 2015 ), 221--224. Felix Wortmann and Kristina Fl\u00fcchter. 2015. Internet of Things. Business 8 Information Systems Engineering 57, 3 (2015), 221--224."},{"doi-asserted-by":"publisher","key":"e_1_2_1_106_1","DOI":"10.1109\/TPDS.2013.2297097"},{"doi-asserted-by":"publisher","key":"e_1_2_1_107_1","DOI":"10.1016\/j.comnet.2008.04.002"},{"doi-asserted-by":"publisher","key":"e_1_2_1_108_1","DOI":"10.1109\/TMC.2004.41"},{"doi-asserted-by":"publisher","key":"e_1_2_1_109_1","DOI":"10.1109\/GLOCOM.2006.986"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3092693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:08Z","timestamp":1750215788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":107,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7,31]]}},"alternative-id":["10.1145\/3092693"],"URL":"https:\/\/doi.org\/10.1145\/3092693","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"type":"print","value":"0360-0300"},{"type":"electronic","value":"1557-7341"}],"subject":[],"published":{"date-parts":[[2017,8,30]]},"assertion":[{"value":"2016-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}