Boundary monitoring algorithms for wireless sensor networks of grouping capabilities
In this paper, we develop three heuristic algorithms to construct efficient boundary monitoring for wireless sensor networks of grouping capabilities. We try to find the maximum K groups of sensors for boundary monitoring of sensor field. The mechanism can prolong the system lifetime. This problem i...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we develop three heuristic algorithms to construct efficient boundary monitoring for wireless sensor networks of grouping capabilities. We try to find the maximum K groups of sensors for boundary monitoring of sensor field. The mechanism can prolong the system lifetime. This problem is formulated as 0/1 integer-programming problem. Three heuristic-based algorithms are proposed for solving the optimization problem. The experimental results showed that the proposed efficient boundary monitoring algorithm (EBMA) gets a near optimization in the efficient boundary monitoring for grouping capabilities. |
---|---|
DOI: | 10.1109/WCINS.2010.5544130 |