Abstract:
In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.
Abstract:
In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.
Abstract:
In one embodiment, a method comprises identifying an age of payload data in a data packet by a wireless network node configured for transmitting the data packet to a multi-hop destination via a wireless mesh network; determining by the wireless network node a schedule for the data packet reaching the multi-hop destination; and the wireless network node prioritizing queuing of the data packet for Collision Sense with Multiple Access and Collision Avoidance (CSMA-CA) based wireless transmission in the wireless mesh network based on the corresponding age, relative to the schedule and respective ages of other data packets awaiting transmission by the wireless network node to the destination, where a higher-aged data packet relative to the schedule is granted a higher priority than a lower-aged data packet relative to the schedule.