Abstract: A network relaying device facilitates communication among a plurality of network nodes. When the network relaying device receives a data packet from a first network node, it determines whether a historical transmission rate of the first network node exceeds a threshold rate. Based on this determination, the network relaying device determines whether to associate the data packet with a first queue or a second queue for transmission to a second network node.

Abstract: Computationally efficient message encoding and decoding schemes for NCMA-based multiple access networks are enabled. Belief propagation decoding of fountain codes designed for NCMA-based multiple access networks may be enhanced using Gaussian elimination. Networks utilizing a network-coded slotted ALOHA protocol can benefit in particular. In such cases, Gaussian elimination may be applied locally to solve the linear system associated with each timeslot, and belief propagation decoding may be applied between the linear systems obtained over different timeslots. The computational complexity of such an approach may be of the same order as a conventional belief propagation decoding algorithm. The fountain code degree distribution may be tuned to optimize for different numbers of expected channel users.

Abstract: Methods and systems involving network coding (NC) atoms as building blocks of NC networks solve the scheduling problem in NC networks using a decomposition framework based on NC atoms. Ten physical-layer network coding (PNC) atoms and their straightforward network coding (SNC) counterparts are disclosed. SNC network can generate a transmission schedule based on SNC atoms. PNC network can generate transmission schedule based on PNC atoms. Performance evaluation results indicate that decomposition based on PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100% and can yield performance gain of 40% or more compared with decomposition based on the PNC TWRC atom alone. Further performance evaluation results indicate that decomposition based on SNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 33% and can yield performance gain of 14% or more compared with decomposition based on the SNC TWRC atom alone.

Abstract: A network relaying device facilitates communication among a plurality of network nodes. When the network relaying device receives a data packet from a first network node, it determines whether a historical transmission rate of the first network node exceeds a threshold rate. Based on this determination, the network relaying device determines whether to associate the data packet with a first queue or a second queue for transmission to a second network node.

Abstract: Systems and methods described herein include a first wireless local area network (“WLAN”) system that jointly exploits physical-layer network coding (“PNC”) and multiuser decoding (“MUD”) to boost system throughput. This multiple access mode is referred to as Network-Coded Multiple Access (“NCMA”). NCMA allows multiple nodes to transmit simultaneously to the access point (“AP”) to boost throughput in a non-relay environment. When two nodes A and B transmit to the AP simultaneously, the AP desires to obtain both packet A and packet B rather than their network-coded packet.

Abstract: Computationally efficient message encoding and decoding schemes for NCMA-based multiple access networks are enabled. Belief propagation decoding of fountain codes designed for NCMA-based multiple access networks may be enhanced using Gaussian elimination. Networks utilizing a network-coded slotted ALOHA protocol can benefit in particular. In such cases, Gaussian elimination may be applied locally to solve the linear system associated with each timeslot, and belief propagation decoding may be applied between the linear systems obtained over different timeslots. The computational complexity of such an approach may be of the same order as a conventional belief propagation decoding algorithm. The fountain code degree distribution may be tuned to optimize for different numbers of expected channel users.

Abstract: Methods and systems involving network coding (NC) atoms as building blocks of NC networks solve the scheduling problem in NC networks using a decomposition framework based on NC atoms. Ten physical-layer network coding (PNC) atoms and their straightforward network coding (SNC) counterparts are disclosed. SNC network can generate a transmission schedule based on SNC atoms. PNC network can generate transmission schedule based on PNC atoms. Performance evaluation results indicate that decomposition based on PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100% and can yield performance gain of 40% or more compared with decomposition based on the PNC TWRC atom alone. Further performance evaluation results indicate that decomposition based on SNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 33% and can yield performance gain of 14% or more compared with decomposition based on the SNC TWRC atom alone.

