SELECTION OF INFORMATION FOR TRANSMISSION AND STORAGE IN AN AD-HOC NETWORK BASED UPON LOCAL SYNOPSIS EXCHANGE

• US 20080002635A1
• Filed: 07/03/2006
• Published: 01/03/2008
• Est. Priority Date: 07/03/2006
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Palo Alto Research Center, Inc. (Xerox Holdings Corp.)
• Inventors: Liu, Juan, Huang, Qingfeng, Greene, Daniel H., Reich, James E., Mosko, Marc E.
• Granted Patent: US 7,835,351 B2
• Time in Patent Office: Days
• US Class Current: 370/338
• CPC Class Codes: H04L 67/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A method of managing traffic in an ad-hoc network includes receiving, at a local node, a received synopsis of data sample updates in a neighbor storage of a neighboring node, the synopsis being based at least in part on dynamic priorities associated with the data samples. The received synopsis is then compared with data sample updates in a local storage of the local node and the local node determines which data samples will be transmitted.

Claims

2. The method of claim 1, where the data sample updates in the local storage are sorted based at least in part on dynamic priorities.

22-1. The method of claim 1, the method further comprising managing resources available for the local storage based in part on dynamic priority.

23. The method of claim 21, wherein comparing the received synopsis with the data sample updates in the local storage further comprises comparing the received synopsis using the received quantized parameters.

3. The method of claim 1, the method further comprising combining the received synopsis with an update message to form a piggybacked update message.

24. The method of claim 22, wherein the storage is resorted by evaluating the dynamic priorities with the quantization parameters received with a synopsis.

25. The article of claim 23, wherein the instructions, when executed, further cause the computer to generate a local synopsis of data sample updates in the local storage.

26. The article of claim 23, wherein the instructions, when executed, further cause the computer to store data sample updates by only storing a data sample update for one or more data source streams having the most recent time stamp.

27. The article of claim 23, wherein the instructions, when executed, further cause the computer to store the updates until the dynamic priorities associated with the updates become less than or equal to a threshold.

28. The article of claim 23, wherein the instructions, when executed, further cause the computer to:

if the local node holds a first unmatched difference in the sort order, transmit a batch of differences from the local storage.

29. The article of claim 23, wherein the instructions, when executed, further cause the computer to:

if the received synopsis holds a first unmatched difference in a sort difference, transmit a local synopsis to the neighbor node.

30. The article of claim 23, wherein the instructions, when executed, further cause the computer to evaluate dynamic priorities on the local node using quantized parameters that are quantized in space or time.

23-2. An article of computer-readable media containing instructions that, when executed, cause the computer to:

receive a received synopsis of data sample updates in a neighbor storage of a neighboring node, wherein the synopsis is based at least in part on dynamic priorities associated with the data samples;

compare the received synopsis with data sample updates in a local storage of the local node; and

determine which data samples the local node will transmit.

24-3. The article of claim 23, wherein the instructions, when executed, further cause the computer to combine the received synopsis with an update message to form a piggybacked update message.

31. A device, comprising:

a local storage;

a port to allow the device to receive a received synopsis of data sample updates in a neighbor storage of a neighboring node, wherein the synopsis is based at least in part on dynamic priorities associated with the data samples; and

a processor to;

compare the received synopsis with data sample updates in the local storage of the local node; and

determine which data samples the local node will transmit.

32. The device of claim 31, the storage further to store the updates such that the updates are sorted based at least in part on dynamic priorities.