Method and apparatus for counting the bidirectional passage of vehicles in a wireless vehicular sensor network

• US 9,177,469 B2
• Filed: 12/20/2006
• Issued: 11/03/2015
• Est. Priority Date: 12/22/2005
• Status: Active Grant

• Current Assignee: Sensys Networks Inc. (Tagmaster AB)
• Original Assignee: Sensys Networks Inc. (Tagmaster AB)
• Inventors: Kwong, Karric
• Primary Examiner(s): Tran, Khoi
• Assistant Examiner(s): MOYER, DALE S
• Application Number:
  US11/614,058
• Publication Number:
  US 20070208499A1
• Time in Patent Office: 3,240 Days
• Field of Search: 340/933, 340/941, 701117-119
• US Class Current: 1/1
• CPC Class Codes: G07C 5/008 communicating information to a remotely located station transmission systems for measured values G08C
• CPC Class Codes: G08G 1/015 with provision for distinguishing between two or more types of vehicles, e.g. between motor-cars and cycles
• CPC Class Codes: G08G 1/017 identifying vehicles G08G1/015, G08G1/054 take precedence
• CPC Class Codes: G08G 1/042 using inductive or magnetic detectors

Abstract

Method and apparatus receiving reports from at least two wireless vehicular sensor nodes and stepping through a process of comparing filtered queues to determine the first and the second waveform in time, leading to counting the vehicles passing the magnetic sensors of the wireless vehicular sensor nodes.

Claims

1. A method comprising the step of counting the passing of vehicles between a first and a second wireless vehicular sensor nodes by

operating an apparatus that interacts with a first filtered queue and a second filtered queue,

with said first filtered queue created in response to a report based upon a magnetic sensor from said first wireless vehicular sensor node,

with said second filtered queue created in response to a second report based upon a second of said magnetic sensor from said second wireless vehicular sensor node, and

said apparatus distinct from said first wireless vehicular sensor node and from said second wireless vehicular sensor node;

wherein the step of counting, comprises said apparatus performing the steps of;

first determining (3300A) if either of said filtered queues are empty;

filling and filtering (3000) out short spikes less than a holdover interval of not more than 300 milliseconds (ms) in said waveform queues by using said reports received from said wireless vehicular sensor nodes;

finding (3100) a first rising edge in said filtered queues and designates said filtered queue as a first waveform;

second determining (3200) whether a second waveform rises before said first waveform falls;

third determining (3400) whether said second waveform falls before said first waveform falls;

causing (2500) a count;

fourth determining (3300B) if either of said filtered queues are empty;

first pushing (3500) only a last pulse back on each waveform queue;

fifth determining (3600) whether said second waveform starts within a first time T1 of said first waveform falling;

second pushing (3800) a most recent pulse back onto said second waveform queue; and

sixth determining (3700) whether said second waveform falls after the next rise of said first waveform.

2. The method of claim 1, wherein the step filling and filtering (3000) further comprises the steps of:

repeating receiving said response from said wireless vehicular sensor node to update said filtered queue until all of said filtered queues are determined nonempty.

3. The method of claim 2, wherein the step of counting by said member of said processor group further comprises said member of said processor group performing the step of

determining that all of said filtered queues are determined nonempty, is further comprised of the steps of:

determining if first filtered queue is nonempty; and

determining if said second filtered queue is nonempty.

4. The method of claim 1, the step of finding (3100) further comprises the steps of:

finding first of said rising edges from said first filtered queue;

finding second of said rising edges from said second filtered queue;

comparing said first rising edge and said second rising edge to determine said first waveform and said second waveform;

popping a first pulse from one of said filtered queue to said first waveform; and

popping said first pulse from said other of said filtered queue to said second waveform.

5. The method of claim 1, the step of second determining (3200) further comprises the steps of:

popping said pulse into said first waveform;

popping said pulse into second waveform; and

determining whether said second waveform rise before said first waveform falls.

6. The method of claim 1, the step of fifth determining (3600) further comprises the steps of:

popping said pulse into said second waveform; and

