Search
Now showing items 1-8 of 8
An investigation into the use of the kriging for Wi-Fi RSSI estimation in complex indoor environments
(IEEE, 2015)
Kriging was originally developed for geographical interpolation purposes, but has proven to be a powerful tool in many other applications as well. In this study we evaluate kriging for Wi-Fi signal strength estimation in ...
A comparison of wireless node topologies for network coding using practical path-loss models
(IEEE, 2010)
In this paper, we discuss the physical arrangement of wireless nodes to form topologies suitable for the implementation of Network Coding. Boundaries for the most favorable placement of the nodes to form Bow-Tie and Butterfly ...
An evaluation of configuration parameters affecting network coding on the data link layer in a wireless network
(IEEE, 2011)
Network Coding, introduced in [2], promises significant theoretical capacity gains in multicast networks. Practical implementations in underlay networks are however quite complex in practice and performance is subject to ...
Error correction for resource limited random network coding networks
(IEEE, 2011)
Random linear network coding is a practical approach to network coding. It is, however, susceptible to corruption of the message packets due to hostile factors in the network. Error correction can be implemented, but in ...
The performance of feature-based classification of digital modulations under varying SNR and fading channel conditions
(IEEE, 2017)
Feature-based classification is a method used for automatic modulation classification of communication signals. This method requires extraction of various features from a signal. One of the approaches for feature extraction ...
Improving QoS for real-time multimedia traffic in ad-hoc networks with delay aware multi-path routing
(IEEE, 2008)
A Mobile Ad-hoc Network (MANET) is a wireless network in which nodes, in the absence of fixed access points, communicate via single or multi-hop paths. Each node in a MANET should thus be able to perform necessary routing ...
Regenerator for Varshamov-tenengolts-like synchronisation error correcting codes
(IEEE, 2008)
Synchronisation errors, that is, the insertion of additional or deletion of valid symbols, are the most difficult class of errors to correct - containing the class of additive errors as a subset. A regenerating algorithm, ...
Efficient packet erasure decoding by transforming the systematic generator matrix of an RS code
(IEEE, 2008)
We consider the erasures-only decoding of Reed-Solomon codes. One class of erasure decoders of algebraic codes can be viewed as a transformation of the systematic generator matrix, as first noticed by Berlekamp. We extend ...