coverage area of wireless sensor network
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 subodh Active In SP Posts: 1 Joined: Feb 2010 09-02-2010, 10:53 PM hi, i am a M.Tech student of IIT Kharagpur and working a project and implimentation on coverage area of wireless sensor network.
 seminarbuddy Active In SP Posts: 261 Joined: Feb 2010 11-02-2010, 07:16 PM In this text, a simple and fast deterministic solution to the area coverage problem in wireless sensor networks has been described. The method is to is determine whether all points in a region are covered by a given set of sensors, where each sensor may have any arbitrary sensing shape. the area coverage problem is translated into the intersection points' coverage problem - simpler and more suitable for evaluating the area coverage problem. Introduction The quality of service (surveillance or monitoring) of a sensor network is directly related to the coverage. Generally, the sensing area is con- sidered as a perfect disk, where each sensor has het- erogeneous or homogeneous sensing capability. Previous works include A solution based on geometric analysis for covering a convex region by using the same radius of disks is pre- sented by Wang et al, a coverage evaluation criterion for covering any shape of monitored region by using any covering radii circle was given by Gal- lais. problem and the solution. a set of sensing areas, A = {a1 , a2 , . . . , an }, and a covered region R is considered. Our task is to determine whether all points in R are covered by A, namely, any point in R is covered at least one area in A. A direct method can be to see all sub-regions divided by the coverage boundaries of all given areas (e.g., a1 , a2 and a3 ), and then check if R is covered or not by all sub-regions. This calculation is very difficult and intensive. Instead, we try to look at how the intersection of any two bound- aries of areas in A and/or the boundary of R is covered. A set of intersection (SI) to be collection of points inside R, which includes: (1) the intersecting points or the two end points of intersecting lines of any two boundaries of areas in A; or (2) the in- tersecting points or the two end points of intersecting lines between any boundary of area in A and the bound- ary of R. Sometimes it is desirable to have higher degrees of coverage. The k-coverage problen is well defined and solved in this text: sciencedirectscience?_ob=ArticleURL&_udi=B6V0F-4R53T43-1&_user=4501256&_coverDate=05%2F16%2F2008&_rdoc=1&_fmt=high&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1203159924&_rerunOrigin=google&_acct=C000059971&_version=1&_urlVersion=0&_userid=4501256&md5=6e487279b19f38d2a6e743873b3af8db visit this link too: www3.interscience.wileyjournal/123236358/abstract?CRETRY=1&SRETRY=0 Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion