In this thesis, we proposed a simple yet novel multicast scheduling scheme for IEEE 802.16e wireless metropolitan area networks. Specifically, we want to solve the problem that how the base station schedules data messages in a multicast superframe such that mobile stations can receive their required multicast data and the total awake time of mobile stations is minimal. We first prove that this problem is NP-complete, and then propose a greedy k-approximation algorithm, named G-EEMS, whose running time is , where n is the total number of multicast data messages and k is the size of MBS (multicast and broadcast service) zone in a frame. Simulation results show that, in terms of energy throughput, G-EEMS significantly outperforms the existing scheme, called SMBC-D.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0729109-111242 |
| Date | 29 July 2009 |
| Creators | Lin, Chia-ching |
| Contributors | Tsang-Ling Sheu, Zi-Tsan Chou, Chia-Hung Yeh, Ming-Luen Wu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-111242 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0026 seconds