• Title/Summary/Keyword: relay selection algorithm

Search Result 66, Processing Time 0.028 seconds

Relay node selection algorithm consuming minimum power of MIMO integrated MANET

  • Chowdhuri, Swati;Banerjee, Pranab;Chaudhuri, Sheli Sinha
    • Advances in Computational Design
    • /
    • v.3 no.2
    • /
    • pp.191-200
    • /
    • 2018
  • Establishment of an efficient routing technique in multiple-input-multiple-output (MIMO) based mobile ad hoc network (MANET) is a new challenge in wireless communication system to communicate in a complex terrain where permanent infrastructure network implementation is not possible. Due to limited power of mobile nodes, a minimum power consumed routing (MPCR) algorithm is developed which is an integration of cooperative transmission process. This algorithm select relay node and support short distance communication. The performance analysis of proposed routing algorithm increased signal to noise interference ratio (SNIR) resulting effect of cooperative transmission. Finally performance analysis of the proposed algorithm is verified with simulated result.

Adaptive Success Rate-based Sensor Relocation for IoT Applications

  • Kim, Moonseong;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3120-3137
    • /
    • 2021
  • Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

Enhanced Multi-Point Relay Selection Algorithm for Mobility and Distribution of Nodes (노드 이동성 및 분포를 고려한 향상된 다중 점 릴레이 선택 알고리즘)

  • Park, Jongho;Oh, Chang-Yeong;Ahn, Ji Hyoung;Kim, Joung-Sik;Jung, Sunghun;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1128-1137
    • /
    • 2012
  • In this paper, we propose an improved MPR selection method considering mobility and density of nodes for ad-hoc networks. In Optimized Link State Routing(OLSR), a node selects 1-hop Multi-Point Relay(MPR) nodes to cover all 2-hop neighbor nodes. In a high population area, many nodes are likely to be selected as MPR nodes by their neighbors. This leads to increase in contention among MPR nodes and may decrease overall performance of the network. In addition, when an MPR node leaves the communication range of its MPR selector node, it can no longer perform as the MPR node and the performance of the network may also decrease. In this paper, we propose an MPR selection method which measures the mobility and density of nodes by exchanging the hello messages and gives the priorities to the nodes for MPR selection. Performance evaluation results using OPNET show that the proposed method is superior to OLSR or the MPR candidate method in terms of connectivity and throughput.

Harmonic-Mean-Based Dual-Antenna Selection with Distributed Concatenated Alamouti Codes in Two-Way Relaying Networks

  • Li, Guo;Gong, Feng-Kui;Chen, Xiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1961-1974
    • /
    • 2019
  • In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

Linear Precoding Technique for Cooperative MIMO Communication Systems Using Selection-Type Relaying (선택적 중계 기법을 적용한 다중 안테나 기반 협력 통신 시스템의 선형 전처리 기술)

  • Yoo, Byung-Wook;Lee, Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.24-29
    • /
    • 2010
  • Selection-type relaying protocol, which is one of cooperative relaying protocols, provides low decoding complexity and improved system performance due to selection diversity. In this paper, we deal with linear precoding technique that minimize the error probability of cooperative MIMO system. Under the assumption that full channel state information is available at whole nodes, linear source and relay precoders, which minimize mean squared error of the estimated symbol vector, are proposed. Moreover, unlikely to the conventional selection-type relaying protocol using a fixed threshold signal-to-noise-ratio, new transmission link selection algorithm selects direct link or relay link as a transmission link, is introduced. Simulation results show that the proposed linear precoder with the transmission link selection algorithm outperforms the conventional precoders for two-hop relaying protocols or selection-type relaying protocols.

