Abstract
Sleep scheduling in a wireless sensor network is the process of deciding which nodes are eligible to sleep (enter power-saving mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem require sensor's location information, which may be impractical considering costly locating overheads. This paper proposes range-based sleep scheduling (RBSS) protocol which needs sensor-to-sensor distance but no location information. RBSS attempts to approach an optimal sensor selection pattern that demands the fewest working (awake) sensors. Simulation results indicate that RBSS is comparable to its location-based counterpart in terms of coverage quality and the reduction of working sensors.
Original language | English |
---|---|
Pages (from-to) | 411-423 |
Number of pages | 13 |
Journal | Wireless Personal Communications |
Volume | 48 |
Issue number | 3 |
DOIs | |
State | Published - Feb 2009 |
Keywords
- Energy efficiency
- Network coverage
- Network density
- Sleep scheduling
- Wireless sensor networks