Method and system for providing network and routing protocols for utility services
First Claim
1. A computer implemented method, comprising:
- discovering neighboring nodes in a wireless communication network;
receiving information on at least one egress node of the wireless communication network, the egress node information including path cost for at least one hop between nodes along a segment of a rout to the egress point; and
calculating a priority list of neighboring nodes, the priority list of sending nodes for use in selecting a neighboring node for forwarding a packet to the egress node,wherein calculating the priority list is based on the path costs for at least one hop between nodes along a segment of a route to the egress point using the corresponding neighboring node.
3 Assignments
0 Petitions
Accused Products
Abstract
A method and system for providing a network and routing protocol for utility services are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a utility device (for example, a constant powered meter) sends network discovery messages to find the utility network. Neighboring meters are discovered and the device listens for advertised routes for one or more networks from the neighbors. The device is then registered with one or more utility networks, receiving a unique address for each network registration. Also illustrated in this invention disclosure is how each device of a class of devices (for example, battery powered meter) finds and associates itself with another device (for example, constant powered meter). The constant powered meter also registers its associate battery powered meter with the utility networks. The constant powered meter registers itself with the access points and the upstream nodes in the path out of each network. Each upstream node can independently make forwarding decisions on both upstream and downstream packets i.e. choose the next hop according to the best information available to it. The constant powered meter can sense transient link problems, outage problems, and traffic characteristics. It uses the information to find the best route out of and within each network. Each network device thus maintains multi-egress, multi-ingress network routing options both for itself and the device(s) associated with it.
-
Citations
33 Claims
-
1. A computer implemented method, comprising:
-
discovering neighboring nodes in a wireless communication network; receiving information on at least one egress node of the wireless communication network, the egress node information including path cost for at least one hop between nodes along a segment of a rout to the egress point; and calculating a priority list of neighboring nodes, the priority list of sending nodes for use in selecting a neighboring node for forwarding a packet to the egress node, wherein calculating the priority list is based on the path costs for at least one hop between nodes along a segment of a route to the egress point using the corresponding neighboring node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method of routing in a wireless communications network, comprising:
-
discovering next hop nodes in the wireless communication network; discovering at least one access point to the wireless communications network; registering with the at least one access point to the wireless communications network; selecting a plurality of nodes as next hop nodes for communicating with at least one access point; receiving routing information from at least one of the discovered next hop nodes; and constructing a routing table from the routing information received from the discovered next hop nodes, wherein the routing table includes at least one alternate path to a given destination node in the communications network. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
-
18. A method of communicating in a wireless network, comprising:
-
receiving a packet at a forwarding node in the wireless network, the received packet including a destination address corresponding to a destination node in the wireless network and at least a partial route to the destination node; determining whether a preferred route exists for transmitting the packet to the destination address, and in the event the determination is that the preferred route exists, replacing the received route from the packet with the preferred route; and forwarding the packet to another node in the wireless network according to the route included in the packet. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
Specification