Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks

Woosik Lee, Ik Hyun Youn, Teukseob Song, Namgi Kim, Jong-Hoon Youn

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both the symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.

Original languageEnglish (US)
Article number7466795
Pages (from-to)1437-1440
Number of pages4
JournalIEEE Communications Letters
Volume20
Issue number7
DOIs
StatePublished - Jul 2016

Fingerprint

Block Design
Wake
Wireless Sensor Networks
Wireless sensor networks
Schedule
Network protocols
Searchlights
Chinese remainder theorem
Balanced Incomplete Block Design
Sensor networks
Sensor Networks
Simulation Study
Cycle
Sensor
Requirements
Sensors

Keywords

  • Chinese remainder theorem
  • Sensor network
  • combinatorial design
  • neighbor discovery

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks. / Lee, Woosik; Youn, Ik Hyun; Song, Teukseob; Kim, Namgi; Youn, Jong-Hoon.

In: IEEE Communications Letters, Vol. 20, No. 7, 7466795, 07.2016, p. 1437-1440.

Research output: Contribution to journalArticle

Lee, Woosik ; Youn, Ik Hyun ; Song, Teukseob ; Kim, Namgi ; Youn, Jong-Hoon. / Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks. In: IEEE Communications Letters. 2016 ; Vol. 20, No. 7. pp. 1437-1440.
@article{2e8b772952d048ffa4e33f4cf27d8349,
title = "Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks",
abstract = "Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both the symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.",
keywords = "Chinese remainder theorem, Sensor network, combinatorial design, neighbor discovery",
author = "Woosik Lee and Youn, {Ik Hyun} and Teukseob Song and Namgi Kim and Jong-Hoon Youn",
year = "2016",
month = "7",
doi = "10.1109/LCOMM.2016.2564971",
language = "English (US)",
volume = "20",
pages = "1437--1440",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Prime Block Design for Asynchronous Wake-Up Schedules in Wireless Sensor Networks

AU - Lee, Woosik

AU - Youn, Ik Hyun

AU - Song, Teukseob

AU - Kim, Namgi

AU - Youn, Jong-Hoon

PY - 2016/7

Y1 - 2016/7

N2 - Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both the symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.

AB - Due do the various requirements of sensor applications, it is desired to design a neighbor discovery protocol that supports both the symmetric and asymmetric duty cycles. This letter proposes a new block-based neighbor discovery protocol for asymmetric sensor networks by adapting the theory of balanced incomplete block designs and the Chinese remainder theorem. Through the simulation study, it is demonstrated that the proposed block-based neighbor discovery protocol outperforms other neighbor discovery methods, such as Disco, U-Connect, SearchLight, Hedis, and Todis.

KW - Chinese remainder theorem

KW - Sensor network

KW - combinatorial design

KW - neighbor discovery

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

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

U2 - 10.1109/LCOMM.2016.2564971

DO - 10.1109/LCOMM.2016.2564971

M3 - Article

AN - SCOPUS:84978704883

VL - 20

SP - 1437

EP - 1440

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 7

M1 - 7466795

ER -