Energy-efficient Area Coverage by Sensors with Adjustable Ranges

Zalyubovskiy, Vyacheslav V.; Erzin, Adil; Astrakov, S. N.; Choo, Hyunseung

doi:10.3390/s90402446

Cited by 57 publications

(39 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11], Zalyubovskiy et al proposed an energy-efficient algorithm for area coverage problems. The locations of sensor nodes are determined and their sensing ranges and communication ranges are adjustable.…”

Section: Area Coveragementioning

confidence: 99%

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Deng

et al. 2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network.

show abstract

Section: Area Coveragementioning

confidence: 99%

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Deng

et al. 2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…[1][2][3][4][5] It is said that the sensor covers the disc or that the disc is the sensing region of the sensor. In WSNs, each sensor is supplied with a limited amount of non-renewable energy, and its lifetime is inversely proportional to the covered area.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, an optimal cover of a planar region with discs or ellipses (when every point of a region belongs to at least one disc or ellipse) is the cover that has minimal density, where the density of the plane region's cover is the ratio of the sum of the elements' areas in the cover to the region's area. [4][5][6][7][8]11,13] Since every disc can be placed at any place of a plane, there is an infinite set of plane covers using discs. [4,7,8,13] The most studied covers are regular covers, [2][3][4][5][6]9,10] where a planar region is tiled by identical regular polygons (tiles), and all of the tiles are covered equally.…”

Section: Introductionmentioning

confidence: 99%

Covering a plane with ellipses

Erzin

Astrakov

2013

Optimization

View full text Add to dashboard Cite

This paper is devoted to the construction of regular min-density plane coverings with ellipses of one, two and three types. This problem is relevant, for example, to power-efficient surface sensing by autonomous above-grade sensors. A similar problem, for which discs are used to cover a planar region, has been well studied. On the one hand, the use of ellipses generalizes a mathematical problem; on the other hand, it is necessary to solve these types of problems in real applications of wireless sensor networks. This paper both extends some previous results and offers new regular covers that use a small number of ellipses to cover each regular polygon; these covers are characterized by having minimal known density in their classes and give the new upper bounds for densities in these classes as well.

show abstract

“…The first one is the search among points of the continuous set Ω \ P . For this purpose methods for the area coverage problem in sensor networks may be useful [18,19].…”

Section: A Location Problem For Wsns With Wireless Chargersmentioning

confidence: 99%

Location Problems in Renewable Sensor Networks With Wireless Energy Transfer

Migov¹

2016

bncc.cs

View full text Add to dashboard Cite

Abstract. The area of wireless sensor networks (WSNs) has recently received a lot of attention. Nevertheless, the major problem is the finite electrical batteries in sensors, which prevents the wide use of WSNs. However, technologies of the wireless energy transfer may be applied to solve energy problems in WSNs with the use of wireless energy chargers. In this study we offer the techniques of finding the points, which are most suitable for a simultaneous omnidirectional wireless charge of a group of sensors. The wireless chargers in question can be both mobile or static. The stated problems are quite similar to the problems of p-center and p-median location in a graph and may be solved by appropriate methods. The approach proposed may significantly decrease a path of a mobile charger when traversing places for recharging sensors. For the WSNs with static wireless chargers these optimal points are useful for the chargers deployment.

show abstract

Energy-efficient Area Coverage by Sensors with Adjustable Ranges

Cited by 57 publications

References 13 publications

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Covering a plane with ellipses

Location Problems in Renewable Sensor Networks With Wireless Energy Transfer

Contact Info

Product

Resources

About