| Abstract(in English) | 第3页 |
| Abstract(in Chinese) | 第4-6页 |
| Chapter 1 Introduction | 第6-15页 |
| 1.1 The background of the spectrum allocation problem | 第6-11页 |
| 1.2 Related work of the spectrum allocation problem | 第11-12页 |
| 1.3 Our results of the spectrum allocation problem | 第12-14页 |
| 1.4 Organization of thesis | 第14-15页 |
| Chapter 2 Models and related definitions | 第15-19页 |
| 2.1 Network models | 第15页 |
| 2.2 Definitions and Propositions | 第15-19页 |
| Chapter 3 Distributed constant approximation algorithm for the spectrum allocation of serving any random k locations in unit ball graph | 第19-28页 |
| 3.1 Description of Algorithm 1 | 第19-20页 |
| 3.2 Analysis of Algorithm 1 | 第20-25页 |
| 3.3 Evaluation | 第25-28页 |
| Chapter 4 The distributed(1+ε)-approximation Algorithm for spectrum allocation of serving any random two locations | 第28-37页 |
| 4.1 Description of Algorithm 2 | 第29-30页 |
| 4.2 Analysis of Algorithm 2 | 第30-33页 |
| 4.3 Case study | 第33-37页 |
| Bibliography | 第37-40页 |
| Finished Papers | 第40-41页 |
| Acknowledgements | 第41页 |
