CONTENT CENTRIC AND LOAD-BALANCING AWARE DYNAMIC DATA AGGREGATION

• US 20150109926A1
• Filed: 03/28/2013
• Published: 04/23/2015
• Est. Priority Date: 05/31/2012
• Status: Active Grant

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Gormus, Sedat, Jin, Yichao
• Granted Patent: US 9,647,942 B2
• Time in Patent Office: Days
• US Class Current: 370/235
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/127 based on intermediate node capabilities
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04W 40/04 based on wireless node resources
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• 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 method of determining a communication link for sending communication data from a first communications node to any one of a plurality of neighbouring candidate nodes, comprising i) for each candidate node, determining a marginal processing gain comprising a measure of the communication data reduction available through aggregating the communication data at the candidate node; and ii) selecting one of the candidate nodes for forming the communication link, wherein the selection is based at least in part on the marginal processing gain determined for each candidate node.

Claims

1. A method of determining a communication link for sending communication data from a first communications node to any one of a plurality of neighbouring candidate nodes, comprising:

i) for each candidate node, determining a marginal processing gain comprising a measure of the communication data reduction available through aggregating the communication data at the candidate node; and

ii) selecting one of the candidate nodes for forming the communication link, wherein the selection is based at least in part on the marginal processing gain determined for each candidate node.

2. A method in accordance with claim 1, wherein the measure of communication data reduction is normalised.

3. A method in accordance with claim 1, wherein the marginal processing gain for a candidate node comprises a difference between a measure of processing gain when allocating said communication data to that candidate node and a measure of processing gain without allocating said communication data to said candidate node.

4. A method in accordance with claim 1, wherein the marginal processing gain is part of an objective function that also comprises a measure of local lifetime gain, the local lifetime gain defining the change in lifetime of one or other of the neighbouring candidate nodes achieved by allocating the communication data to the candidate node;

the method comprising evaluating the objective function for each candidate node in order to determine the node to be selected for the communication link.

5. A method in accordance with claim 4, wherein evaluating the objective function for a given candidate node comprises:

estimating the lifetime of each one of the neighbouring candidate nodes in the event that the communication data is allocated to the given candidate node;

estimating the lifetime of each one of the neighbouring candidate nodes in the event that the communication data is not allocated to the given candidate node;

wherein in each case, the local lifetime is defined as the lifetime of the node having the smallest estimated lifetime among the neighbouring candidate nodes; and

wherein the local lifetime gain for the given candidate node is determined based on the difference between the local lifetime in the event that the communication data is allocated to that candidate node and the local lifetime in the event that the communication data is not allocated to that candidate node.

6. A method in accordance with claim 5 wherein said measure of local lifetime gain is normalised by the local lifetime estimated for the case in which communication data is allocated to that candidate node.

7. A method in accordance with claim 4, wherein the objective function comprises a weighted sum of the measure of processing gain and the measure of local lifetime gain.

8. A method in accordance with claim 7 wherein the weighted sum is dependent on a weighting factor, the weighting factor being operable to balance, in the objective function, the effect of the measure of processing gain and the measure of local lifetime gain, with respect to sensitivity to network lifetime.

9. A method in accordance with claim 5, wherein the lifetime of the neighbouring candidate nodes is estimated by estimating the energy consumption of those neighbouring candidate nodes.

10. A method in accordance with claim 9, wherein the energy consumption of each neighbouring candidate node is estimated by defining a link quality parameter between the first communications node and the respective neighbouring candidate node, wherein the link quality parameter reflects the likelihood that data will need to be transmitted more than once between the first communications node and the neighbouring candidate node in order to ensure its successful delivery.

11. A method in accordance with claim 10, wherein the link quality parameter defines the average number of times a bit of data will need to be transmitted in order to be successfully delivered from the first communications node to the respective neighbouring candidate node.

12. A method in accordance with claim 10, wherein for each candidate node, the lifetime of the first communications node is taken into consideration when determining the local lifetime gain in allocating the communication data to the candidate node.

13. A method in accordance with claim 1, wherein the communication data comprises a plurality of data types and the method comprises carrying out steps i) and ii) for each type of data.

14. A method in accordance with claim 13, wherein each type of data comprises data capable of being aggregated by a respective function or application running on a node, so as to reduce the number of bits required to relay that data.

15. A method in accordance with claim 14, wherein each type of data comprises a sensor reading reflecting a different parameter of the environment.

16. A method in accordance with claim 13, wherein for each type of data, the marginal processing gain is part of an objective function that also comprises a measure of local lifetime gain, the local lifetime gain defining the change in lifetime of one or other of the neighbouring candidate nodes if allocating the communication data of the particular type to the candidate node;

the method comprising evaluating the objective function for each candidate node in order to determine the node to be selected for the communication link for the particular type of communication data.

17. A method in accordance with claim 16, wherein for each type of data, the objective function comprises a reward parameter that biases selection of the candidate node towards nodes that have the capability to aggregate data of that particular type.

18. A method in accordance with claim 16, wherein the objective function is executed at a number of intervals, the size of the intervals being determined based on the amount of variation in the type of data arriving at the first communications node.

19. A method in accordance with claim 18, comprising monitoring the number of different types of data arriving at the first communications node at each one a number of intervals;

for each interval, determining a change in the number of types of data that have arrived compared to the previous interval;

based on said change, determining a probability that the objective function should be executed; and

where the probability is found to be above a threshold, executing the objective function.

20. A method in accordance with claim 19, wherein the threshold is obtained from a random number generator.

21. A method in accordance with claim 1, wherein the communication data is included within a data packet that also includes a communication progress factor,

wherein the communication progress factor is used to govern selection of the candidate node for forward communication in the network towards an intended recipient node.

22. A method in accordance with claim 21, wherein the communication progress factor comprises an indication of the layer of the network in which the first communications node is located,

wherein, when selecting a candidate node for the communication link, the first communications node excludes from consideration as candidate nodes all neighbouring nodes that are located in layers further away from the recipient node, unless those neighbouring nodes have the capability of performing data aggregation on the type of data being transmitted by the first communications node.

23. A method in accordance with claim 21, wherein the communication progress factor comprises:

an indication of the layer of the network in which the first communications node is located, and

a counter, wherein the counter'"'"'s value is incremented each time the communication data is transmitted to a node in a layer that is as either the same as that of the first communications node or further away from the recipient node;

wherein, when the value of the counter reaches a threshold, the first communications node will only consider nodes that are located closer to the recipient node as candidate nodes for forwarding the communication data.

25. A computer program product comprising computer executable instructions which, when executed by a computerised communications apparatus, causes that apparatus to perform a method in accordance with claim 1.

24. A communications apparatus operable in a network of communications apparatus, the apparatus being operable to determine a communication link for a communication from said apparatus to any one of a plurality of candidate neighbouring apparatuses, the apparatus comprising a processing gain determiner operable to determine, for each candidate node, a marginal processing gain comprising a measure of communication data reduction available through aggregating communication data at the candidate node;

and

a communication link selector operable to select one of the candidate nodes for forming the communication link, the selection being based at least in part on the marginal processing gain determined for each candidate node.