| Research Title |
Maximum barrier coverage deployment algorithms in wireless sensor networks |
| Date of Distribution |
13 July 2016 |
| Conference |
| Title of the Conference |
The 13th International Joint Conference on Computer Science and Software Engineering (JCSSE) |
| Organiser |
Department of Computer Science, Khon Kaen University, Thailand |
| Conference Place |
Khon Kaen, Thailand |
| Province/State |
|
| Conference Date |
13 July 2016 |
| To |
15 July 2016 |
| Proceeding Paper |
| Volume |
2016 |
| Issue |
1 |
| Page |
1-5 |
| Editors/edition/publisher |
IEEE |
| Abstract |
Barrier coverage is one of the most important issues in wireless sensor networks (WSNs). In particular, it has been a popular area of WSNs research in recent years. Maximizing the number of barrier paths is one of the key factors in the design of barrier coverage algorithms for WSNs. In this paper, we propose a novel concept to optimize the number of barrier paths by minimizing the total moving distance and the number of moving sensors, which consists of two algorithms. After an initial random placement of sensors, the first approach is to move all sensors close to the optimal location. The second approach is used to determine the barrier paths based on coverage graph and then applied the former to the other sensors which do not belong to any available barrier path. The simulation results show that our two proposed algorithms have improved barrier coverage. The first algorithm is more suitable for a high degree of fault-tolerant coverage while the second approach is to achieve the optimal number of moving sensors and total moving distance. |
| Author |
|
| Peer Review Status |
มีผู้ประเมินอิสระ |
| Level of Conference |
นานาชาติ |
| Type of Proceeding |
Full paper |
| Type of Presentation |
Oral |
| Part of thesis |
true |
| Presentation awarding |
false |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย