Wireless communication apparatus and method using an adaptive credit redistribution algorithm

• US 7,505,778 B2
• Filed: 03/01/2004
• Issued: 03/17/2009
• Est. Priority Date: 02/28/2003
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Park, Jong-hun, Lee, Tae-jin, Tchan, Kyun-hyon, Oh, Jong-soo, Chang, Ki-soo, Joo, Yang-ick, Eom, Doo-seop
• Primary Examiner(s): Urban; Edward
• Assistant Examiner(s): Daglawi; Amar
• Application Number:
  US10/788,316
• Publication Number:
  US 20040177038A1
• Time in Patent Office: 1,842 Days
• Field of Search: 455/518, 455/41.2, 455/512, 455/513, 455/412.1, 370/320, 370/412, 370/333, 705/39
• US Class Current: 455/518
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: H04W 28/24 Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
• CPC Class Codes: H04W 28/26 Resource reservation
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 92/02 Inter-networking arrangements

Abstract

A wireless communication method according to the present invention, in a Bluetooth device connected to multiple piconets and operating in a scatter mode, includes steps of (a) establishing credit values by link for the multiple piconets, and the total sum of the credit values by link as a temporary account value; (b) updating the credit values by link and the temporary account value every slot based on a predetermined manner; (c) performing communications through a link selected based on a comparison result of the credit values by link at each Presence Point(PP); and (d) unevenly redistributing predetermined credit values based on characteristics by link and returning to the step (b) in one of the two cases in which the communications are interrupted with a POLL_NULL sequence and the temporary account value becomes the same as the total number, n, of links.

Claims

1. A wireless communication method for a Bluetooth device connected to a plurality of piconets and operating in a scatter mode, comprising steps of:

(a) establishing credit values by link for the plurality of piconets, and a total sum of respective credit values of links as a temporary account value;

(b) updating the credit values by link and the temporary account value every slot based on a predetermined algorithm;

(c) performing communications through a link selected based on a comparison result of the respective credit values of links at each Presence Point (PP); and

(d) unevenly redistributing predetermined credit values based on respective characteristics of the links and returning to the step (b) in one of the two cases that the communications are interrupted with a POLL_NULL sequence and that the temporary account value becomes the same as the total number, n, of links,

wherein the step (d) redistributes a credit value C to the respective credit values of links based on the inverse of T<sub>scatter—

poll</sub> temporary account value becomes the same as the total number, n, links, the T<sub>scatter—

poll</sub> being a parameter negotiated between corresponding pioconets by a Link Manager Protocol (LMP) with a scatternet formed.

2. The wireless communication method as claimed in claim 1, wherein the step (b) updates the respective credit values of links by incrementing a credit value of a link performing communications every slot and keeping credit values of other links unchanged, and updates the temporary account value by repeating procedures of incrementing the temporary account value by one every slot and decrementing the temporary account value by n if the temporary account value becomes the same as the total number, n, of the links.

3. The wireless communication method according to claim 2, wherein the credit value is incremented by one and the temporary account value is incremented by one in the step(b).

4. The wireless communication method as claimed in claim 1, wherein the step (c) performs the communications through a link having a largest credit value out of a respective credit values of links.

5. The wireless communication method as claimed in claim 1, wherein the step (d) redistributes a credit value C calculated by a following formula to credit values of links except for a link to which a POLL_NULL sequence is sent, based on the inverse of the T_scatter—

_poll by link, if the POLL_NULL sequence occurs, the following formula being;

$C=\max (\left[\frac{n-1}{n}<br><br>\left(a<br><br><br><br>c_{\mathrm{red}}-a<br><br><br><br>c_{\min }\right)\right],\hspace{1em}<br><br>\left[\frac{n-1}{n}<br><br>\left(a<br><br><br><br>c_{\mathrm{red}}-a<br><br><br><br>c_{\max }+N_{\mathrm{switch}<br><br>\text{-}<br><br>\mathrm{th}}\right)\right]),$

