• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.1-9
• /
• 2010

In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.22-33
• /
• 2014

As a standard of WMNs, IEEE 802.11s supports two kinds of MAC algorithm: a mandatory EDCA used by IEEE 802.11e and an optional MCCA. While EDCA classifies traffic according to four Access Categories (AC) and offer differentiated service using a classified priority, MCCA can guarantee the specific bandwidth of users with a TDMA-style bandwidth reservation scheme between mesh routers. In case that a flow is VBR traffic of a multimedia application, MCCA has disadvantage that the reserved bandwidth does not be used entirely, though it guarantees required bandwidth of users and fairness using bandwidth reservation with neighbors' node. In this paper, we showed a problem that is wastes the reserved bandwidth when MCCA is enabled and proposed a new scheduling algorithm to prevent waste of bandwidth and to improve network utilization effectively, named Resource Sharing Round Robin (RSRR) scheduling. Finally we showed simulation results that performance of a proposed RSRR is better than the legacy MCCA through NS-2 simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.702-709
• /
• 2003

In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

• Journal of Gastric Cancer
• /
• v.17 no.2
• /
• pp.132-144
• /
• 2017

Purpose: To identify baseline prognostic factors for survival in patients with disease progression, during or after chemotherapy for the treatment of advanced gastric or gastroesophageal junction (GEJ) cancer. Materials and Methods: We pooled data from patients randomized between 2009 and 2012 in 2 phase III, global double-blind studies of ramucirumab for the treatment of advanced gastric or GEJ adenocarcinoma following disease progression on first-line platinum- and/or fluoropyrimidine-containing therapy (REGARD and RAINBOW). Forty-one key baseline clinical and laboratory factors common in both studies were examined. Model building started with covariate screening using univariate Cox models (significance level=0.05). A stepwise multivariable Cox model identified the final prognostic factors (entry+exit significance level=0.01). Cox models were stratified by treatment and geographic region. The process was repeated to identify baseline prognostic quality of life (QoL) parameters. Results: Of 1,020 randomized patients, 953 (93%) patients without any missing covariates were included in the analysis. We identified 12 independent prognostic factors of poor survival: 1) peritoneal metastases; 2) Eastern Cooperative Oncology Group (ECOG) performance score 1; 3) the presence of a primary tumor; 4) time to progression since prior therapy <6 months; 5) poor/unknown tumor differentiation; abnormally low blood levels of 6) albumin, 7) sodium, and/or 8) lymphocytes; and abnormally high blood levels of 9) neutrophils, 10) aspartate aminotransferase (AST), 11) alkaline phosphatase (ALP), and/or 12) lactate dehydrogenase (LDH). Factors were used to devise a 4-tier prognostic index (median overall survival [OS] by risk [months]: high=3.4, moderate=6.4, medium=9.9, and low=14.5; Harrell's C-index=0.66; 95% confidence interval [CI], 0.64-0.68). Addition of QoL to the model identified patient-reported appetite loss as an independent prognostic factor. Conclusions: The identified prognostic factors and the reported prognostic index may help clinical decision-making, patient stratification, and planning of future clinical studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1418-1432
• /
• 2013

This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper. To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold. For comparison, the relay beamforming without artificial noise (RBoA) is also considered. We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected. Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory. Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1182-1194
• /
• 2018

The Dynamic Adaptive Streaming over HTTP(DASH) is envisioned to evolve to meet an increasing demand on providing seamless video streaming services in the near future. The DASH performance heavily depends on the client's adaptive quality selection algorithm that is not included in the standard. The existing conventional algorithms are basically based on a procedural algorithm that is not easy to capture and reflect all variations of dynamic network and traffic conditions in a variety of network environments. To solve this problem, this paper proposes a novel quality selection mechanism based on the Deep Q-Network(DQN) model, the DQN-based DASH Adaptive Bitrate(ABR) mechanism. The proposed mechanism adopts a new reward calculation method based on five major performance metrics to reflect the current conditions of networks and devices in real time. In addition, the size of the consecutive video segment to be downloaded is also considered as a major learning metric to reflect a variety of video encodings. Experimental results show that the proposed mechanism quickly selects a suitable video quality even in high error rate environments, significantly reducing frequency of quality changes compared to the existing algorithm and simultaneously improving average video quality during video playback.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3458-3474
• /
• 2014

The performance of IEEE 802.11e enhanced distributed channel access (EDCA) is influenced by several interactive parameters that make quality of service (QoS) control complex and difficult. In EDCA, the most critical performance influencing parameters are the arbitration interframe space (AIFS) and contention window size (CW) of each access category (AC). The objective of this paper is to provide a scheme for parameter control such that the throughput per station as well as the overall system throughput of the network is maximized and controllable. For this purpose, a simple and accurate analytical model describing the throughput behavior of EDCA networks is presented in this paper. Based on this model, the paper further provides a scheme in which a Pareto optimal system configuration is obtained via an appropriate CW control for a given AIFS value, which is a different approach compared to relevant papers in the literature that deal with CW control only. The simulation results confirm the effectiveness of the proposed method which shows significant performance improvements compared to other existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.620-629
• /
• 2012

This paper proposes packet aggregation scheme for considering energy consumption of mobile devices on guaranteeing quality of voice. To our purpose, we analyze VoIP service on wireless multi-hop channel in terms of delay, packet loss and energy consumption when packet aggregation scheme is applied to VoIP service. Moreover, we induce a cost function with considering of tradeoff relation between quality of voice and energy consumption.