Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks

Woosik Lee, Jong-Hoon Youn, Teukseob Song

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In this study, we compare the performances of prime-number-assisted block-based neighbor discovery protocol and other recently proposed neighbor discovery protocols (U-Connect, Disco, SearchLight, and Hedis) using a TOSSIM simulator. The experimental results confirm the superiority of prime-number-assisted block-based neighbor discovery protocol over other neighbor discovery protocols in terms of discovery latency and energy consumptions.

Original languageEnglish (US)
JournalInternational Journal of Distributed Sensor Networks
Volume15
Issue number1
DOIs
StatePublished - Jan 1 2019

Fingerprint

Wireless sensor networks
Network protocols
Sensors
Searchlights
Sensor nodes
Energy utilization
Simulators
Topology
Communication

Keywords

  • Network
  • block design
  • neighbor discovery protocol
  • protocol
  • wireless sensor network

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Networks and Communications

Cite this

Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks. / Lee, Woosik; Youn, Jong-Hoon; Song, Teukseob.

In: International Journal of Distributed Sensor Networks, Vol. 15, No. 1, 01.01.2019.

Research output: Contribution to journalArticle

@article{421b6dc675c349e78cf1e64c53f13da9,
title = "Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks",
abstract = "During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In this study, we compare the performances of prime-number-assisted block-based neighbor discovery protocol and other recently proposed neighbor discovery protocols (U-Connect, Disco, SearchLight, and Hedis) using a TOSSIM simulator. The experimental results confirm the superiority of prime-number-assisted block-based neighbor discovery protocol over other neighbor discovery protocols in terms of discovery latency and energy consumptions.",
keywords = "Network, block design, neighbor discovery protocol, protocol, wireless sensor network",
author = "Woosik Lee and Jong-Hoon Youn and Teukseob Song",
year = "2019",
month = "1",
day = "1",
doi = "10.1177/1550147719826240",
language = "English (US)",
volume = "15",
journal = "International Journal of Distributed Sensor Networks",
issn = "1550-1329",
publisher = "Hindawi Publishing Corporation",
number = "1",

}

TY - JOUR

T1 - Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks

AU - Lee, Woosik

AU - Youn, Jong-Hoon

AU - Song, Teukseob

PY - 2019/1/1

Y1 - 2019/1/1

N2 - During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In this study, we compare the performances of prime-number-assisted block-based neighbor discovery protocol and other recently proposed neighbor discovery protocols (U-Connect, Disco, SearchLight, and Hedis) using a TOSSIM simulator. The experimental results confirm the superiority of prime-number-assisted block-based neighbor discovery protocol over other neighbor discovery protocols in terms of discovery latency and energy consumptions.

AB - During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In this study, we compare the performances of prime-number-assisted block-based neighbor discovery protocol and other recently proposed neighbor discovery protocols (U-Connect, Disco, SearchLight, and Hedis) using a TOSSIM simulator. The experimental results confirm the superiority of prime-number-assisted block-based neighbor discovery protocol over other neighbor discovery protocols in terms of discovery latency and energy consumptions.

KW - Network

KW - block design

KW - neighbor discovery protocol

KW - protocol

KW - wireless sensor network

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

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

U2 - 10.1177/1550147719826240

DO - 10.1177/1550147719826240

M3 - Article

AN - SCOPUS:85060856572

VL - 15

JO - International Journal of Distributed Sensor Networks

JF - International Journal of Distributed Sensor Networks

SN - 1550-1329

IS - 1

ER -