Wireless communication device, a wireless communication system and a wireless communication method

1. Field of the Invention

The present invention relates to a wireless communication device, a wireless communication system and a wireless communication method for reducing data packets remaining in a relay node, and for equally setting end-to-end throughput for each link within a wireless ad-hoc network.

2. Description of the Related Art

A wireless ad-hoc network system allows each of plural wireless communication devices (access points or nodes) to communicate data with the other wireless communication devices within a predetermined coverage area, without a centralized control station such as a base station for a mobile phone system. Also, it allows each of the wireless communication devices to communicate data over a long distance by relaying data from a source wireless communication device to a destination wireless communication device.

FIG. 1 shows a typical wireless ad-hoc network system. Access Points AP 1 -AP 4 are wireless communication devices each functioning as an access point. A wireless ad-hoc network is categorized into an ad-hoc based network and a mesh based network. The ad-hoc based network is composed of wireless LAN terminals only, as shown in FIG. 2 . The mesh based network is composed of wireless LAN base stations and wireless LAN terminals, as shown in FIG. 3 . As used herein, “a wireless ad-hoc network system” includes both the ad-hoc based network and the mesh based network. The access points AP 1 -AP 4 in FIG. 1 correspond to the wireless LAN terminals in FIG. 2 or the wireless LAN base stations in FIG. 3 . If the wireless LAN terminals in FIG. 3 include a relay function, they are included in the access points.

In FIG. 1 , when one of the access points (nodes) is located so as to communicate data (transfer packets) with the neighbor access points, the access point can communicate data directly with its neighbor access points within its coverage area. That is, data can be communicated directly between AP 1 and AP 2 , between AP 2 and AP 3 , and between AP 3 and AP 4 . On the other hand, each of the access points can communicate data indirectly with its non-neighbor access points via intermediate access points. That is, data can be communicated indirectly via the intermediate access points between AP 1 and AP 4 , between AP 1 and AP 3 , and between AP 2 and AP 4 . It is noted that around each of the access points AP 1 -AP 4 , there may be terminals (stations) without the relay function, and the terminals may communicate via the access points AP 1 -AP 4 .

FIGS. 4( a ) and ( b ) show examples of data transmission in accordance with IEEE 802.11, one of the wireless LAN standards. The collision avoidance for the data transmission is based on so-called virtual carrier sense. (See Non-Patent Reference 1, for example, which discloses a wireless LAN system comprising a base station and a terminal.)

In FIG. 4( a ), when the access point AP 1 attempts to send data to the access point AP 2 , the access point AP 1 sends the data after a predetermined period called DIFS (Distributed Inter Frame Space) and a random Backoff time (Step S 01 ). In response to the data, the access point AP 2 sends an ACK (ACKnowledgement) packet (Step S 02 ).

In FIG. 4( b ), when the access point AP 1 attempts to send data to the access point AP 2 , the access point AP 1 sends a RTS (Request To Send) packet indicating the following data transmission, after the predetermined perid DIFS and the random Backoff time, prior to sending the data (Step S 1 ). In response to the RTS packet, the access point AP 2 returns a CTS (Clear To Send) packet which allows the data transmission (Step S 2 ). In response to the CTS packet, the access point AP 1 sends data (Step S 3 ), and then access point AP 2 returns an ACK packet after receiving the data (Step S 4 ). This CTS/CTS mechanism is able to solve a hidden terminal problem.

According to the approach shown in FIGS. 4( a ) and ( b ), the number of data transmissions is limited even if the access point transmits data continuously (not interrupted by another access point data transmission), because the waiting period for Backoff is required for each data transmission.

FIGS. 5( a ) and ( b ) show examples of data transmission in accordance with IEEE 802.11e. A TXOP (Transmission Opportunity) is introduced for QoS (Quality of Service) support and improved efficiency (See Non-Patent Reference 2, for example). In FIG. 5( b ), the RTS/CTS is exchanged when the hidden terminal problem mentioned in FIG. 4( b ) is happening.

