Wireless network for sensor array

• US 9,854,551 B2
• Filed: 05/03/2016
• Issued: 12/26/2017
• Est. Priority Date: 04/28/2015
• Status: Expired due to Fees

• Current Assignee: Charles Stark Draper Laboratory Incorporated
• Original Assignee: Charles Stark Draper Laboratory Incorporated
• Inventors: Davis, Almir D., Wilmarth, Roger J., Babcock, IV, Philip S., Khan, Imran
• Primary Examiner(s): Rutkowski, Jeffrey M
• Assistant Examiner(s): Deng, Fangyan
• Application Number:
  US15/145,088
• Publication Number:
  US 20160323841A1
• Time in Patent Office: 602 Days
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 45/72 Routing based on the source address
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 56/0015 one node acting as a reference for the others
• CPC Class Codes: H04W 8/08 Mobility data transfer
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 88/08 Access point devices
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A linear wireless sensor network includes network nodes having monotonically varying network node identifiers along each branch of the network. The network identifiers enable the nodes to forward network packets without use of routing tables. Low duty cycle wireless communication protocols enable network packets to be routed to all nodes of very large networks while consuming very little electrical power. Broadcast, rather than unicast, transmissions between nodes take advantage of favorable signal propagation conditions to forward messages using largest possible hops, skipping over nodes when possible, as well as automatically adapting to time- or spatially-varying conditions. A group of network packets is broadcast and forwarded by a most distant receiving node that received all packets of the group. A receiving node'"'"'s clock is automatically adjusted, based on which packet(s) of a group of packets was received. A sending node synchronizes near-by receiving nodes. Nodes are provisioned over-the-air, with built-in scheduling. Health and welfare information piggybacks on other network traffic.

Claims

1. A linear sensor network, comprising:

a plurality of network nodes forming, and being members of, a plurality of partially overlapping branches, each branch of the plurality of branches having a respective first end and a respective second end, the plurality of branches having a common root, at least one network node of the plurality of network nodes being a member of at least two branches of the plurality of branches, each network node of the plurality of network nodes having a respective unique network node identifier associated therewith for each branch of which the network node is a member, the plurality of network nodes being logically arranged along the plurality of branches according to the nodes'"'"' respective network node identifiers, such that the network node identifiers vary monotonically along each branch, from the first end of the branch to the second end of the branch; and

a base station adjacent the common root of the plurality of branches, comprising a wireless transceiver and having a network node identifier associate therewith;

wherein;

each network node stores a representation of each of the network node'"'"'s network node identifiers;

each network node comprises a respective sensor and a respective wireless transceiver;

each network node collects data with its sensor and, in response to receiving a command originating at the base station, transmits the data via its wireless transceiver using at least one network packet; and

each network node of the plurality of network nodes, except a respective first network node at the first end and a respective last network node at the second end of the branch of which the network node is a member, forwards, via its wireless transceiver, network packets, such that each network packet is forwarded by a respective succession of network nodes whose respective network node identifiers vary monotonically along the succession of network nodes.

2. A linear sensor network according to claim 1, wherein each network node comprises:

a network packet source identifier, coupled to the wireless transceiver, that reads a source network node identifier in a received network packet;

a network packet destination identifier, coupled to the wireless transceiver, that reads a destination network node identifier in a received network packet;

a network node identifier comparator, coupled to the network packet source identifier and to the network packet destination identifier, that compares the stored representation of the node'"'"'s network node identifier to the source network node identifier in the received network packet and to the destination network node identifier in the received network packet; and

a network packet router, coupled to the network node identifier comparator, that determines whether to consider forwarding the received network packet based on a value of the source network node identifier, relative to the representation of the node'"'"'s network node identifier, and on a value of the destination network node identifier, relative to the representation of the node'"'"'s network node identifier.

3. A linear sensor network according to claim 2, wherein the network packet router determines whether to consider forwarding the received network packet without reference to a routing table.

4. A linear sensor network according to claim 2, further comprising:

a packet source and destination node identifier comparator, coupled to the network packet source identifier and to the network packet destination identifier, that compares the source network node identifier in the received network packet and the destination network node identifier in the received network packet;

