• Title/Summary/Keyword: Opportunistic Communication

Search Result 127, Processing Time 0.024 seconds

Double Opportunistic Transmit Cooperative Relaying System with GSC in Rayleigh Fading Channels

  • Kim, Nam-Soo;Lee, Ye-Hoon
    • Journal of electromagnetic engineering and science
    • /
    • v.10 no.4
    • /
    • pp.270-275
    • /
    • 2010
  • In a conventional opportunistic transmit (COT) cooperative relaying system, only the relays that receive signal-to-noise ratio (SNR) from the source and that exceed the threshold transmit to the destination. The COT system, however, only considers the SNR of the source-relay (S-R) path regardless that the SNR of the relay-destination (R-D) path is the opportunistic transmission condition. For that reason, it is not guaranteed that all the transmitted signals from relays exceed the threshold at the destination. Therefore we propose a double opportunistic transmit (DOT) cooperative relaying system - when both of the received SNR from a source and from a destination exceed the threshold, the relay transmits to the destination. It is shown that the proposed DOT system reduces power consumption by 6.9, 20.9, 32.4, and 41.4 % for K =3, 5, 7, and 9, respectively under the given condition of $P_{out}=1{\times}10^{-3}$ and $\overline{\gamma}_{SR}/\Gamma_{SR}$=30 dB, compared to the COT system. We noticed that the performance of the DOT system is superior to that of the COT system for the identical number of active transmit relays under the same condition of the normalized average SNR of $\overline{\gamma}_{RD}/\Gamma_{RD}$.

Prediction-Based Routing Methods in Opportunistic Networks

  • Zhang, Sanfeng;Huang, Di;Li, Yin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3851-3866
    • /
    • 2015
  • The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

FARS: A Fairness-aware Routing Strategy for Mobile Opportunistic Networks

  • Ma, Huahong;Wu, Honghai;Zheng, Guoqiang;Ji, Baofeng;Li, Jishun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.1992-2008
    • /
    • 2018
  • Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

Performance Analysis of a Double Opportunistic Cooperative Diversity System with Uniform Power Relay Selection (균일전력 릴레이 선택방식을 적용한 이중 기회전송 협동 다이버시티 시스템의 성능분석)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.15-21
    • /
    • 2011
  • Cooperative diversity system can be applied to an ad-hoc network for reduction of the power consumption, for expansion of the communication range, and for improving the system performance. In a selection relay cooperative diversity system which selects the maximal SNR(Signal-to-noise ratio) relay for transmitting the source information, the selected strong relay transmits continuously under slow fading channel, consequently it reduces the network lifetime. To overcome this defect, recently the uniform power relay selection has been studied to expand the network life time. We apply the uniform power relay selection to a DOT(Double opportunistic transmit) cooperative system that select the transmit relays, of which the SNR of the transmit relays exceed both of the source-relay and the relay-destination threshold. And the performance of the system is analytically derived. The performance comparisons are made among SC(Selection combining), MRC(Maximal ratio combining), and uniform power relay selection of the cooperative diversity system. We noticed that the performance of the uniform power relay selection is inferior to that of others. It is interpreted that the uniform transmit opportunity to the selected relays for extension of the network lifetime degrades the performance.

Protocol Design for Opportunistic Direct M2M Communication in Wearable Computing Environment (웨어러블 단말과 이웃 단말 간 기회기반 직접 사물통신 프로토콜 설계)

  • Oh, Young-Ho;Lee, Jae-Shin;Kang, Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.2
    • /
    • pp.151-163
    • /
    • 2014
  • The recent wearable device's applications concentrates on providing diverse services such as location based service, context aware service to the users. These various services are implemented by the interactions between the wearable device and the user. In the legacy system, the interaction requires certain explicit configuration from the user. If the user is unfamiliar with the IT technology, it will be impossible to get the wanted service. Therefore, a new autonomous communication concept among neighbor devices is essential for people who is unfamiliar with the IT technology. The implicit human computer interface enables the user to acquire the services, even though the user don't know the IT technology. In this paper, we propose two BLE based protocols (B-LIDx protocol, B-PniP). B-LIDx protocol is the protocol for locationing the mobile device in indoor. B-PniP is a zero-configure opportunistic direct M2M communication protocol between neighbor devices to achieve the autonomous communication concept with zero-configuration. The protocol's evaluations are performed by measuring the time for finding the location of a mobile device in actual environment and aligning the time spent in services using the B-PniP.

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)
    • /
    • v.12 no.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.

Power Allocation Schemes For Downlink Cognitive Radio Networks With Opportunistic Sub-channel Access

  • Xu, Ding;Feng, Zhiyong;Zhang, Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1777-1791
    • /
    • 2012
  • This paper considers a downlink cognitive radio (CR) network where one secondary user (SU) and one primary user (PU) share the same base station (BS). The spectrum of interest is divided into a set of independent, orthogonal subchannels. The communication of the PU is of high priority and the quality of service (QoS) is guaranteed by the minimum rate constraint. On the other hand, the communication of the SU is of low priority and the SU opportunistically accesses the subchannels that were previously discarded by the PU during power allocation. The BS assigns fractions ?? and 1 ?? of the total available transmit power to the PU and the SU respectively. Two power allocation schemes with opportunistic subchannel access are proposed, in which the optimal values of ??'s are also obtained. The objective of one scheme is to maximize the rate of the SU, and the objective of the other scheme is to maximize the sum rate of the SU and the PU, both under the PU minimum rate constraint and the total transmit power constraint. Extensive simulation results are obtained to verify the effectiveness of the proposed schemes.

Opportunistic Spectrum Access with Dynamic Users: Directional Graphical Game and Stochastic Learning

  • Zhang, Yuli;Xu, Yuhua;Wu, Qihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5820-5834
    • /
    • 2017
  • This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

Impact of Outdated CSI on the Performance of Incremental Amplify-and-Forward Opportunistic Relaying

  • Zhou, Tsingsong;Gao, Qiang;Fei, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2567-2582
    • /
    • 2016
  • This paper investigates the impact of outdated channel state information (CSI) on the performance of the incremental amplify-and-forward (AF) opportunistic relaying (OR) over dual-hop Rayleigh fading channels. According to the definition of distribution function, we obtain the cumulative distribution function (CDF) of the actual combined signal-to-noise ratio (SNR) received at the destination. Based on this CDF, the closed-form expressions of the average spectral efficiency and outage probability are derived for the incremental AF OR under outdated CSI. Numerical results show that in the low region of the average SNR of the direct link, outdated CSI deteriorates the system performance, whereas in the high region, outdated CSI has almost no impact on the system performance.