Computer Science – Networking and Internet Architecture
Scientific paper
2010-01-26
Computer Science
Networking and Internet Architecture
Scientific paper
This paper deals with the accomplishment of total area coverage of an arbitrary region using sensors with a finite sensing radius of rs. For a given region, we aim to obtain a deterministic placement of sensors which, apart from ensuring that the entire region comes under the purview of at least a single sensor, minimises the number of sensors utilised. We begin by considering regions devoid of obstacles and thus having every location amenable for placement. Herein, we formalise the popular notion that sensors at the centres of the hexagons of a hexagonal tessellation provide the most optimal placement. We then move on to regions which may comprise obstacles of arbitrary size at arbitrary locations. We recognise two distinct classes of obstacles, namely transparent and opaque obstacles, which are distinguished by their ability (or the lack of it) to permit sensing radiation through them. In the real world, transparent obstacles model lakes, ponds and swamps, while the opaque ones stand for, inter alia, hills, trees and walls.We propose a polynomial-time algorithm for achieving optimal placement in the aforesaid scenarios and we prove its convergence.
Shyam M.
Kumar Anurag
No associations
LandOfFree
Obstacle Constrained Total Area Coverage in Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Obstacle Constrained Total Area Coverage in Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Obstacle Constrained Total Area Coverage in Wireless Sensor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-645246