LOAD MANAGEMENT IN WIRELESS MESH COMMUNICATIONS NETWORKS
First Claim
1. A method of load management in a network, comprising:
- sending, by a first node, a request packet to a second node;
receiving, by the second node, the request packet;
determining whether the second node has reached a limit of nodes, and in the event the determination is that the second node has reached the limit of nodes, increasing a value corresponding to a path cost;
sending the increased value corresponding to the path cost to other first nodes that the second node has determined as candidates to be dropped; and
sending an actual path cost to other first nodes.
3 Assignments
0 Petitions
Accused Products
Abstract
Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. 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 node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.
-
Citations
24 Claims
-
1. A method of load management in a network, comprising:
-
sending, by a first node, a request packet to a second node; receiving, by the second node, the request packet; determining whether the second node has reached a limit of nodes, and in the event the determination is that the second node has reached the limit of nodes, increasing a value corresponding to a path cost; sending the increased value corresponding to the path cost to other first nodes that the second node has determined as candidates to be dropped; and sending an actual path cost to other first nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 24)
-
-
10. A method of load management in a network, comprising:
determining whether a number of nodes registered with a gateway exceeds a predetermined number, and in the event the determination is that the gateway has exceeded the predetermined number, reducing a route advertisement range by one hop.
-
11. A method of load management in a network, comprising:
determining whether a number of nodes registered with a gateway does not exceed a predetermined number, and in the event the determination is that the gateway has not exceeded the predetermined number, increasing a route advertisement range by one hop.
-
12. A method of load management in a network, comprising:
-
informing a gateway, by a node registering with the gateway, if the gateway is the node'"'"'s primary, secondary or tertiary route; and determining whether the number of nodes that the gateway has registered is above a predetermined limit, and in the event the determination is that the number of nodes that the gateway has registered is above a the predetermined limit, sending, by the gateway, a negative acknowledgement to any node attempting to register as a secondary or tertiary route. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
Specification