Abstract: Techniques for using a shared channel in data communications networks include observing at a local node, during a frame of multiple transmission slots, packets transmitted. Based on the packets, a node identifier and transmission slot are determined for each node in a contention set. A priority for each node in the contention set is determined based on the identifier. When the local node is new to the shared channel, a transmission key is determined for the local node, which indicates a subset of transmission slots in the frame based on the identifier for the local node. When the local node is still new, it transmits a packet only when a current transmission slot is indicated by the transmission key. If not new and with carrier sensing, transmission is delayed even when the priority for the local node in the current time slot is greater than any other.

Abstract: Techniques for transmitting data packets on a shared channel in a data communications network include storing, on a local node, a current number of turns in a transmitting queue and a current turn based on packets received from other nodes on the channel. For a first local data packet to transmit, a local transmit turn is obtained based on successfully transmitting the packet in a time interval following a last turn in the queue. A data link layer header includes queue fields for the current number of turns, the local transmit turn, and a request for adding the local transmit turn. While there is still a remaining packet to transmit and when the current turn is the local transmit turn, the packet is transmitted with queue fields indicating the current number of turns, the current turn, and an indication of no new turn. An acknowledgement control packet indicates successful transmission.

Abstract: Techniques include retrieving from storage a plurality of policies for sharing a shared channel among nodes in a data communications network. The plurality of polices define a tree of periodic schedules of variable periods, each policy defines a transmit time slot as a unique slot i of a modulus of a power m of a base b of a series of time slots, where m indicates a level of the tree of periodic schedules. The method also includes; observing at a first node the probabilities of empty time slots, successful time slots, and collision time slots on the shared channel; selecting at the first node a first policy among the plurality of policies based on the probabilities observed instead of a message received from a central authority; and transmitting a local data packet from the first node onto the shared channel at a transmit time based on the first policy.

Abstract: Techniques for transmitting data packets on a shared channel in a data communications network, include determining a time slot interval, T, based on a longest data packet to be transmitted on a shared channel in a data communications network. At a first node in the data communications network a local base time, t0, is determined equal to a time at an end of receipt of a successful acknowledgement control packet on the shared channel. A local data packet is transmitted from the first node onto the shared channel at a transmit time that is an integer multiple n of T after the local base time t0. The local data packet is determined to be successfully transmitted when a successful acknowledgement control packet that uniquely indicates the local data packet is received on the shared channel within the interval T of transmitting the local data packet.

Abstract: Techniques for routing in communications networks include determining a state of a destination node in a current routing table stored at a first node. A value for a reference cost to the destination node is determined based on a minimum cost to the destination in the current routing table. Based on the state, a request message is formed including a reference distance field to prevent loops, an originating node field, a destination field, and a previous hop field. The request message is sent to a different second node within range. A record that indicates the data in the request message is stored in a pending request table. A reply message is received in response to sending the request message. In response to receiving the reply message, the record in the pending request table is removed, and the current routing table is updated based on the reply message.

Abstract: Techniques include retrieving from storage a plurality of policies for sharing a shared channel among nodes in a data communications network. The plurality of polices define a tree of periodic schedules of variable periods, each policy defines a transmit time slot as a unique slot i of a modulus of a power m of a base b of a series of time slots, where m indicates a level of the tree of periodic schedules. The method also includes; observing at a first node the probabilities of empty time slots, successful time slots, and collision time slots on the shared channel; selecting at the first node a first policy among the plurality of policies based on the probabilities observed instead of a message received from a central authority; and transmitting a local data packet from the first node onto the shared channel at a transmit time based on the first policy.

Abstract: Safe, fast, acyclic routing in a communications network includes receiving at a local router, from a first router, a request packet that indicates a first destination value. In response to the request, it is determined whether a first entry in a routing table data structure at the local router indicates the first destination value in a destination field and a valid value in a voucher field. The local router sends to the first router a response packet with a first distance value from a distance field of the first entry only when the voucher field holds a valid value. The local router forwards the request packet to a different second router when the voucher field holds an invalid value.

Abstract: Techniques include retrieving from storage a plurality of policies for sharing a shared channel among nodes in a data communications network. The plurality of polices define a tree of periodic schedules of variable periods, each policy defines a transmit time slot as a unique slot i of a modulus of a power m of a base b of a series of time slots, where m indicates a level of the tree of periodic schedules. The method also includes; observing at a first node the probabilities of empty time slots, successful time slots, and collision time slots on the shared channel; selecting at the first node a first policy among the plurality of policies based on the probabilities observed instead of a message received from a central authority; and transmitting a local data packet from the first node onto the shared channel at a transmit time based on the first policy.

Abstract: Techniques for collision avoidance on a current receiving network node using a half duplex wireless transceiver include, in response to receiving a request to transmit a variable length data message from a first node, transmitting a clear to transmit message that indicates the first node followed by transmitting a physical layer first pilot message. In some circumstances, the techniques include transmitting an acknowledgement message that indicates the first node, only in response to successfully receiving the variable length data message that indicates the first node followed by receiving a physical layer second pilot message. The second pilot message can be detected using either or both of energy detection and preamble detection.

