TW200901683A - Multi-channel communications protocol - Google Patents

Abstract

There is a need to improve design of communication protocols in which two or more channels are provided and, optionally, in which collision avoidance is not available. An improved protocol is provided in which communication nodes pick a channel on which to transmit and collision may occur where two nodes attempt to transmit on the same channel. The node currently occupying a channel is arranged to have a specified probability of holding onto that channel as compared to a newcomer. Other methods are described whereby a node is able to occupy more than one channel at the same time and whereby nodes each occupy approximately the same number of channels.

Description

Road-to-high end-to-end processing capability, communication capacity needs for communication network equipment to increase capacity. This improvement is now used to transmit data over the network.

.J 200901683 IX. Description of the Invention: [Technical Field] The present invention relates to a multi-channel communication protocol [Prior Art] A trend under the demand for low data transmission time of all kinds of communication networks. However, it is extremely time consuming and costly to build. The use rate is, for example, made necessary by an improved design. — In a communication network, the general layer of communication protocols are generally provided as a protocol stacking method. E.g. Starting with the high-level singular layer in the physical layer, as the network infrastructure follows the data link layer, transport layer, network layer and application layer key layer, media access control (Mediuni Access Control layer Typically used to provide (may be, for example) control access to actual transmission media over a communication such as a Local Area Network (LAN) or other m-network. In a packet-based communication network The data is stuffed into the packaged unit. The packets mentioned here are transmitted through the network according to the used ones. Most of the communication with the media access control (MAC) layer nowadays is generally on this layer. The method of using a single channel. However, the increase and the increase, it will be wide, the agreement, the point of view, the face, the pass. In the capital: MAC) network category is known as the seal agreement system, the recent 5 200901683 Development 'has been discussed on the use of multi-channels at the MAC layer. Assuming that simultaneous data transfer is possible, these multiple channels can be thought of as physical channels' or otherwise orthogonal logic channels. SUMMARY OF THE INVENTION The simplified conclusions of the present disclosure are set forth below to provide a basic understanding of the present disclosure. The present invention is not an extensive overview of the disclosure, nor is it intended to define the main/critical elements and definitions of the present invention. The scope of the present invention. The present invention has only one purpose and is to present some concepts of the present disclosure in a simplified manner as a preface to the "embodiment" below. . In order to improve the design of a communication protocol for providing two or more communication channels and selective π # & S avoidance mechanism, the present invention discloses an improved communication protocol macro. It is described that a communication node selects a channel, And send the packet on it. Collisions occur when two nodes are transmitted on the same channel. Compared to the newly added ip point, the node that occupies the channel is configured as

C occupies a pending broadcast probability of the channel. The present invention also discloses other methods in which nodes can use more than one channel at the same time, and each node occupies approximately the same number of channels. The features of the invention disclosed herein will be more apparent and apparent from the following description of the <RTIgt; [Embodiment] The "Embodiment" and the accompanying drawings are intended to describe the example of the present invention, and are not intended to be a form. This "a series of steps to implement this example can be illustrated by a means that does not represent the disclosure". However, the same examples are used to complete the functions that can be constructed or exemplified, as well as the equivalent or equivalent work.

Although the examples of the present disclosure are described and displayed in a singular manner, the described methods are as many different types of communication networks as those skilled in the art will appreciate. The access communication network method is only an example and the disclosure of the present disclosure

