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.
Abstract:
A method of updating routing information in a network where reboot information of other nodes in the network is used to determine whether a given node has recent route updates. If the reboot information indicates the given node has not recently rebooted, then routing information from that given node is used to update the routing information of the comparing node. The reboot information may be a reboot counter which is incremented by a node in response to the node going through a reboot process. When a node reboots, it may request the reboot counter from neighboring nodes. The received reboot counter is compared to the stored reboot counter for at least one node. The rebooting node may choose to receive routing information from a node which has not had its reboot counter changed from the stored reboot counter. In the event none of the neighboring nodes have an unchanged reboot counter, requests may be made for the reboot counters of other nodes, which may be compared to the corresponding stored reboot counters, until the rebooting node discovers a node which has not recently rebooted according to the reboot counter, and may then download routing information from that node.
Abstract:
Bulk information is transferred to nodes in a communication network having a plurality of widely dispersed nodes. The information can be an image, content, or configuration information. The information is uni-cast to a selection of nodes by a central node or server, to seed the information at certain nodes in the network. The information is then distributed by these seed nodes to every other node in the network. A first algorithm selects which nodes should be seeded with information by the central node. A second algorithm distributes information in the network on a query basis.
Abstract:
A method of updating routing information in a network where reboot information of other nodes in the network is used to determine whether a given node has recent route updates. If the reboot information indicates the given node has not recently rebooted, then routing information from that given node is used to update the routing information of the comparing node. The reboot information may be a reboot counter which is incremented by a node in response to the node going through a reboot process. When a node reboots, it may request the reboot counter from neighboring nodes. The received reboot counter is compared to the stored reboot counter for at least one node. The rebooting node may choose to receive routing information from a node which has not had its reboot counter changed from the stored reboot counter. In the event none of the neighboring nodes have an unchanged reboot counter, requests may be made for the reboot counters of other nodes, which may be compared to the corresponding stored reboot counters, until the rebooting node discovers a node which has not recently rebooted according to the reboot counter, and may then download routing information from that node.
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.
Abstract:
An apparatus mounted beneath or behind a surface and being operable to transmit or receive wireless communication signals for transmitting information from one location to a remote location. The apparatus includes an antenna mounted substantially flush with a surface. The apparatus also includes a communication device and a matching network having a radial transmission line. The communication device is connected to the antenna via the matching network and includes either a transmitter, a receiver or a transceiver.
Abstract:
A method for determining configuration of a communication device includes: storing, in a memory of the communication device, a plurality of configuration schemes, wherein each configuration scheme is associated with a geographic location; receiving, at the communication device, a data message from a first communicating device, wherein the data message indicates a first geographic location; identifying, in the memory of the communication device, a first configuration scheme associated with the first geographic location; and transmitting, by the communication device, a data transmission using the first configuration scheme.
Abstract:
A permitting system for controlling devices in a system includes a permit issuing agent that receives a command to be sent to a device. Based upon at least one attribute of the command, the permit issuing agent identifies one or more business logic modules that is pertinent to the command. Each business logic module has a respectively different set of business rules associated with it. Each identified business logic module determines whether the command complies with the business rules associated with that module. If the command is determined to comply with the business rules of all of the identified business logic modules, the agent issues a permit for the command, and the permit is sent to the device for execution of the command.
Abstract:
A plurality of nodes in a first network mitigate data restrictions on access points which are an interface between the first network and a second network. The access points advertise their access parameters to the second network to the nodes. The nodes maintain a list of the advertised access parameters of each access point. The nodes determine whether to transmit data to the second network according to a first transmission mode or a second transmission mode based on the data to be transmitted and the list of access parameters maintained by that node. In the first transmission mode, the node determines to transmit the data to a first access point having a lowest cost with that node. In the second transmission mode, the node determines to transmit the data to a second access point having fewer access restrictions to the second network than the first access point.
Abstract:
Rather than using a large number of transceivers (transmitter/receiver pairs) operating in parallel, Access Points with multiple channels are used to aggregate, or stack, transmitted response communications, e.g., transmitting multiple acknowledgements (ACKs) in a single packet to one or more sources of received packets. The method includes sending on a plurality of channels, by each of a plurality of respective first nodes, a communication to a second node, receiving on the plurality of channels, by the second node, the communication from each of the plurality of first nodes and sending, by the second node, a transmission that contains a response to each communication that was successfully received from each of the plurality of first nodes. The response to each of the plurality of first nodes is part of a single message sent by the second node.