{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:35:24Z","timestamp":1740148524562,"version":"3.37.3"},"reference-count":9,"publisher":"Wiley","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2014-017928"],"award-info":[{"award-number":["2014-017928"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Sensors"],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Neighbor discovery is a significant research topic in wireless sensor networks. After wireless sensor devices are deployed in specific areas, they attempt to determine neighbors within their communication range. This paper proposes a new Block design-based Asynchronous Neighbor Discovery protocol for sensor networks called<jats:italic>BAND<\/jats:italic>. We borrow the concept of combinatorial block designs for neighbor discovery. First, we summarize a practical challenge and difficulty of using the original block designs. To address this challenge, we create a new block generation technique for neighbor discovery schedules and provide a mathematical proof of the proposed concept. A key aspect of the proposed protocol is that it combines two block designs in order to construct a new block for neighbor discovery. We analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature. Our protocol reveals that the worst-case latency is much lower than others. Finally, we evaluate the performance of<jats:italic>BAND<\/jats:italic>and existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency of<jats:italic>BAND<\/jats:italic>is about 40% lower than that of existing protocols. Furthermore,<jats:italic>BAND<\/jats:italic>spends approximately 30% less energy than others during the neighbor discovery process.<\/jats:p>","DOI":"10.1155\/2015\/951652","type":"journal-article","created":{"date-parts":[[2015,7,26]],"date-time":"2015-07-26T17:01:38Z","timestamp":1437930098000},"page":"1-12","source":"Crossref","is-referenced-by-count":9,"title":["Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks"],"prefix":"10.1155","volume":"2015","author":[{"given":"Sangil","family":"Choi","sequence":"first","affiliation":[{"name":"College of Information Science and Technology, University of Nebraska at Omaha, 6001 Dodge Street, Omaha, NE 68182, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wooksik","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Kyonggi University, Suwon 443-760, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teukseob","family":"Song","sequence":"additional","affiliation":[{"name":"Division of Convergence Computer and Media, Mokwon University, Daejeon 302-729, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Hoon","family":"Youn","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Nebraska at Omaha, 6001 Dodge Street, Omaha, NE 68182, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"2","doi-asserted-by":"publisher","DOI":"10.1023\/b:mone.0000048553.45798.5e"},{"year":"1988","key":"8"},{"year":"1996","key":"9"},{"year":"2004","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/a:1016542229220"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2013.6553686"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/surv.2012.040412.00105"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/surv.2013.012414.00164"}],"container-title":["Journal of Sensors"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2015\/951652.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2015\/951652.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2015\/951652.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T17:12:24Z","timestamp":1469639544000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/js\/2015\/951652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":9,"alternative-id":["951652","951652"],"URL":"https:\/\/doi.org\/10.1155\/2015\/951652","relation":{},"ISSN":["1687-725X","1687-7268"],"issn-type":[{"type":"print","value":"1687-725X"},{"type":"electronic","value":"1687-7268"}],"subject":[],"published":{"date-parts":[[2015]]}}}