The parties described in this article are intended to provide two or more channels for a portion of a communication protocol (please refer to the discussion below for more of this term) and may choose to avoid collisions to avoid collisions. Active sensing or probing to determine if the channel is full or there is still capacity available, this step requires additional capital. The methods described herein are used to provide such active collision avoidance detection. For example, in a wireless access communication network, a pair of communication protocols used at the MAC layer will not collide. However, this is only an example. There are many communication protocols on different layers that are not needed or provided. Collision avoidance. This is the case, for example, on an optical wavelength division network. Good benefits can be obtained when the methods described herein are used in unavoidable communication protocols. Although the method of this paper is used in communication protocols that provide collision avoidance, certain benefits. The use of construction and capacity and the implementation of the non-restricted. The example applies to the implementation, which is provided on the channel. Whether it is a busy source can be measured or confronted. In general, i is free. And, in general, the optical multiplex provides collisions, but examples of the system are also available. 7 200901683 Figure 1 shows a schematic diagram of a communication network that can implement the communication protocol described herein. It includes at least a plurality of communication terminals 103 that communicate with the base station 102 of the communication network 100 in a wireless communication manner. The communication terminal mentioned herein can be any suitable type, such as a mobile phone, a laptop computer, a personal digital computer, and the like. The communication network I 〇 〇 contains at least a node i 0 i , which is interconnected by any suitable communication link, wherein the communication link can be a physical link or a wireless link. The communication network of Figure 1 can contain at least more communication terminals 1〇3, base station 1〇2, and node 1〇1, which are shown in the diagram 'just to make the explanation clearer and easier to understand. The communication between the communication terminal 103 and the base station 1 〇 2 is used in conjunction with the specific protocols described herein using appropriate communication protocols known to the prior art. For example, the protocol described herein can be implemented on one layer of a stack of agreements, where the stack contains at least other agreements. To implement the agreements described herein, it is also possible to utilize existing protocols and modify them to conform U to the requirements of the communication protocols described in this disclosure. For example, existing communication protocols may be the widely used IEEE 8 〇 2 u wireless MAC protocol. However, this is not essential. Any appropriate communication protocol can be

8 200901683 10 3 The situation of transferring the data to the base station 10 2 However, the invention is not limited to the f-bringing, and the status of the download key will be inserted in the later (4). In addition, the present invention is not limited to communication at the MAC layer. • The number of channels provided by the present invention may be greater than the number of communication terminals (also referred to herein as users) seeking to communicate with the same designated base port, such as the number of communication channels, which may be for a particular base station. The number of communication terminals 103 is twice or more than twice, but this does not necessarily require such a limitation. It is also possible to use fewer communication channels than the number of communication terminals. The communication channel provided by the present invention may be in any suitable form. For example, 'these channels provided may be frequency-divided; in other words, different frequency bands are used, which can simultaneously perform data traversers. Another option is to provide channels using the slotted split method (sl〇tted approaeh), for example using time division multiplexing or code division multiplexing or combining time division with code division multiplexing. A combination of frequency division multiplexing and time division multiplexing and/or code division multiplexing may also be used, for example, in orth〇g〇nal_frequency 〇 division multiplexing: OFDM. OFDM has been described in Tse and Viswanath, and the details are described in the "Fundanientals of Wireless Communication" published by the University of Cambridge in 2005. Under time-sharing, a larger period, called a frine, is divided into a fixed number of mini-slots. Each communication terminal takes a specific small slot and refers to transmitting data in the small slot. Thereby, the transmissions of these communication terminals can be individually distinguished and efficiently transmitted on different channels. It has been described in detail in ISBN No. 1-0-0 1 32009161, 1991, 9 200901683, in the second edition of "Data Networks" by Bertselkas and Gallager.

U In the crossover multi-function, each communication terminal uses a unique pseudo-noise sequence (Pseud〇noise sequence: PN sequence), and the signal (data) is extended to a much larger bandwidth by the PN sequence. transmission. By knowing the sequence used for the extension, even if multiple communication terminals simultaneously transmit data, a receiving end can decode the data from all communication terminals. For data transmission, each PN sequence or code can be thought of as an individual channel. More details on code division multiplexing, in the article "Code assignment for hidden terminal interference avoidance in multihop packet radio network" by Bertossi and Bonuccelli in the IEEE Journal Transaction. on Communication 3(4):441449 &gt; 1 99 5 Printed in August. Code division multiplexing can also be used in ad hoc networks, such as the June 2003 meeting of the International Conference on Mobile Communications and Computing (MOBIHOC03), page 1 53 163, Muqattash, and Marwan “CDMA based mac”. Protocal for wireless ad hoc network" Exemplary Method For an improved multi-channel MAC protocol, a first example thereof will be described below with reference to FIG. To implement this method, it can be achieved by a plurality of nodes (n〇de) on the communication network, such as the communication terminal 103 in Fig. 1. Each communication terminal 1〇3 has a certain amount of data to be transmitted to the base station 1 0 2 (which may also be referred to as an access point of the communication network 1 ,), and the amount of this data may be a single data file. Or other 10 200901683 any suitable kind of clip material. Such data is packaged in any suitable manner in the prior art and provides access based on the type of mechanism in which it is used. A set of data packets transmitted by the communication terminal 103 on a particular channel for a particular data file or other piece of data is referred to as a flow of packet.

