學術出版;;Publications
Permanent URI for this communityhdl:11536/1
收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.
Browse
5 results
🏛️國立陽明交通大學機構典藏
Search Results
Item type:Item, Simple and Regular Mini-Slot Scheduling for IEEE 802.16d Grid-based Mesh Networks(2010) ;Liang, Jia-Ming ;Chen, Jen-Jee ;Wu, Ho-Cheng ;Tseng, Yu-Chee資訊工程學系This work addresses the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). A practical mini-slot scheduling needs to take into account following issues: the transmission overhead, the scheduling complexity, and the signaling overhead to notify the scheduling results to subscriber stations. We focus in a grid-based WMN, which is the most recommended topology due to its high capacity and connectivity. In this paper, we propose scheduling schemes featured by low complexity and low signaling overhead. The proposed schemes help find periodical and regular schedules, which can balance between transmission overhead and pipeline efficiency. They can achieve near-optimal transmission latencies. Simulation results show that our schemes outperform other schemes, especially when the network size is larger.Item type:Item, Managing Power Saving Classes in IEEE 802.16 Wireless MANs: A Fold-and-Demultiplex Method(2011-09-01) ;Tseng, Yu-Chee ;Chen, Jen-Jee ;Yang, Yen-Chih ;資訊工程學系Department of Computer ScienceIn IEEE 802.16, power management at the Mobile Subscriber Station (MSS) side is always an important issue. The standard defines three types of power saving classes (PSCs). A PSC can bind one or multiple traffic flows. However, given multiple flows in an MSS, the standard does not define how to form PSCs, how to organize the cooperation of multiple PSCs to obtain better energy efficiency, and how to guarantee QoS of these flows. Given a set of flows and their QoS parameters, the objective of this paper is to define multiple PSCs and their listen-and-sleep-related parameters and packet-scheduling policy such that the unavailability intervals of the MSS can be maximized and the QoS of each flow can be guaranteed. To achieve this, we propose a novel fold-and-demultiplex method for an IEEE 802.16 network with PSCs of types I and II together with an earliest-next-bandwidth-first packet scheduler. Given a set of traffic flows in an MSS, the fold-and-demultiplex method first gives each flow a tentative PSC satisfying its bandwidth requirement. Then we fold them together into one long series so as to calculate the total bandwidth requirement. Finally, we demultiplex the series into multiple PSCs, each supporting one or multiple flows. It ends up with high energy efficiency of MSSs while meets flows' bandwidth requirements. Furthermore, our packet scheduler ensures that real-time flows' delay constraints can be met. To the best of our knowledge, this is the first result offering bounded packet delays under MSS's sleep-and-listen behaviors.Item type:Item, On Tile-and-Energy Allocation in OFDMA Broadband Wireless Networks(2011-12-01) ;Liang, Jia-Ming ;Chen, Jen-Jee ;Liu, Cheng-Wen ;Tseng, Yu-CheeLin, Bao-Shuh PaulThe Orthogonal Frequency Division Multiple Access (OFDMA) technique has been widely applied in broadband wireless networks, such as IEEE 802.16 (WiMAX) and 3GPP Long Term Evolution (LTE). Existing studies have targeted at improving network throughput by increasing the transmission rates of mobile stations (MSs). Nevertheless, this is at the cost of higher energy consumption of MSs. In the letter, we consider the tile-and-energy joint allocation problem for uplink transmissions in an OFDMA wireless network. We formulate this problem as a mixed integer programming, where the objective is to minimize MSs' energy consumption subject to satisfying their traffic demands. We show this to be NP-hard and develop a heuristic taking advantage of the water-filling technique. Simulation results show that the performance of our heuristic is close to the optimum, especially when the network is under non-saturated condition.Item type:Item, Per-flow sleep scheduling for power management in IEEE 802.16 wireless networks(2011-11-10) ;Chen, Jen-Jee ;Wu, Shih-Lin ;Wang, Shiou-Wen ;Tseng, Yu-Chee資訊工程學系Power management is a critical issue in IEEE 802.16 wireless networks. In the standard, a power saving class (PSC) of type II is defined to support real-time traffic flows. It allows a flow to switch periodically between active and sleep states to save energy. However, previous studies either consider adjusting start frames of PSCs by assuming that the PSCs are already given or assume one single PSC to accommodate all flows in a mobile station, thus leading to higher energy cost. This paper proposes two "per-flow" sleep scheduling schemes, which assign one PSC to each real-time flow according to its QoS parameters. This leads to less energy consumption, more efficient use of bandwidth, and more compact listening windows. We also prove that deciding whether a given scheduling problem is solvable can be reduced to a maximum matching problem, which is computationally tractable. Simulation results show that such a per-flow scheduling does perform much closer to the active ratio lower bound and achieve higher resource utilization than previous schemes. (C) 2011 Elsevier B.V. All rights reserved.Item type:Item, A Cross-Layer Framework for Overhead Reduction, Traffic Scheduling, and Burst Allocation in IEEE 802.16 OFDMA Networks(2011-05-01) ;Liang, Jia-Ming ;Chen, Jen-Jee ;Wang, You-Chiun ;Tseng, Yu-Chee資訊工程學系IEEE 802.16 orthogonal frequency-division multiple access (OFDMA) downlink subframes have a special 2-D channel-time structure. Allocation resources from such a 2-D structure incur extra control overheads that hurt network performance. Existing solutions try to improve network performance by designing either the scheduler in the medium access control layer or the burst allocator in the physical layer, but the efficiency of overhead reduction is limited. In this paper, we point out the necessity of "codesigning" both the scheduler and the burst allocator to efficiently reduce overheads and improve network performance. Under the partial-usage-of-subcarriers model, we propose a cross-layer framework that covers overhead reduction, real-time and non-real-time traffic scheduling, and burst allocation. The framework includes a two-tier priority-based scheduler and a bucket-based burst allocator, which is more complete and efficient than prior studies. Both the scheduler and the burst allocator are tightly coupled together to solve the problem of arranging resources to data traffic. Given available space and bucket design from the burst allocator, the scheduler can well utilize the frame resource, reduce real-time traffic delays, and maintain fairness. On the other hand, with priority knowledge and resource assignment from the scheduler, the burst allocator can efficiently arrange downlink bursts to satisfy traffic requirements with low complexity. Through analysis, the cross-layer framework is validated to give an upper bound to overheads and achieve high network performance. Extensive simulation results verify that the cross-layer framework significantly increases network throughput, maintains long-term fairness, alleviates real-time traffic delays, and enhances frame utilization.