Non-confliction on-demand multi-address access method

An access method and access conflict technology, which are applied in radio transmission systems, time division multiplexing selection devices, data exchange through path configuration, etc., can solve the problem that the proportion of control overhead is large and the maximum channel throughput is not high enough , did not eliminate and other problems, to achieve the effect of improving channel throughput, obtaining channel use rights, and increasing transmission time

Inactive Publication Date: 2007-09-12
BEIHANG UNIV
View PDF0 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the former still has packet collisions in the application reservation part, and the influence of hidden terminals is only weakened but not eliminated; the latter can avoid the occurrence of packet collisions, but when many nodes do not send, this method will waste a lot of Polling Control Overhead
[0006] At the same time, there are other problems in the on-demand allocation multiple access method proposed in the prior art. For example, when the network traffic is low, compared with the random access method, the on-demand allocation method has an excessive pro

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
  • Non-confliction on-demand multi-address access method
  • Non-confliction on-demand multi-address access method
  • Non-confliction on-demand multi-address access method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0030] Figure 1 is a flow chart of the conflict-free on-demand multiple access method of the present invention, which is specifically:

[0031] Step 1. The central control node announces that the reserved access packet sent by the node collides and starts the conflict resolution stage. Each conflict resolution stage is a number of forecast bursts and forecast confirmation mini-slots set in sequence;

[0032] Step 2. On the forecast burst mini-slot, each access conflict node listens to or sends forecast burst packets according to its virtual identity number;

[0033] Step 3. After receiving the forecast burst packet on the forecast burst mini-slot, the central control node sends the result on the subsequent forecast confirmation mini-slot;

[0034] Step 4. On the forecast confirmation mini-slot, each access conflict node listens to the result sent by the central control node; when the result is that a node has successfully accessed, step 5 is executed, otherwise, step 2 is executed...

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 relates to a conflict-free, on-demand multiple access method, comprising: central control node announces collisions of node-sent reserved access packets have occurred and starts up conflict resolution stages, where each conflict resolution stage comprises several forecast burst and forecast confirm micro time gaps set in sequence; in the forecast burst micro time gap, each access conflicting node monitors or sends forecast burst packet according its virtual ID number, and the central control node receives the forecast burst packets; in the following forecast confirm micro time gaps, the central control node sends the results, and each access conflicting node monitors the results; after a node succeeds in access, the central control node sends result broadcast packet. And the invention can assure access conflicting nodes quickly connect to channel and obtain the channel use right and increases service packet transmitting time as far as possible, and increases the throughput of channel.

Description

technical field [0001] The invention relates to a multiple access method, in particular to a conflict-free on-demand multiple access method. Background technique [0002] The multiple access (ie medium access control, MAC) method solves the problem of how multiple nodes or users share channel resources quickly, efficiently, fairly and reliably. According to the way of channel allocation, multiple access methods are generally divided into three ways: fixed allocation, random access and on-demand allocation. [0003] The fixed-allocation multiple access method generally allocates channel resources to some nodes or all nodes that share the channel for a long time. Since there are a large number of mobile nodes in various mobile communication networks, and the business of each node is mostly bursty business, the multiple access method of fixed allocation will cause a lot of channel resources to be idle and waste, which is not suitable for mobile communication networks. Direct ...

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
IPC IPC(8): H04L12/56H04B7/204H04Q11/04H04L12/28H04L12/863
Inventor 刘凯张军王大鹏李汉涛
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap