Demand-driven prioritized data structure

• US 7,801,073 B2
• Filed: 11/27/2007
• Issued: 09/21/2010
• Est. Priority Date: 11/27/2006
• Status: Active Grant

• Current Assignee: Nytell Software LLC (Intellectual Ventures LLC)
• Original Assignee: Telcordia Licensing Co LLC (Telefonaktiebolaget LM Ericsson)
• Inventors: Kim, Heechang, Siegell, Bruce, Lau, Richard
• Primary Examiner(s): Phunkulh; Bob A
• Application Number:
  US11/986,845
• Publication Number:
  US 20080212545A1
• Time in Patent Office: 1,029 Days
• Field of Search: None
• US Class Current: 370/328
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04W 28/021 in wireless networks with changing topologies, e.g. ad-hoc networks self-organizing networks H04W84/18
• CPC Class Codes: H04W 28/0231 based on communication conditions dynamic wireless traffic scheduling definition based on channel quality criteria H04W72/54
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A system and method for optimizing the efficiency of data sharing among a set of radio nodes in a radio environment is provided. The technique includes identifying a data unit and assigning it a class, identifying a connectivity type, computing a significance factor based on connectivity type and assigned class, mapping the significance factor to a priority factor, and scheduling output of the data unit based on the priority factor. A scheduler algorithm can be used for scheduling output. The class can be assigned based on which nodes of the set of radio nodes possess copies of the data unit at a given time. An arbitration process can be used to determine the priority factor. A significance factor weighting algorithm, based on how many nodes will be receiving the data and on how much a node needs the data, can be used to determine the significance factor.

Claims

1. A method for optimizing the efficiency of data sharing among a set of radio nodes in a radio environment, comprising:

identifying a data unit at a radio node;

assigning a class to said data unit based at least in part on a number of radio nodes in the set of radio nodes having said data unit;

identifying a connectivity type, the identifying comprising determining the radio node'"'"'s connectivity relative to other radio nodes of the set of radio nodes;

computing at the radio node a significance factor based at least in part on said connectivity type and said assigned class;

mapping said significance factor to a priority factor; and

scheduling output of said data unit from the radio node based on the priority factor.

2. The method according to claim 1, wherein the scheduling is performed using a scheduler algorithm.

3. The method according to claim 1, wherein the assigning a class is based at least in part on which one or more nodes of the set of radio nodes possesses copies of the data unit at a given time.

4. The method according to claim 1, the mapping further comprises performing an arbitration process to determine said priority factor.

5. The method according to claim 1, wherein the computing is performed using a significance factor weighting algorithm, said algorithm based at least in part on a number of nodes receiving the data and an importance to a node to obtain the data.

6. The method according to claim 1, wherein said data unit comprises a locally measured value.

7. The method according to claim 6, wherein said locally measured value comprises at least one of SNR from a specific radio source, radio link SNR between nodes, or GPS location at a given time.

8. The method according to claim 1, wherein said connectivity type comprises a topology of the set of radio nodes and a transmission rate among the set of radio nodes.

9. An apparatus for optimizing the efficiency of data sharing among a set of radio nodes in a radio environment, the apparatus comprising:

a radio node configured to store a data unit having a class, the class based at least in part on a number of radio nodes in the set of radio nodes having the data unit;

the radio node configured to determine a connectivity type based at least in part on the radio node'"'"'s connectivity to other radio nodes of the set of radio nodes;

the radio node further configured to compute a significance factor based at least in part on said connectivity type and said assigned class,

wherein said significance factor is mapped to a priority factor and said data unit is scheduled to be output from the radio node based on the priority factor.

10. The apparatus according to claim 9, wherein said data unit is scheduled to be output using a scheduler algorithm.

11. The apparatus according to claim 9, wherein a class is assigned to said data unit based on the one or more nodes of the set of radio nodes that possess copies of the data unit.

12. The apparatus according to claim 9, further comprising an arbitration process for determining said priority factor.

13. The apparatus according to claim 9, wherein computation of said significance factor is performed using a significance factor weighting algorithm, said algorithm based on a number of nodes receiving the data and an importance to a node to obtain the data.

14. The apparatus according to claim 9, wherein said data unit further comprises a locally measured data type.

15. The apparatus according to claim 14, wherein said locally measured data type comprises at least one of SNR from a specific radio source, radio link SNR between nodes, or GPS location at a given time.

16. The apparatus according to claim 9, wherein said connectivity type comprises a topology of the set of radio nodes and a transmission rate among the set of radio nodes.