2014
DOI: 10.1016/j.jnca.2014.07.038
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing ranges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 42 publications
(35 citation statements)
references
References 25 publications
0
35
0
Order By: Relevance
“…In recent years, a considerable amount of work on coverage in directional sensor networks (DSNs) has been reported in the literature [ 9 ]. In [ 10 ], the authors designed two greedy-based scheduling algorithms that aim to select the appropriated sensor direction and sensing range in a way to meet the requirements of the target coverage problem and at the same time maximize the network lifetime. However, the performance of the algorithms is extremely dependent on the closeness of the initial candidates to the optimal solution.…”
Section: Previous Workmentioning
confidence: 99%
“…In recent years, a considerable amount of work on coverage in directional sensor networks (DSNs) has been reported in the literature [ 9 ]. In [ 10 ], the authors designed two greedy-based scheduling algorithms that aim to select the appropriated sensor direction and sensing range in a way to meet the requirements of the target coverage problem and at the same time maximize the network lifetime. However, the performance of the algorithms is extremely dependent on the closeness of the initial candidates to the optimal solution.…”
Section: Previous Workmentioning
confidence: 99%
“…The objective of the MNLAR problem is two fold: (1) perform energy-efficient scheduling by activating and deactivating nodes periodically, and (2) select the active nodes and adjust their sensing ranges to ensure that every target is covered. This problem has been formulated as an optimization problem in the form of Integer Programming [9], [30], [31], Linear Programming [32]- [34], and Voronoi Graphs [35], [36]. This problem is NP-complete [30] making it difficult to perform in real-time.…”
Section: B Maximum Network Lifetime Problemmentioning
confidence: 99%
“…[37] by developing a learning automatabased algorithm to find the optimal cover sets. Additionally, the MNLAR problem was extended to include directional (e.g., camera) sensor networks [34].…”
Section: B Maximum Network Lifetime Problemmentioning
confidence: 99%
“…The adjusting technique enables sensors to save energy when they are covering targets positioned in their vicinity since power consumption of sensors depends on the distance between sensors and targets. This technique is applied to the networks where sensors have multiple sensing ranges [23]. This paper attempts to find a solution to the target coverage problem and, simultaneously, extend the network lifetime by means of both techniques of power saving (i.e., scheduling sensors and adjusting sensing ranges).…”
Section: Related Workmentioning
confidence: 99%