In FIG. 5( a ), when the access point AP 1 attempts to send data to the access point AP 2 , the access point AP 1 sends a data transmission after the predetermined period DIFS and the random Backoff time (Step S 011 ). In response to the data transmission, the access point AP 2 sends the ACK packet as well. However, the access point AP 1 can send the next data transmissions continuously during a predetermined duration called “TXOP Limit”, upon receiving the ACK packet from the access point AP 2 .

In FIG. 5( b ), when the access point AP 1 attempts to send data to the access point AP 2 , the access point AP 1 sends the RTS packet to the access point AP 2 (Step S 11 ). In response to the RTS packet, the access point AP 2 returns the CTS packet which allows the data transmission (Step S 12 ), and then the access point AP 1 starts sending data (Step S 13 ) as well. However, the access point AP 1 can send the next data transmissions continuously during the predetermined duration “TXOP Limit” (Step S 15 and S 17 ), upon receiving the corresponding ACK packets from the access point AP 2 (Step S 14 , S 16 and S 18 ).

According to the approach shown in FIG. 5 , the amount of data to be transmitted per unit time (Packet Transmission Rate) is increased and efficient data transmission is possible, because the waiting period for Backoff is not required, compared to the approach shown in FIG. 4 .

[Non-Patent Reference 1] ANSI/IEEE std 802.11, Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, 1999

[Non-Patent Reference 2] IEEE P802.11e/D9.0, August 2004

[Non-Patent Reference 3] Fusao Nuno, Ichihiko Toyoda, and Masahiro Umehira, “Performance evaluation of QoS Control Scheme that uses back pressure traffic control,” PIMRC2004, Vol. 2, pp. 830-834

Problem(s) to be Solved by the Invention

The conventional wireless ad-hoc network system based on the above-mentioned protocol has the following problems.

First, each of the access points AP 1 -AP 4 in FIG. 1 acquires a transmission opportunity with an equal probability. In this case, the access points AP 2 and AP 3 act as relay nodes to relay data for the other access points. Therefore, the access points AP 2 and AP 3 have a larger amount of data and acquire fewer transmission opportunities compared to the access points AP 1 and AP 4 located at the left/right ends. As a result, data may overflow from a transmission buffer (a relay buffer) for storing data to be transmitted, retransmission for the overflowed data may be required, and throughput within the whole wireless ad-hoc network system may be degraded.

In addition, when applied to the TXOP shown in FIG. 5 , the above-mentioned buffer overlow becomes significant; nevertheless the TXOP aims to improve throughput within the system. Because each of the access points AP 1 -AP 4 transmits a larger amount of data, the data stored in the relay node becomes larger.

With reference to FIG. 6 and FIG. 7 , the problem with regard to buffer overflow is described below.

In FIG. 6 , access points AP 1 -AP 3 send data to an access point AP 4 , and the access point AP 4 sends data to access points AP 5 -AP 7 . The access point AP 4 acts as a relay node within the wireless ad-hoc network. When applied to the wireless LAN standard in accordance with the above-mentioned Non-Patent Reference 1, each of the access points AP 1 -AP 4 acquires the transmission opportunity equally. Then, the amount of data to be transmitted from the access point AP 4 to the access points AP 5 -AP 7 will be approximately one third of the total amount of data to be transmitted from the access points AP 1 -AP 3 to the access pioint AP 4 . Therefore, data packets tend to remain at the transmission buffer in the access point AP 4 as a relay node, and buffer overflow occurs when the data packets reach the limit of the buffer.

