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

Multi-service cooperation multiple access method based on cooperative game in distributed self-organized network

A technology of cooperative game and access method, applied in access restriction, network topology, electrical components, etc., to achieve the effect of avoiding fairness problems and selfish node problems, high normalized throughput performance, and avoiding selfish node problems

Inactive Publication Date: 2014-11-26
PLA UNIV OF SCI & TECH +1
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

That is to say, compared with the traditional multi-service multiple access method, the present invention not only solves the fairness problem and avoids the selfish node problem, but also has higher efficiency of transmitting payload per unit time

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
  • Multi-service cooperation multiple access method based on cooperative game in distributed self-organized network
  • Multi-service cooperation multiple access method based on cooperative game in distributed self-organized network
  • Multi-service cooperation multiple access method based on cooperative game in distributed self-organized network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] Step 1: Use the cooperative game to divide the non-competitive period and the competitive period

[0046] Using the bargaining game in the cooperative game, nodes with different priority service types adaptively determine an optimal transmission scheme. The bargaining problem is usually used to model two things with conflicting interests to work together to negotiate a suitable compromise. In this patent, it is assumed that each node has two priority types: High Priority (HP) and Low Priority (LP), but can only have one priority type in the same sending period. HP nodes and LP nodes are two individuals with conflicting interests. They both want to occupy channel resources to maximize their performance, especially LP nodes, which are seriously unfair under the traditional mechanism, and therefore may become selfish nodes. In order to solve the problems of fairness and selfish nodes in the traditional multi-service multiple access method, this patent uses a cooperative g...

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 a multi-service cooperation multiple access method based on a cooperative game in a distributed self-organized network. A Nash bargaining solution in the cooperative game is calculated, nodes of the businesses of different priorities are subjected to cooperative negotiation to adaptively divide a channel into a competition period and a non-competition period; on the basis of guaranteeing the maximum integral performance of the network, the requirement of the nodes of the businesses of different priorities can be satisfied; during the competition period, a high-priority node and a low-priority node compete for the channel together, and the high-priority node enjoys a higher access priority; and during the non-competition period, the high-priority node does not participate in competition, and one unconflicted low-priority node is selected to be directly sent to a data packet.

Description

technical field [0001] The invention relates to a multi-service cooperative multiple access method based on cooperative game in a distributed ad hoc network. Specifically, in the distributed ad hoc network, a multi-service multiple access method that can solve the fairness and selfish node problems is designed by using the bargaining game in the cooperative game. Background technique [0002] With the development of wireless networks, the demand for multiple services gradually increases. Different priorities need to be provided for different service types. For example, the priority of video and voice services is higher than that of data services, that is, the network needs to provide Quality of Service (Quality of Service, QoS) guarantee. The IEEE 802.11e EDCA (Enhance Enhanced Distributed Channel Access) protocol is a Media Access Control (MAC) protocol that can provide QoS guarantees. In the EDCA protocol, the network provides different QoS guarantees according to differe...

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): H04W48/16H04W84/18
Inventor 蔡跃明李楠杨炜伟
Owner PLA UNIV OF SCI & TECH
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