Compact genetic algorithm for active interval scheduling in hierarchical sensor networks
2005
This paper introduces a novel scheduling problem called the active interval scheduling problem in hierarchical wireless sensor networks for long-term periodical monitoring applications. To improve the report sensitivity of the hierarchical wireless sensor networks, an efficient scheduling algorithm is desired. In this paper, we propose a compact genetic algorithm (CGA) to optimize the solution quality for sensor network maintenance. The experimental result shows that the proposed CGA brings better solutions in acceptable calculation time.
Keywords:
- Mathematical optimization
- Computer science
- Brooks–Iyengar algorithm
- Key distribution in wireless sensor networks
- Real-time computing
- Two-level scheduling
- Fair-share scheduling
- Rate-monotonic scheduling
- Dynamic priority scheduling
- Distributed computing
- Fixed-priority pre-emptive scheduling
- Round-robin scheduling
- Wireless sensor network
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
4
Citations
NaN
KQI