Poster abstract

Block cycle length-based asymmetric rendezvous protocol for IoT applications

Jong-Hoon Youn, Woosik Lee, Teukseob Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In the Internet of Things (IoT) environment, a sensor network protocol must satisfy various application-specific requirements such as synchronous, asynchronous, symmetric, and asymmetric operations. Most block design-based neighbor discovery protocols can not support asymmetric operations. In this paper, we propose a new block cycle length-based asymmetric rendezvous protocol for neighbor discovery. The proposed protocol has beter energy efficiency and shorter latency than existing asynchronous neighbor discovery protocols since it is based on optimized block designs.

Original languageEnglish (US)
Title of host publicationProceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017
PublisherAssociation for Computing Machinery, Inc
Pages287-288
Number of pages2
ISBN (Electronic)9781450348904
DOIs
StatePublished - Apr 18 2017
Event16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017 - Pittsburgh, United States
Duration: Apr 18 2017Apr 20 2017

Other

Other16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017
CountryUnited States
CityPittsburgh
Period4/18/174/20/17

Fingerprint

Network protocols
Sensor networks
Energy efficiency
Internet of things

Keywords

  • Chinese remainder theorem
  • Combinatorial design
  • Neighbor discovery
  • Sensor network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Youn, J-H., Lee, W., & Song, T. (2017). Poster abstract: Block cycle length-based asymmetric rendezvous protocol for IoT applications. In Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017 (pp. 287-288). Association for Computing Machinery, Inc. https://doi.org/10.1145/3055031.3055052

Poster abstract : Block cycle length-based asymmetric rendezvous protocol for IoT applications. / Youn, Jong-Hoon; Lee, Woosik; Song, Teukseob.

Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017. Association for Computing Machinery, Inc, 2017. p. 287-288.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Youn, J-H, Lee, W & Song, T 2017, Poster abstract: Block cycle length-based asymmetric rendezvous protocol for IoT applications. in Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017. Association for Computing Machinery, Inc, pp. 287-288, 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017, Pittsburgh, United States, 4/18/17. https://doi.org/10.1145/3055031.3055052
Youn J-H, Lee W, Song T. Poster abstract: Block cycle length-based asymmetric rendezvous protocol for IoT applications. In Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017. Association for Computing Machinery, Inc. 2017. p. 287-288 https://doi.org/10.1145/3055031.3055052
Youn, Jong-Hoon ; Lee, Woosik ; Song, Teukseob. / Poster abstract : Block cycle length-based asymmetric rendezvous protocol for IoT applications. Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017. Association for Computing Machinery, Inc, 2017. pp. 287-288
@inproceedings{8d2525bbb20e4fe789caba2ae1870326,
title = "Poster abstract: Block cycle length-based asymmetric rendezvous protocol for IoT applications",
abstract = "In the Internet of Things (IoT) environment, a sensor network protocol must satisfy various application-specific requirements such as synchronous, asynchronous, symmetric, and asymmetric operations. Most block design-based neighbor discovery protocols can not support asymmetric operations. In this paper, we propose a new block cycle length-based asymmetric rendezvous protocol for neighbor discovery. The proposed protocol has beter energy efficiency and shorter latency than existing asynchronous neighbor discovery protocols since it is based on optimized block designs.",
keywords = "Chinese remainder theorem, Combinatorial design, Neighbor discovery, Sensor network",
author = "Jong-Hoon Youn and Woosik Lee and Teukseob Song",
year = "2017",
month = "4",
day = "18",
doi = "10.1145/3055031.3055052",
language = "English (US)",
pages = "287--288",
booktitle = "Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Poster abstract

T2 - Block cycle length-based asymmetric rendezvous protocol for IoT applications

AU - Youn, Jong-Hoon

AU - Lee, Woosik

AU - Song, Teukseob

PY - 2017/4/18

Y1 - 2017/4/18

N2 - In the Internet of Things (IoT) environment, a sensor network protocol must satisfy various application-specific requirements such as synchronous, asynchronous, symmetric, and asymmetric operations. Most block design-based neighbor discovery protocols can not support asymmetric operations. In this paper, we propose a new block cycle length-based asymmetric rendezvous protocol for neighbor discovery. The proposed protocol has beter energy efficiency and shorter latency than existing asynchronous neighbor discovery protocols since it is based on optimized block designs.

AB - In the Internet of Things (IoT) environment, a sensor network protocol must satisfy various application-specific requirements such as synchronous, asynchronous, symmetric, and asymmetric operations. Most block design-based neighbor discovery protocols can not support asymmetric operations. In this paper, we propose a new block cycle length-based asymmetric rendezvous protocol for neighbor discovery. The proposed protocol has beter energy efficiency and shorter latency than existing asynchronous neighbor discovery protocols since it is based on optimized block designs.

KW - Chinese remainder theorem

KW - Combinatorial design

KW - Neighbor discovery

KW - Sensor network

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

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

U2 - 10.1145/3055031.3055052

DO - 10.1145/3055031.3055052

M3 - Conference contribution

SP - 287

EP - 288

BT - Proceedings - 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2017

PB - Association for Computing Machinery, Inc

ER -