| 한글제목(Korean Title) |
Comprehensive Asymmetric Scheduling Techniques for Wireless Sensor Networks based on Block Designs |
| 영문제목(English Title) |
Comprehensive Asymmetric Scheduling Techniques for Wireless Sensor Networks based on Block Designs |
| 저자(Author) |
Jong-Hoon Youn
Woosik Lee
Teuk-Seob Song
|
| 원문수록처(Citation) |
VOL 08 NO. 01 PP. 0324 ~ 0326 (2016. 06) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
Wireless sensors are used in a number of monitoring application to collect information through sensors. Usually the sensor devices are small and equipped with a tiny battery, which in effect limits the lifetime of the sensor network. Thus, one of key research and development issues is how to minimize the battery usages. To reduce the energy consumption, sensors switch back and forth between active and sleep modes. When two neighboring sensors are in the active mode at the same time, they can communicate each other. There are many previous research efforts and papers dealing with the problem of neighbor discovery in sensor networks. In this talk, we present co prime-based asymmetric scheduling methods to solve the neighbor discovery problem in asynchronized sensor networks.
|
| 키워드(Keyword) |
Wireless Sensor Networks
IoT
neighbor discovery scheduling
Block design
|
| 파일첨부 |
PDF 다운로드
|
