Run to potential: sweep coverage in wireless sensor networks

Simple item page
dc.contributor.authorXi, Min
dc.contributor.authorWu, Kui
dc.contributor.authorQi, Yong
dc.contributor.authorZhao, Jizhong
dc.contributor.authorLui, Yunhao
dc.contributor.authorLi, Mo
dc.date.accessioned2010-04-16T16:35:19Z
dc.date.available2010-04-16T16:35:19Z
dc.date.copyright2009en
dc.date.issued2009-09
dc.description©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en
dc.description.abstractWireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how well an interested area is monitored (covered) by sensors. The traditional way of evaluating sensor coverage requires that every point in the field should be monitored and the sensor network should be connected to transmit messages to a processing center (sink). Such a requirement is too strong to be financially practical in many scenarios. In this study, we address another type of coverage problem, sweep coverage, when we utilize mobile nodes as supplementary in a sparse and probably disconnected sensor network. Different from previous coverage problem, we focus on retrieving data from dynamic Points of Interest (POIs), where a sensor network does not necessarily have fixed data rendezvous points as POIs. Instead, any sensor node within the network could become a POI. We first analyze the relationship among information access delay, information access probability, and the number of required mobile nodes. We then design a distributed algorithm based on a virtual 3D map of local gradient information to guide the movement of mobile nodes to achieve sweep coverage on dynamic POIs. Using the analytical results as the guideline for setting the system parameters, we examine the performance of our algorithm compared with existing approaches.en
dc.identifier.citationMin Xi; Kui Wu; Yong Qi; Jizhong Zhao; Yunhao Liu; Mo Li; , "Run to Potential: Sweep Coverage in Wireless Sensor Networks," Parallel Processing, 2009. ICPP '09. International Conference on , vol., no., pp.50-57, 22-25 Sept. 2009en
dc.identifier.issn0190-3918
dc.identifier.urihttp://hdl.handle.net/1828/2615
dc.language.isoenen
dc.publisherIEEEen
dc.subject.departmentDepartment of Computer Science
dc.titleRun to potential: sweep coverage in wireless sensor networksen
dc.typeArticleen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Run to potential Sweep coverage in wireless sensor networks.pdf
Size:
439.69 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.83 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.