• ETRI Journal
• /
• v.29 no.1
• /
• pp.120-123
• /
• 2007

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real-time (RT) and non-realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross-layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.50-55
• /
• 2011

Spectrum leasing for cognitive radio (CR) networks is an effective way to improve the spectrum utilization. This paper presents an opportunistic relaying based spectrum leasing for CR networks where the primary users lease their frequency band to the cognitive users. The cognitive users act as relays for the primary users to improve the channel capacity, and this improved capacity is used for the transmission of secondary users' data. We show that the cognitive users can use a significant portion of the communication resource of primary networks while maintaining a fixed target data rate for the primary users. Moreover, the primary network is also benefited by the cooperating cognitive users in terms of outage probability. Information theoretic analysis and simulation results are presented to evaluate the performances of both primary and cognitive networks.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.287-290
• /
• 2011

We consider a two-hop multiple-relay network implemented with opportunistic decode-and-forward cooperative strategy, where the first hop and second hop links experience different fading (Rayleigh and Rician). We derive the exact expressions of end-to-end outage probability and analyze the approximate results in high signal-to-noise ratio region. The analysis shows that the same diversity order can be achieved even in different mixed fading environments. Simulation results are provided to verify our analysis.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.146-147
• /
• 2010

본 논문은 차세대 양방향 이동통신의 상향링크 전송용량 증대를 위한 다중 단말 기회 중계(opportunistic relaying) 기법을 제안한다. 제안된 기법은 단일 안테나(single antenna) 기지국과 다수의 단일 안테나 단말이 있는 협력 네트워크(cooperative network)에서 시간블록 단위로 라운드 로빈(Round-Robin)과 동일한 공정성(fairness)을 보장하면서 높은 불능확률 성능 이득을 제공한다. 컴퓨터 모의 실험결과를 통해 제안된 기법의 성능 이득 크기를 보이며, 기존의 중계 기법보다 높은 다이버시티 차수를 가짐을 확인한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.371-372
• /
• 2012

본 논문은 협력 네트워크(cooperative network)에서 무선 채널의 보안성(security) 강화를 위한 자가 전파방해(self-jamming) 기반 기회적 중계(opportunistic relaying) 기법을 제안한다. 단일 송신 단말 (source)과 단일 수신 단말(destination)이 다중 중계 단말(relay)의 협력을 통해 송수신하는 이중 홉(dualhop) 네트워크에서 도청 단말(eavesdropper)에 의한 정보 절취를 최소화하기 위해 자가 전파방해 기법과 기회적 중계 기법을 결합한다. 이를 통해 무선 채널의 방송(broadcasting) 특성에 기인한 도청 용이성을 저하 시키고, 다중 중계 단말의 송신 전력을 최소화하여 협력 네트워크의 수명(lifetime)을 연장한다. 컴퓨터 모의실험 결과를 통해 제안된 기법이 다중 중계기가 있는 이중 홉 협력 네트워크에서 보안 전송률(secrecy rate)의 불능확률(outage probability) 성능을 제고함을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.265-267
• /
• 2012

This paper analyzes network selection issues of secondary users (SUs) in Cooperative Cognitive Radio Networks (CRNs) by utilizing Queuing Model. Coordinating with Handover Cost-Based Network selection, this paper also addresses an opportunity for the secondary users (SUs) to enhance QoS as well as economics efficiency. In this paper, network selection of SUs is the optimal association between Overall System Time Minimization Problem evaluation of Secondary Connection (SC) and Handover Cost-Based Network selection. This will be illustrated by simulation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2936-2951
• /
• 2016

An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.21-26
• /
• 2012

Intra-session network coding has been proposed to improve throughput by simplifying scheduling of multi-hop wireless network and efficiency of packet transmission. Multi-rate transmission has been used in multihop wireless networks. An opportunistic routing with multirate shows throughput improvement compared with single rate. In this paper, we propose a method of throughput improvement in multi-hop wireless network by using multi-rate and intra-session network coding. We suggest a method to select an local optimal transmission rate at each node. The maximum throughput is evaluated by using linear programming (LP). To solve the LP, we use MATLAB and lp_solve IDE program. The performance evaluation results show that end-to-end throughput is improved by using multirate and intra-session network coding can achieve better throughput than opportunistic routing.

• Journal of Internet of Things and Convergence
• /
• v.6 no.4
• /
• pp.89-92
• /
• 2020

According to the various IoT(Internet of Things) services, there have been lots of task offloading researches for IoT devices. Since there are service response delay and core network load issues in conventional cloud computing based offloadings, fog computing based offloading has been focused whose location is close to the IoT devices. However, even in the fog computing architecture, the load can be concentrated on the for computing node when the number of requests increase. To solve this problem, the opportunistic fog computing concept which offloads task to available computing resources such as cars and drones is introduced. In previous fog and opportunistic fog node researches, the offloading is performed immediately whenever the service request occurs. This means that the service requests can be offloaded to the opportunistic fog nodes only while they are available. However, if the service response delay requirement is satisfied, there is no need to offload the request immediately. In addition, the load can be distributed by making the best use of the opportunistic fog nodes. Therefore, this paper proposes a delayed offloading scheme to satisfy the response delay requirements and offload the request to the opportunistic fog nodes as efficiently as possible.