Pending data announcements

• US 20030081603A1
• Filed: 10/26/2001
• Published: 05/01/2003
• Est. Priority Date: 10/26/2001
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Rune, Johan
• Application Number:
  US09/983,906
• Publication Number:
  US 20030081603A1
• Time in Patent Office: Days
• US Class Current: 370/390
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

In an ad-hoc network information about data pending in a master node is distributed to the slave nodes of the master node. The information about pending data can be distributed in a beacon message which is sent by a master node at the expiration of a beacon interval. Alternatively, the information can be distributed in every message transmitted by a master node. The information can be in the form of a list or a bit map. The information can be either an indication that data is pending in the master node, or the information can be more detailed. The more detailed information can include whether the data pending in the master node is in danger of being dropped by the master node, the size of the pending data or the urgency associated with the pending data. Yet an alternative is to use predefined time slots for each slave node of the master node to exchange information about pending data. The information sent from the master would concern data pending in the master for the particular slave. The information sent from the slave would concern data pending in the slave.

Claims

1. A method for providing information regarding pending data in an ad-hoc network, the ad-hoc network including at least a master node and a slave node, the method comprising the steps of:

broadcasting a message, from the master node, indicating whether data is pending in the master node for any of the slave nodes of the master node;

returning to the master node'"'"'s network by the slave node, if the slave node is not currently active in the master node'"'"'s network, wherein the slave node returns to the master node'"'"'s network and the master node broadcasts the message once every predefined interval;

receiving the message by the slave node; and

controlling, by the slave node, the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the message.

2. The method of claim 1, further comprising the steps of:

returning to the master node'"'"'s network by another slave node, if the another slave node is not currently active in the master node'"'"'s network, wherein the another slave node returns to the master node'"'"'s network once every predefined interval;

receiving the message by the another slave node; and

controlling, by the another slave node, the time in which the another slave node participates in all of the networks in which the another slave node is a member as a function of the message.

3. The method of claim 1, wherein the message includes a bit map which indicates which slave nodes have data pending in the master node.

4. The method of claim 1, wherein the message includes a list of slave nodes for which the master node has data pending.

5. The method of claim 1, wherein the message also includes information about the size of the pending data.

6. The method of claim 5, wherein the message also includes information about whether the pending data is going to be dropped by the master node.

7. The method of claim 5, wherein the message also includes an indication of urgency associated with the pending data.

8. The method of claim 1, wherein the message also includes information regarding a next network switch of the master node.

9. The method of claim 1, wherein the ad-hoc network operates in accordance with Bluetooth protocol.

10. The method of claim 1, wherein the slave node operates on a time-division basis between the master node'"'"'s network and any other network in which the slave node participates.

11. The method of claim 1, wherein the predefined interval is a prime number of time slots.

12. The method of claim 1, further comprising the steps of:

broadcasting another message, from the master node, indicating data pending in the master node for all slave nodes of the master node;

returning to the master node'"'"'s network by the slave node, if the slave node is not currently active in the master node'"'"'s network, wherein the slave node returns to the master node'"'"'s network at the predefined interval and the master node broadcasts the another message two time slots after the predefined interval;

receiving the another message by the slave node; and

controlling, by the slave node, the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the another message.

13. A method for providing information regarding pending data in an ad-hoc network, the ad-hoc network including at least a master node and a slave node, the method comprising the steps of:

sending a message, from the master node to the slave node, wherein the message includes, in addition to any data intended for the slave node, an indication of whether data is pending in the master node for any of the slave nodes of the master node;

receiving the message by another slave node;

controlling, by the another slave node, the time in which the another slave node participates in all of the networks in which the another slave node is a member as a function of the message.

14. The method of claim 13, wherein the indication of data pending in the master node is included in a header of the message.

15. The method of claim 14, wherein the header is a baseband header.

16. The method of claim 14, wherein the header is a payload header of the message.

17. The method of claim 13, wherein the message includes a polling pause indicator which indicates to the slave node that the master node will not poll the slave node for a predetermined time period.

18. The method of claim 13, wherein the indication of data pending in the master node is conveyed in a bit map.

19. The method of claim 13, wherein the indication of data pending is included in an extension to a header of the message, the presence of the extension to the header indicated by a bit in the header.

20. The method of claim 13, further comprising the step of:

notifying, all slave nodes of the master node that support the indication of pending data, of which slave nodes of the master node support the indication of pending data.

21. The method of claim 13, wherein the master node only indicates the data pending if all slave nodes support the pending data indication.

22. A method for providing information regarding pending data in an ad-hoc network, the ad-hoc network including at least a master node and a slave node, the method comprising the steps of:

sending a message from the master node to the slave node, wherein the message indicates that the master node will not poll the slave node for a predetermined time period; and

controlling, by the slave node, the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the predetermined time period.

23. The method of claim 22, wherein the message further includes an indication of whether data is pending in the master node for the slave node.