The previous MAC protocol has optimized the transmission of a single data packet rather than a data packet flow. In other words, in the MAC layer, there is no concept of a data packet stream or a collection of data packets, but only in higher layers, such as transport, network, or application layers. However, as noted herein, most of the data transfer or data exchange is based on flow, and this is also the use of the methods described herein. Next, the method of FIG. 2 will be described as an exemplary method performed on a communication terminal 103 that seeks to update a data archive or other data segment to a base station 102 or other communication network node. This method can be implemented on any of the present communication terminals 1 〇 3, but for the sake of brevity, what is described now, only a single communication terminal 103 is described as an example. The communication terminal 1 〇 3 selects (block 2 0 0) the channel on which to transmit its packet stream, which is the result of dividing the data file. This choice can be random, or it can be obtained using a pseudo random algorithm or any other suitable method. The choice of these channels in the current state (s t a t e), such as whether these channels are busy (b u s y) or idle (i d 1 e). Communication terminal 1 0 3 attempts to transmit the packet through the selected channel (box 11 200901683

201), and if an evaluation is made as to whether a collision will occur, if the communication terminal 103 receives an acknowledgement message (Acknowledgement message: ACK message) that the packet transmitted by the communication terminal has been received by the other party within a certain period of time, Assume that no collisions have occurred. Such an ACK message is hereinafter referred to as a first ACK message&apos; to distinguish this message from other ACK messages received later in the process. In this example, the communication terminal 103 moves to the channel possession state (block 204), and in this state continues to send its packet stream over the channel with a certain degree of persistence. The extent of this persistence (or "stickness") can be adjusted by changing some of the parameter values, the details of which will be described in detail below. This specific time limit for assessing whether a collision has occurred is referred to herein as a time slot, which is long enough for the communication terminal to transmit a single packet to the base station&apos; and receive a confirmation message sent back in this condition. In an illustrative example, the length of the aforementioned time slot is the same on each communication terminal 1 〇 3 and is determined separately for the solution of the application to be used. For example, in the Wires Local Area Network (WLAN), the time slot length is based on the bandwidth of each channel, the maximum size of the packet, and the maximum transmission range (or the maximum distance between nodes). set. In actual operation, the aforementioned values are obtained by sending out test packets, estimating or calculating them before the actual communication, or continuously monitoring the usage of the method itself during use of the method, or using any other suitable method. And get it. If no ACK message is received during that particular time, a collision is assumed. For example, when the selected channel is already busy, not only the packet that is to be transmitted, but also the packet on the channel that is already busy will be discarded. In this case, the communication terminal 103 (block 203) waits for a specific time before repeating the step selection channel (block 2 〇〇) and attempting to transmit the packet through the selected channel (block 2 0 1). This particular latency may be a random length of time 'e.g., an integer multiple of the length of the time slot' and the integer value is random (or pseudo-random). If the waiting time is zero or fixed, the communication terminal 103 may repeatedly encounter a collision at block 202.