where, n denotes the total number of links, ac_red denotes a credit value of a link to be redistributed, ac_max denotes the maximum credit value out of credit values of links to be redistributed, ac_min denotes the minimum credit value out of credit values of links to be redistributed, and N_switch-th denotes a threshold value for preventing frequent switchovers among piconets.

6. The wireless communication method as claimed in claim 1 wherein the credit values to be redistributed to the links are obtained by following formula:

$\left(\left[\frac{T_{\mathrm{scatter\_poll},1}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=1}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right],\left[\frac{T_{\mathrm{scatter\_poll},2}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=i}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right],\mathrm{\dots <br><br>}<br><br>,n-\underset{i=1}{\stackrel{n-1}{\sum <br><br>}}<br><br>\left[\frac{T_{\mathrm{scatter\_poll},i}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=1}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right]\right).$

7. A Bluetooth wireless communication apparatus connected to a plurality of piconets and operating in a scatter mode, comprising:

a buffer unit for storing credit values by link for the plurality of piconets, and the total sum of the respective credit values of links as a temporary account value;

a communication priority decision unit for updating the credit values by link and the temporary account value every slot based on a predetermined manner, and selecting a link to perform communications based on a comparison result of the credit values by link at each Presence Point(PP);

a credit redistribution unit for unevenly redistributing predetermined credit values based on respective characteristics of links in one of the two cases in which the communications are interrupted with a POLL_NULL sequence and the temporary account value becomes the same as the total number, n, of links; and

a communication initiation unit for initiating communications through a corresponding link selected in the communication priority decision unit,

wherein, if a POLL_NULL sequence occurs, the credit redistribution unit redistributes a credit value C calculated by a following formula to credit values of links except for a corresponding link, based on the inverse of a T<sub>scatter—

poll</sub> by link, said following formula being;

$C=\max (\left[\frac{n-1}{n}<br><br>\left(a<br><br><br><br>c_{\mathrm{red}}-a<br><br><br><br>c_{\min }\right)\right],\hspace{1em}<br><br>\left[\frac{n-1}{n}<br><br>\left(a<br><br><br><br>c_{\mathrm{red}}-a<br><br><br><br>c_{\max }+N_{\mathrm{switch}<br><br>\text{-}<br><br>\mathrm{th}}\right)\right]),$

where, n denotes the total number of links, ac_red denotes a credit value of a link to be redistributed, ac_max denotes the maximum credit value out of credit values of links to be redistributed, ac_min denotes the minimum credit value out of credit values of links to be redistributed, and N_switch-th denotes a threshold value for preventing frequent switchovers among piconets, and

wherein, in the credit redistribution unit, the credit values to be redistributed to the links are obtained by following formula wherein the Tscatter_poll being a parameter negotiated between corresponding piconets by the link Manager Protocol (LMP) with a scatternet formed;

$\left(\left[\frac{T_{\mathrm{scatter\_poll},1}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=1}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right],\left[\frac{T_{\mathrm{scatter\_poll},2}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=i}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right],\mathrm{\dots <br><br>}<br><br>,n-\underset{i=1}{\stackrel{n-1}{\sum <br><br>}}<br><br>\left[\frac{T_{\mathrm{scatter\_poll},i}^{-1}\times <br><br>c}{\stackrel{n}{\underset{i=1}{\sum <br><br>}}<br><br>T_{\mathrm{scatter\_poll},i}^{-1}}\right]\right).$

8. The wireless communication apparatus as claimed in claim 7, wherein the communication priority decision unit updates the credit values by link by incrementing by one a credit value of a link performing communications every slot and keeping credit values of the other links unchanged, and updates the temporary account value by repeating procedures of incrementing the temporary account value by one every slot and decrementing the temporary account value by n if the temporary account value becomes the same as the total number, n, of the links.

9. The wireless communication apparatus as claimed in claim 7, wherein the credit redistribution unit selects a link having the largest credit value out of the respective credit values of links as a link to perform communications.

10. The wireless communication apparatus as claimed in claim 7, wherein the credit redistribution unit redistributes a credit value C to the respective credit values of links based on the inverse of T_scatter—

_poll, by link if the temporary account value becomes the same as the total number, n, of links.