Name
Abstract | ||
|---|---|---|
Nowadays, directional sensor networks (DSNs) have drawn a lot of attentions, which are made up of a large number of tiny directional sensors that are different from traditional omnidirectional sensors. Directional sensor is characterized by working direction and angle of view (AOV). In this paper we study area coverage of DSNs. We exploit Voronoi theory to divide sensors into polygons, by optimizing the local coverage in each polygon to achieve the overall coverage. We take full use of Voronoi vertexes and edges to judge whether a sensor gets full coverage inside in current polygon, if not, then the sensor calls Move Inside Cell Algorithm (MIC) and Rotate Working Direction Algorithm (RWD) algorithms we have designed. Compared to the similar methods to solve this question our algorithms are relatively simple and moving distance is shorter. Simulation results reveal that our algorithms outperform some existing methods in term of the area coverage. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-52730-7_25 | Lecture Notes of the Institute for Computer Sciences, Social Informatics, and Telecommunications Engineering |
Keywords | Field | DocType |
Coverage,Voronoi,DSNs,Sensor network | Computer vision,Omnidirectional antenna,Polygon,Vertex (geometry),Pattern recognition,Computer science,Exploit,Voronoi diagram,Artificial intelligence,Angle of view,Wireless sensor network,Area coverage | Conference |
Volume | ISSN | Citations |
183 | 1867-8211 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shan You | 1 | 1 | 0.71 |
| Guanglin Zhang | 2 | 164 | 24.00 |
| Demin Li | 3 | 28 | 10.08 |