In an embodiment, the generation of the random waiting time on block 203 includes at least one method for determining the leave waiting phase at the time point of the end of each time slot, wherein the value of α is ok. Adjusted. For lightly loaded networks with less than 50% load, the value of the channel release probability can be set to ρ = 〇·1, and the value of the channel selection attempt probability α can be set to &lt;2=0.5. In the case of a medium load network with a load of 75 0/〇, the value of ρ can be set to ρ = 〇.〇5, and the value of 〇; can be set to α = 〇 2β. This probability (3⁄4 is called channel selection attempt) Probability (channej seiecti〇n attenipt probability) Once the communication terminal 103 enters the channel, as described above, 204, with a certain degree of process continuity, continuously keeps &amp; broadcast in its packet stream on the selected channel. The packet of the pen is transmitted. Block 20 5 monitors whether the packet flow or the collected jfejj +» J&gt;L· the transmission of the Fantasy Beco packet has been completed. For example, the packet of the &amp; stream can be 妯" 1 The break is not based on the flow identifier, so that it is possible to detect when the sentence is sealed, and the mass + m '丨 conveys 70. In other words, as long as after a certain period of time, the segment notices that δ is no longer needed. When transmitting the packet, Le can detect the time point of the transmission and the current transmission. In addition to the above method 13 200901683, any other method suitable for detecting when the transmission is completed can be used. Once the transfer is complete The method ends (block 06) at the point in time when the entire data file is transmitted. Otherwise, the communication terminal continues to transmit the packet of the packet stream to the selected channel (block 207) until it is assumed that a collision has occurred (block 208). If a communication terminal 103 of a third party attempts to transmit on the same channel, a collision may occur. If the ACK message is not received within the specific period, the same method as the block f 1 block 202 is used, assuming Collision occurs. Any ACK message belonging to the category referred to here, hereinafter referred to as the second ACK message, is used to distinguish the received ACK message from block 2 0 2. If the collision hypothesis has occurred, the communication terminal takes the probability p (Block 209 and block 210) discard the selected channel (block 211), where the probability p value can be adjusted to adjust the above-mentioned stickiness or "persistence". The term "channel release probability" is used to refer to the meaning of the probability p, which is different from the channel selection attempt probability α. Any appropriate value for the rate can be used. For example, if ρ = 1, the packet flow is the process until the collision occurs. At this point, they will always stop. In another example, if ρ = 〇 Channel capture occurs at the communication terminal 103, and once it enters the channel possession state, it remains in that state until its transmission is completed. This is typically a case where 'the number of channels is greater than the attempt at the same specific time The number of communication terminals accessing the same media. In some embodiments, the 'channel release probability Ρ is set to a value of 14 200901683 so that the communication base station that has successfully transmitted on one channel has a high probability of mastering the channel, making the newcomer tend to By abandoning this channel and attempting to use the new channel, the aforementioned purpose can be achieved by giving a small positive value to the channel release probability P. The expression of the aforementioned purpose can also be said to be: the probability that an existing occupant of one channel possesses the channel is much higher than that of the newcomer.

According to the method described in Fig. 2, it is not possible for the two communication terminals to enter the channel ownership state of the same channel at the same time, because a collision will occur at block 202. What is even more unlikely is that more than one communication terminal 1 0 3 also considers that it has the same channel, and then a positive channel release probability of block 2 0 9 will allow one or both channels to abandon ownership. For example, channel errors or mutual interference between channels, in rare cases, may cause the two communication terminals 103 to have the same channel ownership at the same time. Thus, in some embodiments in accordance with the present invention, the channel release probability P will have a small positive value. The above method with reference to Fig. 2 can also be considered as an example of a packet flow involving one of the two classes (c 1 a s s). As each packet stream arrives into the system, the channel is randomly picked up and attempted to be transmitted on it. The difference between the packet stream that has not been found for transmission and the packet stream that is already in the channel possession state is different. The packet stream can be one of two categories, satisfied: S or unsatisfied (u n s a t i s f y: U ). Each packet stream enters the system and enters the system with a packet stream of category U. Each packet stream of category S "owns" a channel and is in each time slot (for example, when using slotted segmentation to provide multiple 15 200901683 channels) In the attempt to transfer on this channel. The user of each category u attempts to transmit on the channel to be transmitted randomly by the channel selection attempt probability α in a manner independent of the time slot and the time slot. If it successfully transmits on the channel, it becomes the user of category S and then owns the channel. If a collision occurs later, it is again a user of category U. When the user of category S encounters a collision, it will be converted to a type U user with a probability ρ (other than all other factors). In this way, there is a breaking of symmetry between the communication terminals, whereby the communication terminal that has acquired the channel has a different behavior from the communication terminal that has not acquired the channel. With the method of Fig. 2, it becomes possible to provide a channel on which each communication terminal can be transmitted. This maximizes system stability and improves the efficiency of the communication bandwidth that can be used. In addition, the higher order information required is minimal, and the agreement is decentralized, and the female does not need any centralized scheduler. By this means, the delay or the transmission time of an entire packet stream can be improved. Another Exemplary Method The method described above with reference to Figure 2 can be thought of as seeking to provide each communication terminal 103 with a single channel for transmission. In another embodiment, each communication terminal 1 〇 3 must be capable of transmitting on more than one channel at the same time. When the number of communication channels is larger than the number of terminals 203, its advantages are revealed, and such an example will be described later with reference to FIG. Let the mutual transmission make the change of the ninth