In FIG. 7 , an access point AP 1 sends data to an access point AP 4 via access points AP 2 and AP 3 , and at the same time the access point AP 4 sends data to the access point AP 1 via the access points AP 3 and AP 2 . Within this network, the access points for sending data (AP 1 and AP 4 ) send data to their neighbor access points (AP 1 sends data to AP 2 , and AP 4 sends data to AP 3 ). However, the access points as relay nodes (AP 2 and AP 3 ) need to relay data to plural of their neighbor access points (AP 2 sends data to AP 1 and AP 3 , and AP 3 sends data to AP 2 and AP 4 ). Therefore, the access points as relay nodes (AP 2 and AP 3 ) need to acquire more transmission opportunities than the access points for sending data (AP 1 and AP 4 ); otherwise, data packets remain at the transmission buffer and accordingly buffer overflow occurs.

When buffer overflow occurs within the wireless ad-hoc network, the relay node will discard the data packets communicated via plural relay nodes using wireless resources. Discarding data packets due to buffer overflow wastes the wireless resources. Therefore, buffer overflow in the relay node may cause a serious problem within the wireless ad-hoc network.

In this regard, the current wireless LAN standards (such as Non-Patent Reference 1) do not define the technologies to solve the problem of buffer overflow in the relay node. Therefore, the performance in the relay node will be degraded significantly due to buffer overflow, when those standards are applied to the wireless ad-hoc network.

Non-Patent Reference 3 describes the technology to avoid data packets remaining at the buffer. According to the Non-Patent Reference 3, a field comprising 1 bit is added to the ACK packet transmitted from the relay node. When buffer overflow is likely to occur, the command to decrease the rate is transmitted to the sending node. This technology uses only 1 bit to control traffic for the sending node, and does not take into consideration the amount of data to be transmitted (Packet Transmission Rate) and the amount of data packets at the transmission buffer.

In view of the above-mentioned problems, it is a general object of the present invention to provide a wireless communication device, a wireless communication system and a wireless communication method for preventing buffer overflow due to data packets remaining in a relay node within a wireless ad-hoc network system, and for improving throughput within the whole system.

Means for Solving the Problem

The above-mentioned object is achieved by a wireless communication device within a wireless ad-hoc network system, comprising:

an information acquisition unit configured to acquire information on the amount of data relay processing in the wireless communication device and/or a neighbor wireless communication device;

a priority calculation unit configured to calculate a transmission priority of the wireless communication device, based on the acquired information; and

a priority determination unit configured to determine a priority related parameter for data transmission from the wireless communication device, based on the transmission priority.

The above-mentioned object is also achieved by a wireless ad-hoc network system in which one of a plurarity of wireless communication devices communicates data with a neighbor wireless communication device, and relays the data from a source wireless communication device to a destination wireless communication device, wherein

the one of the wireless communication devices comprises:

an information acquisition unit configured to acquire information on the amount of data relay processing in the neighbor wireless communication device;

a setting unit configured to set transmission probability of both the one wireless communication divice and the neighbor wireless communication device below a predetermined value, based on the acquired information.

In addition, the above-mentioned object is also achieved by a wireless communication method within a wireless ad-hoc network system, comprising the steps of:

acquiring information on the amount of data relay processing in a wireless communication device and/or a neighbor wireless communication device;

calculating a transmission priority of the wireless communication device, based on the acquired information; and

determining a priority related parameter for data transmission from the wireless communication device, based on the transmission priority.

Effect of the Invention

According to the embodiments of the present invention, it is possible to prevent buffer overflow due to data packets remaining in a relay node, to improve throughput within the whole system, and to improve performance within the whole wireless ad-hoc network system.

Other objects, features and advantages of the present invention will become more apparent from the following detailed description when read in conjunction with the accompanying drawings, in which:

FIG. 1 shows an example of a wireless ad-hoc network system;

FIG. 2 shows an example of an ad-hoc based network;

FIG. 3 shows an example of a mesh based network;

FIG. 4 shows examples of data transmission in accordance with IEEE 802.11;

FIG. 5 shows examples of data transmission in accordance with IEEE 802.11e;

FIG. 6 shows a first problem with regard to buffer overflow;

FIG. 7 shows a second problem with regard to buffer overflow;

FIG. 8 shows a wireless communication device according to a first embodiment of the present invention;