Exploiting Multi-Hop Relaying to Overcome Blockage in Directional mmWave Small Cells

  • Niu, Yong;Gao, Chuhan;Li, Yong;Su, Li;Jin, Depeng
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.364-374
    • /
    • 2016
  • With vast amounts of spectrum available in the millimeter wave (mmWave) band, small cells at mmWave frequencies densely deployed underlying the conventional homogeneous macrocell network have gained considerable interest from academia, industry, and standards bodies. Due to high propagation loss at higher frequencies, mmWave communications are inherently directional, and concurrent transmissions (spatial reuse) under low inter-link interference can be enabled to significantly improve network capacity. On the other hand, mmWave links are easily blocked by obstacles such as human body and furniture. In this paper, we develop a multi-hop relaying transmission (MHRT) scheme to steer blocked flows around obstacles by establishing multi-hop relay paths. In MHRT, a relay path selection algorithm is proposed to establish relay paths for blocked flows for better use of concurrent transmissions. After relay path selection, we use a multi-hop transmission scheduling algorithm to compute near-optimal schedules by fully exploiting the spatial reuse. Through extensive simulations under various traffic patterns and channel conditions, we demonstrate MHRT achieves superior performance in terms of network throughput and connection robustness compared with other existing protocols, especially under serious blockage conditions. The performance ofMHRT with different hop limitations is also simulated and analyzed for a better choice of the maximum hop number in practice.

Spectrum Leasing and Cooperative Resource Allocation in Cognitive OFDMA Networks

  • Tao, Meixia;Liu, Yuan
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.102-110
    • /
    • 2013
  • This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

Joint Mode Selection and Resource Allocation for Mobile Relay-Aided Device-to-Device Communication

  • Tang, Rui;Zhao, Jihong;Qu, Hua;Zhu, Zhengcang;Zhang, Yanpeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.950-975
    • /
    • 2016
  • Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.

A Relay Selection Scheme with Q-Learning (Q-Learning을 이용한 릴레이 선택 기법)

  • Jung, Hong-Kyu;Kim, Kwang-Yul;Shin, Yo-An
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.39-47
    • /
    • 2012
  • As a scheme to efficiently reduce the effects of multipath fading in next generation wireless communication systems, cooperative communication systems have recently come into the spotlight. Since these cooperative communication systems use cooperative relays with diverse fading coefficients to transmit information, having all relays participate in cooperative communication may result in unnecessary waste of resources, and thus relay selection schemes are required to efficiently use wireless resources. In this paper, we propose an efficient relay selection scheme through self-learning in cooperative wireless networks using Q-learning algorithm. In this scheme, we define states, actions and two rewards to achieve good SER (Symbol Error Rate) performance, while selecting a small number of cooperative relays. When these parameters are well-defined, we can obtain good performance. For demonstrating the superiority of the proposed Q-learning, We compared the proposed scheme with Q-learning and a relay selection scheme with a mathematical analysis. The simulation results show that, compared to a scheme that obtains optimum relays through a mathematical analysis, the proposed scheme uses resources efficiently by using smaller numbers of relays with comparable SER performance. According to these simulation results, the proposed scheme can be considered as a good attempt for future wireless communication.

Resource Allocation for Relay-Aided Cooperative Systems Based on Multi-Objective Optimization

  • Wu, Runze;Zhu, Jiajia;Hu, Hailin;He, Yanhua;Tang, Liangrui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2177-2193
    • /
    • 2018
  • This paper studies resource allocation schemes for the relay-aided cooperative system consisting of multiple source-destination pairs and decode-forward (DF) relays. Specially, relaying selection, multisubcarrier pairing and assignment, and power allocation are investigated jointly. We consider a combinatorial optimization problem on quality of experience (QoE) and energy consumption based on relay-aided cooperative system. For providing better QoE and lower energy consumption we formulate a multi-objective optimization problem to maximize the total mean opinion score (MOS) value and minimize the total power consumption. To this end, we employ the nondominated sorting genetic algorithm version II (NSGA-II) and obtain sets of Pareto optimal solutions. Specially, two formulas are devised for the optimal solutions of the multi-objective optimization problems with and without a service priority constraint. Moreover, simulation results show that the proposed schemes are superior to the existing ones.