Multi-Path Relay Selection Based on Radio and Television Business

2013 ◽  
Vol 756-759 ◽  
pp. 1883-1888
Author(s):  
Chao Yi Zhang ◽  
Yan Dong Zhao
Keyword(s):  
Time Delay ◽  
Routing Protocol ◽  
Relay Selection ◽  
Dynamic Network ◽  
Relay Node ◽  
Selection Method ◽  
System Throughput ◽  
Selection Strategy ◽  
Decision Threshold ◽  
Coverage Area

This paper presents a relay selection method for radio and television business, this method uses nodes time-delay and power information, obtains the value of network interrupt as decision threshold, then selects the relay node. At same time this paper proposes an optimal relay selection strategy which can minimize the network interrupt probability combination with power distributionMulti-Path Relay Routing Protocol, this protocol can change the appropriate route path according to the dynamic network. Simulation results show that this protocol can extend cells coverage area, reduce time-delay and increase system throughput, improve system spectral efficiency, and enhance Qos of radio and television business.

Based on Time-Delay and Bandwidth Relay Selection Algorithm for Radio and Television Services

2013 ◽  
Vol 748 ◽  
pp. 1009-1014
Author(s):  
Chao Yi Zhang ◽  
Mu Qing Wu ◽  
Lin Lin Luan ◽  
Chun Xiu Xu
Keyword(s):  
Time Delay ◽  
Routing Protocol ◽  
Relay Node ◽  
System Throughput ◽  
Decision Threshold ◽  
Selection Algorithm ◽  
Routing Method ◽  
Relay Selection Algorithm ◽  
Blind Spots

Proposed a relay routing method for Radio and TV services, the method through obtaining the nodes time-delay and power information, obtained the value of the system interrupt decisions, and as a decision threshold to select the relay node. While in consideration of link priorities and fairness, designed a relay routing protocol that can dynamically change the route when the network changed. Simulation results show that this protocol can be expanded coverage, reduced communication blind spots, increase system throughput and enhance the quality of service.

Relay Selection in Distributed Transmission Based on the Golden Code Using ML and Sphere Decoding in Wireless Networks

2011 ◽  
Vol 6 (4) ◽  
pp. 63-75 ◽  
Author(s):  
L. Ge ◽  
G. J. Chen ◽  
J. A. Chambers
Keyword(s):  
Relay Selection ◽  
Cooperative Diversity ◽  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Relay Node ◽  
Relay Network ◽  
Selection Strategy ◽  
Sphere Decoding ◽  
Golden Code ◽  
Maximum Minimum

The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multiple-output (MIMO) systems, in particular, overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and the authors propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission with the full maximum-likelihood (ML) decoding and sphere decoding (SD) based on a wireless relay network. This strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves on the established one-sided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) based on different detectors and a scheme without relay selection, with the maximum-minimum and maximum-mean selection schemes confirm the performance advantage of relay selection. The proposed strategy yields the best performance of the three methods.

The sequence relay selection strategy based on stochastic dynamic programming

2017 ◽  
Vol 31 (19-21) ◽  
pp. 1740076
Author(s):  
Rui Zhu ◽  
Xihao Chen ◽  
Yangchao Huang
Keyword(s):  
Stochastic Dynamic Programming ◽  
Relay Selection ◽  
Relay Node ◽  
Selection Strategy ◽  
Stochastic Dynamic ◽  
Channel State ◽  
State Information ◽  
Convergence Performance ◽  
Relay Node Selection ◽  
Stochastic Dynamic Program

Relay-assisted (RA) network with relay node selection is a kind of effective method to improve the channel capacity and convergence performance. However, most of the existing researches about the relay selection did not consider the statically channel state information and the selection cost. This shortage limited the performance and application of RA network in practical scenarios. In order to overcome this drawback, a sequence relay selection strategy (SRSS) was proposed. And the performance upper bound of SRSS was also analyzed in this paper. Furthermore, in order to make SRSS more practical, a novel threshold determination algorithm based on the stochastic dynamic program (SDP) was given to work with SRSS. Numerical results are also presented to exhibit the performance of SRSS with SDP.

scholarly journals Power Optimized Single Relay Selection with an Improved Link-Adaptive-Regenerative Protocol

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Jie Li ◽  
Jianrong Bao ◽  
Shenji Luan ◽  
Bin Jiang ◽  
Chao Liu
Keyword(s):  
Outage Probability ◽  
Cooperative Communications ◽  
Power Efficiency ◽  
Relay Selection ◽  
Relay Node ◽  
Link Quality ◽  
Selection Strategy ◽  
Amplify And Forward ◽  
Selection Scheme ◽  
Single Relay

To improve the reliability and efficiency in cooperative communications, a power optimized single relay selection scheme is proposed by increasing the diversity effort with an improved link-adaptive-regenerative (ILAR) protocol. The protocol determines the forwarding power of a relay node by comparing the signal-to-noise ratio (SNR) at both sides of the node; thus it improves the power efficiency. Moreover, it also proposes a single relay selection strategy to maximize the instantaneous SNR product, which ensures the approximate best channel link quality for good relay forwarding. And the system adjusts the forwarding power in real time and also selects the best relay node participated in the cooperative forwarding. In addition, the cooperation in the protocol is analyzed and the approximate expression of the bit-error-rate (BER) and the outage probability at high SNRs are also derived. Simulation results indicate that the BER and outage probability of the relay selection scheme by the ILAR protocol outperform other contrast schemes of current existing protocols. At BER of 10−2, the proposed scheme with ILAR protocol outperforms those of the decoded-and-forward (DF), the selected DF (SDF), and the amplify-and-forward (AF) protocols by 3.5, 3.5 and 7 dB, respectively. Moreover, the outage probability of the relay system decreases with the growth of the relay number. Therefore, the proposed relay selection scheme with ILAR strategies can be properly used in cooperative communications for good reliability and high power efficiency.