FIG. 9 shows an example of stations within a coverage area of each access point;

FIG. 10 shows an example of association relationships among access points;

FIG. 11 shows an EDCA parameter;

FIG. 12 is a flowchart which illustrates data transmission processing in the first embodiment of the invention;

FIG. 13 shows a wireless communication device according to a second embodiment of the present invention;

FIG. 14 shows an example of the amount of data at the transmission buffer in each access point;

FIG. 15 is a flowchart which illustrates data transmission processing in the first embodiment of the invention;

FIG. 16 shows a wireless communication device according to a third embodiment of the present invention;

FIG. 17 is a flowchart which illustrates data transmission processing in the third embodiment of the invention;

FIG. 18 shows a wireless communication device according to a fourth embodiment of the present invention;

FIG. 19 is a flowchart which illustrates flow control in the fourth embodiment of the invention;

FIG. 20 shows an example of the amount of transmission traffic monitored by each access point;

FIG. 21 shows another example of the amount of transmission traffic monitored by each access point;

FIG. 22 shows an example of a signaling mechanism by means of unicast;

FIG. 23 shows an example of a signaling mechanism by means of a beacon;

FIG. 24 shows an example of a signaling mechanism in a star topology;

FIG. 25 shows an example packet for flow control;

FIG. 26 shows another example packet for flow control;

FIG. 27 shows another example packet for flow control;

FIG. 28 shows yet another example packet for flow control;

FIG. 29 shows an example ACK packet for flow control; and

FIG. 30 shows an example of the control of Packet Transmission Rate.

In the following, embodiments of the present invention are described according to the IEEE 802.11 wireless LAN protocol (Non-Patent Reference 1).

First Embodiment

FIG. 8 shows a wireless communication device according to a first embodiment of the present invention.

In FIG. 8 , the wireless communication device acting as an access point AP includes the following data transmission (data relay) functions: a transmission buffer 1 for temporarily storing data to be transmitted (received signals); a priority control module 2 for transmitting data based on a transmission priority calculated from a priority related parameter (explained below); an association information module 3 for counting the number of stations (STAs) within a coverage area of its own access point AP and the number of neighbor nodes in direct association with its own access point AP, and for acquiring information on the amount of data relay processing; a priority calculation module 4 for calculating the transmission priority of its own access point AP based on the information from the association information module 3 , and for determining the priority related parameter of the priority control module 2 .

FIG. 9 shows an example of stations within a coverage area of each access point. Within the coverage areas, an access point AP 1 has three stations (STAs), an access point AP 2 has six stations, an access point AP 3 has one station, and an access point AP 2 has two stations. The association information module 3 ( FIG. 8 ) in each of the access points AP 1 -AP 4 counts the number of stations within the coverage area of its own access point. Based on the number of stations within the coverage area, the priority calculation module 4 calculates the transmission priority. More specifically, if the number of stations within the coverage area increases, the amount of data relay processing is expected to be increased. In this case, the priority calculation module 4 sets a higher priority, in order to prevent buffer overflow.

FIG. 10 shows an example of association relationships among access points. An access point AP 1 has one neighbor node (associated with AP 4 ), an access point AP 2 has one neighbor node (associated with AP 3 ), access point AP 3 has two neighbor nodes (associated with AP 2 and AP 4 ), access point AP 4 has three neighbor nodes (associated with AP 1 , AP 3 and AP 5 ), access point AP 5 has two neighbor access points (associated with AP 4 and AP 6 ), and access point AP 6 has one neighbor access point (associated with AP 5 ). The association information module 3 ( FIG. 8 ) in each of the access points AP 1 -AP 4 counts the number of its neighbor nodes. Based on the number of its neighbor nodes, the priority calculation module 4 calculates the transmission priority. More specifically, if the number of neighbor nodes increases, the amount of data relay processing is expected to be increased. In this case, the priority calculation module 4 sets a higher priority, in order to prevent buffer overflow.

