Efficient rendezvous for distributed messages in frequency-hopping communication networks
First Claim
1. A method, comprising:
- generating a rendezvous request message, the rendezvous request message specifying a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network, and a priority indicating the importance of the distributed message to be transmitted on channel C at time T, wherein the computer network operates with one or more broadcast timeslots in a frequency-hopping sequence;
comparing a) transmission overhead and latency associated with transmitting the rendezvous request message, to b) waiting for a subsequent broadcast timeslot;
determining, based on the comparison, if it is worth waiting for the subsequent broadcast timeslot to transmit the distributed message;
in response to the determining that it is not worth waiting for the subsequent broadcast timeslot,transmitting the rendezvous request message on one or more channels used in the computer network, the one or more channels based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T, andtransmitting the distributed message on channel C at rendezvous time T; and
in response to the determining that it is worth waiting for the subsequent broadcast timeslot,transmitting the distributed message during the subsequent broadcast timeslot.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a rendezvous request message is generated (e.g., by a sender) that specifies a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network. The rendezvous request message is then transmitted on one or more channels used in the computer network based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T. Accordingly, the distributed message is then transmitted on channel C at rendezvous time T. In another embodiment, a device receives a rendezvous request message, and in response to determining to honor the rendezvous request message, listens for the distributed message on channel C at rendezvous time T.
52 Citations
23 Claims
-
1. A method, comprising:
-
generating a rendezvous request message, the rendezvous request message specifying a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network, and a priority indicating the importance of the distributed message to be transmitted on channel C at time T, wherein the computer network operates with one or more broadcast timeslots in a frequency-hopping sequence; comparing a) transmission overhead and latency associated with transmitting the rendezvous request message, to b) waiting for a subsequent broadcast timeslot; determining, based on the comparison, if it is worth waiting for the subsequent broadcast timeslot to transmit the distributed message; in response to the determining that it is not worth waiting for the subsequent broadcast timeslot, transmitting the rendezvous request message on one or more channels used in the computer network, the one or more channels based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T, and transmitting the distributed message on channel C at rendezvous time T; and in response to the determining that it is worth waiting for the subsequent broadcast timeslot, transmitting the distributed message during the subsequent broadcast timeslot. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. An apparatus, comprising:
-
one or more network interfaces to communicate in a frequency-hopping computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; generate a rendezvous request message, the rendezvous request message specifying a channel C and a rendezvous time T for which a distributed message is to be transmitted in the frequency-hopping computer network, and a priority indicating the importance of the distributed message to be transmitted on channel C at time T, wherein the computer network operates with one or more broadcast timeslots in a frequency-hopping sequence; compare a) transmission overhead and latency associated with transmitting the rendezvous request message, to b) waiting for a subsequent broadcast timeslot; determine, based on the comparison, if it is worth waiting for the subsequent broadcast timeslot to transmit the distributed message; in response to the determining that it is not worth waiting for the subsequent broadcast timeslot, transmit the rendezvous request message on one or more channels used in the computer network, the one or more channels based on reaching a plurality of intended recipients of the distributed message with the rendezvous request message prior to rendezvous time T; and transmit the distributed message on channel C at rendezvous time T; and in response to the determining that it is worth waiting for the subsequent broadcast timeslot, transmit the distributed message during the subsequent broadcast timeslot. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19)
-
-
20. A method, comprising:
-
receiving a rendezvous request message, the rendezvous request message specifying a channel C and a rendezvous time T for which a distributed message is to be transmitted in a frequency-hopping computer network, and a priority indicating the importance of the distributed message to be transmitted on channel C at time T, wherein the computer network operates with one or more broadcast timeslots in a frequency-hopping sequence; determining whether to honor the rendezvous request message based upon the priority within the rendezvous request message; and in response to determining to honor the rendezvous request message, listening for the distributed message on channel C at rendezvous time T, wherein, the rendezvous request message and distributed message are received from a transmitter in the network, in response to the transmitter comparing a) transmission overhead and latency associated with transmitting the rendezvous request message to b) waiting for a subsequent broadcast timeslot, and determining, based on the comparison, that it is not worth waiting for the subsequent broadcast timeslot, and the distributed message is received during the subsequent broadcast timeslot from the transmitter, in response to the transmitter determining, based on the comparison, that it is worth waiting for the subsequent broadcast timeslot. - View Dependent Claims (21, 22)
-
-
23. An apparatus, comprising:
-
one or more network interfaces to communicate in a frequency-hopping computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; receive a rendezvous request message, the rendezvous request message specifying a channel C and a rendezvous time T for which a distributed message is to be transmitted in the frequency-hopping computer network, and a priority indicating the importance of the distributed message to be transmitted on channel C at time T, wherein the computer network operates with one or more broadcast timeslots in a frequency-hopping sequence; determine whether to honor the rendezvous request message based upon the priority within the rendezvous request message; and listen for the distributed message on channel C at rendezvous time T in response to determining to honor the rendezvous request message, wherein, the rendezvous request message and distributed message are received from a transmitter in the network, in response to the transmitter comparing a) transmission overhead and latency associated with transmitting the rendezvous request message to b) waiting for a subsequent broadcast timeslot, and determining, based on the comparison, that it is not worth waiting for the subsequent broadcast timeslot, and the distributed message is received during the subsequent broadcast timeslot from the transmitter, in response to the transmitter determining, based on the comparison, that it is worth waiting for the subsequent broadcast timeslot.
-
Specification