CN1276120A - Identification method, a terminal realizing such a method and an access communication network including such a terminal - Google Patents
Identification method, a terminal realizing such a method and an access communication network including such a terminal Download PDFInfo
- Publication number
- CN1276120A CN1276120A CN 97182391 CN97182391A CN1276120A CN 1276120 A CN1276120 A CN 1276120A CN 97182391 CN97182391 CN 97182391 CN 97182391 A CN97182391 A CN 97182391A CN 1276120 A CN1276120 A CN 1276120A
- Authority
- CN
- China
- Prior art keywords
- terminal
- idi
- identifier
- identifiers
- idy
- 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
Links
Images
Landscapes
- Small-Scale Networks (AREA)
Abstract
The invention relates to an identification method for use in a multiple access communication network wherein a terminal with a predefined identifier desires access to the network. The identification method includes distribution of a grant message, which defines an identifier range, from a controller to a plurality of terminals which includes the terminal. The method further includes comparing the result of a reordering in a predefined way by the terminal of a plurality of elements included in the identifier with the identifier range in order to decide whether the terminal receives access or not, e. g. the reversing of bits of a binary number comparing with the identifier range.
Description
The present invention relates to as claim 1 recognition methods that is used for the multichannel Access Network described in aforementioned, the access communication network of the terminal of this method of realization as claim 4 described in aforementioned and the terminal as comprising described in claim 5 is aforementioned.
The professional has known this method that is used for the multichannel access, for example, shows " digital communication basis and application " book with reference to BernardSkar, publishes Prentice Hall/ADivision of Simon in 1988; Schuster-Englewood Cliffs, New Jersey 07632, ISBN#0-13-212713-X 025.In the 9th chapter " multiplexed and multichannel inserts ",, describe the distribution according to need multichannel and insert (DAMA) method particularly at the 497th page.Different with the fixed allocation method, in the fixed allocation method, a terminal regularly inserts common signal channel, and is irrelevant with its actual needs; It is a dynamic allocation method that the distribution according to need multichannel inserts, and in the method, a terminal has only just enter common signal channel when its request inserts.
In the 505th page of a kind of like this method of description of this chapter, giving has the method that inserts a plurality of user's orderings that require at random.Utilize inquiring technology to inquire about different terminals in the Access Network termly, to determine their service request.The professional knows various inquiring technologies.In order to explain the present invention, below describe in these inquiring technologies specific a kind of, that is, and anonymous sorting technique.Anonymous sorting technique gives each the terminal regulation in the Access Network unique terminal identifier.For example, this terminal identifier is the unique number that is shown as with bit table, stamps the marking by means of memory in the hardware of this terminal.So-called allowance message controller from Access Network on normal basis is distributed to different terminals.Range of identifiers that this has permitted message specifies, for example, can be by lower limit terminal identifier and upper limit terminal identifier regulation.Requirement enters each terminal of network, under the situation in its terminal identifier drops on this range of identifiers, allows it to react to permitting message.
Yet if different terminals requires to insert simultaneously, and its identifier all drops in the identical identifier scope, contention occurs.These terminals are reacted to identical allowance message, will produce conflict.This range of identifiers is divided into subrange, and anonymous sorting technique can be proceeded.For example, this subrange is half of this range of identifiers, and by lower limit terminal identifier and intermediate terminals identifier specifies, it is divided into about equally two parts to previous scope.The next one allowance distribution of messages of stipulating this subrange if a plurality of identifiers drop in this subrange, then occurs contention to each terminal once more.By cutting apart population of terminals continuously, search technique continues operation, up to only staying the single terminal that requires access.At this moment, the terminal that stays receives and inserts; This operation constantly repeats, and enters into communication network up to producing single terminal again, can receiving.
Yet,, utilize the allowance information query needed time of population of terminals to become excessive added burden if population of terminals quantity is very big and communication service is paroxysmal.This point is very clearly in following example.Because a company produces and provide the terminal of a series of identifiers in succession, the house in the same vicinity is unlikely so that the terminal arrangement near identifier to be arranged.The imagination is connected to two terminals of identical tree in the Access Network, and their identifier only differs a numeral, and for example, only there is difference their address on least significant bit.After this tree collapse in the network, all users of this tree attempt login in the time much at one.Plenty of time has lost because the adjacent end with closely similar address is attempted login in the time much at one, up to be divided into tree very rudimentary also occur congested.Along with increasing of terminal number, therefore unique terminal identifier number also increases, and it is more serious that this problem just becomes.
The purpose of this invention is to provide a kind of recognition methods that is used for the multichannel access communication network, realize the terminal and the access communication network that comprises this terminal of this method; For example, more than known method, but do not have the shortcoming of above-mentioned excessive added burden and unacceptable identification to postpone.
According to the present invention, achieving this end is the method for describing by means of in the claim 1, the access communication network of describing in terminal of describing in the claim 4 and the claim 5.
The present invention handles this problem and provides so a kind of method, does not need range of identifiers constantly is divided into the identifier subrange.Basic thought of the present invention is by terminal a plurality of elements that are included in the terminal identifier scope to be compared according to result and the range of identifiers that preordering method reorders, to determine whether this terminal receives access.According to this method, originally dropped on a plurality of elements of neighbor address in the identical identifier scope, the result that reorders of these elements drops in the different range of identifiers now.
Really, in a plurality of terminals that roughly the same time requirement inserts, the adjacent end address of reordering of these terminals is no longer dropped in the identical scope, so, no longer to identical allowance message contention.In the contention of neighbor address terminal, produce less allowance message, therefore, waste the less time and be used for each terminal that requirement enters communication network.
In claim 2, describe a kind of possible embodiment of the present invention, and this embodiment is described with a suitable simple example.We suppose that terminal A and terminal B have the identifier of following binary system numeration respectively, 00 11 0 and 00 11 1, and these are adjacent identifiers, identifier value value of being respectively 6 in decimal system numeration and value 7.The element of the total value least significant bit that is arranged in identifier is placed on the higher effective bit position of total value of this identifier, can be achieved like this in this example, least significant bit in the binary system of the identifier numeration is placed in the binary system numeration of this identifier the 3rd, vice versa.The result that reorders of adjacent identifier becomes 00 01 1 and 00 11 1 among terminal A and the terminal B, identifier value value of being respectively 3 in decimal system numeration and value 7.It is big that distance between the adjacent identifier value that reorders becomes really, and therefore, the comparative result of these reorder identifier and range of identifiers or subranges just has difference in short time of delay.
Yet, very effective embodiment of the present invention is described in the claim 3.Really, the element in the adjacent identifier is fallen to arrange (reversing), therefore, the element that is positioned at least significant bit is rearranged the element position of preface to highest significant position, and the adjacent identifier that reorders drops in the different subranges at once.Utilize following example can be illustrated more clearly in this point: at the least significant and the leftmost position of identifier, these two identifiers are all in the subrange of AAAA to AAAE respectively for least significant bit among adjacent identifier AAAA and the AAAC and highest significant position; But, fall row's adjacent identifier BAAA with in CAAA drops on the different subranges of BAAA to BEEE and CAAA to CEEE respectively.
If terminal identifier is by the unique number regulation that is expressed as the position, then the row of falling of identifier is that least significant bit is placed on the position of highest significant position, time low order is placed on time high effective bit position, so, differentiated adjacent end identifier on the least significant bit of bit sequence end only, the difference between the two becomes on the highest significant position of bit sequence head end.
Should be noted that we are that example has been said clearly problem with the letter in a last joint, still, the present invention is not limited to the terminal identifier that is expressed as bit sequence, and the present invention also is not limited to the individual element that only is expressed as single position and reorders.Really, the dissimilar identifiers that the present invention can be applicable to have different expressions and passes through the inhomogeneity element, as long as an element of identifier takies position in the expression of this identifier, this identifier gives a kind of meaning for this position in the identifier value decision of determining according to system, uses this identifier in this system.In two following examples, this is given explanation.
Example 1:
Adjacent identifier:
Identifier A:Belgium@Antwerp@Vanhoof
Identifier B:Belgium@Antwerp@Wolters
Wherein
The highest effective unit: country; With
Minimum effective unit: name
Two identifiers all are included in following definite subrange:
Subrange A and B: with the country of " B " beginning;
Adjacent identifier obtains according to name and national reordering of exchanging:
Identifier A:Vanhoof@Antwerp@Belgium reorders
Identifier B:Wolters@Antwerp@Belgium reorders
Be included in following definite subrange:
The A subrange reorders: with the country of " V " beginning;
The B subrange reorders: with the country of " W " beginning;
Example 2:
Be expressed as the adjacent identifier of the unit representative of Grey binary reflex-code:
Identifier A (12 4 6): 1,010 0,110 0101
Identifier B (12 4 7): 1,010 0,110 0100
Wherein
The highest effective unit: first code block; With
Minimum effective unit: last code block
Two identifiers all are included in following definite subrange:
Subrange A and B: first code block 1010
(being equivalent to 12);
Adjacent identifier falls reordering of row according to code block and obtains:
Identifier A:0101 0,110 1010 reorders
Identifier B:0100 0,110 1010 reorders
Be included in following definite subrange:
The A subrange reorders: first code block 0101
(being equivalent to 6)
The B subrange reorders: first code block 0100
(being equivalent to 7)
Shall also be noted that term used in claims " comprises " should not being construed to is confined to the following device of listing.Therefore, diction sentence " equipment that comprises device A and B " should not be confined to the equipment only be made up of components A and B.Its meaning is that relevant parts are A and B in this equipment in the present invention.
Similarly, should be noted that it also is that term " connection " used in claims should not be construed to and is confined to just directly connect.Therefore, diction sentence " being connected to the device A of device B " should not be confined to such device or system, and the output of wherein installing A directly is connected to the input of device B.Its meaning is that the path between the output of A and the output of B can be a path that comprises other equipment or device.
With reference to embodiment being described below in conjunction with accompanying drawing, can clearer understanding the present invention above and other purpose and feature and understand content of the present invention better.
Fig. 1 represents the block diagram of a multichannel access communication network embodiment, wherein adopts method of the present invention;
Fig. 2 represents the operation of two the terminal recognition symbols of register pair that reorder that the present invention utilizes.
With reference to Fig. 1, we describe the recognition methods of being adopted in the multichannel access communication network.At first, by means of the functional block description shown in Fig. 1, the use of this recognition methods is described.Describe based on this, the professional can know clearly the effect of each functional block among Fig. 1, therefore no longer gives detailed description.In addition, give more detailed description for the operation principle of recognition methods of the present invention.
The multichannel access communication network comprises: controller C and a plurality of terminal T1, and T2 ..., Ti ..., T15, T16.Controller C is through tree network, that is, the cascade between common transport link and each user link is connected to each terminal T1, T2 ..., Ti ..., T15, T16.Too full for what Fig. 1 was squeezed, the more detailed block diagram of the terminal of only drawing Ti, and in another joint, give to describe.
Each terminal T1, T2 ..., Ti ..., T15, T16 have its own unique identifier, so that controller C is discerned.Too full for what Fig. 1 was squeezed, the identifier IDi of the terminal of only drawing Ti.Each identifier is determined by a plurality of elements.In order not make this description and accompanying drawing too loaded down with trivial details, in this specific embodiment, with 4 each identifiers of bit representation in succession.The included element and the value thereof of identifier of two terminals of only drawing in the drawings (that is, Ti and T2).
With reference to Fig. 2: the identifier IDi of expression terminal Ti, that is,
IDi-C; IDi-D) and the identifier ID2 of terminal T2, that is,
ID2-C; ID2-D).The value of stipulating each element in this specific embodiment is:
With
We suppose that these lists of elements are shown as binary number, and this binary number in decimal system counting method is:
With
Gui Ding value is represented the total value (in the bracket of Fig. 2) of identifier IDi and ID2 respectively herein.Should be noted that by means of the hardware memory (not shown) each rubidium marking in succession is on terminal in the identifier.
Should be noted that in order to describe the present invention, in this specific embodiment, preferably utilize the time division multiple access net of distribution according to need process, when a terminal request inserts, this terminal is entered in this network.In order to allow terminal T1, T2 ..., Ti ..., T15, a terminal among the T16 enters into the multichannel Access Network, adopts a kind of inquiring technology that is referred to as anonymous sorting technique.
This anonymous sorting technique comprises that inquiry terminal colony is to determine their service request termly.This is all terminal T1 that the allowance message G (IDx-IDy) that is used to self-controller C distributes to its field termly, T2 ..., Ti ..., T15, T16 finishes.This permits the scope IDx-IDy of message G (IDx-IDy) regulation identifier, and this scope is determined when terminal wishes to insert, and allows them that this is permitted those terminals that message G (IDx-IDy) reacts.Suppose range of identifiers IDx-IDy initial among this embodiment, this scope is to be determined by total value in the decimal system counting method of following two identifiers:
Range of identifiers IDx-IDy, wherein
T1:
With
T16：?
Range of identifiers
Allow total value to be equal to or greater than 0 and be equal to or less than each terminal of 15 and react.
Under the situation of allowance message being reacted more than a terminal, range of identifiers IDx-IDy is divided into subrange, and therefore, controller C distributes the allowance message of a following subrange of regulation.In this embodiment, suppose to cut apart the following first time:
Identifier subrange ID1-ID8, wherein
T1:
With
T8:
With
Identifier subrange ID9-ID16, wherein
T9:
With
T16：?
In case, terminal T1, T2 ..., Ti ..., T15 is unique this to be permitted the terminal that message responds one of among the T16, and then controller C just allows its to insert, and that terminal begins to enter into the embodiment of time-division multiple address system.For example, comprise that distance is balanced, the access procedure embodiment in synchronous and power is adjusted at exceeds scope of the present invention.Our purpose is to discern " winner " terminal that receives access procedure as quickly as possible.
As mentioned above, owing to only describe a terminal Ti in more detail, should be understood that the access procedure that other-end is implemented among this embodiment after this also is similar.Terminal Ti comprises following functional block:
-receiver RECi is used for slave controller C reception allowance message in succession;
-register the ORDi that reorders, each element of identifier ID i (IDi-A of the terminal Ti that is used for reordering; IDi-B; IDi-C; IDi-D).Can understand this point better with reference to Fig. 2: the register ORDi that reorders reads each element IDi-A of terminal identifier IDi seriatim from the hardware memory (not shown) of terminal Ti; IDi-B; IDi-C; IDi-D, the method for falling to arrange according to element reorders each element to its output, so provide reorder Inv (IDi) as a result of identifier ID i.This function is to be realized by (FILO) first-in last-out push-down stack order shift register memories of simplifying.The reorder function of register ORD2 (not shown) of terminal T2 is similarly, and the result that reorders who provides identifier ID 2 is Inv (ID2).The result who reorders is, the total value of identifier is with reordering and change.Really,
Total value be transformed into
Total value and
Total value be transformed into
Total value.This result will be as an advantageous conditions, and gives explanation in the next section.
-comparator C OMPi is used for an identifier and range of identifiers are compared, to determine whether terminal Ti receives access.Described in a former joint, in fact its meaning is, the value of each identifier of stipulating in the value of this identifier and the range of identifiers is compared.Shall also be noted that the identifier at an input of comparator C OMPi is actually the Inv as a result (IDi) of the identifier ID i that reorders.In the time of in this identifier drops on the specified identifier scope, comparator C OMPi provides the control signal (not shown) of an affirmation, and terminal Ti is reacted to controller C the allowance message that receives.
The operation principle of recognition methods of the present invention is described by an example in the next section.
Suppose such a case, controller C wishes to begin to bear results, and determining which terminal need enter into the multichannel access communication network in its terminal, and two terminal Ti of adjacent identifier (that is, 0101 (5) and 0100 (4)) and T2 attempt to enter.
Controller C distributes allowance message G (IDx-IDy) to all terminals in its field, and this field comprises above-mentioned initial range of identifiers:
Ti is the same with terminal, and terminal T2 utilizes its receiver to receive allowance message, and range of identifiers is offered its comparator.Meanwhile, the register that reorders of this terminal is read each element of its identifier from its hardware memory, according to falling row's method each element that reorders, and the identifier that reorders is also offered its comparator.
The same with the comparator of terminal Ti, the comparator of terminal T2 compares the identifier that reorders and the range of identifiers of reception:
With
0-15 compares with range of identifiers, and these two comparators all provide the control signal of affirmation.
Should be noted that because other-end does not ask to enter into this network, so do not carry out the processing of permitting message.
Terminal Ti and terminal T2 respond to controller C, so controller C knows to have at least a terminal to sign in in the network, yet, also to determine the contention between the different terminals.Controller C designs the query context of above-mentioned reality, distributes again and permits message, and this time, it determines first identifier subrange, that is, and and ID1-ID8.
According to above-mentioned similar method, two terminals are finished the same operation to the allowance message that receives, and two comparators compare the range of identifiers ID1-ID8 of reorder identifier and reception:
With
0-7 compares with range of identifiers.
The comparator of terminal Ti provides negative control signal, so, response message is provided for controller C.Yet the comparator of terminal T2 provides the control signal of affirmation, so, response message is provided for controller C.This response message is unique response message that controller C receives, and therefore, terminal T2 receives and enters into the multichannel Access Network.
Should be noted that under situation about not reordering the identifier of two terminal Ti and T2 is both in origin identification symbol scope:
With
Compare with scope 0-15; Again in first subrange:
With
Compare with scope 0-7.Even, defer to as above same rule below cut apart and obtain another subrange
Two identifiers still drop in this scope.This process continues to cut apart subrange, up to wherein having only a terminal identifier.In this preferred embodiment,, then need four times and cut apart if do not reorder; If before relatively, reorder, then only need once cut apart.
Above-mentioned example explanation, if each element to identifier reorders before relatively, then the present invention quickens to enter into the terminal identification method of multichannel access communication network greatly.
Should be noted that in this preferred embodiment all terminals compare their identifier that reorders with the range of identifiers that provides, this feasible realization the present invention becomes, and tube is single more.Really, the terminal of all regulations of controller should be observed the rule that reorders, otherwise, reorder in some terminals and they that identifier compares and another part terminal does not reorder under the situation of mixing that identifier compares with them, the situation that can occur conflicting.Yet it also is feasible under the mixing situation that the present invention is applied in, and for example, utilizes special unit in the identifier, compares with the identifier that reorders or compares with the identifier that do not reorder so that point out.Yet this implementation method requires terminal that interpreting means is arranged, and is used to explain this special identifier symbol, and requires controller that special logic is arranged, and is used to control the predetermined chance to each terminal, so that access network and avoid clashing.
Though above-mentioned preferred embodiment is a lower limit of regulation and a upper limit, with the range of identifiers in the regulation allowance message; But application of the present invention is not limited to the regulation of this range of identifiers.Really, the professional knows that obviously some little changes can be arranged in the above-described embodiments, to be suitable for regulation range of identifiers in permitting message, for example:
-in case transmitted a lower limit, it is offered terminal up to another lower limit by controller by a plurality of terminal storage and utilization, has only the upper limit to send terminal to by permitting message;
The allowance message of stated reference, it is with reference to a plurality of of being scheduled to and being stored in each terminal identifier scope.
Another is noted that relevant with terminal identifier, and terminal identifier is stored in the hardware memory of this terminal in the above-described embodiments, and it reorders the register pair that reorders after reading.Though this preferred embodiment is described the reordering function of this method,, application of the present invention is not summed up as that this is a kind of.Really, the identifier that reorders is offered comparator different embodiments can be arranged:
-hardware mark-on identifier is directly read and is reordered according to software approach;
-hardware mark-on identifier calls over according to reordering;
-hardware mark-on the identifier that reorders is directly read;
Should be noted that application of the present invention is not limited to the time division multiple access communication net among the selected embodiment of the invention described above.The professional knows that obviously some little changes can be arranged in the above-described embodiments, to be suitable for comprehensive multichannel Access Network at other, for example, the frequency division multiple access net; Perhaps so even Access Network does not wherein adopt multiplexed type, for example such Access Network, and each terminal has a different up link, is used for being connected with the up of controller.Though the description of the principle of the invention is in conjunction with concrete equipment, apparent, this description is to give explanation by example, rather than limitation of the scope of the invention, and scope of the present invention is stipulated in appended claims.
Claims (5)
1. recognition methods that is used for the multichannel access communication network, the terminal (Ti) that wherein has predefined identifier (IDi) requires to insert described network, described recognition methods comprises that slave controller (C) is to a plurality of terminal (T1, Ti, T16) the allowance message of distribution provisions range of identifiers (IDx-IDy) (G (IDx-IDy)), these terminals comprise described terminal (Ti) and are connected to described controller (C), it is characterized in that described method also comprises: will be by a plurality of element (IDi-A that are included in the described identifier (IDi); IDi-B; IDi-C; IDi-D) result that described terminal (Ti) reorders according to preordering method (Inv (IDi)) compares with described range of identifiers (IDx-IDy), to determine whether described terminal (Ti) receives access.
2. according to the recognition methods of claim 1, it is characterized in that described reordering comprises: at least one element of a plurality of elements (IDi-D) is placed on higher effective position (IDi-B) on described identifier (IDi) the total value least significant bit being arranged in.
3. according to the recognition methods of claim 2, it is characterized in that described reordering is described a plurality of element (IDi-A in the described identifier (IDi); IDi-B; IDi-C; IDi-D) row of falling.
4. have predefined identifier (IDi) and be suitable for entering into the terminal (Ti) of multichannel access communication network, comprise be connected to a plurality of terminals (T1 ..., Tj ..., controller T16) (C), these terminals comprise described terminal (Ti); Described controller (C) comprises distributor (DIS), be used for from described controller (C) to described a plurality of terminals (T1 ... Ti ..., T16) the allowance message of distribution provisions range of identifiers (IDx-IDy) (G (IDx-IDy)), it is characterized in that described terminal (Ti) comprising:
-receiving system (RECi) is suitable for receiving described allowance message (G (IDx-IDy));
-the device that reorders (ORD) is suitable for according to preordering method being included in a plurality of element (IDi-A in the described identifier (IDi); IDi-B; IDi-C; IDi-D) reorder, thereby the described result who reorders (Inv (IDi)) of described identifier (IDi) is provided
Comparison means (COMP) is suitable for described result (Inv (IDi)) is compared with described range of identifiers (IDx-IDy), to determine whether described terminal receives access.
5. an access communication network is characterized in that, described access communication network comprises the terminal (Ti) described in the claim 4 at least.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB97182391XA CN1142663C (en) | 1997-09-30 | 1997-09-30 | Identification method, a terminal realizing such a method and an access communication network including such a terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB97182391XA CN1142663C (en) | 1997-09-30 | 1997-09-30 | Identification method, a terminal realizing such a method and an access communication network including such a terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1276120A true CN1276120A (en) | 2000-12-06 |
| CN1142663C CN1142663C (en) | 2004-03-17 |
Family
ID=5178445
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB97182391XA Expired - Fee Related CN1142663C (en) | 1997-09-30 | 1997-09-30 | Identification method, a terminal realizing such a method and an access communication network including such a terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1142663C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8452327B2 (en) | 2008-06-13 | 2013-05-28 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
-
1997
- 1997-09-30 CN CNB97182391XA patent/CN1142663C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8452327B2 (en) | 2008-06-13 | 2013-05-28 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US8838168B2 (en) | 2008-06-13 | 2014-09-16 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US9060358B2 (en) | 2008-06-13 | 2015-06-16 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US9369860B2 (en) | 2008-06-13 | 2016-06-14 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US10009934B2 (en) | 2008-06-13 | 2018-06-26 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US10334639B2 (en) | 2008-06-13 | 2019-06-25 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
| US10652937B2 (en) | 2008-06-13 | 2020-05-12 | Huawei Technologies Co., Ltd. | Method for data communication, system for communication and related devices |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1142663C (en) | 2004-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6092137A (en) | Fair data bus arbitration system which assigns adjustable priority values to competing sources | |
| US8320379B2 (en) | Arbiter circuit and method of carrying out arbitration | |
| US5892769A (en) | Method and system for prioritized multiple access using contention signatures for contention-based reservation | |
| CN1152532C (en) | Efficient output-request packet switch and method | |
| CN100496141C (en) | Method and system for connecting conflict avoidance in radio communication | |
| US20070140115A1 (en) | Method for selection of an available transmission channel by sending a negative decision value and an additional positive decision value and corresponding base station, mobile terminal and mobile radio network | |
| CN1107390C (en) | Multiple access telecommunication network | |
| CN1316867A (en) | Event trigging change of insertion service class in random insertion channel | |
| US4663757A (en) | Packet switched local network with priority random splitting and conflict detection | |
| US4794516A (en) | Method and apparatus for communicating data between a host and a plurality of parallel processors | |
| CN1142663C (en) | Identification method, a terminal realizing such a method and an access communication network including such a terminal | |
| US5535210A (en) | Method and system for resolution of channel access in data transmission systems | |
| EP1020050B1 (en) | An identification method, a terminal realizing such a method and an access communication network including such a terminal | |
| CN1090692A (en) | The local communication system of multidata channel | |
| US7995607B2 (en) | Arbiter for a serial bus system | |
| CN113965977B (en) | Data transmission method, device, system and medium in multilink system | |
| CN1287614C (en) | Method of distributing channel in specific wireless communication system | |
| CN1921434A (en) | Method of operating a data bus system and a transmitter station | |
| CN1130055C (en) | Contention resolution element for a device for transmitting of packet-oriented signals | |
| CN113133010B (en) | Wireless networking method, device, terminal equipment and storage medium | |
| JPH11243578A (en) | Radio resource management method | |
| CN1125555C (en) | Method and device using virtual bidirectional information in wireless communication system | |
| EP0822677A2 (en) | Data storing method and data searching method for radiodata stored according to this method | |
| WO2003058888A1 (en) | Multiple port arbiter and switching systems |
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 | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |