Abstract: A method selects antennas in an OFDMA wireless network including a base station and a mobile station. The mobile station measures a channel state of a downlink in a downlink subframe using different subsets of available antennas, and selects a subset of receive antennas for downlink reception based on the channel states between the base station and the different subsets of antennas at the mobile station. The base station measures the channel state in an uplink using an uplink subframe received in the base station from the mobile station, and selects a subset of transmit antennas for mobile station's uplink transmission based on the channel states between the base station and different subset of antennas at the mobile station.

Abstract: An apparatus, system, method and computer program product for secure ranging between at least two devices in radio communications with each other. In particular, an apparatus, system, method and computer program product for secure ranging between at least two devices communicating via ultra wideband (UWB) protocols. Either ternary-IR or time-hope-IR sequences are used for ranging and security. A first device transmits a range packet. A second device responds to the range packet after a delay time known only to the first and second devices. The delay time can be selected randomly by either to the first device or the second device and made known to the other device in an encrypted notification packet.

Abstract: A method for selecting antennas in a multiple-input, multiple-output wireless communications network that includes multiple stations is presented. Each station includes a set of transmit RF chains and a set of receive RF chains, and each RF chain is connectable to a set of antennas. A first station transmits a training frame for each possible subset of the set of antennas, and the set of transmit RF chains are connected to the subset of antennas according to a connection mapping rule while transmitting each training frame. A subchannel matrix is estimated in a second station for each frame. The subchannel matrices are combined to obtain a complete channel matrix. A particular subset of the antennas is selected according to the complete channel matrix. The set of transmit RF chains is connected to the selected particular subset of antennas to transmit data from the first station to the second station.

Abstract: The embodiments of the invention provide an adaptive method for base station cooperation in a wireless network. In a multi-user communications network that includes base stations, and in which each base station is associated with a cell, and in which each cell includes one or more mobile stations, each base station determines pre-coding matrices for full-cooperation, semi-cooperation and non-cooperation. Each base stations also determines a sum rate SRfull for full-cooperation, a sum rate SRsemi for semi-cooperation, and a sum rate SRnon for non-cooperation. Then, each base station selects the pre-coding for full-cooperation, the pre-coding matrices for semi cooperation, or the pre-coding matrices for non cooperation. Each base station transmits signals according to the selected pre-coding matrices.

Abstract: A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain ? is measured for each link x. Resource trade-off curves y=f(x) are constructed for each link x from the channel power gains ?, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c?f(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.

Abstract: A network includes a master node (master) and a set of slave nodes (slaves). The network uses orthogonal frequency-division multiplexing (OFDM) and time division multiple access (TDMA) symbols on sub-carriers. During a first downlink transmission from the master to the set of slaves using downlinks and all of the sub-carriers, a broadcast polling packet including data packets for each slave and sub-carrier assignments for the slaves is broadcast. Each slave transmits simultaneously to the master using uplinks and the assigned sub-carriers, a first response packet after receiving the broadcast polling packet. The master then broadcasts using the downlinks and all of the sub-carriers, a group acknowledgement packet, wherein the broadcast polling packet, the response packet, and the group acknowledgement packet include one superframe in one communication cycle, and wherein the broadcasting on the downlinks and the transmitting on the uplinks are disjoint in time.

Abstract: A method and apparatus for transmitting a packet in a wireless communications network is presented. A packet is constructed to include synchronization header, a physical layer header, and a payload. A preamble and a start of frame delimiter are inserted in the synchronization header. Multiple fixed length ternary sequences are inserted in the start of frame delimiter in an arbitrary order, and then the packet is transmitted.

Abstract: A method, MIMO communication device and electronic storage medium for mapping symbols during a duration of each plural consecutive frames of each of a plurality of first data streams (10, 12, 14, 16, 18, 20, 22, 24, 26) to frames of a plurality of second data streams (spaced-time coded streams or antenna streams); and varying the mapping during the duration of each of the plural consecutive frames of each of the plurality of first data streams (10, 12, 14, 16, 18, 20, 22, 24, 26).

Abstract: A method and apparatus for transmitting a packet in a wireless communications network is presented. A packet is constructed to include synchronization header, a physical layer header, and a payload. A preamble and a start of frame delimiter is inserted in the synchronization header. Multiple pairs of cores and of suffixes are inserted in the start of frame delimiter, and then the packet is transmitted.

Abstract: In a wireless network using cooperative relaying, a set of messages are broadcast from a base station to a set of relay stations during a first phase of a scheduling interval. During a second phase of the scheduling interval, the set of messages from the set of relay stations are broadcasting cooperatively to a set of mobile stations, while broadcasting. While broadcasting, a time and a rate and a size of each message is optimized during the first phase, and a rate of each message is optimized during the second phase.

Abstract: The invention describes a method for transmitting a packet in a wireless network of nodes. At a beginning of a scheduled time slot a metric in the node is set, in which the metric indicates a need to transmit a packet to a receiver in the wireless network. The metric is mapped to a received power level and the packet is transmitted at a transmit power level so that the received power level is achieved at the receiver.

Abstract: A method selects antennas in an OFDMA network. A channel state of a downlink is measured using a downlink subframe received in a mobile station from a base station. A channel state of an uplink is measured using an uplink subframe received in the base station from the mobile station. Next, the method compares the channel states to determine whether the downlink and the uplink are reciprocal or not. The mobile station can perform receive antenna selection based on the quality of the downlink channel state. The mobile station can also perform transmit antenna selection when instructed by the base station.

Abstract: A method signals a quality of range estimates in a UWB network. For each range estimate, a confidence level of a range estimate is signaled, a confidence interval for the range estimate is signaled, and a confidence interval scaling factor for the confidence interval is signaled.

Abstract: A method transmits an L bit packet in a relay network including a source node, a relay node and a destination node. The source node partitions the packet into first fragment of ?L bits and a second fragment of (1??) bits. The first fragment is transmitted from the source node to the relay node at a first data rate during a first phase. The second fragment is transmitted from the source node to the destination node at a second data rate during a second phase while the first fragment is retransmitted from the relay node to the destination node at a third data rate.

Abstract: A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.

Abstract: A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain ? is measured for each link x. Resource trade-off curves y=ƒ(x) are constructed for each link x from the channel power gains ?, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c?ƒ(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.

Abstract: A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.

Abstract: In a wireless network including a base station (BS) and a set of mobile stations (MS), a MS transmits a ranging request message to the BS, using random access, when the MS enters the cell. The ranging request message includes request MS specific information for identifying the MS. The MS receives a ranging response message broadcast from the BS, which includes response MS specific information, request and response specific information to determine whether the BS received the request, or whether a collision occurred.

Abstract: A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.

Abstract: A system and method for communicating information in a wireless cooperative relay network of nodes, the nodes including a source, a set of relays, and a destination. The source broadcasts a code word encoded as a data stream using a rateless code. The relays receive the data stream, decode the data stream to recover the code word, and reencode and transmit the recovered code word as the data stream with the rateless code. The destination receives and decodes the reencoded data streams to recover the code word.