Controlling the amount of data to be transmitted based on the transmission priority calculated by the priority control module 2 can be achieved by changing an EDCA (Enhanced Distributed Channel Access) parameter defined in IEEE 802.11e. Conventionally, the EDCA is a mechanism for QoS. In this embodiment, the EDCA is used to control transmission traffic.

FIG. 11 shows an EDCA parameter. The EDCA parameter for determining the EDCA operation includes AIFS (Arbitrary Inter Frame Space), Backoff and TXOP Limit (Transmission Opportunity Limit). AIFS defines a predetermined period necessary to wait before Backoff, Backoff defines a random time necessary to wait before transmitting the packet, and TXOP Limit defines the duration for which one node can transmit data packets continuously.

AIFS is a fixed period which can be derived from the following equation:

AIFS=AIFSN*SlotTime,

where AIFSN (Arbitrary Inter Frame Space Number) is a fixed value determined from the priority of QoS, and SlotTime is a slot time determined by the physical layer protocol. According to IEEE 802.11, the default value for AIFSN is 2, and default value for SlotTime is 20 μs.

Backoff is a random time which can be derived from the following equation:

Backoff=random( )*SlotTime,

where random( ) is a random value selected from a closed interval [0, CW]. CW (Contention Window) is a fixed value determined from the physical layer, the number of times to be retransmitted, the priority of QoS, etc. Particularly, the CW value before retransmission is called CWmin. For example, the default value for CWmin is 31 according to IEEE 802.11. In this case, using 20 μs of SlotTime, the average Backoff is derived to be 310 μs.

TXOP Limit is a fixed value determined from the priority of QoS only. Without QoS, TXOP Limit is not defined and only one packet can be transmitted (plural packets cannot be transmitted continuously).

Therefore, by making the AIFSN parameter smaller, the waiting period before transmitting data will be shorter, and then the transmission priority will be higher. In addition, by making the CW parameter smaller, the Backoff time will be shorter, and then the transmission priority will be higher. Moreover, by making the TXOP Limit parameter longer, the access point can occupy the bandwidth over a longer time period, and then the transmission priority will be higher.

FIG. 12 is a flowchart which illustrates data transmission processing in the first embodiment shown in FIG. 8 .

In FIG. 12 , each access point AP within the wireless ad-hoc network system receives a beacon and the like from the other access points under the control of the association information module 3 (Step S 101 ), and counts the number of stations within the coverage area of the access point AP and the number of neighbor nodes associated with the access point AP (Step S 102 ).

Next, the priority calculation module 4 calculates the transmission priority based on the number of stations and the number of the access points acquired by the association information module 3 , and determines the priority related parameter (CW, AIFSN and/or TXOP Limit) (Step S 103 ).

Then, the priority control module 2 transmits data held at the transmission buffer 1 , based on the priority related parameter (Step S 104 ).

Second Embodiment

FIG. 13 shows a wireless communication device according to a second embodiment of the present invention. The priority calculation module 4 acquires information on the amount of buffered data indicating the amount of data relay processing from a transmission buffer 1 . Then, the priority calculation module 4 calculates the transmission priority of its own access point AP based on the information on the amount of buffered data, and determines the priority related parameter of the priority control module 2 . The other components operate similarly to the components shown in FIG. 8 . It is noted that the wireless communication device in FIG. 13 may include the association information module 3 in FIG. 8 , and use the number of stations, the number of neighbor nodes and the amount of buffered data to determine the priority related parameter in the priority calculation module 4 .

FIG. 14 shows an example of the amount of data at the transmission buffer in each access point. The amount of buffered data in an access point A 3 is largest, that in an access point A 2 is the second largest, that in an access point A 1 is the third largest, and that in an access point A 4 is the smallest. Each of the access points AP 1 -AP 4 monitors its own transmission buffer 1 ( FIG. 13 ), and the priority calculation module 4 calculates the transmission priority based on the amount of buffered data. More specifically, if the amount of buffered data increases, the amount of data relay processing is expected to be increased. In this case, the priority calculation module 4 sets a higher priority, in order to prevent buffer overflow.

