On balanced k -coverage in visual sensor networks

Malek, Sakib Md. Bin; Sadik, Md. Muntakim; Rahman, Ashikur

doi:10.1016/j.jnca.2016.06.011

Cited by 25 publications

(12 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem is only partly similar because cameras can be oriented, they can pan and zoom, and deployments are in the order of tens of cameras, while we have tens of thousands of potential locations. However, given the similarity to network coverage, we adapt the heuristic proposed in [20] that tries to achieve a fair coverage of selected targets from multiple cameras.…”

Section: Sensors and Camera Placementmentioning

confidence: 99%

On Cost-Effective, Reliable Coverage for LoS Communications in Urban Areas

Gemmi

Cigno

Maccari

2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

The use of ultra high frequencies in 5G and future networks to improve transmission speeds and capacity requires that users' equipment remain in Line of Sight with the access antennas most of the service time. This requirement implies a change in perspective to plan the coverage: Antennas cannot be placed on roofs or remote antenna sites, and a robust coverage is based on multi-antenna visibility from any point. This paper tackles the problem of public street coverage in urban areas with a data-driven methodology. Starting from 3D digital maps, we formalize the problem of antenna placement as a set coverage problem and leverage powerful heuristics to implement a general algorithm that allows the exploration of different policies, returning the detailed coverage, the antenna placement, and the cost of the coverage. Results on 15 areas in 3 Italian cities show the properties of different policies and confirm for the first time on large scale real data the feasibility of Line of Sight communications with a sustainable number of antennas per km 2 .

show abstract

Section: Sensors and Camera Placementmentioning

confidence: 99%

On Cost-Effective, Reliable Coverage for LoS Communications in Urban Areas

Gemmi

Cigno

Maccari

2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…In [27], the authors introduced the balanced k-coverage problem. The problem aims to avoid the situations in which k-coverage is provided merely for some targets in the network, while the rest are left uncovered or covered individually.…”

Section: Related Workmentioning

confidence: 99%

A new target-oriented imperialist competitive-based algorithm to solve target coverage problem in directional sensor networks

Saadati

fard

Mohamadi

2022

Preprint

View full text Add to dashboard Cite

Today, directional sensor networks (DSNs) have received a great deal of attention. A DSN is composed of several self-configurable directional sensors with adjustable spherical sectors of limited angles, which can provide coverage on several targets distributed randomly within a defined area. One of the most significant problems associated with this type of networks, which has been already proved as an NP-hard problem, is monitoring the maximum number of targets by means of minimum number of sensors. Another aspect of the problem is how to extend the lifetime of such networks concerning the limited power source of the sensors. An appropriate solution to this problem is the use of scheduling technique in environments with densely-distributed sensors. In this paper, we proposed an imperialist competitive-based scheduling algorithm capable of providing near-optimal coverage through determining the priority of the targets that can be monitored by fewer sensors. To evaluate the proposed algorithm performance, the obtained results were compared to those of a target-oriented greedy-based algorithm already proposed in the literature. The final results showed the acceptable competency of the proposed algorithm in terms of solving the problem in hand.

show abstract

“…The weakness of this algorithm is that when the densities of the nodes are low, a coverage hole could exist. The authors in [9] addressed the problem of covering each target at least k times while using a minimum number of sensors. They devised a greedy approach with two variants of incentive mechanisms to solve this problem.…”

Section: Related Workmentioning

confidence: 99%

“…(8) and Eq. (9). We use the relationship between the random value in [0, 1] and the parameter Pr as in Eq.…”

Section: C: the Proposed Algorithmmentioning

confidence: 99%

A Two-Phase Coverage Control Algorithm for Self-Orienting Heterogeneous Directional Sensor Networks

Cao

2020

IEEE Access

View full text Add to dashboard Cite

Maximizing network coverage is very important for heterogeneous directional sensor networks (HDSNs). HDSNs consist of directional sensor nodes with different parameters in terms of the sensing radius, the communication radius and the angle of view. After the initial deployment of the HDSNs, coverage problems occur, such as overlapped areas and holes in the coverage, which are not covered by any one of the sensor nodes. To solve these coverage problems, motility and mobility are often utilized. Motility means the ability to adjust the working direction of the nodes, while mobility presents the physical movement of the nodes. The coverage problem that we solved in this paper is characterized by the heterogeneity of the directional sensor nodes in terms of the sensing radius, the field of angle, the motility, the mobility, and the communication radius. A two-phase algorithm was proposed to solve the coverage optimization problem of the HDSNs. In the first phase of the proposed algorithm, a stepwise method was used to adjust the working direction of the nodes; in the second phase of the proposed algorithm, a virtual force-directed self-adaptive differential evolution algorithm was proposed to achieve a tradeoff between the coverage and the energy consumption. Extensive simulation experiments were performed to demonstrate the effectiveness of our proposed algorithm over alternative algorithms in terms of the coverage rate and energy consumption. INDEX TERMS Directional sensor networks, coverage control, heterogeneous network, self-adaptive differential evolution algorithm, virtual force.

show abstract

On balanced k -coverage in visual sensor networks

Cited by 25 publications

References 21 publications

On Cost-Effective, Reliable Coverage for LoS Communications in Urban Areas

On Cost-Effective, Reliable Coverage for LoS Communications in Urban Areas

A new target-oriented imperialist competitive-based algorithm to solve target coverage problem in directional sensor networks

A Two-Phase Coverage Control Algorithm for Self-Orienting Heterogeneous Directional Sensor Networks

Contact Info

Product

Resources

About