Abstract: A cascaded memory system includes a memory module having a primary interface coupled to a memory controller via a first communication channel and a secondary interface coupled to a second memory module via a second communication channel. The first memory module buffers and repeats signals received on the primary and secondary interfaces to enable communications between the memory controller and the secondary memory module.

Abstract: A system and method for growing and maintaining biological material including producing a protein associated with the tissue, selecting cells associated with the tissue, expanding the cells, creating at least one tissue bio-ink including the expanded cells, printing the at least one tissue bio-ink in at least one tissue growth medium mixture, growing the tissue from the printed at least one tissue bio-ink, and maintaining viability of the tissue.

Abstract: A domain manager configured to manage and/or configure an audio-video (AV) system but not directly participate in networked media transmission or clock synchronization. The domain manager may include a database; an endpoint manager configured to communicate with the database, the endpoint manager being configured to setup and maintain secure connections to and from media devices and controllers; and at least one management module configured to communicate with the database and provide services to the media devices and controllers. In embodiments, the at least one management module may include at least one of a manager for managing credentials and grouping devices into domains, a device directory for managing device registrations and lookup, and an access controller for managing and/or evaluating access control policy.

Abstract: A domain manager configured to manage and/or configure an audio-video (AV) system but not directly participate in networked media transmission or clock synchronization. The domain manager may include a database; an endpoint manager configured to communicate with the database, the endpoint manager being configured to setup and maintain secure connections to and from media devices and controllers; and at least one management module configured to communicate with the database and provide services to the media devices and controllers. In embodiments, the at least one management module may include at least one of a manager for managing credentials and grouping devices into domains, a device directory for managing device registrations and lookup, and an access controller for managing and/or evaluating access control policy.

Abstract: A domain manager configured to manage and/or configure an audio-video (AV) system but not directly participate in networked media transmission or clock synchronization. The domain manager may include a database; an endpoint manager configured to communicate with the database, the endpoint manager being configured to setup and maintain secure connections to and from media devices and controllers; and at least one management module configured to communicate with the database and provide services to the media devices and controllers. In embodiments, the at least one management module may include at least one of a manager for managing credentials and grouping devices into domains, a device directory for managing device registrations and lookup, and an access controller for managing and/or evaluating access control policy.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Techniques are provided for selecting a root node in an ad hoc network comprising a plurality of nodes including a first node. According to one implementation of these techniques, a first node can receive a message from at least one of the other nodes. Each message includes a number of primary factors associated with a particular node regarding capabilities of the particular node. The primary factors associated with each node can then be evaluated, and an attempt can be made to select the root node based on the primary factors associated with each node. If the first node is unable to select the root node based on the primary factors associated with each node, then the root node can be selected based on secondary factors associated with each node.

Abstract: Method and apparatus for packet scheduling in a wireless network is described. First values for a data transmission rate are measured for each of a plurality of mobile stations over time. Second values for a function of the data transmission rate are computed using at least one of the first values for each of the mobile stations. A rate of change of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A stability of the data transmission rate is computed for each of the plurality of mobile stations using the second values associated therewith. A channel quality factor is determined for each of the mobile stations using a current value of the second values, the rate of change of the function, and the stability of the function associated therewith.

Abstract: A method and system for data transmission by computational devices in a wireless network (100) are disclosed. A computational device (102) organizes the wireless network in a hierarchical topology having at least one root node and updates a list of interferers and a list of descendents. Then, the computational device allocates a Contention Free Period (CFP) slot to each computational device in the wireless network based on at least one of the list of interferers and the list of descendents and transmits data during the allocated CFP slot.

Abstract: Methods for providing a client access to a channel in a meshed wireless local area network are disclosed. The methods comprise that a client in the meshed wireless local area network implement a polling based channel access methodology. The client determines that the channel is available by sensing that the channel is not busy and sends a request for access to the channel to an access point, wherein the request specifies a priority of data that is to be transmitted when the client is granted access to the channel. The client waits a time period before receiving at least one of a) a rejection of the request for access to the channel, b) access to the channel, c) modification of the request for access to the channel, and d) delay access to the channel.

