• 제목/요약/키워드: opportunistic transmission

검색결과 95건 처리시간 0.018초

Cognitive Radio Based Spectrum Sharing: Evaluating Channel Availability via Traffic Pattern Prediction

  • Li, Xiukui;Zekavat, Seyed A. (Reza)
    • Journal of Communications and Networks
    • /
    • 제11권2호
    • /
    • pp.104-114
    • /
    • 2009
  • In this paper, a technique is proposed that enables secondary users to evaluate channel availability in cognitive radio networks. Here, secondary users estimate the utilization of channels via predicting the traffic pattern of primary user, and select a proper channel for radio transmission. The proposed technique reduces the channel switching rate of secondary users (the rate of switching from one channel to another) and the interference on primary users, while maintaining a reasonable call blocking rate of secondary users.

On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels

  • Kim, Yoora
    • 한국통신학회논문지
    • /
    • 제41권8호
    • /
    • pp.924-927
    • /
    • 2016
  • In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

릴레이 기반의 해양 통신 시스템에서 기회주의적 서브채널 할당 기법 (An Opportunistic Subchannel Allocation Scheme in Relay-based Marine Communication Networks)

  • 이덕희;이성로;소재우
    • 한국통신학회논문지
    • /
    • 제39C권7호
    • /
    • pp.546-551
    • /
    • 2014
  • 본 논문에서는 릴레이 기반의 선박 통신 네트워크에서 데이터 전송률을 높이기 위한 기회주의적 서브채널 할당기법을 제안한다. 릴레이 시스템을 기반으로 하는 기존 연구에서, 릴레이는 매 프레임마다 기지국으로부터 수신 받은 데이터를 선박에게 즉시 전달 해준다. 이때, 이중 홉 네트워크(기지국과 릴레이, 릴레이와 선박 간 링크)에서 전송 가능한 최대 수율은 두 링크의 채널 상태에 의해 결정된다. 만약, 채널 상태에 따른 두 링크가 가지는 채널 용량의 차이가 크다면 자원이 낭비되는 상황이 발생하게 된다. 이러한 문제점은 시스템의 성능을 저하시키며, 제한된 무선 자원을 효율적으로 활용하지 못하는 문제점이 발생하게 된다. 따라서 본 논문에서는 두 링크 사이에서 발생하는 자원의 낭비를 최소화 시킴과 동시에 자원을 효율적으로 할당 할 수 있는 기법을 제안한다. 또한 제안하는 기법의 계산 복잡도를 줄이기 위해서 차선의 기법을 제안한다. 시뮬레이션 결과를 통해서, 제안하는 기법은 기존 연구 대비 계산의 복잡도는 증가하지만 시스템의 데이터 전송률 성능이 최대 14.0% 향상됨을 확인 할 수 있다.

Reduction of the Retransmission Delay for Heterogeneous Devices in Dynamic Opportunistic Device-to-device Network

  • Chen, Sixuan;Zou, Weixia;Liu, Xuefeng;Zhao, Yang;Zhou, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4662-4677
    • /
    • 2018
  • The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

A Simple Cooperative Transmission Protocol for Energy-Efficient Broadcasting Over Multi-Hop Wireless Networks

  • Kailas, Aravind;Thanayankizil, Lakshmi;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • 제10권2호
    • /
    • pp.213-220
    • /
    • 2008
  • This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

  • Jiang, Lei;Feng, Jing;Shen, Ye;Xiong, Xinli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권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.

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2144-2165
    • /
    • 2016
  • In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

양방향 중계 네트워크에서 다중 중계기를 이용한 협력 중계 기법 (Cooperative Relaying Scheme Using Multiple Relays in Two-Way Relay Network)

  • 박지환;공형윤
    • 한국전자파학회논문지
    • /
    • 제21권7호
    • /
    • pp.815-822
    • /
    • 2010
  • 중계기 선택 기반 양방향 중계 기법은 중계기 수에 따른 선택 다이버시티 이득을 얻을 수 있으며, 기존의 단방향 중계 기법보다 높은 데이터 율을 가진다. 그러나 기존의 중계기 선택 기반 양방향 중계 기법에서는 사용자 간의 직접 통신 링크를 고려하지 않아 협력 통신의 장점인 결합 이득을 얻을 수 없었다. 본 논문에서는 다수의 중계기가 존재하는 네트워크에서 선택 다이버시티 이득과 결합 이득 모두를 얻을 수 있는 기회주의적 협력양방향 중계 기법과 증분형 협력 양방향 중계 기법을 제안한다. 제안하는 두 기법이 중계기 수에 따른 선택 다이버시티 이득과 결합 이득을 모두 얻음으로써 기존의 양방향 중계 기법보다 우수한 성능을 가짐을 시뮬레이션 결과를 통해 증명한다.

Node Incentive Mechanism in Selfish Opportunistic Network

  • WANG, Hao-tian;Chen, Zhi-gang;WU, Jia;WANG, Lei-lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1481-1501
    • /
    • 2019
  • In opportunistic network, the behavior of a node is autonomous and has social attributes such as selfishness.If a node wants to forward information to another node, it is bound to be limited by the node's own resources such as cache, power, and energy.Therefore, in the process of communication, some nodes do not help to forward information of other nodes because of their selfish behavior. This will lead to the inability to complete cooperation, greatly reduce the success rate of message transmission, increase network delay, and affect the overall network performance. This article proposes a hybrid incentive mechanism (Mim) based on the Reputation mechanism and the Credit mechanism.The selfishness model, energy model (The energy in the article exists in the form of electricity) and transaction model constitute our Mim mechanism. The Mim classifies the selfishness of nodes and constantly pay attention to changes in node energy, and manage the wealth of both sides of the node by introducing the Central Money Management Center. By calculating the selfishness of the node, the currency trading model is used to differentiate pricing of the node's services. Simulation results show that by using the Mim, the information delivery rate in the network and the fairness of node transactions are improved. At the same time, it also greatly increases the average life of the network.

무선 에너지 하비스팅 인지 무선 네트워크에서 최적화 제어 정책을 이용한 선택적 스펙트럼 접근 (Opportunistic Spectrum Access Using Optimal Control Policy in RF Energy Harvesting Cognitive Radio Networks)

  • 정준희;황유민;차경현;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제10권3호
    • /
    • pp.6-10
    • /
    • 2015
  • 무선 에너지 하비스팅 기술은 주로 무선 통신 네트워크에서 전력소모가 적은 무선 통신 장치들을 동작시키기 위해 주변 환경으로부터 RF 신호를 수집, 에너지로 변환하는 기술로 최근 각광을 받고 있다. 이와 같은 기술과 기존의 인지무선(Cognitive Radio) 네트워크 모델을 기반으로, 본 논문에서는 적은 파워 소비를 하는 2차 유저(Secondary User)가 근처에서 동작 중인 1차 유저(Primary User)의 특정 거리 안에 존재할 때 1차 유저가 전송한 통신 신호로부터 무선에너지 하비스팅을 하고 특정 거리 밖에 존재할 때 우선 사용자에게 할당되어 있는 허가대역을 주기적으로 센싱, 선택적으로 접근하는 무선에너지 하비스팅 인지무선 네트워크 모델을 제시한다. 이 때 1차 유저와 2차 유저는 Poisson pont process로 분포되어있고 통신을 하고 있는 수신자들과 일정한 거리로 떨어져있다. 위와 같은 네트워크 모델에서 주어진 여러 가지 조건하에 2차 유저 네트워크 처리량을 최대화할 수 있는 최적의 프레임 주기, 전송파워, 2차 유저 밀도 제안하고 앞으로의 연구방향을 제시한다.