Block combination selection scheme for neighbor discovery protocol

Woosik Lee, Sangil Choi, Namgi Kim, Jong-Hoon Youn, Dreizan Moore

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

1 Citation (Scopus)

Abstract

A neighbor discovery protocol (NDP) is one of the critical research subjects in wireless sensor networks (WSNs) for efficient energy management of sensor nodes. A block design concept can be applied to find a neighbor discovery schedule that guarantees at least one common active slot between any pair of sensor nodes. However, the block design - based solutions in the literature are not flexible enough because, due to the lack of a general block design scheme, only a limited set of block designs is available for some duty cycles. In this paper, a new approach for the block construction that can easily generate a set of neighbor discovery schedules with a diverse set of duty cycles is introduced. Moreover, we propose a block combination selection scheme (BCS) to choose a near-optimal block combination among the set of candidate schedules. The BCS algorithm first generates set of the candidate block combinations whose duty cycle is similar to the desired duty cycle. Then, from the set of candidates, BCS picks a block combination which has the minimum duty cycle and latency product. In this simulation study, we evaluate the performance of the BCS algorithm and compare it to the performance of other NDPs, such as Random, U-Connect, Disco, and Quorum with a target duty cycle. According to our simulation results, the BCS algorithm always picks the best block combination from the set. If the desired duty cycle is 1%, the block combination selected by BCS performs up to 56.29% better than other NDPs in terms of worst-case latency. In terms of energy consumption, the BCS algorithm performs is 58.8% better than other NDPs.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages143-147
Number of pages5
ISBN (Print)9781479917976
DOIs
StatePublished - Sep 28 2015
Event5th International Conference on Communication Systems and Network Technologies, CSNT 2015 - Gwalior, India
Duration: Apr 4 2015Apr 6 2015

Other

Other5th International Conference on Communication Systems and Network Technologies, CSNT 2015
CountryIndia
CityGwalior
Period4/4/154/6/15

Fingerprint

Network protocols
Sensor nodes
Energy management
Wireless sensor networks
Energy utilization

Keywords

  • Block construction
  • Block design
  • Neighbor discovery protocol
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Lee, W., Choi, S., Kim, N., Youn, J-H., & Moore, D. (2015). Block combination selection scheme for neighbor discovery protocol. In Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015 (pp. 143-147). [7279897] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CSNT.2015.251

Block combination selection scheme for neighbor discovery protocol. / Lee, Woosik; Choi, Sangil; Kim, Namgi; Youn, Jong-Hoon; Moore, Dreizan.

Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 143-147 7279897.

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