FIG. 15 is a flowchart which illustrates data transmission processing in the second embodiment shown in FIG. 13 .

In FIG. 15 , using the priority calculation module 4 , each access point AP within the wireless ad-hoc network system monitors the amount of data at the transmission buffer (Step S 201 ), and calculates the ratio of the data size to the whole buffer size (Step S 202 ).

Next, the priority calculation module 4 calculates the transmission priority based on the ratio of the data size to the whole buffer size, and determines the priority related parameter (CW, AIFSN and/or TXOP Limit) (Step S 203 ).

Then the priority control module 2 transmits data held at the transmission buffer 1 , based on the priority related parameter (Step S 204 ).

Third Embodiment

FIG. 16 shows a wireless communication device according to a third embodiment of the present invention. A neighbor AP information exchange module 5 exchanges the number of stations within the coverage area, the number of neighbor nodes, and the amount of buffered data in its own access point with a neighbor access point. The priority calculation module 4 determines the priority related parameter, considering the number of stations within the coverage area, the number of neighbor nodes, and the amount of bufferd data in both its own access point and the neighbor access point. In this case, the wireless communication device can determine the transmission priority relative to the other wireless communication devices, and it is possible to adapt the transmission priority to the network conditions.

FIG. 17 is a flowchart which illustrates data transmission processing in the third embodiment shown in FIG. 16 .

In FIG. 17 , using the neighbor AP information exchange module 5 , each access point AP within the wireless ad-hoc network system transmits the number of stations within the coverage area, the number of its neighbor nodes, and the amount of buffered data (the ratio) acquired by the association information module 3 to the neighbor access point using a beacon and the like (Step S 301 ).

At the same time, the neighbor AP information exchange module 5 receives the number of stations within the coverage area, the number of neighbor nodes, and the amount of buffered data in the neighbor access point (Step S 302 ).

Next, the priority calculation module 4 compares the information acquired from the neighbor access point by the neighbor AP information exchange module 5 with the number of stations, the number of its neighbor nodes, and the amount of buffered data in its own access point acquired by the association information module 3 (Step S 303 ). Based on this total comparison, the priority calculation module 4 calculates the transmission priority and determines the priority related parameter (CW, AIFSN and/or TXOP Limit) (Step S 304 ).

Then the priority control module 2 transmits data held at the transmission buffer 1 , based on the priority related parameter (Step S 305 ).

Fourth Embodiment

FIG. 18 shows a wireless communication device according to a fourth embodiment of the present invention. The neighbor AP information exchange module 5 transmits information on the amount of transmission traffic and the like to the neighbor access point, for example using a signaling mechanism, as a control packet. At the same time, the neighbor AP information exchange module 5 recieves a control packet from the neighbor access point, and the priority calculation module 4 determines the priority related parameter.

FIG. 19 is a flowchart which illustrates flow control in the fourth embodiment. The flowchart is classified into the following three steps.

(1) Monitoring the amount of transmission traffic and the amount of buffered data;

(2) Transmitting the monitored information to the neighbor node using a signaling mechanism and the like; and

(3) Controlling the transmission traffic.

In FIG. 19 , the access point which relays data packets constantly monitors the amount of transmission traffic and the number of packets at the transmission buffer (Step S 401 ). Since the amount of transmission traffic and the number of packets at the transmission buffer can change at any time, the relay access point constantly monitors them. Then, the access point which relays data packets transmits the monitored information (the amount of transmission traffic and the number of packets at the transmission buffer) to the associated neighbor access point using a control packet (Step S 402 ).

When the associated neighbor access point receives the control packet (Step S 403 ), it controls transmission traffic by controlling the above-mentioned EDCA parameter based on the monitored information (the amount of transmission traffic and the number of packets at the transmission buffer in the relay node) included in the control packet.

