Abstract: A method, apparatus and computer program product for providing partial packet recovery (PPR) for wireless networks is presented. PPR incorporates an expanded physical layer (PHY) interface that provides PHY-independent hints to higher layers about the PHY's confidence in each bit it decodes, and a technique to recover data even when a packet preamble is corrupted and not decodable at the receiver. Also described is an asynchronous link-layer automatic repeat request (ARQ) protocol built on PPR that allows a receiver to compactly encode a request for retransmission of only those bits in a packet that are likely in error.

Abstract: In one aspect, a wireless system includes an encoder configured to encode data using a spinal code which uses a function over the message bits to directly produce a sequence of constellation symbols for transmission. The wireless system also includes a decoder configured to decode the spinal code. The function may be at least one of a non-linear function and a hash function.

Abstract: A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number “N” of tiers. The number “N” is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.

Abstract: A method and apparatus for selecting a queue for service across a shared link. The method includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer, selecting a queue having a first priority for each group of queues within each ingress (104) having packets destined for a particular egress (104), selecting a queue having a second priority for each subset of queues having first priorities and having packets destined for the particular egress (104), and selecting the queue having the second priority for service across the shared link in the given timeslot.

Abstract: A method and network architecture for implementing an energy efficient network. The network includes a plurality of nodes that collect and transmit data that are ultimately routed to a base station. The network nodes form a set of clusters with a single node acting as a cluster-head. The cluster-head advertises for nodes to join its cluster, schedules the collection of data within a cluster, and then transmits the data to the base station. A cluster can intelligently combine data from individual nodes. After a period of operation, the clusters are reformed with a different set of nodes acting as cluster-heads. The network provides an increased system lifetime by balancing the energy use of individual nodes.

Abstract: The position and orientation of a mobile unit is determined from ultrasonic waves received from beacons of known location. Orientation is determined from a phase difference of the sensed ultrasonic wave at plural receivers on the mobile unit. Signals from multiple beacons may be processed to solve for x, y and z position and for speed of sound. The receivers are spaced at greater than a half wavelength of the ultrasonic wave and signals from plural receivers are processed to remove multiple wavelength phase ambiguity. Two non-collinear sets of collinear receivers allow ambiguity resulting from symmetry of the receivers to be broken.

Abstract: A method and apparatus for selecting a queue for service across a shared link. The method includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer, selecting a queue having a first priority for each group of queues within each ingress (104) having packets destined for a particular egress (104), selecting a queue having a second priority for each subset of queues having first priorities and having packets destined for the particular egress (104), and selecting the queue having the second priority for service across the shared link in the given timeslot.

Abstract: A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number “N” of tiers. The number “N” is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.

Abstract: A single integrated circuit chip interfaces device control circuitry of a device to a client machine via a computer network. The chip comprises an internal data bus; a central processing unit connected to the internal data bus; an internal memory connected to the internal data bus; a device interface connected to the internal data bus, wherein the device interface comprises circuit blocks for communicating digital information between the integrated circuit and the device control circuitry; and a network interface connected to the internal data bus, wherein the network interface comprises circuit blocks for communicating digital information between the integrated circuit and the computer network.