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.

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.

A Relay Selection Algorithm Based on User Trust Degree for D2D Communications

2021 ◽  
Author(s):  
Xiaobin Li ◽  
Haoran Liu
Keyword(s):  
Success Rate ◽  
Social Relationship ◽  
Relay Node ◽  
D2d Communications ◽  
Relay Nodes ◽  
Trust Degree ◽  
Relay Communication ◽  
Relay Selection Algorithm ◽  
User Trust

Abstract The emergence of 5G has promoted the rapid development of the Internet of Things(IOT), the dramatic increasing of mobile equipment has led to the increasing shortage of spectrum resources, D2D(Device-to-Device) communication technology is widely concerned for its ability to improve the utilization of spectrum resources. In order to expand the communication scope, relay nodes are introduced into D2D communications, as the third party of D2D relay communication, the quality of relay nodes directly affects the quality of communication process. In order to make more users willing to participate in relay communication, social relationship is introduced into D2D relay communication, However, as an explicit relationship between people, the function of social relationship in D2D communication is limited by the mobility of users and the variability of communication scenarios. In order to find a more reli­able relay node and upgrade the connection success rate of D2D relay communication, implicit social relationship between the users need to be mined. Aiming at that, user trust degree (UTD) is established in this paper. By combining the explicit relationship which is called the social connectivity degree with the implicit social relationship called the interest similarity degree, and considering the user’s movement, a relay selection algorithm is presented to help sender find a relay node with a deeper user trust, which can increase the user’s willingness to participate in D2D relay communication and upgrade the success rate of communication connection, so this algorithm can ensure the security of the relay node and can improve the throughput performance. Simulation results show that this algorithm can increase the success rate of connection, improve the overall throughput of the system and improve the user's communication expe­rience.

Power Allocation of Relay Selection in Coordinated Channel Based on Channel Statistical Information

2014 ◽  
Vol 543-547 ◽  
pp. 796-799
Author(s):  
Yi Tian
Keyword(s):  
Relay Selection ◽  
Search Algorithm ◽  
Relay Node ◽  
Statistical Information ◽  
Relay Network ◽  
Selection Algorithm ◽  
Amplify And Forward ◽  
Relay Selection Algorithm ◽  
Full Search ◽  
Better Than

In order to balance between optimality and operation efficiency of relay selection algorithm, an efficient relay selection algorithm has been raised based on bit error rate (BER) in an amplify-and-forward (AF) collaborated relay network. The algorithm, based on characters of channel statistical information and system BER, adds gain parameter of equivalent channel, sets SNR as threshold, select relay node assembly in the condition of same power, so as to minimize system BER. This algorithm has equal performance with Full Search Algorithm but with simpler calculation. Performance of the relay selection calculation BER is better than other algorithm by forwarding and preselecting an optimal relay node.

scholarly journals cDERSA: Cognitive D2D Enabled Relay Selection Algorithm to Mitigate Blind-Spots in 5G Cellular Networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Adeel Iqbal ◽  
Muddasir Rahim ◽  
Riaz Hussain ◽  
Abdulfattah Noorwali ◽  
Mohammad Zubair Khan ◽  
...  
Keyword(s):  
Cellular Networks ◽  
Relay Selection ◽  
Selection Algorithm ◽  
Relay Selection Algorithm ◽  
Blind Spots

scholarly journals Developing a Video Buffer Framework for Video Streaming in Cellular Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Saba Qasim Jabbar ◽  
Dheyaa Jasim Kadhim ◽  
Yu Li
Keyword(s):  
Outage Probability ◽  
Video Streaming ◽  
Cellular Networks ◽  
Quality Of Experience ◽  
Video Quality ◽  
Base Station ◽  
System Throughput ◽  
Selection Algorithm ◽  
Radio Resources

This work proposes a new video buffer framework (VBF) to acquire a favorable quality of experience (QoE) for video streaming in cellular networks. The proposed framework consists of three main parts: client selection algorithm, categorization method, and distribution mechanism. The client selection algorithm was named independent client selection algorithm (ICSA), which is proposed to select the best clients who have less interfering effects on video quality and recognize the clients’ urgency based on buffer occupancy level. In the categorization method, each frame in the video buffer is given a specific number for better estimation of the playout outage probability, so it can efficiently handle so many frames from different videos at different bitrates. Meanwhile, at the proposed distribution mechanism, a predetermined threshold value is selected for lower and upper levels of playout outage probability. Then, the control unit at the base station will distribute the radio resources and decide the minimum rate requirement based on clients’ urgency categories. Simulation results showed that the VBF grantees fairness of resources distribution among different clients within the same cellular network while minimizing the interruption duration and controlling the video buffer at an acceptable level. Also, the results showed that the system throughput of the proposed framework outperforms other existing algorithms such as playout buffer and discontinuous reception aware scheduling (PBDAS), maximum carrier-to-interface ratio (MAX-CIR), and proportional fair (PF) due to enhancing the quality of experience for video streaming by increasing the radio resources in fairness manner.

A Bandwidth and Energy Aware QoS Routing Protocol for Enhanced Performance in Ad-hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 203-213
Author(s):  
Priyanka Bharadwaj ◽  
Surjeet Balhara
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Qos Routing ◽  
Delivery Ratio ◽  
Energy Aware ◽  
Multimedia Services ◽  
Average Delay ◽  
Hoc Networks

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.

scholarly journals D2D Assisted Cellular Networks in Licensed and Unlicensed Spectrum: Matching-Iteration-Based Joint User Access and Resource Allocation

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 80
Author(s):  
Qiuqi Han ◽  
Guangyuan Zheng ◽  
Chen Xu
Keyword(s):  
Resource Allocation ◽  
Cellular Networks ◽  
System Capacity ◽  
System Throughput ◽  
Unlicensed Spectrum ◽  
Resource Allocation Algorithm ◽  
User Access ◽  
Limited Spectrum

Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.

Sign in / Sign up

Export Citation Format

Share Document