200901683 Figure 3 is the same as Figure 2 except that block 203 is described in more detail because of the copper plate removal step. Among them, the lost copper plate loses a copper plate (block 300), showing the probability of the side of the head being the selected probability, and if the side that is displayed is the head, to the block 200. The above is an example of a method that can be used to implement block 203 of Figure 2, primarily by continuously dropping a piece of copper until a human head appears. What is said here is not to be able to really lose any copper plate as long as it can get two possible results (or pseudo-can be used ^. The difference between Figure 3 and Figure 2 is when entering the channel, The communication terminal can also re-enter the equal part of the waiting block 2 0 3 according to the loop. In this way, the communication terminal enters the channel having the plurality of channels at the same time, for example, assuming that the block is 2 0 2, and there is no inference In the event of a collision, the communication terminal proceeds to enter the channel possession state (block 204) and also performs 300. At the subsequent occurrence of block 300, two possible outcomes are selected and, based on the result, selected at block 200. On the other channel selected by the block (block 201), there is an attempt to transmit and if no inference occurs, the program proceeds to the channel; block 2 04). In this way, the communication terminal can enter more than one channel possession state. The packets from the same data stream can then be sent simultaneously to the channel with the status of the channel for the transfer. Under the circumstance, especially when the number of channels is more than the number of communication base stations for uploading, the situation described in the previous paragraph may be a more efficient way to include a step system α (the channel is waiting for the square board, straight, but I Program) In the state 2 picture, it can be advanced to the block random selection channel. Send, and understate (the use of all channels for the channel is 17

200901683 An example of another method similar to the method of Figure 3 will be explained below: In each time slot, each communication terminal attempts to acquire a new channel by transmitting a packet on a randomly selected channel, the probability of which is α (channel selection attempt probability). If the transmission is successful, the communication terminal now "owns the channel, otherwise it gives up. In addition, for each channel that is encountered by the communication terminal that encounters the collision, such a channel has a probability of abandonment ρ (channel release Probability), which is independent of all other channels. An alternative method allows communication terminals that encounter collisions on k channels to accurately discard kp channels (kp is an integer). Otherwise, if the communication terminal does not give up [kp] One is [kp] + l channels, the probability is the average of the selected kp channels, where [kp] refers to the integer part of kp. Another exemplary method is also the same as Figure 3, In addition to blocks 300 and 301, this becomes block 400, which represents a program that is scheduled to wait for a period of time based on the history of the collision. In the method described with reference to Figure 3, a single communication terminal has the opportunity to enter more than one. The channel of the channel has a state. In high-order terms, if a collision occurs when the existing data stream is not inferred recently, the waiting program for the block 400 is waiting for one. Short time. If the recent inference has a collision, the waiting time will be increased, and if more recent inferences have more collisions, the waiting time will increase further. In some examples, the increase in waiting time can be reached. A specific maximum value. The relationship between the waiting time and the inferred collision history can be any suitable relationship, such as linearity, or index ' or other specific 18 200901683 relationship. The implementation of the waiting time can be as above Method, based on a random selection of a particular channel selection attempt probability. In this way, the method associated with Figure 4 enables simultaneous "owning" of more than one channel, but according to historical records, the communication terminal must give up trying to own An example of the method of Figure 4 will disclose below that the communication terminal i maintains its own value in ar new initialization to amax, and in each time slot, attempts a new channel. If successful, it will be α; Set to ctmax' and connect 4. If this attempt causes a collision to occur, the communication terminal i compares the value of the oti. :ai/2 or amin. The communication terminal i has and has a collision encounter channel, the probability of which is constant and this is determined by the communication terminal to the other channels in the method of Figure 3 and Figure 4, a communication At the point, there can be more than one channel, which ensures that the number of "owners" in each communication terminal is on the other hand, and it can also make a difference here, so that terminals (such as those top-level services) can be compared to those in the economy. The level has a larger number of channels. The implementation of the method described in this example is obtained by the IEEE 802. il wireless MAC protocol, wherein the request for send/clear to send mechanism may be the third The second result is a channel on the collision history inferred by a communication terminal. The terminal i takes ai to obtain the channel by the probability CM. Reset to the following two and give up the probability P that it has. Terminals can also be equal channels at the same time. The communication of some communication services is finally modified by the priority of the standard. The RTS/CTS: is dropped. If the collision 19 200901683

The avoidance mechanism cannot be used here. The foregoing method is preferable. This is not inevitable. If the communication node 1 〇 3 can be implemented, the RTS/CTS mechanism can be used. Such a standard of IEEE 8 02.1 1, the difference of the present invention is "the asymmetry between the possession terminal and the "newcomer." In IEE], the probability of one attempting to access the channel is equal. Compared with the method, the probability of the two trying to access the channel is different, which is obviously different from the standard IEEE8〇2.U. Another exemplary system Figure 5 is a schematic diagram of another communication network in which the method can be implemented. Figure 5 and the first! Similarly, the base station B and the base station 1〇2 are labeled as a platform A and B' # can communicate with the dotted line 1 〇 3 in Fig. 5.

The method of the ancient I cut described here can also be used in the downlink case, for example, when the fifth stage is carried by the base station and the port in the figure to the same communication terminal] ^ ^ % 103. In this case, the method of Figure 2 is used to transmit the packet flow end. The base station can also use the packet of the packet stream of Figures 3 and 4 to the communication terminal. The alpha and the selected ones in the method described herein are related to the communication link. Responsiveness is related to the acquisition of the channel - between the usage rate and the responsiveness - a new packet flow entry indication. In order to implement the communication chain embodiment. However, in the case of collision avoidance, the method proposed by the above mentioned method in the above-mentioned communication 802.11 shows that the disclosed method is not limited. In the figure, the communication terminal I (downlink) of the base station should packetize the base stations A and B to the communication end method to transmit the probability of the seal p. After the balance is available, how long is the maximum utilization rate 20 200901683, in general, both α and p are selected as small values. In order to maximize sex, both α and p are generally chosen to be large values. By choosing α and ρ as non-zero and small values, it is possible to obtain utilization and satisfactory responsiveness. One aspect of the latter is good short-range fairness (where fairness ''fairness' is about the distribution of channels of communication terminals). For example, for a lightly loaded network, whose load is lower than that, the channel release probability P can be approximately Set at p = 〇.l, and pass the fx test probability α is set to approximately α = 0.5. If the medium load 潍C / load is approximately 75%, ρ can be set to ρ = 0·05 and α It can be α = 0.2. Figure 6 of the exemplary communication network node shows a schematic diagram suitable for implementing the method network node 600 described herein, for example, the communication network node is, for example, a mobile phone, a personal digital An assistant, laptop, personal or the like. It may be a communication network, or a station or other network node. It contains at least a communication link 601 that is used to connect to the communication network with any suitable Q. The foregoing connection method may be, for example, using a wireless link or a physical link. The communication network node may include other accessories not shown here because of the traditional communication base station and For the sake of this, those skilled in the art are provided by the prior art. For the sake of clarity of the technical disclosure, not all the details are described. The communication network node 600 also includes at least the user interface 6 0 2, so that the keyboard (or pocket keyboard) and the display screen or other suitable kind of response are selected by the 50% channel of the good room, the way to set up the computer base is to end the package. And there is a 21 200901683 interface that can be used. The processor 604 provided can be any suitable type, such as a microprocessor, computer or other processor. The data input 603 provided is used to be transmitted. The profile or other information can be entered into node 600. A protocol stack 605 is displayed to indicate that the node is scheduled to operate a communication protocol suite' and also provides any suitable type of memory. 606. Exemplary Computing Apparatus FIG. 7 shows various components of an example of computing infrastructure 700, wherein computing infrastructure 700 can be any shape The computing and/or electronic device is implemented 'and may be implemented in the communication network node of the present invention. The computing infrastructure device 700 includes at least one or more inputs 74, which are any type suitable for receiving media content. Internet Protocol, data file, video or other input. The device also includes at least a communication interface 708 for use as an interface for any suitable type of communication network, such as 'wireless access communication network, internet Or any packet-based communication network.

Packet. The platform software (platform softwar 'and further transmits S〇 ftWare according to a specific protocol) includes at least the operating system 702 or any other suitable platform software that can be used in the computing infrastructure so that the application software 7 〇 5 can be executed on the device. By.

22 200901683 Media (eg memory 7 〇 3) to provide. The memory here may be any suitable type, such as random access memory (RAM), any kind of disc storage device (such as magnetic material or optical storage device, hard disk drive, CD, DVD). Or other disc drive). In addition, you can also use flash memory, Erasable Programmable Read-Only Memory (EPROM) or electrically erasable programmable read-only memory (Electrically Erasable Programmable Read- Only Memory: EEPROM) 〇C) It is also possible to provide output 7 0 7, such as audio and/or video output, to a display system that integrates or communicates with the computing infrastructure. The display device can provide a graphical user interface or any other suitable type of user interface 7 0 6 ' although this is not required. The term "computer" as used in this disclosure refers to any device capable of processing the ability to enable the execution of instructions. Those skilled in the art will recognize that 'the aforementioned processing power can be integrated into many different devices' and thus the term "computer" as mentioned above includes at least a personal computer, a feeding device, a mobile phone, and a personal digital assistant. And many other kinds of equipment. The method disclosed herein can be performed by machine readable software on a storage medium. This software can be implemented for parallel processors (parallel Pr〇CeSS〇r) or serial processors, so that the steps of the method can be performed in any suitable order or simultaneously. It is recognized that the 'corps can be a valuable 'separable transaction', and the essence of the disclosure also includes the software's control or execution 23 200901683 on the 'dumb' or standard hardware to implement the desired Achieved functionality. This disclosure also includes "description" or software that defines the hardware configuration, such as Hardware DeSCripti〇n Language (HDL) software, which is commonly used in Shixi chip designers' or for general purpose Program chip configuration to implement the functions to be achieved.

