Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

An interference-aware multi-flow cooperative routing method

A multi-hop cooperative and routing technology, applied in the field of interference-aware multi-flow cooperative routing, to achieve the effect of reducing network delay and maximizing end-to-end throughput

Active Publication Date: 2017-12-01
HUNAN UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It can be seen that how to perform relay selection to reduce the interference between links in a wireless cooperative network is extremely challenging.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An interference-aware multi-flow cooperative routing method
  • An interference-aware multi-flow cooperative routing method
  • An interference-aware multi-flow cooperative routing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] The present invention calculates the available alternative channel set FCH (i, j) between two nodes i and j according to the following steps:

[0038] 1) If the number of node i’s working channel set CH(i) is less than the number of interfaces M, there are still idle interfaces for arbitrarily allocating channels, so node i can use the working channel set ACH(i) to take all the orthogonal channels, That is, ACH(i)={ch 1 ,ch 2 ,...,ch N}, otherwise the set of available working channels is equal to the set of working channels itself: ACH(i)=CH(i), similarly calculate the set of available working channels ACH(j) of node j;

[0039] 2) Then the candidate channel set FCH(i,j) of link (i,j) is FCH(i,j)=ACH(i)∩ACH(j)-{ch 1}. The present invention calculates the interference-aware cooperative routing index of the link between any two adjacent nodes i and j (i, j) according to the following steps:

[0040] 1) For any channel ch w ∈FCH(i,j), calculate the maximum available ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an interference-aware multi-flow cooperative routing method. The nodes in the multi-hop cooperative wireless network studied by the method can adopt two transmission modes: cooperative transmission and direct transmission. Through joint relay selection and channel allocation, research For interference-sensitive cooperative routing problems, a distributed cooperative routing method is designed. The method completes channel allocation, optimal transmission mode selection and optimal cooperative node selection during the establishment of cooperative routing. The method can select the optimal cooperative route with the least interference for multiple data streams in the network, and at the same time determine the reasonable allocation of multiple channels in the wireless network among multiple data streams, thereby maximizing the end-to-end throughput of network data streams. Reduce network latency.

Description

technical field [0001] The present invention relates to the field of wireless networks, in particular to a wireless network supporting cooperative communication technology, in particular to an interference-aware multi-flow cooperative routing method. Background technique [0002] Compared with the MIMO technology, the Cooperative Communication technology (Cooperative Communication) at the physical layer is a space diversity technology suitable for single-antenna users. It takes advantage of the broadcast characteristics of wireless channels to allow single-antenna terminal devices to share their physical resources for communication in a multi-user environment, forming a virtual antenna array. Devices participating in cooperative communication can forward information to each other, and multiple copies of the same information can reach the receiving end through mutually independent wireless channels, thereby obtaining space diversity gain—cooperative diversity gain. [0003] ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W40/16
Inventor 谢鲲李卉何施茗文吉刚
Owner HUNAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com