CN101034933A - Self-adaptive multi-address access method and central control node - Google Patents

Self-adaptive multi-address access method and central control node Download PDF

Info

Publication number
CN101034933A
CN101034933A CN200710063759.4A CN200710063759A CN101034933A CN 101034933 A CN101034933 A CN 101034933A CN 200710063759 A CN200710063759 A CN 200710063759A CN 101034933 A CN101034933 A CN 101034933A
Authority
CN
China
Prior art keywords
node
traffic
center control
control nodes
current
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN200710063759.4A
Other languages
Chinese (zh)
Other versions
CN100466492C (en
Inventor
刘凯
张军
程连贞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CNB2007100637594A priority Critical patent/CN100466492C/en
Publication of CN101034933A publication Critical patent/CN101034933A/en
Application granted granted Critical
Publication of CN100466492C publication Critical patent/CN100466492C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4006—Conversion to or from arithmetic code
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/48—Message addressing, e.g. address format or anonymous messages, aliases
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/58—Message adaptation for wireless communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066—Session management
    • H04L65/1101—Session protocols
    • H04L65/1104—Session initiation protocol [SIP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/10—Architectures or entities
    • H04L65/1016—IP multimedia subsystem [IMS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

This invention relates to an adaptive multiple access methods, include: center control nodes determine the current volume of business class, choose corresponding to the way Channel Access Control Center in the control nodes released; each node in accordance with the letter received by the road access to access. It also relates to a central control node, including monitoring unit, all the nodes used to control the central node; and grading modules, connecting with the monitoring unit used to determine the current volume and choose corresponding access method. This invention chooses different method for different volume. The invention determines suitable method for every volume to make the access best.

Description

Self-adaptive multi-address access method and center control nodes
Technical field
The present invention relates to a kind of self-adaptive multi-address access method and center control nodes, particularly relate to and a kind ofly select the multiple access method and the center control nodes of corresponding channel access way, be applicable to systems such as mobile ad hoc network, wireless sensor network, Radio Access Network according to current traffic level.
Background technology
Multiple access insert (or claiming medium access control) method solve a plurality of nodes or user how fast, efficient, fair, the problem of shared channel resources reliably.According to the mode of channel allocation, it is divided into fixed allocation, the three kinds of modes that insert and distribute according to need at random usually.
Present general single access at random and the access way as required of adopting of direct applied channel allocation mode in mobile radio communication network.
At random in the multiple access method of Jie Ruing, concealed terminal and exposed terminal problem have appearred in each node when sharing wireless broadcast channel based on the mode of carrier sense in the multihop network structure, make multiple access performance reduce greatly, particularly when sending node number and network traffic increase, the probability of packet collisions and re-transmission can sharply strengthen, thereby increased average packet time delay and average packet loss ratio greatly, reduced channel throughput, also occurred the inequitable problem of shared channel simultaneously.
In the demand assigned multiple access method, each node re-uses channel resource according to service conditions request channel resource after the success.Different according to application reservation and allocated channel mode, it can be divided into based on competition at random with based on there not being two classes of conflict.Method based on competition at random mainly adopts various short control groupings to shake hands (as sending request/removing request, be RTS/CTS), periodic status information exchange distributed appointment mode, be suitable for of the business transmission of sudden strong, message transfer, as IEEE 802.11 distributed coordination function (DCF), two busy tone multiple access (DBTMA) and distributed packet reservation multiple access methods such as (DPRMA) than short type; Mainly utilize center control nodes to coordinate to realize distribution according to need based on conflict free method, be suitable for once inserting the type of service that needs the long period stable transfer after the foundation, can provide good quality of service (QoS) to guarantee, its typical case's representative polling mechanisms that use as IEEE 802.11 point coordination function (PCF) and virtual base station methods such as (VBS) more.But, still there is packet collisions in the former in the application reservation section, and the influence of concealed terminal has just obtained weakening, do not eliminated; The latter can avoid the generation of packet collisions situation, and when not excessive many nodes did not send, this method can be wasted a large amount of poll control expenses.In addition, present most of demand assigned multiple access methods that propose are compared existence with the multiple access method that inserts at random and are controlled the problem that the expense proportion is excessive, propagation delay time is bigger when network traffic is low.
Summary of the invention
Technical problem to be solved by this invention is, overcome the deficiency of single channel access way in the prior art, a kind of self-adaptive multi-address access method and a kind of center control nodes that is used to realize this self-adaptive multi-address access method that can select the different channels access way according to different traffic level is provided, combines the advantage of various channel access waies under different business amount situation, to reach the access optimization.
For this reason, the embodiment of self-adaptive multi-address access method of the present invention comprises: center control nodes is determined current traffic level, each node announcement of selecting corresponding channel access way and controlling to described center control nodes; Each node inserts according to the channel access way of being received.In the technique scheme, center control nodes determines that current traffic level can have two kinds of methods.
First method, center control nodes can be compared the current business amount with the default first traffic carrying capacity threshold value and the second traffic carrying capacity threshold value, determine current traffic level.Second method, center control nodes can also be determined current traffic level by preceding traffic level and other parameters of once determining under the situation of clear and definite previous traffic level.The current traffic level of once determining be in/during heavy traffic, center control nodes is regularly seeked the opinion of the recent maximum access failure number of times continuously of each node, and compare with the default first continuous access failure number of times threshold value and the second continuous access failure number of times threshold value, determine current traffic level.When the current traffic level of once determining was light traffic, center control nodes was compared continuous access request collision frequency at no distant date with inserting the collision frequency threshold value, determine current traffic level.When the current traffic level of once determining is attached most importance to traffic carrying capacity, center control nodes will send the interstitial content of traffic packets at no distant date and compare with the certain proportion value of node sum, determine current traffic level.
The embodiment of center control nodes of the present invention comprises: monitoring means is used to monitor each node that described center control nodes is controlled; And the deciding grade and level unit, be connected with monitoring means, be used for determining current traffic level and selecting corresponding channel access way according to the monitoring information that receives.
The present invention has overcome the deficiency of single channel access way in the prior art, a kind of self-adaptive multi-address access method and a kind of center control nodes that is used to realize this self-adaptive multi-address access method that can select the different channels access way according to different traffic level is provided, draw the advantage of different channels access way under different business amount situation, to reach the access optimization.
Further, center control nodes can compare with definite current traffic level by the threshold value with current business amount and different business amount grade, thereby has realized the decision method that miscellaneous service amount grade transforms mutually; Can also under the situation of clear and definite previous traffic level, determine current traffic level by preceding traffic level and other parameters of once determining, thereby realize the decision method of adjacent conversion between the miscellaneous service amount grade.
Description of drawings
Fig. 1 be CCN according to current traffic carrying capacity, determine traffic level and select the flow chart of corresponding channel access way;
Fig. 2 be CCN according to current traffic carrying capacity, determine traffic level and select another flow chart of corresponding channel access way;
Fig. 3 for a current traffic level be in/during heavy traffic, CCN determines traffic level and selects the flow chart of corresponding channel access way;
When Fig. 4 was light traffic for a current traffic level, CCN determined traffic level and selects the flow chart of corresponding channel access way;
When Fig. 5 attached most importance to traffic carrying capacity for a current traffic level, CCN determined traffic level and selects the flow chart of corresponding channel access way;
The flow chart of Fig. 6 for inserting according to light traffic channel access way;
Fig. 7 for according in/flow chart that heavy traffic channel access way inserts;
The flow chart of Fig. 8 for inserting according to heavy traffic channel access way;
The flow chart of Fig. 9 for inserting according to heavy traffic channel access way with priority restriction;
Figure 10 is the structural representation of center control nodes.
Embodiment
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
In order to solve the deficiency of single channel access way in the existing multiple access method, the invention provides a kind of multiple access method that can select the different channels access way according to different traffic level, by drawing the advantage of each channel access way, to reach the access optimization.Comprise: center control nodes (CCN) is determined current traffic level, the step of selecting corresponding channel access way and announcing to each node of described CCN control by the control grouping of broadcast transmission special use; And the step that inserts according to the channel access way of being received of each node.
Suppose:
S CurrentRepresent current throughput, 0≤S Current≤ 1;
S The 1-thresholdingThe first traffic carrying capacity threshold value of expression light traffic thresholding, 0≤S The 1-thresholding≤ 1;
S The 2-thresholdingThe second traffic carrying capacity threshold value of representing heavy traffic carrying capacity thresholding, 0≤S The 2-thresholding≤ 1;
G represents the normalization total traffic, i.e. the ratio of all block lengths to be sent of current network and the ideal situation lower channel maximum block length that can send;
N NodeBe illustrated in the node sum of CCN registration;
K represents active node ratio thresholding coefficient;
N CAF_maxRepresent the continuous access failure of recent maximum (Continuous AccessFailure the is called for short CAF) number of times in all nodes;
N CAF_max(i) the continuous access failure number of times of recent maximum of expression node i, i represents certain node in each node;
N CAF_1The expression first continuous access failure number of times threshold value;
N CAF_2The expression second continuous access failure number of times threshold value;
N AR_CExpression inserts the request collision frequency continuously;
N Collision_maxThe maximum collision frequency that inserts of expression;
S represents the access slot number;
N No-PKT(i) the current poll node i of expression and the gap periods number of this node of poll next time.
CCN determines that current traffic level has two kinds of methods.
Wherein a kind of method is, CCN collects, adds up successful traffic carrying capacity (being current throughput) according to the situation that receives traffic packets, represent the first traffic carrying capacity threshold value of light traffic thresholding with default being used to then and be used to represent that the second traffic carrying capacity threshold value of heavy traffic carrying capacity thresholding compares, determine current traffic level and select corresponding channel access way.Detailed process comprises as shown in Figure 1:
Step 111, CCN make regular check on the business transmission situation record and the business statistics situation of each node, collect, add up successful traffic carrying capacity according to the situation that receives traffic packets, obtain current throughput S Current
Step 112, CCN judge S CurrentWhether less than S The 1-thresholding, be to determine that then current traffic level is a light traffic, execution in step 113; Otherwise forward step 114 to.
Step 113, CCN select light traffic channel access way, and announce to each node of described CCN control, forward step 117 to.
Step 114, CCN judge S CurrentWhether less than S The 2-thresholding, be then determine current traffic level be in/heavy traffic, execution in step 115; The traffic carrying capacity otherwise definite current traffic level is attached most importance to forwards step 116 to.
During step 115, CCN select/heavy traffic channel access way, and, forward step 117 to each node announcement that described CCN controls.
Step 116, CCN select heavy traffic channel access way, and announce to each node of described CCN control.
Whether step 117, the cycle of making regular check on arrive, are then to forward step 111 to, otherwise execution in step 118.
Step 118, continue to use before selected multiple access method, forward step 117 to and carry out.
CCN can also count the node number that sends traffic packets at no distant date when the business transmission situation record of making regular check on each node and business statistics situation, for selective channel access way more accurately, center control nodes is compared current throughput with the default first traffic carrying capacity threshold value and the second traffic carrying capacity threshold value, if the current business throughput is during greater than the second traffic carrying capacity threshold value, can also promptly send the node number of traffic packets by the node number that will have grouping to send at no distant date at no distant date, with the certain proportion value kN of node sum NodeCompare, thereby determine current traffic level exactly, so that select optimum channel access way.As shown in Figure 2, also comprise in the last flow process: step 119, CCN judge that the node number that sends traffic packets at no distant date is whether less than the certain proportion value kN of node sum Node, if less than, then determine current traffic level be in/heavy traffic, execution in step 115; Otherwise, determine the current traffic level traffic carrying capacity of attaching most importance to, execution in step 116.The step 114 that goes up simultaneously in the flow process correspondingly changes into: step 114 ', CCN judges S CurrentWhether less than S The 2-thresholding, be then determine current traffic level be in/heavy traffic, execution in step 115; Otherwise, forward step 119 to.
S The 1-thresholdingDesirable 0.1,0.15,0.2,0.25 etc., S The 2-thresholdingDesirable 0.7,0.75,0.8,0.85 etc.K is an active node ratio thresholding coefficient, k desirable 0.1,0.05,0.01,0.005,0.001 etc., and concrete value can send traffic carrying capacity according to reality to be determined, promptly all finishes common transmission traffic carrying capacity at each node and (is made as λ 0) under the prerequisite, finally make normalization total traffic G (=kN Nodeλ 0) greater than certain value, as G more than or equal to 0.8; In addition, the concrete value of k also can (be made as η with the ratio of poll groupings length and traffic packets length P/PKT) relevant, can be as the span of k at k≤0.1 η P/PKTIn, generally, desirable k=0.1 η P/PKT
Make regular check on definite method in cycle: the cycle of making regular check on is that frame time length is met the integral multiple that required transmission traffic packets is counted product with once communicating by letter.
CCN can also determine current traffic level by preceding traffic level and other parameters of once determining under the situation of clear and definite previous traffic level, select corresponding channel access way.The current traffic level of once determining be in/during heavy traffic, CCN regularly seeks the opinion of the recent maximum access failure number of times continuously of each node, and with the default N that is used to represent the continuous access failure number of times of light traffic thresholding CAF_1And be used to represent the N of the continuous access failure number of times of heavy traffic carrying capacity thresholding CAF_2Compare, determine current traffic level, select corresponding channel access way.Detailed process comprises as shown in Figure 3:
The continuous access failure times N of recent maximum of each node is seeked the opinion of in step 121, CCN issue CAF_max
Step 122, each node send report sound separately, and its length is the N of a basic busy tone CAF_max(i) doubly.
Step 123, CCN promptly have N according to the current access collision situation of the short acquisition of the report duration of a sound CAF_max=max{N CAF_max(i) }, N CAF_maxRepresent current access collision situation.
Step 124, CCN judge N CAF_maxWhether less than N CAF_1, be to determine that then current traffic level is a light traffic, execution in step 125; Otherwise forward step 126 to.
Step 125, CCN select light traffic channel access way, and announce to each node of described CCN control, forward step 129 to.
Step 126, CCN judge N CAF_maxWhether less than N CAF_2, be then determine current traffic level be in/the heavy traffic grade, execution in step 127; The traffic level otherwise definite current traffic level is attached most importance to forwards step 128 to.
During step 127, CCN select/heavy traffic channel access way, and, forward step 129 to each node announcement that described CCN controls.
Step 128, CCN select heavy traffic channel access way, and announce to each node of described CCN control.
Whether step 129, the cycle of seeking the opinion of arrive, are then to forward step 121 to, otherwise execution in step 1210.
Step 1210, continue to use before selected multiple access method, forward step 129 to.
N CAF_1And N CAF_2Can determine according to the empirical value that effectively carries out the traffic packets transmission.
When the current traffic level of once determining was light traffic, CCN was with regularly interior continuous access request collision frequency and insert the collision frequency threshold value, as maximum access collision frequency, compares, thereby determines current traffic level.Detailed process comprises as shown in Figure 4:
Step 131, the default initial continuous access request collision frequency N of CCN AR_C=0.
Step 132, CCN monitor channel send situation.
Whether step 133, CCN receive the request of inserting (Access Requirement is called for short AR) grouping, are execution in step 134 then, otherwise execution in step 132.
Whether step 134, AR grouping collides, and is execution in step 135 then, otherwise forwards step 136 to.
Step 135, the continuous request collision frequency that inserts add 1, i.e. N AR_C=N AR_C+ 1, forward step 138 to and carry out.
Step 136, access request collision frequency zero clearing continuously, i.e. N AR_C=0.
Step 137, continue to continue to use light traffic channel access way, forward step 132 to.
Step 138, N AR_CWhether insert collision frequency N greater than maximum Collision_max, be then determine current traffic level be in/heavy traffic, execution in step 139, otherwise determine that current traffic level is a light traffic forwards step 137 to.
During step 139, CCN are selected/heavy traffic channel access way, and announce to each node of described CCN control.
When the current traffic level of once determining is attached most importance to traffic carrying capacity, CCN will send the interstitial content of traffic packets at no distant date and compare with the certain proportion value of node sum, determine current traffic level.Detailed process comprises as shown in Figure 5:
Step 141, CCN make regular check on the record that each node sends the traffic packets situation.
Step 142, CCN judge that the interstitial content that sends traffic packets at no distant date is whether less than the certain proportion value kN of node sum Node, if less than then determine current traffic level be in/heavy traffic, execution in step 143; The traffic carrying capacity otherwise definite current traffic level is attached most importance to forwards step 144 to.
During step 143, CCN are selected/heavy traffic channel access way, and announce to each node of described CCN control.
Step 144, continue to continue to use heavy traffic channel access way, forward step 141 to and carry out.
If adopt light traffic channel access way, after CCN correctly receives the solicited message of the access reservation (AR) that a node of its control sends, send this node to each node and insert successful declaration information, promptly send this node of declaration and inserts successfully, informed successfully, simultaneously that other nodes need dodge this node and send traffic packets until this node so that inform the access of this node by inserting successfully (AS) grouping.Detailed process comprises as shown in Figure 6:
Step 211, each node send AR grouping, wherein can contain to remain the sending service block length in packets headers.
Whether step 212, CCN utilize the access that inserts successfully (AS) grouping declaration node successful, wherein can announce the length of institute's sending service grouping in packets headers.
The node that step 213, related application insert sends traffic packets (PKT), and other node will be avoided the long enough time, so that allow the successful node of this access successfully distribute traffic packets.
Step 214, CCN send and confirm grouping or the subsidiary traffic packets of confirming mark.
Whether this node of marker for judgment during step 215, CCN divide into groups according to node traffic has all sent the traffic packets of this meeting, is then, execution in step 211, otherwise, forward step 213 to.
In above-mentioned AR, AS packets headers,, then adopt default standard traffic packets length if do not comprise traffic packets length.
Light traffic channel access way drawn the accidental channel access way in hour low access delay, low packet collisions rate of traffic carrying capacity, can finish the advantage that all current business groupings send transmission fully.
If in adopting/and heavy traffic channel access way, CCN seeks the opinion of each node, according to the collision situation of each node each node is divided into groups, and the node in every group inserts by the access slot of competing in this group.Wherein CCN as shown in Figure 7, comprising according to the step that the collision situation of each node divides into groups each node:
The continuous access failure number of times of recent maximum (N is seeked the opinion of in step 221, CCN issue CAF_max), so that understand current traffic carrying capacity and insert collision situation.
Step 222, each node send report sound separately, and its length is the N of a basic report sound (or busy tone) CAF_max(i) doubly.
Step 223, CCN obtain N according to the length of report sound CAF_max (=max{ N CAF_max(i) }).
Step 224, will institute be divided into N under the linchpin node CAF_maxIndividual group.
The step that node in every group inserts by the access slot of competing in this group as shown in Figure 7, comprising:
Step 225, select every group node to point out access successively, when certain group of prompting, can only belong to the qualified access that is at war with of node of this group.
S access slot arranged for this group interior nodes competition after step 226, prompting insert, the node that the transmission of dividing into groups arranged in this group is according to the access that is at war with of selection certain access slot wherein someway.
Whether have node to participate in the competition in step 227, this group, be execution in step 228 then; Otherwise forward step 229 to.
Step 228, competition insert and whether to send collisionless, are then to forward step 2210 to; Otherwise forward step 2211 to.
Step 229, CCN select next group node to insert, and forward step 226 to.
Step 2210, CCN arrange relevant successful access node to send traffic packets, forward step 2212 to.Send traffic packets by CCN earlier, wherein can attach a certain successful access node of poll, thereafter should the success access node or relevant successful access node send traffic packets, promptly on the channel resource of its distribution, send traffic packets, then CCN sends traffic packets again, is that another successful access node sends traffic packets afterwards, and the rest may be inferred, CCN and all successful access nodes alternately send traffic packets, enter reservation access next time and traffic packets after distributing and send the stage.If successful access node is finished all traffic packets of this meeting and is sent, this node discharges resource so, the subsidiary channel resource sign that discharges in last traffic packets of this meeting sends, after CCN received, the next frame after this can arrange the traffic packets of other successful access nodes to send at this channel resource.
The traffic packets of step 2211, the successful access node of arrangement sends, and the node of success access waits for that next frame reattempts access, forwards step 226 execution to.
Step 2212, judging whether the cycle of seeking the opinion of arrive, is execution in step 221 then, otherwise execution in step 229.
Selecting time slot method can be that equiprobability is selected at random, also can be to obey certain probability distribution to select.
Definite method of access slot number is: if there is not available channel resource, then the number of access slot becomes 0, treats to become non-0 behind the available channel resource; If it is many to insert collision, increase the number of access slot; If it is few to insert collision, reduce the number of access slot, until being 1.
Utilize the control grouping to broadcast announcement after the division group, wherein contain group's number N CAF_max, the division group border listed in successively node ID (ID), be divided into 3 groups as 3,01001,10110 expressions, ID number is the 1st group smaller or equal to 01001 node, and ID number is the 3rd group greater than 10110 node, and marginal node belongs to the 2nd group.
CCN seeks the opinion of grouping every the some cycles issue, so that obtain continuous access failure number of times maximum in each node.The continuous access failure number of times of the recent maximum of each node is exactly the recent maximum collision frequency N that inserts continuously of this node CAF_max(i), its report duration of a sound degree is the N of a basic report sound (or busy tone) CAF_max(i) doubly, if i.e. continuous 5 access failures of certain node, this node is sent out 5 basic report sounds of busy tone to the time slot.
If successful access node is finished all traffic packets of this meeting and is sent, so just in last traffic packets that sends this meeting, attach and discharge the channel resource sign, this node stop is used the channel resource to its distribution after distributing, after CCN received, the next frame after this can arrange the traffic packets of other successful access nodes to send at this channel resource.
In/heavy traffic channel access way drawn multi-address access method according to requirement and greatly reduced concealed terminal and exposed terminal influence in the reservation when traffic carrying capacity is higher, has eliminated in the traffic packets transmission and collided possible advantage, flexibly reservation insert and method of adjustment can so that node more quickly and efficiently access channel, finish the no conflict transmission of traffic packets to greatest extent.
If adopt heavy traffic channel access way, each node of CCN poll, if a wherein node of poll need not to send traffic packets, then CCN increases the polling cycle number to this node; If this node need send traffic packets, then this node the CCN poll it the time send traffic packets and CCN and continue this node of poll from following one-period.CCN can come each node of poll by the traffic packets of subsidiary poll vertex ticks or the traffic packets of subsidiary priority limit markers.
In the heavy traffic channel access way, when CCN comes each node of poll by the traffic packets of subsidiary poll vertex ticks, if in this polling cycle certain node do not have that professional grouping sends and last time this node of polling cycle have traffic packets to send, then CCN following one-period this node of poll not, if still not having professional grouping once more during this node of poll sends, then many more empty one-periods are this node of poll again, the rest may be inferred, do not have when polled several times traffic packets to send if having, then need at interval several all after dates this node of poll again.In case node has traffic packets to send when once polled, do not have the gap periods of transmission number and just reduce to 0, promptly following one-period rises and continues this node of poll.Paddle wheel is ask the situation of change in cycle with the some nodes of poll below, and detailed process comprises as shown in Figure 8:
Step 23a1, CCN set certain node does not have the periodicity of transmission N No-PKT(i)=0, promptly represent in each polling cycle all this nodes of poll.
Step 23a2, CCN utilize the traffic packets of subsidiary this vertex ticks of poll to send or poll groupings transmission (when do not have traffic packets to send this moment) comes this node of poll;
Whether step 23a3, this node need to send traffic packets, are execution in step 23a4 then, otherwise execution in step 23a5;
Step 23a4, this node send traffic packets.At this moment still need this node of poll, CCN remembers N next time No-PKT(i)=0, forwarding step 23a6 to carries out;
Step 23a5, this node are replied to CCN and be need not to send traffic packets.At this moment many again sky one-period these nodes of poll, CCN remembers N No-PKT(i)=N No-PKT(i)+1;
Step 23a6, CCN check the N of this node of following one-period No-PKT(i);
Step 23a7, CCN judge N No-PKTWhether be 0 (i), be execution in step 23a8 then, otherwise execution in step 23a9;
Step 23a8, CCN utilize the traffic packets of subsidiary this poll vertex ticks to come this node of poll, forward step 23a3 to and carry out;
Step 23a9, CCN judge this cycle this node of poll not, wait for entering following one-period, and CCN remembers N No-PKT(i)=N No-PKT(i)-1, forwarding step 23a6 to carries out.
The gap periods number that is reduced among the gap periods number that is increased among the wherein above step 23a5 and the step 23a9 can consistent, also can be inconsistent, be not limit by above-mentioned increase by 1 (reducing 1) yet, can be set to the function that a certain obedience increases progressively (or successively decreasing) rule on demand and get final product, as N with the increase (or reducing) that shows the cycle space-number No-PKT(i)=aN No-PKT(i)+b and N No-PKT(i)=N No-PKT(i)/a-b (wherein, a and b are coefficient, a 〉=1, b 〉=0), and for example N No-PKT(i)=2 Nno-PKT (i)And N No-PKT(i)=log 2[N No-PKT(i)+1] etc.
In the heavy traffic channel access way, when CCN passes through each node of traffic packets poll of subsidiary priority limit markers, node with enough priority service groupings can insert the use channel, and CCN can screen the node of the not enough node of priority, the next enough priority of direct poll.Do not need to send if certain node has the traffic packets that is higher than this priority in this polling cycle, then CCN following one-period this node of poll not, if still not having the traffic packets that is higher than this priority once more during this node of poll needs to send, then many more empty one-periods are this node of poll again, the rest may be inferred, if having does not have the traffic packets that is higher than this priority when polled several times and need to send, then need at interval several all after dates this node of poll again.In case node has the traffic packets that is higher than this priority to need to send when once polled, do not have the gap periods of transmission number and just reduce to 0, promptly following one-period rises and continues this node of poll.Ask the situation of change in cycle below with CCN paddle wheel by a certain node of traffic packets poll of subsidiary priority limit markers, detailed process as shown in Figure 9:
Step 22b1, CCN set certain node does not have the periodicity of transmission N No-PKT(i)=0.
Step 23b2, CCN utilize the traffic packets of subsidiary priority limit markers to send or poll groupings transmission (when do not have traffic packets to send this moment) comes this node of poll;
Step 23b3, judging whether this node has the traffic packets that is higher than this priority to need to send, is execution in step 23b4 then, otherwise execution in step 23b5.
Step 23b4, this node send traffic packets.At this moment still need this node of poll, CCN remembers N next time No-PKT(i)=0, forwarding step 23b6 to carries out.
Step 23b5, this node are replied to CCN and be need not to send traffic packets.CCN remembers N No-PKT(i)=N No-PKT(i)+1.
Step 23b6, CCN check the n of this node of following one-period O-PKT(i).
Step 23b7, CCN judge N No-PKTWhether be 0 (i), be execution in step 23b8 then, otherwise execution in step 23b9.
Step 23b8, CCN utilize subsidiary this node of priority limit markers poll, forward step 23b3 to and carry out.
Step 23b9, CCN remember n O-PKT(i)=N No-PKT(i)-1, forwarding step 23b6 to carries out.
The gap periods number that is reduced among the gap periods number that is increased among the wherein above step 23b5 and the step 23b9 can consistent, also can be inconsistent, be not limit by above-mentioned increase by 1 (reducing 1) yet, can be set to the function that a certain obedience increases progressively (or successively decreasing) rule on demand and get final product, as N with the increase (or reducing) that shows the cycle space-number No-PKT(i)=aN No-PKT(i)+b and N No-PKT(i)=N No-PKT(i)/a-b (wherein, a and b are coefficient, a 〉=1, b 〉=0), and for example N No-PKT(i)=2 Nno-PKT (i)And N No-PKT(i)=log 2[N No-PKT(i)+1] etc.
Heavy traffic channel access way, drawn does not have the conflict poll as required multiple access method when traffic carrying capacity is heavy the most fair, satisfy the advantage that the traffic packets that needs most is transmitted to greatest extent.In/multiple access method under the heavy traffic situation also can adopt the priority restriction, so that guarantee that the traffic packets of high priority preferentially obtains sending.
More than in/the heavy traffic channel inserts and heavy traffic channel inserts the transmission that is particularly suitable for real time business, can guarantee service quality (QoS) requirements such as time delay and required transmission rate.The fairness problem that is occurred when traffic carrying capacity increases can utilize that CCN adjusts, restriction individual nodes too much successfully inserting and carry out as required that poll solves in reservation.
Because all kinds of groupings of CCN send and can be received by each node; all adopted CCN and each node alternately to send the interactive form of all kinds of groupings in the various channel access waies among the present invention simultaneously under the different business amount situation; therefore CCN utilizes the AS grouping; the transmission of all kinds of groupings such as traffic packets and poll groupings can be used as the synchronous base that each node sends all kinds of groupings; promptly divide into groups with AS; time reference when compete access or send traffic packets as all nodes the finish time that traffic packets and poll groupings etc. send; here each time slot has comprised the transmitting time of all kinds of groupings and has overcome signal transmission delay; transceiver change-over time etc. necessary guard time at interval, thereby realized the multiple access access procedure of each node under the asynchronous condition.
Among the present invention, CCN and each node only have a semiduplex transceiver, and equipment requirements is simple.In addition, the present invention be applicable to any a plurality of node can with CCN by the broadcast type medium be connected communication the multinode access infrastructure.
In a word, the present invention combines the advantage of various channel access waies under different business amount situation, has avoided relevant shortcoming simultaneously, but reaches finally that channel throughput height, access delay are little, the low asynchronous system work of discarded ratio of packet, QoS are guaranteed, channel uses the purpose fair, that the transceiver equipment requirement is simple, the scope of application is extensive.
Channel Transmission comprises two stages in period, and the node that promptly has grouping to send obtains the transmit stage as required of usufructuary self adaptation reservation access phase of channel resource and node transmission traffic packets.In access phase, CCN can dynamically adjust the channel access way according to the situation of traffic carrying capacity, the node that respectively has grouping to send inserts according to corresponding channel access way, CCN is each successful access node allocation of channel resources may then, thereafter enter transmit stage, the channel resource that each node utilization is distributed carries out conflict free traffic packets and sends.
CCN in the embodiment of the invention and each node only have a semiduplex transceiver, and equipment requirements is simple.In order to realize above-mentioned self-adaptive multi-address access method, CCN as shown in figure 10, also comprises monitoring means 1, is used to monitor each node of described CCN control; And deciding grade and level unit 2, be connected with monitoring means 1, be used for determining current traffic level and selecting corresponding channel access way according to the monitoring information that receives.The deciding grade and level unit will select corresponding channel access way to return to monitoring means, and announce to each node of described CCN control by the transceiver of CCN simultaneously.
When the channel access way of selecting not simultaneously, the monitoring function that monitoring means need start is also different, when being light traffic channel access way, after the solicited message that the node-sent reserved of its control of receiving CCN inserts, if this node inserts successfully, CCN sends the declaration information that this node successfully inserts to each node, thereby except informing that this node inserts successfully, inform that also other nodes need dodge this node and send traffic packets until this node, intact back CCN sends out and confirms grouping or the subsidiary traffic packets of confirming mark.In being/during heavy traffic channel access way, CCN need seek the opinion of each node, obtain the recent maximum access failure number of times continuously of each node, according to the collision situation of each node each node is divided into groups, the node in every group inserts by the access slot of competing in this group.
When attaching most importance to the traffic channel access way, CCN needs each node of poll, judges whether the node of poll needs to send traffic packets, is then to arrange this node access and continue this node of poll in following one-period; Otherwise increase polling cycle number to this node.
Again as shown in figure 10, described monitoring means comprises: declaration module 11 is used for sending the declaration information that a node wherein successfully inserts to other nodes; Seek the opinion of module 12, be used to seek the opinion of each node and obtain the recent maximum access failure number of times continuously of each node; Poll module 13 is used for each node of poll, judges whether the node of poll needs to send traffic packets, is then to arrange this node access and continue this node of poll in following one-period; Otherwise increase polling cycle number to this node; Scheduler module 10 is used for described declaration module 11, seeks the opinion of module 12, poll module 13 is connected respectively, is used for calling the monitoring means corresponding functional modules according to the selected channel access way in deciding grade and level unit.
It should be noted last that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail with reference to preferred embodiment, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and scope of technical solution of the present invention.

Claims (11)

1, a kind of self-adaptive multi-address access method is characterized in that, comprising:
Center control nodes is determined current traffic level, each node announcement of selecting corresponding channel access way and controlling to described center control nodes;
Each node inserts according to the channel access way of being received.
2, method according to claim 1, it is characterized in that, described center control nodes determines that current traffic level comprises: center control nodes is compared current throughput with the default first traffic carrying capacity threshold value and the second traffic carrying capacity threshold value, if current throughput, determines then that current traffic level is a light traffic less than the first traffic carrying capacity threshold value; If current throughput is between the first traffic carrying capacity threshold value and the second traffic carrying capacity threshold value, then definite current traffic level be in/heavy traffic; If current throughput is greater than the second traffic carrying capacity threshold value, then determine the current traffic level traffic carrying capacity of attaching most importance to.
3, method according to claim 2, it is characterized in that, described center control nodes is compared current throughput with the default first traffic carrying capacity threshold value and the second traffic carrying capacity threshold value, if the current business throughput is greater than the second traffic carrying capacity threshold value, also comprise: center control nodes judges that the interstitial content send traffic packets at no distant date is whether less than the certain proportion value of node sum, if less than, then determine current traffic level be in/heavy traffic; Otherwise, determine the current traffic level traffic carrying capacity of attaching most importance to.
4, method according to claim 1, it is characterized in that, described center control nodes determines that current traffic level comprises: the current traffic level of once determining be in/during heavy traffic, center control nodes is regularly seeked the opinion of the recent maximum access failure number of times continuously of each node, and compare with the default first continuous access failure number of times threshold value and the second continuous access failure number of times threshold value, if less than the first continuous access failure number of times threshold value, determine that then current traffic level is a light traffic; If between the first continuous access failure number of times threshold value and the second continuous access failure number of times threshold value, then definite current traffic level be in/heavy traffic; If greater than the second traffic carrying capacity threshold value, then determine the current traffic level traffic carrying capacity of attaching most importance to;
When the current traffic level of once determining is light traffic, the center control nodes continuous access request collision frequency of each node is at no distant date compared with access collision frequency threshold value, if greater than inserting the collision frequency threshold value, then determine current traffic level be in/heavy traffic; Otherwise determine that current traffic level is a light traffic;
When the current traffic level of once determining is attached most importance to traffic carrying capacity, center control nodes will send the interstitial content of traffic packets at no distant date and compare with the certain proportion value of node sum, if less than the certain proportion value of node sum, then determine current traffic level be in/heavy traffic; The traffic carrying capacity otherwise definite current traffic level is attached most importance to.
5, method according to claim 1 is characterized in that, each node inserts according to the light traffic channel access way of being received and comprises: each node sends the solicited message that reservation inserts to center control nodes; Center control nodes sends wherein to other nodes that a node inserts successful declaration information, is used to inform that other nodes dodge this node and send traffic packets until this node.
6, method according to claim 1, it is characterized in that, each node according in being received/heavy traffic channel access way inserts and comprises: center control nodes is seeked the opinion of each node, collision situation according to each node divides into groups each node, and the node in every group inserts by the access slot of competing in this group.
7, method according to claim 6, it is characterized in that center control nodes divides into groups each node to comprise according to the collision situation of each node: the report sound that center control nodes sends by each node calculates the maximum access failure number of times continuously that indicates collision situation; Each node is divided into groups by the continuous access failure number of times of maximum.
8, method according to claim 1, it is characterized in that, each node inserts according to heavy traffic channel access way and comprises: each node of center control nodes poll, associated packets according to node sends to judge whether needs send traffic packets to polled node, is then from this node of continuation of following one-period poll; Otherwise increase polling cycle number to this node.
9, method according to claim 8 is characterized in that, described each node of center control nodes poll is specially: center control nodes is by the traffic packets of subsidiary poll vertex ticks or each node of traffic packets poll of subsidiary priority limit markers.
10, a kind of center control nodes is characterized in that, comprising: monitoring means is used to monitor each node that described center control nodes is controlled; And the deciding grade and level unit, be connected with monitoring means, be used for determining current traffic level and selecting corresponding channel access way according to the monitoring information that receives.
11, center control nodes according to claim 10 is characterized in that, described monitoring means comprises:
The declaration module is used for sending the declaration information that a node wherein successfully inserts to other nodes;
Seek the opinion of module, be used to seek the opinion of each node and obtain the recent maximum access failure number of times continuously of each node;
The poll module is used for each node of poll, judges according to the associated packets transmission of node whether needs send traffic packets to polled node, is then from this node of continuation of following one-period poll; Otherwise increase polling cycle number to this node;
Scheduler module is used for described declaration module, seeks the opinion of module, the poll module is connected respectively, is used for calling the monitoring means corresponding functional modules according to the selected channel access way in deciding grade and level unit.
CNB2007100637594A 2007-02-08 2007-02-08 Self-adaptive multi-address access method and central control node Expired - Fee Related CN100466492C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007100637594A CN100466492C (en) 2007-02-08 2007-02-08 Self-adaptive multi-address access method and central control node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007100637594A CN100466492C (en) 2007-02-08 2007-02-08 Self-adaptive multi-address access method and central control node

Publications (2)

Publication Number Publication Date
CN101034933A true CN101034933A (en) 2007-09-12
CN100466492C CN100466492C (en) 2009-03-04

Family

ID=38731263

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007100637594A Expired - Fee Related CN100466492C (en) 2007-02-08 2007-02-08 Self-adaptive multi-address access method and central control node

Country Status (1)

Country Link
CN (1) CN100466492C (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101860942A (en) * 2010-05-28 2010-10-13 上海顶竹通讯技术有限公司 Method for distinguishing terminal access mode
TWI466572B (en) * 2008-06-05 2014-12-21 Ericsson Telefon Ab L M Wireless communication network and method and system therein
CN104581967A (en) * 2013-10-11 2015-04-29 中国移动通信集团公司 Method for adjusting contention access resource, and method and device for sending contention access request
CN107580333A (en) * 2013-03-22 2018-01-12 华为技术有限公司 OFDMA competing methods and access point
CN103974392B (en) * 2014-04-09 2018-03-09 东莞市巨细信息科技有限公司 One-to-many wireless communications method
CN109548168A (en) * 2018-12-19 2019-03-29 北航（四川）西部国际创新港科技有限公司 Adaptive hierarchical multiple access method and its system in highly dynamic radio network
CN109714807A (en) * 2019-01-16 2019-05-03 南京航空航天大学 A kind of cognition wireless network cut-in method based on common control channel

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100837351B1 (en) * 2002-04-06 2008-06-12 엘지전자 주식회사 Update method for radio link parameter of mobile communication system
CN1719931A (en) * 2004-07-07 2006-01-11 株式会社Ntt都科摩 Channel allocation method
CN100433716C (en) * 2005-08-16 2008-11-12 中兴通讯股份有限公司 System and method for supporting multi-carrier downlink high-speed data packet access

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI466572B (en) * 2008-06-05 2014-12-21 Ericsson Telefon Ab L M Wireless communication network and method and system therein
CN101860942A (en) * 2010-05-28 2010-10-13 上海顶竹通讯技术有限公司 Method for distinguishing terminal access mode
CN107580333A (en) * 2013-03-22 2018-01-12 华为技术有限公司 OFDMA competing methods and access point
CN107580333B (en) * 2013-03-22 2022-04-05 华为技术有限公司 OFDMA competition method and access point
CN104581967A (en) * 2013-10-11 2015-04-29 中国移动通信集团公司 Method for adjusting contention access resource, and method and device for sending contention access request
CN104581967B (en) * 2013-10-11 2018-12-28 中国移动通信集团公司 Contention access resource adjusting method, contention access request sending method and device
CN103974392B (en) * 2014-04-09 2018-03-09 东莞市巨细信息科技有限公司 One-to-many wireless communications method
CN109548168A (en) * 2018-12-19 2019-03-29 北航（四川）西部国际创新港科技有限公司 Adaptive hierarchical multiple access method and its system in highly dynamic radio network
CN109714807A (en) * 2019-01-16 2019-05-03 南京航空航天大学 A kind of cognition wireless network cut-in method based on common control channel
CN109714807B (en) * 2019-01-16 2021-03-23 南京航空航天大学 Cognitive radio network access method based on common control channel

Also Published As

Publication number Publication date
CN100466492C (en) 2009-03-04

Similar Documents

Publication Publication Date Title
CN1218591C (en) Dynamic allocation of packet data channels
CN101034933A (en) Self-adaptive multi-address access method and central control node
CN1310540C (en) Base station, wireless resource control device, mobile station, communication system and communication method
CN1145283C (en) Appts. and method for designating reverse common channel for dedicated communication in mobile communication system
CN1170378C (en) Reverse data transmission method and appts. in mobile communication system
CN101040498A (en) Uplink scheduling method in voice over internet protocol transmission
CN1723638A (en) Be used in the mobile communication system control and insert at random to prevent the method for collision between uplink messages
CN1947379A (en) Adaptive beacon period in a distributed network
CN1104177C (en) Packet channel feedback
CN101076176A (en) Method for allocating user apparatus service resource in mobile telecommunication system
CN1787468A (en) Method of controlling quality of service for a wireless lan base station apparatus
CN1849836A (en) System, apparatus and method for uplink resource allocation
CN101032125A (en) Network array, forwarder device and method of operating a forwarder device
CN1717069A (en) The method of effective communicating control information in the multimedia broadcast/multicast service
CN105052096A (en) Broadcast control bandwidth allocation and data transceiving method and apparatus
CN1780240A (en) Distributed wireless access method and apparatus based on network distribution vector table
CN1957565A (en) Wireless communication network and method for transmitting packets over channel in wireless communication network
CN101035074A (en) Non-confliction on-demand multi-address access method
CN1832368A (en) Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
CN1618248A (en) Station apparatus, method for resource allocation in station apparatus and mobile communication system
CN1744550A (en) Wireless communication device, a wireless communication system and a wireless communication method
CN1889750A (en) Channel distributing method in mixed network
CN101039238A (en) Radio communication system, radio communication device and radio communication method
WO2010028604A1 (en) Method, device and base station for frequency band allocation
CN1631012A (en) Scheduling method and apparatus for half-duplex transmission

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090304

Termination date: 20160208

CF01 Termination of patent right due to non-payment of annual fee