(J is well acquainted with the storage device used to store program instructions, and it can be recognized that it can be distributed throughout the network. For example, a remote computer can store an example of a program that is described as software. The regional or terminal computer can access the remote computer and download a part or all of the software to execute the program. On the other hand, the regional computer can download one of the required software parts or perform on the terminal in the area. Some software refers to 'and also performs some software instructions on the remote computer (or computer network). Those who are familiar with the art, will also recognize the software by using the traditional techniques known from the conventional techniques. All or part of the instructions may be implemented by a dedicated circuit, such as a programmable logic array or the like. Any range or device value given herein, as is well known The artist is clearly visible and can be expanded or changed without losing the effect sought. In accordance with one aspect of the present invention, it is further understood that the benefits or advantages of one or more of the items can be related to a particular embodiment or a plurality of embodiments. In the case of a project, the steps of the method described herein may be performed in any suitable order, or may be performed simultaneously, if appropriate. In addition, each of the disclosed methods may be The step blocks can also be removed without departing from the spirit and scope of the subject matter described in the disclosure.

It can be appreciated that any embodiment described above is provided for illustration only, and any one skilled in the art can make various modifications, but still deviate from the spirit of the invention. range. The above description, examples and materials are provided to provide a complete description of the use and structure of the illustrative embodiments of the invention. Although various embodiments of the present invention have been described above with a certain degree of specificity, or are disclosed with reference to one or more individual embodiments, those skilled in the art are referred to the prior art and the present disclosure. Various changes may be made to the various embodiments without departing from the spirit and scope of the invention. BRIEF DESCRIPTION OF THE DRAWINGS The above embodiments will be better understood with reference to the accompanying drawings, in which: FIG. 1 is a schematic diagram of a communication network; FIG. 2 is a channel selected and on the channel A flowchart of an example of a method of transmitting a data packet; FIG. 3 is a flow chart showing an example of a method of selecting a complex channel and transmitting a data packet on the complex channel; FIG. 4 is a process of selecting a channel and transmitting a data packet on the channel A flow chart of another example of the method; Figure 5 is a schematic diagram of another communication network; 25 200901683 Figure 6 is a schematic diagram of a communication network node (η 〇de ); and Figure 7 illustrates a computer-based device An embodiment of the method of selecting a channel and transmitting a data packet can be implemented thereby. The same element symbols are used to designate the same elements in the drawings. [Main component symbol description] 600 communication network node 6 0 1 communication key interface 602 user interface 603 data wheel 604 processor 605 agreement stack 606 memory 700 computing infrastructure 701 processor 702 operating system 703 memory 704 input 705 application software 706 user interface 707 output 708 communication interface 26

Claims (1)

200901683 X. Patent application scope: 1. A method comprising at least the following steps: selecting one of a plurality of channels to send a data packet in a set of data packets to the channel, the set comprising at least a plurality of data packets; On the channel, the data packet is transmitted, and a first confirmation message is awaited. If a first confirmation message is received, the selected channel is continuously used to transmit the packet from the set, and after each packet is sent, waiting to be received. a second confirmation message; and if the second confirmation message is not received after the one of the packets is sent, the selected channel is discarded according to a specific channel release probability. 2. The method of claim 1, wherein the data from the collection of the data package together form a data file. I) 3. The method of claim 1 is implemented as part of a communication protocol that does not provide a channel collision avoidance mechanism. 4. The method of claim 1, further comprising the steps of: if the first confirmation signal is not received, repeating the selected one according to a channel selected attempt probability after a substantially random waiting period The steps of the channel. The method of claim 4, wherein the channel release probability is about 0.05 and the channel has a selected probability of about 0.2. 6. The method of claim 1, further comprising the steps of: repeating one of the selected plurality of channels to select a second channel and continuing to utilize the selected channel and the second selected channel To transfer Γ) packets from this collection. 7. The method of claim 6, further comprising the steps of: repeating the step of selecting one of the plurality of channels selected to select a subsequent channel; and continuing to utilize all of the selected channels to transmit from the set Packet. 8. The method of claim 6, wherein for each channel to be used, the step of selecting each channel is based on a channel selection attempt rate, and the channel selection probability is independent. Grounded and used to implement a random wait time. 9. The method of claim 8, wherein the selection of the value of the channel selection trial probability is based on information relating to the collision history. The method of claim 8, wherein after receiving a 28 200901683 first confirmation signal, the probability of the channel selection attempt is increased; and if the first time limit is still not received after the specified time limit If the signal is confirmed, the probability of the selected channel selection will decrease by a specific value. 11. The method of claim 10, wherein the increase in the probability of selection of the channel selection does not exceed a maximum value, and the decrease in the probability of selection of the channel selection does not exceed a minimum value. Ο 12 • The method of claim 1, wherein the method is implemented as part of a communication protocol that is located in a Medium Access Control Layer of a communication protocol group. 1 3. The method of claim 1, wherein the method is performed in a communication terminal in a wireless access communication network communication network. Q 1 4. The method of claim 1, wherein the method is performed as part of a communication protocol that provides the complex channel by a frequency division process. 15. The method of claim 1, wherein the method is performed as part of a communication protocol that provides a plurality of channels operable in a synchronous mode based on a particular and fixed period of time. 29 200901683 16. A method comprising the steps of: selecting one of a plurality of channels to send a data packet in a set of complex data packets on the channel, the set comprising at least a plurality of data packets; Transmitting the data packet and continuing to use the selected channel to transmit the packet from the collection; waiting for a confirmation message after transmitting each packet; and not receiving the confirmation after transmitting one of the packets The message is discarded based on a particular channel release probability. The method is performed as part of a communication protocol that does not provide collision avoidance capabilities. The method of claim 16, further comprising the step of repeating one of the selected plurality of channels to select a second channel and continuing to utilize the selected channel and the second selected channel To send packets from this collection. The communication network node includes at least: a processor configured to select one of the plurality of channels to send a data packet in a set of the plurality of data packets on the channel, the set being at least A plurality of data packets are included; and a transmitter configured to transmit the data packet on the selected channel and to wait to receive a first acknowledgement message; 30 200901683 wherein the transmitter is configured such that if a a confirmation message, continuing to use the selected channel to transmit packets from the set, and waiting for a second confirmation message after each packet is sent; and the transmitter is configured such that if one of the packets is sent After the second confirmation message is not received, the selected channel is discarded according to a specific channel release attempt probability. 1 9. The communication network node of claim 18, wherein the processor and the transmitter are configured to operate with a communication protocol that does not provide a channel collision avoidance mechanism. 20. The communication network node of claim 18, wherein the processor is arranged to dynamically select the channel selected attempt probability based on information regarding the collision history. 31