wherein;

the network packet router is coupled to the packet source and destination node identifier comparator and determines whether to consider forwarding the received network packet also based on the value of the source network node identifier, relative to the value of the destination network node identifier.

5. A linear sensor network according to claim 1, wherein:

for each node of the plurality of network nodes, except the first network node and the last network node, the node'"'"'s location on the branch of which the network node is a member logically partitions the branch into a first portion and a second portion, relative to the node; and

each network node of the plurality of network nodes, except the first network node and the last network node, forwards, via its wireless transceiver, network packets received from respective nodes on the first portion of the branch of which the network node is a member to at least one node on the second portion of the branch of which the network node is a member, and each network node, except the first network node and the last network node, forwards, via its wireless transceiver, network packets received from respective nodes on the second portion of the branch of which the network node is a member to at least one node on the first portion of the branch of which the network node is a member.

7. A linear sensor network according to claim 1, wherein each network node identifier comprises a branch identifier.

8. A linear sensor network according to claim 1, wherein each network node that is a member of more than one branch stores information about each such branch.

9. A linear sensor network according to claim 1, wherein each network node that is a member of more than one branch stores information about at least one network node that is a member of each branch of the more than one branch.

10. A linear sensor network according to claim 9, wherein, for each network node of the at least one network node, the information comprises the network node identifier of the network node.

11. A linear sensor network according to claim 1, wherein each network node that is a member of more than one branch stores information about at least one network node that is:

(a) within radio range of the network node and (b) a member of each branch of the more than one branch.

12. A linear sensor network according to claim 11, wherein, for each network node of the at least one network node, the information comprises the network node identifier of the network node.

6. A method for forwarding network packets, the method comprising:

forming a plurality of partially overlapping branches from a plurality of network nodes, each branch of the plurality of branches having a respect first end and a respective second end, the plurality of branches having a common root, at least one network node of the plurality of network nodes being a member of at least two branches of the plurality of branches;

to each network node of the plurality of network nodes, assigning a unique network node identifier for each branch of which the network node is a member, such that the plurality of network nodes is logically arranged along the plurality of branches according to the respective network node identifiers, such that the network node identifiers vary monotonically along each branch, from the first end of the branch to the second end of the branch;

disposing a base station adjacent the common root of the plurality of branches, the base station comprising a wireless transceiver and having a network node identifier associate therewith;

storing in each network node a representation of each of the network node'"'"'s network node identifiers;

at each network node, collecting data using a sensor of the network node;

in at least one of the plurality of network nodes, in response to receiving a command originating at the base station, transmitting the data via the network node'"'"'s wireless transceiver using at least one network packet; and

in each network node of the plurality of network nodes, except a respective first network node at the first end and a respective last network node at the second end of the branch of which the network node is a member, forwarding, via the network node'"'"'s wireless transceiver, network packets, such that each network packet is forwarded by a respective succession of network nodes whose respective network node identifiers vary monotonically along the succession of network nodes.

13. A method according to claim 6, wherein assigning the unique network node identifier comprises assigning a network node identifier that comprises a branch identifier.

14. A method according to claim 6, wherein storing in each network node a representation of each of the network node'"'"'s network node identifiers comprises, for each network node that is a member of more than one branch, storing information about each such branch.

15. A method according to claim 6, wherein storing in each network node a representation of each of the network node'"'"'s network node identifiers comprises, for each network node that is a member of more than one branch, storing information about at least one network node that is a member of each branch of the more than one branch.

16. A method according to claim 6, wherein storing in each network node a representation of each of the network node'"'"'s network node identifiers comprises, for each network node that is a member of more than one branch, for each such branch, storing information about at least one network node that is a member of such branch.

17. A method according to claim 16, wherein the information comprises the network node identifier of the network node that is a member of such branch.

18. A method according to claim 6, wherein storing in each network node a representation of each of the network node'"'"'s network node identifiers comprises, for each network node that is a member of more than one branch, for each such branch, storing information about at least one network node that is (a) a member of such branch and (b) within radio range.

19. A method according to claim 18, wherein, for each network node of the at least one network node, the information comprises the network node identifier of the network node.