scholarly journals Performance Modeling Analysis of D-MSMR-CARQ with Relay Selection in Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yongqiang Zhou ◽  
Huan Qian ◽  
Qihao Wang ◽  
Suoping Li
Keyword(s):  
Wireless Sensor Networks ◽  
Relay Selection ◽  
Selection Method ◽  
Transmission Delay ◽  
Wireless Sensor ◽  
System Throughput ◽  
Selection Methods ◽  
Delay Performance ◽  
Average Transmission ◽  
Channel Environment

Reliable and efficient real-time transmission is an important and challenging issue for wireless sensor networks (WSNs). Truncated retransmission times and relay selection can effectively reduce transmission delay and improve system throughput. A new direct multisource multirelay cooperative automatic repeat request (D-MSMR-CARQ) protocol based on truncation with two relay selection methods in WSNs is analytically analyzed in this paper. Firstly, based on two different relay selection methods under the maximum ratio combining (MRC), the discrete time Markov chain (DTMC) model of D-MSMR-CARQ protocol and state space is established. Secondly, for each D-MSMR-CARQ protocol based on different relay selection method, we obtain the closed-form expressions of the system average transmission delay and the expressions of the system throughput through state transition probabilities. Finally, numerical results reveal that the first relay selection method outperforms the second relay selection method on the average transmission delay performance for the proposed protocol. More specifically, the delay performance of the proposed protocol can be improved by 13% compared with the nondirect-link protocol when the channel environment is the same; the proposed protocol improves the throughput performance by 47% compared with the nondirect protocol when the channel environment is harsh under the same simulation parameters. Furthermore, the optimal number of source nodes and relay nodes is determined.

A Comparative study on secure routing algorithms SAODV and A-SAODV in Mobile AdHoc Networks (MANET) – The Enhancements of AODV

2012 ◽  
Vol 3 (2) ◽  
pp. 419-423
Author(s):  
JARUPULA RAJESHWAR ◽  
Dr G NARSIMHA
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Dynamic Network ◽  
Secure Routing ◽  
Mobile Adhoc Networks ◽  
Security Challenges ◽  
Basic Protocol ◽  
Freely Moving ◽  
Adhoc Networks ◽  
Secure Routing Protocols

A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in forming a network. But due to its openness characteristics it is posing many security challenges. As it has highly dynamic network topology security for routing is playing a major role. We have very good routing protocols for route discovery as well as for transporting data packers but most of them lack the feature of security like AODV. In this paper we are studying the basic protocol AODV and identify how it can be made secure. We are studying a protocol S-AODV which is a security extension of AODV which is called Secure AODV (S-AODV) and we are studying enhanced version of S-AODV routing protocol a Adaptive Secure AODV (A-SAODV). Finally we have described about the parameter to be taken for performance evaluation of different secure routing protocols

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

Joint optimal power splitting and relay selection strategy under SWIPT

2021 ◽  
Author(s):  
Saleemullah Memon ◽  
Kamran Ali Memon ◽  
Junaid Ahmed Uqaili ◽  
Kamlesh Kumar Soothar ◽  
Rabnawaz Sarmad Uqaili ◽  
...  
Keyword(s):  
Relay Selection ◽  
Selection Strategy ◽  
Power Splitting ◽  
Optimal Power

Application of the Combination Scheme of PAPR Reduction and Predistortion Techniques in Cooperative Communication with AF Protocol using the Relay Selection Strategy

2021 ◽  
Author(s):  
Annisa Anggun Puspitasari ◽  
Ummi Ainun Nadhiroh ◽  
Mareta Dwi Nor Habibah ◽  
Galuh Setya Palupi ◽  
Mohamad Ridwan ◽  
...  
Keyword(s):  
Cooperative Communication ◽  
Relay Selection ◽  
Papr Reduction ◽  
Selection Strategy ◽  
Combination Scheme

Exponential synchronization of a Markovian jump complex dynamic network with piecewise-constant transition rates and distributed delay

2018 ◽  
Vol 41 (9) ◽  
pp. 2535-2544 ◽  
Author(s):  
Nasim Akbari ◽  
Ali Sadr ◽  
Ali Kazemy
Keyword(s):  
Time Delay ◽  
Sufficient Conditions ◽  
Distributed Delay ◽  
Dynamic Network ◽  
Exponential Synchronization ◽  
Linear Matrix ◽  
Transition Rates ◽  
Markovian Jump ◽  
Piecewise Constant ◽  
Time Varying Delay

The exponential synchronization of a Markovian jump complex dynamical network with piecewise-constant transition rates is investigated. Two distinct types of time-varying delay are considered for the system; one is distributed time-delay for each node, the other is discrete coupling time-delay. Based on an augmented Lyapunov–Krasovskii functional, some sufficient conditions are derived and expressed in the form of linear matrix inequalities, which are formulated in such a manner as to determine the controller gain matrices. Finally, an example is given to illustrate the effectiveness and validity of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document