Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Techniques for discovering a device in a wireless network are described herein. For example, a first device may send a network discovery solicitation message to a second device to solicit a communication relationship (e.g., request connection to a parent). The network discovery solicitation may include one or more information elements that indicate a channel function associated with the first device and a listening window during which the first device will be listening for communications. The second device may use the channel function to frequency hop and send a network discovery message to the first device during the listening window. The network discovery message may include one or more information elements to establish a sampled schedule for the first device moving forward.

Abstract: Techniques for connecting networks to facilitate distribution of data are described. For example, to distribute multicast data to members of a multicast group that span multiple networks, the techniques may identify a path between networks that each have a member of the multicast group, such as a shortest path between networks. The techniques may inform the networks on the path to establish a connection with an adjacent network. This may allow multicast data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for connecting networks to facilitate distribution of data are described. For example, to distribute multicast data to members of a multicast group that span multiple networks, the techniques may identify a path between networks that each have a member of the multicast group, such as a shortest path between networks. The techniques may inform the networks on the path to establish a connection with an adjacent network. This may allow multicast data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Techniques for limiting forwarding of multicast communications are described herein. For example, the techniques intelligently forward data along paths of a network where members of a multicast group are located. As such, nodes that do not lead to members of the multicast group may be pruned from distribution of the data. This reduces network communications, ultimately conserving processing, communication, and/or battery resources of the nodes.

Abstract: Techniques for discovering a device in a wireless network are described herein. For example, a first device may send a network discovery solicitation message to a second device to solicit a communication relationship (e.g., request connection to a parent). The network discovery solicitation may include one or more information elements that indicate a channel function associated with the first device and a listening window during which the first device will be listening for communications. The second device may use the channel function to frequency hop and send a network discovery message to the first device during the listening window. The network discovery message may include one or more information elements to establish a sampled schedule for the first device moving forward.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, the techniques may identify a particular node that is able to communicate with each network and instruct the particular node to act as a bridge between the networks. The particular node may forward data from either network to the other network. This may allow data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Techniques for discovering a device in a wireless network are described herein. For example, a first device may send a network discovery solicitation message to a second device to solicit a communication relationship (e.g., request connection to a parent). The network discovery solicitation may include one or more information elements that indicate a channel function associated with the first device and a listening window during which the first device will be listening for communications. The second device may use the channel function to frequency hop and send a network discovery message to the first device during the listening window. The network discovery message may include one or more information elements to establish a sampled schedule for the first device moving forward.

Abstract: Techniques for limiting forwarding of multicast communications are described herein. For example, the techniques intelligently forward data along paths of a network where members of a multicast group are located. As such, nodes that do not lead to members of the multicast group may be pruned from distribution of the data. This reduces network communications, ultimately conserving processing, communication, and/or battery resources of the nodes.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, the techniques may identify a particular node that is able to communicate with each network and instruct the particular node to act as a bridge between the networks. The particular node may forward data from either network to the other network. This may allow data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Techniques for communicating channel data regarding a channel plan are described herein. For example, a device may communicate a channel information element that includes a tag indicating a first operating context to which to apply channel data regarding a channel plan. The channel information element may also include a reference tag to indicate whether the channel data is contained in the channel information element or has been previously received and/or to identify a second operating context associated with previously received channel data. If the reference tag indicates that the channel data is contained in the channel information element, the channel data may be extracted from the channel information element and applied to the first operating context. If the reference tag indicates that the channel data has been previously received, the previously received channel data may be accessed and applied to the first operating context.

Abstract: Techniques for communicating schedule data regarding a schedule are described herein. For example, a device may communicate a schedule information element that includes a tag indicating a first operating context to which to apply schedule data regarding a schedule. The schedule information element may also include a reference tag to indicate whether the schedule data is contained in the schedule information element or has been previously received and/or to identify a second operating context associated with previously received schedule data. If the reference tag indicates that the schedule data is contained in the schedule information element, the schedule data may be extracted from the schedule information element and applied to the first operating context. If the reference tag indicates that the schedule data has been previously received, the previously received schedule data may be accessed and applied to the first operating context.

Abstract: Techniques for communicating schedule data regarding a schedule are described herein. For example, a device may communicate a schedule information element that includes a tag indicating a first operating context to which to apply schedule data regarding a schedule. The schedule information element may also include a reference tag to indicate whether the schedule data is contained in the schedule information element or has been previously received and/or to identify a second operating context associated with previously received schedule data. If the reference tag indicates that the schedule data is contained in the schedule information element, the schedule data may be extracted from the schedule information element and applied to the first operating context. If the reference tag indicates that the schedule data has been previously received, the previously received schedule data may be accessed and applied to the first operating context.