Abstract: Methods for performing client to client communication in a wireless local area network are disclosed. At an ‘n’ tier client in the wireless local area network, a signaling message from an ‘n?1’ tier client is received wherein the signaling message comprises a first period, a second period, and a third period. Communicating with the ‘n?1’ tier client during the first period and communicating with the ‘n+1’ tier client during the third period. At an access point in the wireless local area network, an association table identifying clients in the wireless local area network is created and a first period for client to client communication based upon the association table and traffic in the wireless local area network is determined where the access point does not communicate with the clients during the first period.

Abstract: A method (S200) and system for scheduling data transmissions between a base station (110) and a plurality of user terminals (130) in a wireless network. The method and system include transmitting a first poll (260) from the base station (110) to a first user terminal traffic stream (Step S210). In response to the first poll (260) the first user terminal traffic stream transmits a first frame (210) to the base station (110), where a queue state of the first user terminal traffic stream is indicated in the header of the first frame (210) (Step S220). The base station (110) removes the first user terminal traffic stream from an active list when the first frame (210) indicates that the queue state is empty (Step S230). The base station (110) then calculates a deferral window (220) and schedules transmissions of other data frames (240) between the base station (110) and the plurality of user terminal traffic streams that remain on the active list (Steps S240 and S250).

Abstract: Methods for delivery of multicast packets in a wireless communication system are disclosed. The methods comprise transmitting a contention free period initiation signal from an access point to the station, transmitting broadcast packets from the access point to the station, transmitting multicast packets from the access point to the station and holding the multicast packets in storage after the transmission, transmitting a contention free period end signal from the access point to the station, determining if a negative acknowledgement message has been received, retransmitting the multicast packets in response to receiving a negative acknowledgment message, and eliminating the multicast packets at a next beacon interval.

Abstract: Methods for managing wireless backhaul in a multi-tier wireless local area network are disclosed. The methods comprise maintaining a polling list wherein the polling list specifies the children to be serviced, transmitting a communication in the downstream direction to a child in the polling list, receiving exception communications from the child, and updating the polling list in response to the exception communication.

Abstract: A method for transmitting beacons by nodes in a multi-tier wireless local area network is disclosed. First, a first beacon by a tier 1 node in the multi-tier wireless local area network is transmitted. Then, a second beacon by a tier 2 node is transmitted where the second beacon is transmitted based upon the time that the first beacon is sent by the tier 1 node.

Abstract: A method for performing neighbor discovery in a multi-tier wireless local area network where a client creates a neighbor list identifying a neighbor wherein the neighbor is identified as an access point or a client. Then, the client determines a time to perform a scan of neighbors based upon 1) a type of neighbor discovery to be performed and 2) when a first beacon is transmitted by an access point in a first tier of the multi-tier wireless local area network. Subsequently, the client performs a scan of neighbors at the determined time on a channel associated with the type of neighbor discovery. Finally, the client receives a beacon sent from a neighbor of the client to update the neighbor list with information transmitted in the beacon.

Abstract: A method (600) performed by a packet scheduler of an access point (215) of adaptively resizing a scheduling window in a Quality of Service enabled Local Area Network (200) is disclosed. The packet scheduler schedules data packets for a given duration, termed a scheduling window. The packet scheduler according to an embodiment of the invention adaptively changes the duration of the scheduling window based on the QoS requirements of data packets to be transmitted to and from the access point (215). In particular, the duration of the scheduling window is changed based on the delay requirement of the data packet having the most constraint QoS requirement.

Abstract: A method and system for scheduling multicast transmissions in a WLAN involves transmissions between a Quality of Service (QoS) Access Point (QAP) (105) and a plurality of stations (110). The method includes transmitting a first group poll (410) from a QAP (105) to each station (110) in a multicast group comprising a plurality of stations (110) (step 705). An active station (110) and inactive stations (110) among said plurality of stations (110) are then identified (step 510). Next, a directed Contention Free (CF) poll (425) is transmitted from the QAP (105) to the active station (110) (step 715). An inbound QoS data frame (415) is then transmitted from the active station (110) to the QAP (105) (step 720). An outbound QoS data frame (420) corresponding to the inbound QoS data frame (415) is then multicast from the QAP (105) to the inactive stations (110) (step 725).

Abstract: A communication unit (10) can have at least a first receiver (11) and a second receiver (12). The latter typically consumes more power than the former during ordinary operation. Pursuant to one embodiment a communication unit can use the lower-power receiver to detect energy on a monitored channel while the second receiver is retained in a reduced power mode of operation. Upon detecting an absence of channel activity the second receiver can be restored to normal operability to effect such activities as are then presently required.