Path Construction for Minimum-energy Broadcast in WiMAX relay networks

• Main Authors: Lin , Yan-Hao, 林彥豪
• Other Authors: Lee , Jeng-Farn
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/73228227024113917399

碩士 === 國立中正大學 === 資訊工程研究所 === 99 === In wireless network, resource allocation is always a critical issue. Because of the shared media in the wireless network, it is important that finding an efficient algorithm to allocate resource. In this paper, we study the downlink broadcasting resource allocation problem in IEEE 602.16j WiMAX relay network. The objective is to serve all users with the minimum resource allocation. It is not easy to solve this kind of problem because different allocation leads to produce different routing path and different topology. However, the existing approaches’ performance are not good enough and don’t concern resource recycling carefully. Base on the reasons mentioned above, we propose a heuristic algorithm called Enhancement Power Decreasing Protocol (EPDP) and a new recycling method called SWEEP to solve the problem. By simulating, we show that our algorithm outperforms the existing approach and is very close to the optimal solution.