Approximation algorithms for sweep coverage in wireless sensor networks

dc.contributor.guide	Mandal, Partha Sarathi
dc.coverage.spatial	Mathematics
dc.creator.researcher	Gorain, Barun
dc.date.accessioned	2023-05-09T06:12:21Z
dc.date.available	2023-05-09T06:12:21Z
dc.date.awarded	2015
dc.date.completed	2015
dc.date.registered	2010
dc.description.abstract	Coverage is one of the most important issues in wireless sensor networks WSNs and it is a well studied research area To ensure coverage a set of sensors continuously monitor the subject to be covered Sweep coverage is a recent development for the applications of WSNs where periodic monitoring by a set of mobile sensors is sufficient instead of continuous one like traditional coverage In this thesis we remark on the flaw of the approximation algorithms Mo Li Wei Fang Cheng Kebin Liu Yu
dc.description.note	Not Available
dc.format.accompanyingmaterial	None
dc.format.dimensions	Not Available
dc.format.extent	Not Available
dc.identifier.uri	http://hdl.handle.net/10603/481791
dc.language	English
dc.publisher.institution	DEPARTMENT OF MATHEMATICS
dc.publisher.place	Guwahati
dc.publisher.university	Indian Institute of Technology Guwahati
dc.relation	Not Available
dc.rights	self
dc.source.university	University
dc.subject.keyword	Mathematics
dc.subject.keyword	Physical Sciences
dc.title	Approximation algorithms for sweep coverage in wireless sensor networks
dc.title.alternative	Not available
dc.type.degree	Ph.D.