Lee, W, Choi, S, Kim, N, Youn, J-H & Moore, D 2015, Block combination selection scheme for neighbor discovery protocol. in Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015., 7279897, Institute of Electrical and Electronics Engineers Inc., pp. 143-147, 5th International Conference on Communication Systems and Network Technologies, CSNT 2015, Gwalior, India, 4/4/15. https://doi.org/10.1109/CSNT.2015.251
Lee W, Choi S, Kim N, Youn J-H, Moore D. Block combination selection scheme for neighbor discovery protocol. In Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 143-147. 7279897 https://doi.org/10.1109/CSNT.2015.251
Lee, Woosik ; Choi, Sangil ; Kim, Namgi ; Youn, Jong-Hoon ; Moore, Dreizan. / Block combination selection scheme for neighbor discovery protocol. Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 143-147
@inproceedings{c3294107901f4d3a9d1d9648186a7936,
title = "Block combination selection scheme for neighbor discovery protocol",
abstract = "A neighbor discovery protocol (NDP) is one of the critical research subjects in wireless sensor networks (WSNs) for efficient energy management of sensor nodes. A block design concept can be applied to find a neighbor discovery schedule that guarantees at least one common active slot between any pair of sensor nodes. However, the block design - based solutions in the literature are not flexible enough because, due to the lack of a general block design scheme, only a limited set of block designs is available for some duty cycles. In this paper, a new approach for the block construction that can easily generate a set of neighbor discovery schedules with a diverse set of duty cycles is introduced. Moreover, we propose a block combination selection scheme (BCS) to choose a near-optimal block combination among the set of candidate schedules. The BCS algorithm first generates set of the candidate block combinations whose duty cycle is similar to the desired duty cycle. Then, from the set of candidates, BCS picks a block combination which has the minimum duty cycle and latency product. In this simulation study, we evaluate the performance of the BCS algorithm and compare it to the performance of other NDPs, such as Random, U-Connect, Disco, and Quorum with a target duty cycle. According to our simulation results, the BCS algorithm always picks the best block combination from the set. If the desired duty cycle is 1{\%}, the block combination selected by BCS performs up to 56.29{\%} better than other NDPs in terms of worst-case latency. In terms of energy consumption, the BCS algorithm performs is 58.8{\%} better than other NDPs.",
keywords = "Block construction, Block design, Neighbor discovery protocol, Wireless sensor network",
author = "Woosik Lee and Sangil Choi and Namgi Kim and Jong-Hoon Youn and Dreizan Moore",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/CSNT.2015.251",
language = "English (US)",
isbn = "9781479917976",
pages = "143--147",
booktitle = "Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Block combination selection scheme for neighbor discovery protocol

AU - Lee, Woosik

AU - Choi, Sangil

AU - Kim, Namgi

AU - Youn, Jong-Hoon

AU - Moore, Dreizan

PY - 2015/9/28

Y1 - 2015/9/28

N2 - A neighbor discovery protocol (NDP) is one of the critical research subjects in wireless sensor networks (WSNs) for efficient energy management of sensor nodes. A block design concept can be applied to find a neighbor discovery schedule that guarantees at least one common active slot between any pair of sensor nodes. However, the block design - based solutions in the literature are not flexible enough because, due to the lack of a general block design scheme, only a limited set of block designs is available for some duty cycles. In this paper, a new approach for the block construction that can easily generate a set of neighbor discovery schedules with a diverse set of duty cycles is introduced. Moreover, we propose a block combination selection scheme (BCS) to choose a near-optimal block combination among the set of candidate schedules. The BCS algorithm first generates set of the candidate block combinations whose duty cycle is similar to the desired duty cycle. Then, from the set of candidates, BCS picks a block combination which has the minimum duty cycle and latency product. In this simulation study, we evaluate the performance of the BCS algorithm and compare it to the performance of other NDPs, such as Random, U-Connect, Disco, and Quorum with a target duty cycle. According to our simulation results, the BCS algorithm always picks the best block combination from the set. If the desired duty cycle is 1%, the block combination selected by BCS performs up to 56.29% better than other NDPs in terms of worst-case latency. In terms of energy consumption, the BCS algorithm performs is 58.8% better than other NDPs.

AB - A neighbor discovery protocol (NDP) is one of the critical research subjects in wireless sensor networks (WSNs) for efficient energy management of sensor nodes. A block design concept can be applied to find a neighbor discovery schedule that guarantees at least one common active slot between any pair of sensor nodes. However, the block design - based solutions in the literature are not flexible enough because, due to the lack of a general block design scheme, only a limited set of block designs is available for some duty cycles. In this paper, a new approach for the block construction that can easily generate a set of neighbor discovery schedules with a diverse set of duty cycles is introduced. Moreover, we propose a block combination selection scheme (BCS) to choose a near-optimal block combination among the set of candidate schedules. The BCS algorithm first generates set of the candidate block combinations whose duty cycle is similar to the desired duty cycle. Then, from the set of candidates, BCS picks a block combination which has the minimum duty cycle and latency product. In this simulation study, we evaluate the performance of the BCS algorithm and compare it to the performance of other NDPs, such as Random, U-Connect, Disco, and Quorum with a target duty cycle. According to our simulation results, the BCS algorithm always picks the best block combination from the set. If the desired duty cycle is 1%, the block combination selected by BCS performs up to 56.29% better than other NDPs in terms of worst-case latency. In terms of energy consumption, the BCS algorithm performs is 58.8% better than other NDPs.

KW - Block construction

KW - Block design

KW - Neighbor discovery protocol

KW - Wireless sensor network

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

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

U2 - 10.1109/CSNT.2015.251

DO - 10.1109/CSNT.2015.251

M3 - Conference contribution

SN - 9781479917976

SP - 143

EP - 147

BT - Proceedings - 2015 5th International Conference on Communication Systems and Network Technologies, CSNT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -