完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Liang, Jia-Ming | en_US |
dc.contributor.author | Wang, You-Chiun | en_US |
dc.contributor.author | Chen, Jen-Jee | en_US |
dc.contributor.author | Liu, Jui-Hsiang | en_US |
dc.contributor.author | Tseng, Yu-Chee | en_US |
dc.date.accessioned | 2014-12-08T15:20:34Z | - |
dc.date.available | 2014-12-08T15:20:34Z | - |
dc.date.issued | 2011-11-10 | en_US |
dc.identifier.issn | 1389-1286 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/j.comnet.2011.04.021 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/14656 | - |
dc.description.abstract | The IEEE 802.16j standard is defined to enhance WiMAX networks with relay capacity. Under the transparent mode, existing studies only target improving network throughput by increasing the transmission rates of mobile stations (MSs) and maximizing concurrent transmissions. However, using a higher transmission rate or allowing more concurrent transmissions could harm MSs in terms of their energy consumption, especially when they are battery-powered. In this paper, we consider the energy-conserved resource allocation problem in the uplink direction of an IEEE 802.16j network under the transparent mode. This problem asks how to arrange the frame usage with satisfying MSs' demands as the constraint and minimizing their total energy consumption as the objective. We prove this problem to be NP-complete and develop two energy-efficient heuristics, called demand-first allocation (DFA) and energy-first allocation (EFA) schemes. These heuristics employ a gradient-like search method to approximate the optimal solution. Specifically, DFA tries to satisfy MSs' demands first by using as less frame space as possible. Then, with the remaining frame space. DFA tries to save MSs' energy by lowering their transmission rates or adjusting their transmission paths. Viewed from a different perspective. EFA first allocates the frame space to MSs to consume the least energy. Since the total allocation may exceed the frame space. EFA then exploits spatial reuse and rate adjustment to pack all demands into one frame. simulation results show that our heuristics can approximate the ideal performance bounds and save up to 90% of MSs' energy as compared to existing results. (C) 2011 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Broadband wireless network | en_US |
dc.subject | Energy conservation | en_US |
dc.subject | IEEE 802.16j | en_US |
dc.subject | Resource management | en_US |
dc.subject | Transparent relay | en_US |
dc.subject | WiMAX | en_US |
dc.title | Energy-efficient uplink resource allocation for IEEE 802.16j transparent-relay networks | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.comnet.2011.04.021 | en_US |
dc.identifier.journal | COMPUTER NETWORKS | en_US |
dc.citation.volume | 55 | en_US |
dc.citation.issue | 16 | en_US |
dc.citation.spage | 3705 | en_US |
dc.citation.epage | 3720 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000296114000008 | - |
dc.citation.woscount | 6 | - |
顯示於類別: | 期刊論文 |