Earticle

초록

영어

The 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 literature are not flexible enough because block design cannot support asymmetric asynchronous operations. In this paper, we introduce a new approach for asymmetric asynchronous neighbor discovery protocol that combines two optimal block designs using the OR operation. OR-based block combination solves the problem of original block design, which cannot support asymmetric scenarios. We evaluate the performance of OR-based block combinations using a simulation study. According to our simulation results, OR-based block combination performs up to 71% better than other asymmetric algorithms, such as U-Connect and Disco with 10% and 1% duty cycles.

목차

Abstract
 1. Introduction
 2. Related Works
 3. OR-based Block Combination
  3.1. Block Design Scheme in Scheduling
  3.2. OR-based Block Combination Construction
 4. Simulation Experiments
 5. Conclusion
 Acknowledgments
 References

키워드

저자

• Woosik Lee [ Computer Science, Kyonggi Univerisy, South Korea ]
• Sangil Choi [ College of Information Science & Technology, University of Nebraska at Omaha, NE, USA ]
• Teuk Seob Song [ Division of Convergence Computer and Media, Mokwon University, South Korea ] Corresponding author
• Namgi Kim [ Computer Science, Kyonggi Univerisy, South Korea ]
• Jong-Hoon Youn [ College of Information Science & Technology, University of Nebraska at Omaha, NE, USA ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Control and Automation

• 간기

  월간

• pISSN

  2005-4297

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605