determining whether said second waveform starts within said first time T1 of said first waveform falling.

7. The method of claim 1, the step of sixth determining (3700), further comprises the steps of:

looking at a top pulse in said filtered queue for said first waveform;

determining whether said second waveform falls after the rise of said top pulse.

8. The method of claim 1, wherein at least one of said wireless vehicular sensor nodes uses a method of generating said report based upon at least one member of the group consisting of:

a rising edge and a falling edge;

wherein said members are determined based upon a vehicle sensor state using said magnetic sensor.

9. The method of claim 1, wherein at least one of said wireless vehicular sensor nodes uses a method of generating said report based upon a first time and an ending time using the recent variance of a vehicular sensor waveform based upon a vehicle sensor state using said magnetic sensor.

10. An apparatus, comprising

said apparatus configured to count the passing of vehicles between a first and a second wireless vehicular sensor node by interacting with a first filtered queue and a second filtered queue, comprising:

means for first determining (3300A) if either of said filtered queues are empty;

means for filling and filtering (3000) out short spikes in empty waveform queues by using reports received from said wireless vehicular sensor nodes;

means for finding (3100) said first rising edge in said filtered queues and designating said filtered queue as a first waveform;

means for second determining (3200) whether a second waveform rises before said first waveform falls;

means for third determining (3400) whether said second waveform falls before the first waveform falls;

means for causing (2500) a good count;

means for fourth determining (3300B) if either of said filtered queues are empty;

means for first pushing (3500) only a last pulse back on each waveform queue;

means for fifth determining (3600) whether said second waveform starts within a first time T1 of said first waveform falling;

means for second pushing (3800) a most recent pulse back onto said second waveform queue; and

means for sixth determining (3700) whether said second waveform falls after the next rise of said first waveform.

11. The apparatus of claim 10, further comprising:

said means for receiving said reports from said wireless vehicular sensor nodes.

12. The apparatus of claim 11, further comprising:

a processor configured for a wireline communicatively coupling (2062) to said means for receiving said reports from said wireless vehicular sensor nodes to implement the step for counting.

13. The apparatus of claim 10, wherein at least one member of a means group includes at least one instance of a member of the group consisting of:

a finite state machine and a computer accessibly coupled to a memory and at least partly directed by a program system including at least one program step residing in said memory;

wherein said computer includes at least one data processor and at least one instruction processor;

wherein said means group consists of the members of;

said means for receiving,

means for first determining (3300A),

means for filling and filtering (3000),

means for finding (3100),

means for second determining (3200),

means for third determining (3400),

means for causing (2500),

means for fourth determining (3300B),

means for first pushing (3500),

means for fifth determining (3600),

means for second pushing (3800), and

means for sixth determining (3700).

14. The apparatus of claim 13, wherein said program system further comprises at least one member of the group consisting of the program steps of:

first determining (3300A) if either of said filtered queues are empty;

filling and filtering (3000) out said short spikes in said empty waveform queues by using said reports received from said wireless vehicular sensor nodes;

finding (3100) said first rising edge in said filtered queues and designating said filtered queue as said first waveform;

second determining (3200) whether said second waveform rises before first waveform falls;

third determining (3400) whether said second waveform falls before the first waveform falls;

causing (2500) said good count;

fourth determining (3300B) if either of said filtered queues are empty;

first pushing (3500) only said last pulse back on each waveform queue;

fifth determining (3600) whether said second waveform starts within said first time T1 of said first waveform falling;

second pushing (3800) said most recent pulse back onto said second waveform queue; and

sixth determining (3700) whether said second waveform falls after the next rise of said first waveform.

15. A method of manufacturing said apparatus of claim 13, comprising the step of:

providing the members of said means group to said apparatus.

16. The apparatus as a product of the process of claim 15.

17. The apparatus of claim 10, including an access point configured to communicate with said wireless vehicular sensor nodes.

18. The access point of claim 17, comprising:

means for receiving said reports from said wireless vehicular sensor nodes.

19. The apparatus of claim 10, including a processor communicatively coupled to an access point configured to communicate with said wireless vehicular sensor nodes.