바로가기메뉴
메뉴바로가기
본문바로가기
탑메뉴
메인메뉴
> 연구성과 > 국외저널
Inquiry
책임교수
논문명
논문종류
----- 선택하세요 ----
SCI
SCOPUS
LNCS / LNAI / LNEE
기타저널
제1저자
교신저자
공동저자
Impact Factor
개제학술지명
Keyword
게재일
----- 년 ----
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
----- 월 ----
01
02
03
04
05
06
07
08
09
10
11
12
비밀번호
내용
Directional sensor networks composed of a large number of directional sensors equipped with a limited battery and with a limited angle of sensing have recently attracted attention. Maximizing network lifetime is a challenge in developing energy-efficient directional sensor networks, while covering all of the targets in a given area. However, the existing schemes have considered target coverage problem as only the maximization of network lifetime. In real sensor networks, the quality of target coverage will be varied according to the detection probability of the sensors covering targets. In this paper, we address the directional cover-sets with coverage reliability (DCCR) problem of organizing directional sensors into a group of nondisjoint subsets to extend network lifetime maximally while maintaining networks' satisfied coverage reliability. For the DCCR problem, we first present a coverage reliability model that mainly takes into account the detection probability of each sensor in cover-sets and eventually supports coverage reliability for target coverage. We also develop a heuristic algorithm called directional coverage and reliability (DCR) greedy algorithm to solve the DCCR problem. To verify and evaluate the algorithm, we conduct simulations and show that it extends network lifetime to a reasonable degree while guaranteeing the minimum coverage reliability.
*ITRC 기여율=0.5