{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:42Z","timestamp":1740123522908,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2016-00148-FST","MYRG2017-00029-FST"],"award-info":[{"award-number":["MYRG2016-00148-FST","MYRG2017-00029-FST"]}],"id":[{"id":"10.13039\/501100004733","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11227-018-2494-3","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T02:44:46Z","timestamp":1532400286000},"page":"5558-5577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks"],"prefix":"10.1007","volume":"74","author":[{"given":"Se-Hang","family":"Cheong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8468-6182","authenticated-orcid":false,"given":"Yain-Whar","family":"Si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"issue":"8","key":"2494_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/MCOM.2002.1024422","volume":"40","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) A survey on sensor networks. IEEE Commun Mag 40(8):102","journal-title":"IEEE Commun Mag"},{"key":"2494_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jnca.2017.02.007","volume":"84","author":"G Solmaz","year":"2017","unstructured":"Solmaz G, Turgut D (2017) Tracking pedestrians and emergent events in disaster areas. J Netw Comput Appl 84:55","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"2494_CR3","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.jnca.2012.11.001","volume":"36","author":"A Mart\u00edN-Campillo","year":"2013","unstructured":"Mart\u00edN-Campillo A, Crowcroft J, Yoneki E, Mart\u00ed R (2013) Evaluating opportunistic networks in disaster scenarios. J Netw Comput Appl 36(2):870","journal-title":"J Netw Comput Appl"},{"key":"2494_CR4","doi-asserted-by":"crossref","unstructured":"Cheong SH, Lee KI, Si YW et al (2011) Lifeline: emergency ad hoc network. In: Computational Intelligence and Security (CIS), 2011 Seventh International Conference on. IEEE, pp 283\u2013289","DOI":"10.1109\/CIS.2011.70"},{"issue":"6","key":"2494_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/65.967595","volume":"15","author":"M Mauve","year":"2001","unstructured":"Mauve M, Widmer J, Hartenstein H (2001) A survey on position-based routing in mobile ad hoc networks. IEEE Netw 15(6):30","journal-title":"IEEE Netw"},{"issue":"3","key":"2494_CR6","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s11227-016-1656-4","volume":"72","author":"P Phoummavong","year":"2016","unstructured":"Phoummavong P, Utsu K, Chow CO, Ishii H (2016) Location-aided route discovery mechanism based on two-hop neighbor information for ad hoc network. J Supercomput 72(3):1201","journal-title":"J Supercomput"},{"issue":"3","key":"2494_CR7","first-page":"27","volume":"7","author":"A Efrat","year":"2010","unstructured":"Efrat A, Forrester D, Iyer A, Kobourov SG, Erten C, Kilic O (2010) Force-directed approaches to sensor localization. ACM Trans Sens Netw (TOSN) 7(3):27","journal-title":"ACM Trans Sens Netw (TOSN)"},{"issue":"1","key":"2494_CR8","first-page":"3","volume":"13","author":"SH Cheong","year":"2016","unstructured":"Cheong SH, Si YW (2016) Accelerating the Kamada\u2013Kawai algorithm for boundary detection in a mobile ad hoc network. ACM Trans Sens Netw (TOSN) 13(1):3","journal-title":"ACM Trans Sens Netw (TOSN)"},{"key":"2494_CR9","unstructured":"Schieferdecker D (2014) An algorithmic view on sensor networks: surveillance, localization, and communication (epubli)"},{"key":"2494_CR10","doi-asserted-by":"crossref","unstructured":"Rafiei A, Abolhasan M, Franklin D, Safaei F (2011) Boundary node selection algorithms in WSNs. In: Local Computer Networks (LCN), 2011 IEEE 36th Conference on. IEEE, pp 251\u2013254","DOI":"10.1109\/LCN.2011.6115201"},{"key":"2494_CR11","doi-asserted-by":"crossref","unstructured":"Sahoo PK, Hsieh KY, Sheu JP (2007) Boundary node selection and target detection in wireless sensor network. In: Wireless and Optical Communications Networks, 2007. WOCN\u201907. IFIP International Conference on. IEEE, pp 1\u20135","DOI":"10.1109\/WOCN.2007.4284126"},{"issue":"11","key":"2494_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman TM, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129","journal-title":"Softw Pract Exp"},{"issue":"1","key":"2494_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(1):7","journal-title":"Inf Process Lett"},{"issue":"4","key":"2494_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R Davidson","year":"1996","unstructured":"Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Trans Graph (TOG) 15(4):301","journal-title":"ACM Trans Graph (TOG)"},{"key":"2494_CR15","volume-title":"Fundamental algorithms for computer graphics","author":"J Bresenham","year":"1991","unstructured":"Bresenham J, Earnshaw R, Pitteway M (1991) Fundamental algorithms for computer graphics. Springer, Berlin"},{"issue":"3","key":"2494_CR16","first-page":"20","volume":"6","author":"O Saukh","year":"2010","unstructured":"Saukh O, Sauter R, Gauger M, Marr\u00f3n PJ (2010) On boundary recognition without location information in wireless sensor networks. ACM Trans Sens Netw (TOSN) 6(3):20","journal-title":"ACM Trans Sens Netw (TOSN)"},{"issue":"7","key":"2494_CR17","doi-asserted-by":"publisher","first-page":"897039","DOI":"10.1155\/2014\/897039","volume":"10","author":"B Huang","year":"2014","unstructured":"Huang B, Wu W, Gao G, Zhang T (2014) Recognizing boundaries in wireless sensor networks based on local connectivity information. Int J Distrib Sens Netw 10(7):897039","journal-title":"Int J Distrib Sens Netw"},{"key":"2494_CR18","doi-asserted-by":"crossref","unstructured":"Wang Y, Gao J, Mitchell JS (2006) Boundary recognition in sensor networks by topological methods. In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking. ACM, pp 122\u2013133","DOI":"10.1145\/1161089.1161104"},{"key":"2494_CR19","doi-asserted-by":"crossref","unstructured":"Zhang C, Zhang Y, Fang Y (2006) Detecting coverage boundary nodes in wireless sensor networks. In: Networking, Sensing and Control, 2006. ICNSC\u201906. Proceedings of the 2006 IEEE International Conference on. IEEE, pp 868\u2013873","DOI":"10.1109\/ICNSC.2006.1673261"},{"issue":"3","key":"2494_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer F (1991) Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Comput Surv (CSUR) 23(3):345","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2494_CR21","doi-asserted-by":"publisher","first-page":"8310296","DOI":"10.1155\/2016\/8310296","volume":"2016","author":"LH Zhao","year":"2016","unstructured":"Zhao LH, Liu W, Lei H, Zhang R, Tan Q (2016) Detecting boundary nodes and coverage holes in wireless sensor networks. Mob Inf Syst 2016:8310296. \n                    https:\/\/doi.org\/10.1155\/2016\/8310296","journal-title":"Mob Inf Syst"},{"issue":"1","key":"2494_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jides.2016.04.001","volume":"3","author":"R Beghdad","year":"2016","unstructured":"Beghdad R, Lamraoui A (2016) Boundary and holes recognition in wireless sensor networks. J Innov Digit Ecosyst 3(1):1","journal-title":"J Innov Digit Ecosyst"},{"issue":"1","key":"2494_CR23","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s11227-014-1129-6","volume":"69","author":"Samira Afzal","year":"2014","unstructured":"Afzal S, Beigy H (2014) A localization algorithm for large scale mobile wireless sensor networks: a learning approach. J Supercomput 69(1):98\u2013120. \n                    https:\/\/doi.org\/10.1007\/s11227-014-1129-6","journal-title":"The Journal of Supercomputing"},{"key":"2494_CR24","doi-asserted-by":"crossref","unstructured":"V\u00f6lker M, Wagner D, Schmid J, G\u00e4deke T, M\u00fcller-Glaser K (2012) Force-directed tracking in wireless networks using signal strength and step recognition. In: Localization and GNSS (ICL-GNSS), 2012 International Conference on. IEEE, pp 1\u20138","DOI":"10.1109\/ICL-GNSS.2012.6253126"},{"issue":"2","key":"2494_CR25","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s11227-011-0700-7","volume":"64","author":"JW Park","year":"2013","unstructured":"Park JW, Park DH, Lee C (2013) Angle and ranging based localization method for ad hoc network. J Supercomput 64(2):507","journal-title":"J Supercomput"},{"key":"2494_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511996368","volume-title":"Exploratory social network analysis with Pajek","author":"W Nooy De","year":"2011","unstructured":"De Nooy W, Mrvar A, Batagelj V (2011) Exploratory social network analysis with Pajek, vol 27. Cambridge University Press, Cambridge"},{"key":"2494_CR27","unstructured":"Chimani M, Gutwenger C, J\u00fcnger M, Klau GW, Klein K, Mutzel P (2013) The open graph drawing framework (OGDF). In: Handbook of graph drawing and visualization 2011, p 543"},{"issue":"5","key":"2494_CR28","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1007\/s11227-016-1898-1","volume":"73","author":"KA Darabkh","year":"2017","unstructured":"Darabkh KA, Albtoush WY, Jafar IF (2017) Improved clustering algorithms for target tracking in wireless sensor networks. J Supercomput 73(5):1952","journal-title":"J Supercomput"},{"issue":"6","key":"2494_CR29","doi-asserted-by":"publisher","first-page":"e98679","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE 9(6):e98679","journal-title":"PLoS ONE"},{"key":"2494_CR30","volume-title":"Algorithms for graph partitioning: a survey","author":"PO Fj\u00e4llstr\u00f6m","year":"1998","unstructured":"Fj\u00e4llstr\u00f6m PO (1998) Algorithms for graph partitioning: a survey, vol 3. Link\u00f6ping University Electronic Press, Link\u00f6ping"},{"key":"2494_CR31","first-page":"491","volume-title":"Sourcebook of parallel computing","author":"K Schloegel","year":"2003","unstructured":"Schloegel K, Karypis G, Kumar V (2003) Graph partitioning for high-performance scientific simulations. In: Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L, White A (eds) Sourcebook of parallel computing. Morgan Kaufmann Publishers Inc., San Francisco, CA, pp 491\u2013541"},{"key":"2494_CR32","doi-asserted-by":"publisher","unstructured":"Hendrickson B, Leland RW (1995) A multi-level algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, Supercomputing \u201995, ACM, New York. \n                    https:\/\/doi.org\/10.1145\/224170.224228","DOI":"10.1145\/224170.224228"},{"key":"2494_CR33","first-page":"2","volume":"19","author":"I Safro","year":"2015","unstructured":"Safro I, Sanders P, Schulz C (2015) Advanced coarsening schemes for graph partitioning. J Exp Algorithmics (JEA) 19:2","journal-title":"J Exp Algorithmics (JEA)"},{"key":"2494_CR34","unstructured":"Noack A (2007) Unified quality measures for clusterings, layouts, and orderings of graphs, and their application as software design criteria. Ph.D. thesis, Brandenburg University of Technology, Cottbus-Senftenberg"},{"key":"2494_CR35","volume-title":"Introduction to biomedical engineering","author":"JD Enderle","year":"2012","unstructured":"Enderle JD, Bronzino JD (2012) Introduction to biomedical engineering. Academic Press, New York"},{"issue":"1","key":"2494_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P Gajer","year":"2004","unstructured":"Gajer P, Goodrich MT, Kobourov SG (2004) A multi-dimensional approach to force-directed layouts of large graphs. Comput Geom 29(1):3","journal-title":"Comput Geom"},{"key":"2494_CR37","doi-asserted-by":"crossref","unstructured":"Biemann C (2006) Chinese Whispers: an efficient graph clustering algorithm and its application to natural language processing problems. In: Proceedings of the first workshop on graph based methods for natural language processing. Association for Computational Linguistics, pp 73\u201380","DOI":"10.3115\/1654758.1654774"},{"key":"2494_CR38","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-37247-6_39","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"David B. Bracewell","year":"2013","unstructured":"Bracewell DB, Tomlinson MT, Mohler M (2013) Determining the conceptual space of metaphoric expressions. In: International Conference on Intelligent Text Processing and Computational Linguistics. Springer, Berlin, Heidelberg, pp 487\u2013500"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2494-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2494-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2494-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T19:44:03Z","timestamp":1569008643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2494-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":38,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["2494"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2494-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"24 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}