Block design-based asynchronous neighbor discovery protocol for wireless sensor networks

Sangil Choi, Wooksik Lee, Teukseob Song, Jong-Hoon Youn

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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 BAND. 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 BAND and existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency of BAND is about 40% lower than that of existing protocols. Furthermore, BAND spends approximately 30% less energy than others during the neighbor discovery process.

Original languageEnglish (US)
Article number951652
JournalJournal of Sensors
Volume2015
DOIs
StatePublished - Jan 1 2015

Fingerprint

Wireless sensor networks
Network protocols
sensors
schedules
simulation
communication
Sensor networks
Communication
Sensors
energy

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Instrumentation
  • Electrical and Electronic Engineering

Cite this

Block design-based asynchronous neighbor discovery protocol for wireless sensor networks. / Choi, Sangil; Lee, Wooksik; Song, Teukseob; Youn, Jong-Hoon.

In: Journal of Sensors, Vol. 2015, 951652, 01.01.2015.

Research output: Contribution to journalArticle

@article{714fea5147f24ddc910693337117ff53,
title = "Block design-based asynchronous neighbor discovery protocol for wireless sensor networks",
abstract = "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 BAND. 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 BAND and existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency of BAND is about 40{\%} lower than that of existing protocols. Furthermore, BAND spends approximately 30{\%} less energy than others during the neighbor discovery process.",
author = "Sangil Choi and Wooksik Lee and Teukseob Song and Jong-Hoon Youn",
year = "2015",
month = "1",
day = "1",
doi = "10.1155/2015/951652",
language = "English (US)",
volume = "2015",
journal = "Journal of Sensors",
issn = "1687-725X",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - Block design-based asynchronous neighbor discovery protocol for wireless sensor networks

AU - Choi, Sangil

AU - Lee, Wooksik

AU - Song, Teukseob

AU - Youn, Jong-Hoon

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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 BAND. 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 BAND and existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency of BAND is about 40% lower than that of existing protocols. Furthermore, BAND spends approximately 30% less energy than others during the neighbor discovery process.

AB - 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 BAND. 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 BAND and existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency of BAND is about 40% lower than that of existing protocols. Furthermore, BAND spends approximately 30% less energy than others during the neighbor discovery process.

UR - http://www.scopus.com/inward/record.url?scp=84939171862&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84939171862&partnerID=8YFLogxK

U2 - 10.1155/2015/951652

DO - 10.1155/2015/951652

M3 - Article

AN - SCOPUS:84939171862

VL - 2015

JO - Journal of Sensors

JF - Journal of Sensors

SN - 1687-725X

M1 - 951652

ER -