Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability
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 a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/583753 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547919887073280 |
|---|---|
| author | Joon-Min Gil Jong Hyuk Park Young-Sik Jeong |
| author_facet | Joon-Min Gil Jong Hyuk Park Young-Sik Jeong |
| author_sort | Joon-Min Gil |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-6532ad78bcc64eb599cd03ef751ffbfa |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-6532ad78bcc64eb599cd03ef751ffbfa2025-02-03T06:42:59ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-12-01910.1155/2013/583753583753Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage ReliabilityJoon-Min Gil0Jong Hyuk Park1Young-Sik Jeong2 School of Information Technology Engineering, Catholic University of Daegu, Gyeongbuk 712-702, Republic of Korea Department of Computer Science and Engineering, Seoul National University of Science and Technology, Seoul 139-743, Republic of Korea Department of Multimedia Engineering, Dongguk University, Seoul 100-715, Republic of KoreaDirectional 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.https://doi.org/10.1155/2013/583753 |
| spellingShingle | Joon-Min Gil Jong Hyuk Park Young-Sik Jeong Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability International Journal of Distributed Sensor Networks |
| title | Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability |
| title_full | Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability |
| title_fullStr | Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability |
| title_full_unstemmed | Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability |
| title_short | Maximizing Network Lifetime of Directional Sensor Networks Considering Coverage Reliability |
| title_sort | maximizing network lifetime of directional sensor networks considering coverage reliability |
| url | https://doi.org/10.1155/2013/583753 |
| work_keys_str_mv | AT joonmingil maximizingnetworklifetimeofdirectionalsensornetworksconsideringcoveragereliability AT jonghyukpark maximizingnetworklifetimeofdirectionalsensornetworksconsideringcoveragereliability AT youngsikjeong maximizingnetworklifetimeofdirectionalsensornetworksconsideringcoveragereliability |