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

A Method of Allocating Channel Resources Using Greedy Algorithm in Multi-channel Multi-hop Wireless Network

A multi-hop wireless network and greedy algorithm technology, applied in the field of greedy algorithm allocation channel resources, can solve high cost, high cost and other problems

Inactive Publication Date: 2016-08-17
SHANGHAI JIAOTONG UNIV +1
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

On the other hand, most of the existing technologies adopt a centralized processing method, that is, from the perspective of complete information, global planning
And this is expensive and costly in practical applications

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
  • A Method of Allocating Channel Resources Using Greedy Algorithm in Multi-channel Multi-hop Wireless Network
  • A Method of Allocating Channel Resources Using Greedy Algorithm in Multi-channel Multi-hop Wireless Network
  • A Method of Allocating Channel Resources Using Greedy Algorithm in Multi-channel Multi-hop Wireless Network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] The embodiments of the present invention are described in detail below. The present embodiment is implemented on the premise of the technical solution of the present invention, and detailed implementation and specific operation process are provided, but the protection scope of the present invention is not limited to the following embodiments .

[0042] The algorithm provided by the invention is a fast centralized greedy algorithm, which can efficiently complete the channel allocation problem and enable the network to have a good output performance. The main steps of the method provided by the present invention are as follows: first, each node first calculates its own transmission capability, and then makes a local optimal greedy decision of channel occupancy according to its own transmission capability and the transmission capabilities of surrounding nodes. After a link is decided, the link that interferes with it will be marked as an illegal link, which is not included...

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 present invention provides a method for allocating channel resources using a greedy algorithm in a multi-channel multi-hop wireless network, which includes steps: first, each node detects basic information of nodes that may interfere with its own transmission data and uses these basic information Calculate the transmission capabilities of itself and these nodes respectively; in the second step, perform a greedy algorithm for each node; in the third step, each node randomly executes the second step in sequence until all optional links in the network have been divided For the unselectable link set SN or the selected and established link set Sl, the selected and established link set Sl is output as the result of the greedy algorithm. The invention has strong realizability, has a wide application background, and can exert high efficiency in universal application scenarios, so that network traffic can achieve an effect comparable to the global optimal, and is very efficient.

Description

technical field [0001] The present invention relates to a method in the technical field of wireless communication, in particular to a greedy algorithm for rationally allocating channel resources to achieve optimal network output, and in particular to a method for allocating channel resources using a greedy algorithm in a multi-channel multi-hop wireless network. Background technique [0002] With the development of wireless networks, spectrum resources are becoming more and more scarce, which seriously restricts the efficient and fast transmission of information. Therefore, channel allocation in multi-channel multi-hop wireless networks has attracted more and more attention. This topic has been extensively studied not only academically, but also in the field of industrial applications. Effective use of existing resources will help the inventor's network to get better output is an important issue that needs to be solved urgently. [0003] On the one hand, as the number of ch...

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): H04W28/08H04W72/08H04W72/54
Inventor 邱航黄新施琦王新兵田军
Owner SHANGHAI JIAOTONG 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