@article{(Open Science Index):https://publications.waset.org/pdf/8445,
	  title     = {Coverage and Connectivity Problem in Sensor Networks},
	  author    = {Meenakshi Bansal and  Iqbal Singh and  Parvinder S. Sandhu},
	  country	= {},
	  institution	= {},
	  abstract     = {In over deployed sensor networks, one approach
to Conserve energy is to keep only a small subset of sensors
active at Any instant. For the coverage problems, the monitoring
area in a set of points that require sensing, called demand points, and
consider that the node coverage area is a circle of range R, where R
is the sensing range, If the Distance between a demand point and
a sensor node is less than R, the node is able to cover this point. We
consider a wireless sensor network consisting of a set of sensors
deployed randomly. A point in the monitored area is covered if it is
within the sensing range of a sensor. In some applications, when the
network is sufficiently dense, area coverage can be approximated by
guaranteeing point coverage. In this case, all the points of wireless
devices could be used to represent the whole area, and the working
sensors are supposed to cover all the sensors. We also introduce
Hybrid Algorithm and challenges related to coverage in sensor
networks.},
	    journal   = {International Journal of Electronics and Communication Engineering},
	  volume    = {5},
	  number    = {1},
	  year      = {2011},
	  pages     = {94 - 96},
	  ee        = {https://publications.waset.org/pdf/8445},
	  url   	= {https://publications.waset.org/vol/49},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 49, 2011},
	}