{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:50Z","timestamp":1750221230268,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T00:00:00Z","timestamp":1529971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,26]]},"DOI":"10.1145\/3231053.3231089","type":"proceedings-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T14:00:37Z","timestamp":1535637637000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Detecting gaps and voids in WSNs and IoT networks"],"prefix":"10.1145","author":[{"given":"Madani","family":"Bezoui","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Boumerdes, Boumerdes, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahc\u00e8ne","family":"Bounceur","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bretagne Occidentale, Brest, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"Lagadec","sequence":"additional","affiliation":[{"name":"ENSTA Bretagne, Brest, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhardt","family":"Euler","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bretagne Occidentale, Brest, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Hammoudeh","sequence":"additional","affiliation":[{"name":"Manchester Metropolitan University, Manchester, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Laouid","sequence":"additional","affiliation":[{"name":"University of El-Oued, El-Oued, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkamel","family":"Tari","sequence":"additional","affiliation":[{"name":"University of Bejaia, Bejaia, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816839.2816935"},{"key":"e_1_3_2_1_2_1","volume-title":"SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002)","volume":"31","author":"Papadimitratos P.","year":"2002","unstructured":"Papadimitratos , P. , and Haas , Z. J . Secure routing for mobile ad hoc networks . In SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002) ( 2002 ), vol. 31 , San Antonio, TX. Papadimitratos, P., and Haas, Z. J. Secure routing for mobile ad hoc networks. In SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002) (2002), vol. 31, San Antonio, TX."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023646.1023657"},{"issue":"6","key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Intrusion detection and countermeasure of virtual cloud systems-state of the art and current challenges","volume":"6","author":"Andrew Carlin","year":"2015","unstructured":"Andrew Carlin , Mohammad Hammoudeh and Omar Aldabbas , Intrusion detection and countermeasure of virtual cloud systems-state of the art and current challenges , International Journal of Advanced Computer Science and Applications , 2015 , 6 ( 6 ), 1 -- 15 . Andrew Carlin, Mohammad Hammoudeh and Omar Aldabbas, Intrusion detection and countermeasure of virtual cloud systems-state of the art and current challenges, International Journal of Advanced Computer Science and Applications, 2015, 6(6), 1--15.","journal-title":"International Journal of Advanced Computer Science and Applications"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1811982.1812349"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061915"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3390\/s17102212"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2163730"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2007.645"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/827265.828515"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2403837"},{"key":"e_1_3_2_1_12_1","volume-title":"European Conference on Operational Research","author":"Bounceur R.","year":"2015","unstructured":"A. Bounceur , R. Euler , A. Benzerbadj , F. Lalem , M. Saoudi , T. Kechadi , M. Sevaux, Finding a polygon hull in wireless sensor networks , in: European Conference on Operational Research , University of Strathclyde, Glasgow, UK, Invited talk, EURO 2015 , July 2015 A. Bounceur, R. Euler, A. Benzerbadj, F. Lalem, M. Saoudi, T. Kechadi, M. Sevaux, Finding a polygon hull in wireless sensor networks, in: European Conference on Operational Research, University of Strathclyde, Glasgow, UK, Invited talk, EURO 2015, July 2015"},{"key":"e_1_3_2_1_13_1","first-page":"38","article-title":"LPCN: Least Polar-angle Connected Node Algorithm to Find a Polygon Hull in a Connected Euclidean Graph, Journal of Network and Computer Applications (JNCA)","volume":"93","author":"Lalem A.","year":"2017","unstructured":"F. Lalem , A. Bounceur , M. Bezoui , M. Saoudi , R. Euler , and M. Sevaux . LPCN: Least Polar-angle Connected Node Algorithm to Find a Polygon Hull in a Connected Euclidean Graph, Journal of Network and Computer Applications (JNCA) , Elsevier , 93 ( 2017 ), pp. 38 -- 50 . F. Lalem, A. Bounceur, M. Bezoui, M. Saoudi, R. Euler, and M. Sevaux. LPCN: Least Polar-angle Connected Node Algorithm to Find a Polygon Hull in a Connected Euclidean Graph, Journal of Network and Computer Applications (JNCA), Elsevier, 93 (2017), pp. 38--50.","journal-title":"Elsevier"},{"key":"e_1_3_2_1_14_1","volume-title":"Ad Hoc Networks","author":"Saoudi F.","year":"2017","unstructured":"M. Saoudi , F. Lalem , A. Bounceur , R. Euler , A. Laouid , M. Bezoui , and M. Sevaux , D-LPCN: A Distributed Least Polar-angle Connected Node Algorithm for Finding the Boundary of a Wireless Sensor Network , Ad Hoc Networks , Elsevier , Volume 56, 1 March 2017 , Pages 56--71. M. Saoudi, F. Lalem, A. Bounceur, R. Euler, A. Laouid, M. Bezoui, and M. Sevaux, D-LPCN: A Distributed Least Polar-angle Connected Node Algorithm for Finding the Boundary of a Wireless Sensor Network, Ad Hoc Networks, Elsevier, Volume 56, 1 March 2017, Pages 56--71."},{"key":"e_1_3_2_1_15_1","volume-title":"Smart-Cities and IoT. In the IEEE Sensors conference","author":"Bounceur M.","year":"2017","unstructured":"A. Bounceur , M. Bezoui , R. Euler , F. Lalem , A Wait-Before-Starting Algorithm for Fast, Fault-Tolerant and Low Energy Leader Election in WSNs Dedicated to Smart-Cities and IoT. In the IEEE Sensors conference , Oct 2017 , Glasgow, United Kingdom. A. Bounceur, M. Bezoui, R. Euler, F. Lalem, A Wait-Before-Starting Algorithm for Fast, Fault-Tolerant and Low Energy Leader Election in WSNs Dedicated to Smart-Cities and IoT. In the IEEE Sensors conference, Oct 2017, Glasgow, United Kingdom."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4108\/icst.simutools.2014.254811"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896387.2900336"},{"key":"e_1_3_2_1_18_1","unstructured":"CupCarbon simulator http:\/\/www.cupcarbon.com  CupCarbon simulator http:\/\/www.cupcarbon.com"}],"event":{"name":"ICFNDS'18: International Conference on Future Networks and Distributed Systems","acronym":"ICFNDS'18","location":"Amman Jordan"},"container-title":["Proceedings of the 2nd International Conference on Future Networks and Distributed Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3231053.3231089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3231053.3231089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:01Z","timestamp":1750212421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3231053.3231089"}},"subtitle":["the angle-based method"],"short-title":[],"issued":{"date-parts":[[2018,6,26]]},"references-count":18,"alternative-id":["10.1145\/3231053.3231089","10.1145\/3231053"],"URL":"https:\/\/doi.org\/10.1145\/3231053.3231089","relation":{},"subject":[],"published":{"date-parts":[[2018,6,26]]},"assertion":[{"value":"2018-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}