In the following, each of the above steps is described in detail.

FIG. 20 shows an example of the amount of transmission traffic monitored by each access point. Each of access points AP 1 -AP 4 monitors its own transmission traffic. For example, the access point AP 1 monitors its transmission traffic F 1 , the access point AP 2 monitors its transmission traffic F 2 and R 3 , the access point AP 3 monitors its transmission traffic F 3 and R 2 , and the access point AP 4 monitors its transmission traffic R 1 .

FIG. 21 shows another example of the amount of transmission traffic monitored by each access point. An access point AP 1 monitors its transmission traffic F 1 , an access point AP 2 monitors its transmission traffic F 2 , an access point AP 3 monitors its transmission traffic F 3 , and an access point AP 4 monitors either transmission traffic F 5 , F 6 and F 7 respectively transmitted to access points AP 5 -AP 7 or total transmission traffic F 4 (F 5 +F 6 +F 7 ).

It is noted that monitoring the amount of transmission traffic is achieved by monitoring the number of received ACK packets with respect to the data packets sent from the access point for a certain period of time. The access point may use a peak value of the amount of transmission traffic, instead of the amount of transmission traffic for a certain period of time. In addition to the total amount of transmission traffic, the access point may collect and transmit statistical traffic information for either each priority of QoS or each link for the purpose of accurate flow control. With regard to the period of monitoring, the access point may use the average or the running average for a predetermined period.

As a signaling mechanism for transmitting information to the neighbor access point, either of the following two options can be used.

(1) By means of unicast; and

(2) By means of a beacon transmitted periodically.

Unicast (1) has an advantage of ensuring the transmission of the signal controlling the transmission rate to the receiver. FIG. 22 shows an example of a signaling mechanism by means of unicast. For example, an access point AP 3 sends transmission traffic F 3 to an access point AP 4 and transmission traffic R 2 (in the opposite direction) to an access point AP 2 , including a FC-Req (Flow Control Request) packet. When the access points AP 2 and AP 4 receive the FC-Req, they each return a FC-Res (Flow control Response) to the access point AP 3 . This signaling mechanism by means of unicast can ensure communications with the neighbor nodes. However, if the number of nodes associated with the relay node increases, the number of unicast packets is expected to be increased, which may cause degradation in the wireless bandwidth (throughput).

FIG. 23 shows an example of a signaling mechanism by means of a beacon, in which flow control signaling is achieved by adding a new element to the beacon packet broadcast periodically. This signaling mechanism is achieved easily, because it adds the new element to the packet instead of defining a new packet for flow control. However, this signaling mechanism has disadvantages in that reliability will be reduced due to broadcasting and flow control for a short period cannot be achieved due to periodic broadcasting.

FIG. 24 shows an example of a signaling mechanism in a star topology, in which FC-Req (Flow Control Request) packets are transmitted from a relay access point AP 4 to access points AP 1 -AP 3 attempting to send data to this access point AP 4 .

FIG. 25-FIG . 28 show example frames used for flow control. Each of the frames has the example element included in a packet, and can be applied to both the mechanisms by means of unicast and the mechanisms by means of the beacon.

