ABSTRACT

A WSN can be composed of homogeneous or heterogeneous sensor nodes also termed as motes, which adapts the same or different coordination, sensing and computation abilities, respectively. Node deployment is a fundamental issue to be solved in WSNs. A proper node deployment scheme can reduce the complexity of problems in WSNs as, for example, routing, data fusion, communication,etc. Furthermore, it can extend the lifetime of WSNs by minimizing energy consumption. In this paper, we investigate random and deterministic node deployments for large-scale WSNs under the performance metrics.Thus, we have taken four different deterministic deployment patterns for Wireless Sensor Network (WSNs) namely a square grid ,a regular hexagon based, a octagon-square based and a decagonstar pattern for sensor nodes deployment and analysed each of them on the basis of their average coverage provided in the application field. Using basic geometry we propose a novel strategy for calculating the relative frequency of exactly k-covered points, by using k-coverage maps, for all the deployment methods .

Title	:	Coverage Analysis In Wireless Sensor Network
Authors	:	Sasmita Manjari Nayak, Mr Rajeeb Sankar Bal
Keywords	:	WSN(Wireless senser network);WSNs(Wireless senser networks)
Issue Date	:	July 2016.
Abstract	:
Page(s)	:	248-259
ISSN	:	0975–3397
Source	:	Vol. 8, Issue.07