• Journal of information and communication convergence engineering
• /
• 제12권3호
• /
• pp.135-139
• /
• 2014

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.99-105
• /
• 2010

통신 시스템의 성능을 유도하기위하여 가장 많이 가정하는 잡음의 모델은 부가성 백색 잡음이다. 그러나 실제 통신 시스템을 사용하는 환경에서는 임펄시브 잡음이 더욱 현실적인 모델이기 때문에 최근에는 임펄시브 잡음 하에서의 통신 시스템의 성능을 분석하는 연구가 증가하고 있다. 따라서 본 논문에서는 최근에 집중적인 연구 주제가 되고 있는 협동다이버시티 시스템을 대상으로 하여 임펄시브 잡음하에서 시스템의 성능을 유도하였다. 특히 릴레이 방식으로 복조후 전송방식과 증폭후 전송방식을 사용하였을 때의 성능을 해석적으로 유도하고 비교하였다. 연구결과 레일레이 페이딩을 받는 무선 채널에서, 임펄시브 잡음의 평균 임펄스의 수가 감소할수록 잡음의 임펄시브 성분이 증가하고, 그 결과 신호 대 잡음비(SNR)가 큰 영역에서 시스템의 성능은 열화되었다. 그리고 동일한 조건에서 복조후 전송 릴레이를 채택한 협동 다이버시티 시스템이 증폭후 전송방식을 채택하였을 때보다 우수한 성능을 나타내었다.

• Journal of information and communication convergence engineering
• /
• 제8권1호
• /
• pp.40-44
• /
• 2010

opportunistic spectrum access (OSA) allows unlicensed users to share licensed spectrum in space and time with no or little interference to primary users, with bring new research challenges in MAC design. We propose a cognitive MAC protocol using statistical channel information and selecting appropriate idle channel for transmission. The protocol based on the CSMA/CA, exploits statistics of spectrum usage for decision making on channel access. Idle channel availability, spectrum hole sufficiency and available channel condition will be included in algorithm statistical information. The model include the control channel and data channel, the transmitter negotiates with receiver on transmission parameters through control channel, statistical decision results (successful rate of transmission) from exchanged transmission parameters of control channel should pass the threshold and decide the data transmission with spectrum hole on data channel. A dynamical sensing range as a important parameter introduced to maintain the our protocol performance. The proposed protocol's simulation will show that proposed protocol does improve the throughput performance via traditional opportunistic spectrum access MAC protocol.

• ETRI Journal
• /
• 제29권2호
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• 한국인터넷방송통신학회논문지
• /
• 제9권6호
• /
• pp.1-8
• /
• 2009

최근에 많은 연구가 진행되고 있는 무선 ad-hoc 네트워크는 전력 제한 시스템이기 때문에 전력 절약은 ad-hoc 네트워크의 매우 중요한 연구 주제 중 하나이다. 그러므로 본 논문에서는 무선 ad-hoc 네트워크에 기회전송 릴레이(Opportunistic transmission relay) 시스템을 적용하였을 때, 전체 시스템의 오수신율이 최소가 되도록 제한된 전력을 각 송신 노드에 최적으로 할당하는 방법에 관하여 제안하고 각 값들을 수식적으로 유도하였다. 유도한 결과는 각 노드들에 통일한 전력을 할당할 때보다 시스템의 오수신 특성이 항상 우수하였다.

• 한국통신학회논문지
• /
• 제35권7A호
• /
• pp.731-742
• /
• 2010

We propose an incremental relaying protocol in conjunction with opportunistic communication for differential modulation with an aim to make efficient use of the degrees of freedom of the channels by exploiting a imited feedback signal from the destination. In particular, whenever the direct link from the source to the destination is not favorable to decoding, the destination will request the help from the opportunistic relay (if any). The performance of the proposed system is derived in terms of average bit error probability and achievable spectral efficiency. The analytic results show that the system assisted by the opportunistic relaying can achieve full diversity at low SNR regime and exhibits a 30㏈ gain relative to direct transmission, assuming single-antenna terminals. We also determine the effect of power allocation on the bit error probability BEP) performance of our relaying scheme. We conclude with a discussion on the relationship between the given thresholds and channel resource savings. Monte-Carlo simulations are performed to verify the analysis.

• 산업경영시스템학회지
• /
• 제35권4호
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• 한국인터넷방송통신학회논문지
• /
• 제13권6호
• /
• pp.71-78
• /
• 2013

최근 기회전송 증가 릴레이 시스템은 무선 페이딩 채널에서 시스템 성능을 효과적으로 개선하기 위하여 많은 연구가 되고 있다. 그러나 대부분의 기회전송 증가 릴레이 시스템 연구는 소스-목적지 사이에 직접 경로가 존재하는 시스템을 대상으로 성능을 해석하고 있고 직접 경로가 없이 소스-릴레이-목적지의 간접 경로만 존재하는 시스템에 대한 해석은 매우 적다. 따라서 본 논문에서는 직접 경로가 존재하지 않는 기회전송 증가 릴레이 시스템에서 먼저 부분적인 채널 정보만으로 릴레이를 선택하여 전송하고, 만약 통신이 실패하면 전체 채널정보를 이용하여 최적의 증가 릴레이를 사용하여 정보를 전송하는 프로토콜을 제안하였다. 그리고 제안한 전송 프로토콜을 적용한 시스템의 성능을 해석적으로 유도하고 그 결과를 시뮬레이션 결과와 비교하여 유도결과를 입증하였다. 본 논문의 결과는 소스-목적지간에 직접 경로가 존재하지 않는 이동통신 시스템과 양방향 TV 방송 시스템에 기회전송 증가 릴레이 시스템을 도입하였을 경우 시스템 설계 및 성능 예측에 직접 활용할 수 있을 것으로 생각된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.872-885
• /
• 2015

The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.5805-5825
• /
• 2019

Smartphones are important platforms because of their sophisticated computation, communication, and sensing capabilities, which enable a variety of applications in the Internet of Things (IoT) systems. Moreover, advancements in hardware have enabled sensors on smartphones such as environmental and chemical sensors that make sensor data collection readily accessible for a wide range of applications. However, dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users that vary throughout the day, which greatly affects the efficacy of sensor data collection. Therefore, it is necessary to consider phone users mobility patterns to design data collection schedules that can reduce the loss of sensor data. In this paper, we propose a mobility-based weighted adaptive opportunistic scheduling framework that can adaptively adjust to the dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users and provide prioritized scheduling based on various application scenarios, such as velocity, region of interest, and sensor type. The performance of the proposed framework is compared with other scheduling frameworks in various heterogeneous smartphone user mobility scenarios. Simulation results show that the proposed scheduling improves the transmission rate by 8 percent and can also improve the collection of higher-priority sensor data compared with other scheduling approaches.