24. The method of claim 23, wherein the indication of whether data is pending in the master node for the slave node is conveyed in a bit map.

25. The method of claim 23, wherein the indication of whether data is pending in the master node for the slave node is conveyed in a list.

26. An ad-hoc network comprising:

a first subnetwork, the first subnetwork including a first master node;

a second subnetwork, the second subnetwork including a second master node;

a slave node, the slave node participates in the first and second subnetworks on a time-division basis;

wherein the first master node broadcasts a message indicating whether data is pending in the first master node for any of the slave nodes of the first master node, and

wherein the slave node returns to the first subnetwork, if the slave node is not currently active in the first subnetwork, and the first master node broadcasts the message once every predefined interval.

27. The network of claim 26, wherein the second master node broadcasts a message indicating data pending in the second master node for all slave nodes of the second master node, and

wherein the slave node returns to the second subnetwork, if the slave node is not currently active in the second subnetwork, and the second master node broadcasts the message once every another predefined interval.

28. The network of claim 27, wherein the slave node controls the time in which the slave node participates in the first and second subnetworks as a function of the messages.

29. The network of claim 26, wherein the message includes a bit map which indicates which slave nodes have data pending in the master node.

30. The network of claim 26, wherein the message includes a list of slave nodes for which the master node has data pending.

31. The network of claim 26, wherein the message also includes information about the size of the pending data.

32. The network of claim 31, wherein the message also includes information about whether the pending data is going to be dropped by the master node.

33. The network of claim 31, wherein the message also includes an indication of urgency associated with the pending data.

34. The network of claim 26, wherein the ad-hoc network operates in accordance with Bluetooth protocol.

35. The network of claim 26, wherein the slave node operates on a time-division basis between the master node'"'"'s network and any other network in which the slave node participates.

36. The network of claim 26, wherein the master node broadcasts another message indicating data pending in the master node for all slave nodes of the master node,

wherein the slave node returns to the master node'"'"'s network if the slave node is not currently active in the master node'"'"'s network, wherein the slave node returns to the master node'"'"'s network at the predefined interval and the master node broadcasts the another message two time slots after the predefined interval,

wherein the slave node receives the another message and controls the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the another message.

37. An ad-hoc network comprising:

a first subnetwork, the first subnetwork including a first master node;

a second subnetwork, the second subnetwork including a second master node;

a slave node, the slave node participates in the first and second subnetworks on a time-division basis;

wherein in every message sent by the first master node the message includes, in addition to any data intended for the slave node to which the message is addressed, an indication of whether data is pending in the first master node for any of the slave nodes of the first master node.

38. The network of claim 37, wherein the slave node controls the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the message.

39. The network of claim 37, wherein the indication of data pending in the master node is included in a header of the message.

40. The network of claim 39, wherein the header is a baseband header.

41. The network of claim 39, wherein the header is a payload header of the message.

42. The network of claim 37, wherein the message includes a polling pause indicator which indicates to the slave node that the master node will not poll the slave node for a predetermined time period.

43. The network of claim 37, wherein the indication of data pending in the master node is conveyed in a bit map.

44. The network of claim 37, wherein the indication of data pending is included in an extension to a header of the message, the presence of the extension to the header indicated by a bit in the header.

45. The network of claim 37, wherein the master node informs all of the slave nodes that support the indication of pending data, of which slave nodes of the master node support the indication of pending data.

46. The network of claim 37, wherein the master node only indicates the data pending if all slave nodes support the pending data indication.

47. The network of claim 37, wherein the indication of data pending is included in an extension to a header of the message, wherein the presence of the extension to the header is indicated by an L_CH field being set to 00.

48. A method for providing information regarding pending data in an ad-hoc network, the ad-hoc network including at least a master node and a slave node, the method comprising the steps of:

sending a message, from the master node to the slave node, indicating whether data is pending in the master node for the slave node;

returning to the master node'"'"'s network by the slave node, if the slave node is not currently active in the master node'"'"'s network, wherein the slave node returns to the master node'"'"'s network and the master node sends the message once every predefined interval, wherein the predefined interval is unique for each slave of the master node'"'"'s network;

receiving the message by the slave node; and

controlling, by the slave node, the time in which the slave node participates in all of the networks in which the slave node is a member as a function of the message.

49. The method of claim 48, further comprising the steps of:

determining the unique predefined interval for each slave node in the master node'"'"'s network; and

informing the each slave node of the respective unique predefined interval.

50. The method of claim 49, wherein the unique predefined interval is selected based upon a member address of the master node'"'"'s network for each slave node.

51. The method of claim 50, wherein the unique predefined interval is selected also based upon a clock of the master node.

52. The method of claim 48, further comprising the step of:

negotiating, by the master node, the unique predefined interval with each slave node.

53. The method of claim 48, further comprising the step of:

responding, by the slave node, to the message from the master node, wherein the response contains information about data pending in the slave node for the master node.