Abstract: Methods and systems involving network coding (NC) atoms as building blocks of NC networks solve the scheduling problem in NC networks using a decomposition framework based on NC atoms. Ten physical-layer network coding (PNC) atoms and their straightforward network coding (SNC) counterparts are disclosed. SNC network can generate a transmission schedule based on SNC atoms. PNC network can generate transmission schedule based on PNC atoms. Performance evaluation results indicate that decomposition based on PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100% and can yield performance gain of 40% or more compared with decomposition based on the PNC TWRC atom alone. Further performance evaluation results indicate that decomposition based on SNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 33% and can yield performance gain of 14% or more compared with decomposition based on the SNC TWRC atom alone.

Abstract: Methods and systems involving network coding (NC) atoms as building blocks of NC networks solve the scheduling problem in NC networks using a decomposition framework based on NC atoms. Ten physical-layer network coding (PNC) atoms and their straightforward network coding (SNC) counterparts are disclosed. SNC network can generate a transmission schedule based on SNC atoms. PNC network can generate transmission schedule based on PNC atoms. Performance evaluation results indicate that decomposition based on PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100% and can yield performance gain of 40% or more compared with decomposition based on the PNC TWRC atom alone. Further performance evaluation results indicate that decomposition based on SNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 33% and can yield performance gain of 14% or more compared with decomposition based on the SNC TWRC atom alone.

Abstract: Methods and systems are disclosed involving physical-layer network coding (PNC) atoms as building blocks of PNC networks to solve the scheduling problem in PNC networks using a decomposition framework based on PNC atoms. Ten PNC atoms and their straightforward network coding (SNC) counterparts are disclosed. Performance evaluation results are discussed, which indicate that decomposition based on the ten PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100%. Furthermore, decomposition based on the ten PNC atoms can yield performance gain of 40% or more compared with decomposition based on the TWRC atom alone.

Abstract: Systems and methods described herein include a first wireless local area network (“WLAN”) system that jointly exploits physical-layer network coding (“PNC”) and multiuser decoding (“MUD”) to boost system throughput. This multiple access mode is referred to as Network-Coded Multiple Access (“NCMA”). NCMA allows multiple nodes to transmit simultaneously to the access point (“AP”) to boost throughput in a non-relay environment. When two nodes A and B transmit to the AP simultaneously, the AP desires to obtain both packet A and packet B rather than their network-coded packet.

Abstract: Methods and systems are disclosed involving physical-layer network coding (PNC) atoms as building blocks of PNC networks to solve the scheduling problem in PNC networks using a decomposition framework based on PNC atoms. Ten PNC atoms and their straightforward network coding (SNC) counterparts are disclosed. Performance evaluation results are discussed, which indicate that decomposition based on the ten PNC atoms outperforms the traditional multi-hop (non-NC) scheduling by about 100%. Furthermore, decomposition based on the ten PNC atoms can yield performance gain of 40% or more compared with decomposition based on the TWRC atom alone.

Abstract: Disclosed are systems and methods which provide for location positioning in wireless networks using techniques which are adapted to provide reliable location determinations even in complex topological environments. Embodiments utilize multiple antenna patterns, such as may be provided using phased array antennas, and implement location positioning techniques which do not require alteration of remote stations in providing location positioning. Various techniques for determining location may be implemented, including a channel model independent approach, a channel model based approach, or combinations thereof. A channel model independent approach used in providing location positioning may compare receive signal strength differences to an antenna gain difference table to determine an angle in the azimuth that a remote station is located.

Abstract: Data as may be employed in telecommunication is segmented into blocks, each block having associated therewith a metric of distortion as a function of the number of bits in the block to represent the quality of the data contained in the block. Within the blocks, bits are ordered according to significance. The blocks are then ranked according to the distortion metric, then the lowest significant bits of blocks having the lowest distortion metrics are dropped and bits are allocated to other blocks having the highest distortion metrics in order to redistribute the quality or distortion of each of the blocks for transmission (or subsequent compressed storage). Each of the blocks can thus be transmitted at substantially the same level of distortion within a channel which is bandwidth restricted compared to the maximum possible resolution of the data, thus minimizing imbalances in quality among the blocks of data and maximizing channel efficiency.