Abstract: Techniques for information-centric transport include, in response to receiving content from a server process on a local node storing the content on the local node. The content comprises a plurality of chunks. A CNS-compatible name for the content is generated. Also, a plurality of chunk names is generated for the plurality of chunks. A manifest field is generated, which holds data that indicates the chunk names and data that indicates encoding of the chunks. The manifest field and the CNS-compatible name are caused to be stored. A data packet that includes, in a second reliable protocol payload, the manifest field and an node identifier for a node that stores the content is caused to be sent in response to a request for the manifest for the CNS-compatible name.

Abstract: Techniques for transmitting data packets on a shared channel in a data communications network include storing, on a local node, a current number of turns in a transmitting queue and a current turn based on packets received from other nodes on the channel. For a first local data packet to transmit, a local transmit turn is obtained based on successfully transmitting the packet in a time interval following a last turn in the queue. A data link layer header includes queue fields for the current number of turns, the local transmit turn, and a request for adding the local transmit turn. While there is still a remaining packet to transmit and when the current turn is the local transmit turn, the packet is transmitted with queue fields indicating the current number of turns, the current turn, and an indication of no new turn. An acknowledgement control packet indicates successful transmission.

Abstract: Techniques include retrieving from storage a plurality of policies for sharing a shared channel among nodes in a data communications network. The plurality of polices define a tree of periodic schedules of variable periods, each policy defines a transmit time slot as a unique slot i of a modulus of a power m of a base b of a series of time slots, where m indicates a level of the tree of periodic schedules. The method also includes; observing at a first node the probabilities of empty time slots, successful time slots, and collision time slots on the shared channel; selecting at the first node a first policy among the plurality of policies based on the probabilities observed instead of a message received from a central authority; and transmitting a local data packet from the first node onto the shared channel at a transmit time based on the first policy.

Abstract: Techniques for transmitting data packets on a shared channel in a data communications network, include determining a time slot interval, T, based on a longest data packet to be transmitted on a shared channel in a data communications network. At a first node in the data communications network a local base time, t0, is determined equal to a time at an end of receipt of a successful acknowledgement control packet on the shared channel. A local data packet is transmitted from the first node onto the shared channel at a transmit time that is an integer multiple n of T after the local base time t0. The local data packet is determined to be successfully transmitted when a successful acknowledgement control packet that uniquely indicates the local data packet is received on the shared channel within the interval T of transmitting the local data packet.

Abstract: Techniques for routing in communications networks include determining a state of a destination node in a current routing table stored at a first node. A value for a reference cost to the destination node is determined based on a minimum cost to the destination in the current routing table. Based on the state, a request message is formed including a reference distance field to prevent loops, an originating node field, a destination field, and a previous hop field. The request message is sent to a different second node within range. A record that indicates the data in the request message is stored in a pending request table. A reply message is received in response to sending the request message. In response to receiving the reply message, the record in the pending request table is removed, and the current routing table is updated based on the reply message.

Abstract: Techniques for collision avoidance on a current receiving network node using a half duplex wireless transceiver include, in response to receiving a request to transmit a variable length data message from a first node, transmitting a clear to transmit message that indicates the first node followed by transmitting a physical layer first pilot message. In some circumstances, the techniques include transmitting an acknowledgement message that indicates the first node, only in response to successfully receiving the variable length data message that indicates the first node followed by receiving a physical layer second pilot message. The second pilot message can be detected using either or both of energy detection and preamble detection.

Abstract: A distance-vector based routing protocol that integrates with adaptive publish-subscribe mechanisms by establishing routes to well-known controllers using distance-vector signaling.

Abstract: A distance-vector based routing protocol that integrates with adaptive publish-subscribe mechanisms by establishing routes to well-known controllers using distance-vector signaling.

Abstract: Rate adaptation in a digital wireless communication network is performed by measuring by a wireless node data throughput values attained while communicating at different data rates on a channel in the network. The node calculates from the measured throughput alone a current transmission rate without any a priori knowledge of a state of the channel. The transmission rate calculation involves calculating a ratio of the measured throughput with respect to an exponential weighted moving average of the measured throughput. By repeating the measurements and calculations periodically, the rate used for transmission by the node is adapted automatically.

Abstract: A wireless base station having K antennas communicates with M mobile devices using multiuser diversity scheme with opportunistic interference management. The base station transmits K distinct pilot signals from K corresponding antennas and receives feedback from mobile devices. The feedback from each device indicates a strong pilot signal and a weak pilot signal received from the K distinct pilot signals. Using these indications, the base station assigns each of the K antennas to a mobile device. The base station then transmits distinct data streams to the mobile devices using the corresponding antennas assigned to the corresponding mobile devices. The transmission may include multiplying the transmitted distinct data streams by a vector V orthogonal to a vector U, thereby allowing mobile devices not assigned to an antenna to cancel the transmitted distinct data streams.

Abstract: A new and useful approach to binding network socket API using hidden identifiers, referred to by the acronym HIDRA (Hidden Identifiers for De-multiplexing and Resolution Architecture). HIDRA is the first solution that takes advantage of “hidden” identifiers to be used in hosts. HIDRA has three main components that integrate together: a protocol-agnostic API and stack; upgraded name-resolution and service-discovery functions; and transport-layer modifications. The hidden identifiers are de-multiplexed into open identifiers in lower protocol layers and open identifiers are resolved back into hidden identifiers in lower protocol layers for use by the application.