| Summary: | Based on different objectives, a variety of mathematical models for the wireless mesh network (WMNs) exist. Among them, the link scheduling model for WMNs aims at finding a data transmission schedule based on network links so that some objectives on packet transmission areoptimized under certain transmission constraints. In this paper, a new WMN link scheduling model with additional in formation of node locations and gateway designs is orchestrated. An approximate dynamic programming algorithmis utilized for scheduling the new model. Experiment results show that, in addition to maintaining many wireless network characteristics, the proposed scheduling algorithm effectively simulates the result of dynamic programming, and has performances superior to genetic algorithm.
|
|---|