A packet shown in FIG. 25 has an Element ID, a length of the payload (Length) and the amount of data transmission (Packet Transmission Rate), which are elements used for transmitting the amount of data transmission in the access point to the neighbor node. A packet shown in FIG. 26 has an Element ID, a length of the payload (Length) and the number of associated nodes (Number of associated MP (Mesh Point)), which are elements used for transmitting the number of associated nodes to the neighbor node, as additional information. A packet shown in FIG. 27 has an Element ID, a length of the payload (Length), an identifier for links (Associated MP's MAC Address), and the amount of received data (Packet receiving rate), which shows the amount of data received by the node for each link. FIG. 28 shows an example element including a Peak Data Rate for each priority AC (Access Category) of QoS. The packet shown in FIG. 28 further includes an Expiration Timer which indicates the time when the node receiving the Flow Control Request packet should control transmission traffic.

Typically, the Flow Control Response is just an ACK (ACKnowledgement) packet. In addition, the Flow Control Response may include the amount of requested transmission traffic (Offered Load). Also, the the amount of requested transmission traffic may be transmitted after being categorized into each priority of QoS. In this case, the access point which has the larger amount of requested transmission traffic can be given a higher priority for transmitting data. FIG. 29 shows an example element indicating the amount of requested transmission traffic for each AC, which can be included in the ACK packet.

In the following, the control of Packet Transmission Rate in the node which receives the above-mentioned packet for flow control is described. It is noted that the sending procedures for the control of Packet Transmission Rate by means of unicast are different from those by means of a beacon, but receiving procedures are the same. With reference to FIG. 30 , the control of Packet Transmission Rate is described based on the signaling mechanism by means of unicast.

FIG. 30 shows an example of the control of Packet Transmission Rate. An access point AP 2 controls the transmission rate, using information on the amount of transmission traffic and the number of associated nodes included in a flow control packet received from an access point AP 3 . For example, when “Offerd Load” in the frame indicates “6 Mbps” and “Number of associated MP on the receiving side” indicates “2”, transmission traffic in the access point AP 2 should be 3 Mbps (6 Mbps/2) or less. If transmission traffic is above 3 Mbps, the amount of buffered data in the access point AP 3 will be increased. For this reason, the access point AP 2 increments the value of AIFSN, in order to decrease transmission traffic. On the other hand, if transmission traffic is below 3 Mbps, for the access point AP 2 it is possible to decrement the value of AIFSN in response to the request from an application, so as to increase transmission traffic. Instead of changing the value of AIFSN, CWmin and/or TXOP Limit may be changed in order to decrease or increase Packet Transmission Rate. In case of changing CWmin and/or TXOP Limit, Packet Transmission Rate can be decreased or increased significantly, compared to changing AIFSN. On the other hand, the control of Packet Transmission Rate using AIFSN can be more moderate than the control using CWmin and/or TXOP Limit. It is noted that AIFSN, CWmin and/or TXOP Limit can be controlled using buffer usage included in the flow control packet. For example, when the buffer usage becomes above half of the buffer capacity while the Packet Transmission Rate at the relay node included in the flow control packet remains below its threshold, it is possible to increase AIFSN and/or CWmin and decrease TXOP Limit to prevent buffer overflow.

As described above, the access point according to the present invention acquires the number of stations within the coverage area, the number of neighbor nodes, and the amount of buffered data, as information on the amount of data relay processing in the own access point (and the other access points, if necessary). Based on the information, the access point calculates the transmission priority and determines the priority related parameter (CW, AIFSN and/or TXOP Limit) for data transmission. As a result, it is possible to prevent buffer overflow in the access point acting as a relay node that is likely to have the larger amount of data to be processed, and to improve throughput within the whole system. For example, the present invention can be applied to VoIP (Voice over Internet Protocol) which requires high capacity and short delay, in order to improve performance within the network. VoIP is expected to be used as an application within the wireless ad-hoc network system.

In addition, the access point according to the present invention controls the priority related parameter and does not change its data transmission protocol itself. For this reason, the access point applying the present invention can communicate with an access point that does not apply the present invention. That is, the access point according to the present invention has backward compatibility.

The description of the embodiments of the present invention is given above for the understanding of the present invention. It will be understood that the invention is not limited to the particular embodiments described herein, but is capable of various modifications, rearrangements and substitutions as will now be apparent to those skilled in the art without departing from the scope of the invention. Therefore, it is intended that the following claims cover all such modifications and changes that fall within the true spirit and scope of the invention.

The present application is based on Japanese Priority Applications No. 2004-254595 filed on Sep. 1, 2004 and No. 2005-156395 filed on May 27, 2005 with the Japanese Patent Office, the entire contents of which are hereby incorporated by reference.