No description available.

yes / Empirical modeling of wireless fading channels using common schemes such as autoregression and thefinitestate Markov chain (FSMC) is investigated. The conceptual background of both channel structures and the establishment of their mutual dependence in a confined manner are presented. The novel contribution lies in the proposal of a new approach for deriving the state transition probabilities borrowed from economic disciplines, which has not been studied so far with respect to the modeling of FSMC wireless fading channels. The proposed approach is based on equal portioning of the received signal-to-noise ratio, realized by using an alternative probability construction that was initially highlighted by Tauchen. The associated statistical procedure shows that afirst-order FSMC with a limited number of channel states can satisfactorily approximate fading. The computational overheads of the proposed technique are analyzed andproven to be less demanding compared to the conventional FSMC approach based on the levelcrossing rate. Simulations confirm the analytical results and promising performance of the new channel modelbased on the Tauchen approach without extracomplexity costs.

Wireless sensor networks are attractive largely because they need no wired infrastructure. But precisely this feature makes them energy constrained, and the consequences of this hard energy constraint are the overall topic of this thesis. We are in particular concerned with principles for energy efficient wireless communication and the energy-wise trade-off between sensing and radio communication. Radio transmission between sensors incurs both a fixed energy cost from radio circuit processing, and a variable energy cost related to the level of radiated energy. We here find that transmission techniques that are otherwise considered efficient consumes too much processing energy. Currently available sensor node radios typically have a maximum output power that is too limited to benefit from transmission-efficient, but processing-intensive, techniques. Our results provide new design guidelines for the radio output power. With increasing transmission energy -- with increasing distance -- the considered techniques should be applied in the following order: output power control, polarisation receiver diversity, error correcting codes, multi-hop communication, and cooperative multiple-input multiple-output transmissions. To assess the measurement capability of the network as a whole, and to facilitate a study of the sensing-communication trade-off, we devise a new metric: the network measurement capacity. It is based on the number of different measurement sequences that a network can provide, and is hence a measure of the network's readiness to meet a large number of possible events. Optimised multi-hop routing under this metric reveals that the energy consumed for sensing has decisive impact on the best multi-hop routes. We also find support for the use of hierarchical heterogeneous network structures. Model parameter uncertainties have large impact on our results and we use probability theory as logic to include them consistently. Our analysis shows that common assumptions can give misleading results, and our analysis of radio channel measurements confirms the inadequacy of the Rayleigh fading channel model. / wisenet

Error Resilient Coding tools are the methods to avoid or reduce the amount of corruption in video by altering the encoding algorithm. One of them is Flexible Macroblock Ordering (FMO) which provides us with ordering macroblocks of the frames flexibly. Six of them have definite ordering pattern and the last one, called explicit type, can get any order. In this thesis two explicit type algorithms, one of which is new, are explained and the performance of different FMO types in wired and wireless communication are evaluated. The first algorithm separates the important blocks into separate packets, so it equalizes the importance of packets. The proposed method allocates the important macroblocks according to a checkerboard pattern and employs unequal error protection to protect them more. The simulations are performed for wired and wireless communication and Forward Error Correction is used in the second stage of the simulations. Lastly the results of the new algorithms are compared with the performance of the other FMO types. According to the simulations the Proposed algorithm performs better than others when the error rate is very high and FEC is employed.

This thesis consists of two parts addressing two different problems in fading channels. The first part deals with asynchronous cooperative relay communication. The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In this work we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding Diversity-Multiplexing Tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound on DMT for all multiplexing gains and for number of relays N ≥ 2. The distributed space-time codes for all the protocols considered are based on Cyclic Division Algebras (CDA). The second part of the work addresses the DMT analysis of diversity embedded codes for MIMO channels. Diversity embedded codes are high rate codes that are designed so that they have a high diversity code embedded within them. This allows a form of opportunistic communication depending on the channel conditions. The high diversity code ensures that at least a part of the information is received reliably, whereas the embedded high rate code allows additional information to be transferred if the channel is good. This can be thought of coding the data into two streams: high priority and low priority streams so that the high priority stream gets a better reliability than the lower priority stream. We show that superposition based diversity embedded codes in conjunction with naive single stream decoding is sub-optimal in terms of the DM tradeoff. We then construct explicit diversity embedded codes by the superposition of approximately universal space-time codes from CDAs. The relationship between broadcast channels and the diversity embedded setting is then utilized to provide some achievable Diversity Gain Region (DGR) for MIMO broadcast Channels.

Scheduling has always been an indispensable part of resource allocation in wireless networks. Accurate information about channel-state is assumed as a modeling simplification. However, in a real-life network ,e.g., Long Term Evolution(LTE) or IEEE 802.16e WiMAX, the channel-state information feedback to the transmitter can have uncertainty. The primary reason being that although resource allocation is done at the finer granularity of a Physical Resource Block (PRB), channel-state information is still feedback at the coarser granularity of a sub band, which is a group of PRBs. This is done to reduce the feedback traffic from the users to the Base Station. However, this averaging causes information loss and hence, the resulting uncertainty at the scheduler. Moreover, uncertainty might be present in the channel-estimates because of the very process of estimation. In the first part of the thesis, we model the channel-estimate in accuracy and characterize the network stability region. Compared to earlier works, we allow the channel estimates to have dependence among themselves, which is a more realistic situation in a modern LTE or WiMax network. We then propose two simple Max Weight based scheduling schemes that achieve any rate in the interior of the stability region. We also derive an asymptotically tight upper bound on the mean queueing delay in our system under one of the throughput-optimal policies we propose. The above policies ensure stability of the network and we have also obtained bounds on the mean queueing delays. However, different applications may require certain quality of service which may not be satisfied by these policies. Thus, we also propose a throughput-optimal policy for the network under traffic with heterogeneous QoS constraints and present some numerical results studying its performance. In the second part of the thesis, we study the problem of energy-efficient scheduling under average delay constraint. For wireless access technologies, the largest power consumer is the Base Station(BS). Any reduction in the power consumption in a BS will reduce carbon footprint from the Information and Communication Technology sector. We concentrate on the problem of minimizing the total non-renewable power consumed in a Green BS, that is powered by renewable energy sources ,e.g., solar/wind energy and may also be connected to the power grid or diesel generators. Specifically, we consider the problem of minimizing the average grid power consumption of a Green BS downlink in scheduling multiple users with average delay constraints. We have a packetized model for the data packets (i.e., the packets cannot be fragmented) which is a more realistic model for packet-switched networks. The power function is a non-decreasing convex function of the queue-lengths and only one user is allowed to transmit in a slot. We prove the existence of a power optimal policy under delay constraints for multiple users. We analyse the problem and provide some structural results for the optimal policy.

This thesis proposes and analyzes data fusion algorithms that operate on the physical layer of a wireless sensor network, in the context of three applications of cognitive radios: 1. Cooperative spectrum sensing via binary consensus; 2. Multiple transmitter localization and communication footprint identification; 3.Target self-localization using beacon nodes. For the first application, a co-phasing based data combining scheme is studied under imperfect channel knowledge. The evolution of network consensus state is modeled as a Markov chain, and the average transition probability matrix is derived. Using this, the average hitting time and average consensus duration are obtained, which are used to determine and optimize the performance of the consensus procedure. Second, using the fact that a typical communication footprint map admits a sparse representation, two novel compressed sensing based schemes are proposed to construct the map using 1-bit decisions from sensors deployed in a geographical area. The number of transmitters is determined using the K-means algorithm and a circular fitting technique, and a design procedure is proposed to determine the power thresholds for signal detection at sensors. Third, an algorithm is proposed for self-localization of a target node using power measurements from beacon nodes transmitting from known locations. The geographical area is overlaid with a virtual grid, and the problem is treated as one of testing overlapping subsets of grid cells for the presence of the target node. The column matching algorithm from group testing literature is considered for devising the target localization algorithm. The average probability of localizing the target within a grid cell is derived using the tools from Poisson point processes and order statistics. This quantity is used to determine the minimum required node density to localize the target within a grid cell with high probability. The performance of all the proposed algorithms is illustrated through Monte Carlo simulations.

Opportunistic selection and rate adaptation play a vital role in improving the spectral and power efficiency of current multi-node wireless systems. However, time-variations in wireless channels affect the performance of opportunistic selection and rate-adaptation in the following ways. Firstly, the selected node can become sub-optimal by the time data transmission commences. Secondly, the choice of transmission parameters such as rate and power for the selected node become sub-optimal. Lastly, the channel changes during data transmission. In this thesis, we develop a comprehensive and tractable analytical framework that accurately accounts for these effects. It differs from the extensive existing literature that primarily focuses on time-variations until the data transmission starts. Firstly, we develop a novel concept of a time-invariant effective signal-to-noise ratio (TIESNR), which tractably and accurately captures the time-variations during the data transmission phase with partial channel state information available at the receiver. Secondly, we model the joint distribution of the signal-to-noise ratio at the time of selection and TIESNR during the data transmission using generalized bivariate gamma distribution. The above analytical steps facilitate the analysis of the outage probability and average packet error rate (PER) for a given modulation and coding scheme and average throughput with rate adaptation. We also present extensive numerical results to verify the accuracy of each step of our approach and show that ignoring the correlated time variations during the data transmission phase can significantly underestimate the outage probability and average PER, whereas it overestimates the average throughput even for packet durations as low as 1 msec.

Σκοπός της παρούσας διπλωματικής εργασίας είναι η μελέτη και ο προσδιορισμός, θεωρητικός και πειραματικός, του συντελεστή Κ της Rician κατανομής σε ένα κανάλι στα 2.4 GHz. Η κατανομή Rice χρησιμοποιείται για την περιγραφή του πλάτους του λαμβανόμενου σήματος σε ένα κανάλι μετάδοσης με ισχυρή επίδραση οπτικής επαφής (Line-of-Sight) μεταξύ κεραίας πομπού και δέκτη. Ο συντελεστής Κ Rice εκφράζει τον λόγο της συνεισφοράς της ισχύος της απευθείας συνιστώσας του σήματος ως προς την συνολική λαμβανόμενη ισχύ λόγω φαινομένων διάχυσης. Χρησιμοποιείται για τον χαρακτηρισμό του καναλιού καθώς και τον υπολογισμό του BER (bit-error-ratio) και της πλέον σημαντικής παραμέτρου των τηλεπικοινωνιών SNR (Signal-to-Noise-Ratio), δηλαδή του λόγου σήματος προς θόρυβο. Στο 1ο κεφάλαιο αναλύονται και περιγράφονται μερικές από τις σημαντικότερες τεχνολογίες ασυρμάτων δικτύων, από την πρώτη στιγμή της εμφάνισής τους (δίκτυα 1ης και 2ης γενιάς) έως τα πιο σύγχρονα δίκτυα 3ης και 4ης γενιάς, και παρουσιάζονται οι ζώνες συχνοτήτων που καταλαμβάνουν αυτές οι τεχνολογίες στο διαθέσιμο ηλεκτρομαγνητικό φάσμα. Στο 2ο κεφάλαιο μελετώνται οι 3 βασικότεροι μηχανισμοί διάδοσης του ηλεκτρομαγνητικού κύματος μέσα σε ένα ασύρματο κανάλι (ανάκλαση, περίθλαση, σκέδαση), περιγράφονται οι τύποι των απωλειών που υφίσταται ένα σήμα κατά την μετάδοση του και τα φαινόμενα των διαλείψεων, που παρατηρούνται πολύ έντονα σε ένα κινητό και μεταβαλλόμενο περιβάλλον διάδοσης. Στο 3ο κεφάλαιο γίνεται περιγραφή του μοντέλου ηλεκτρομαγνητικής μετάδοσης κατά Rice, δηλαδή όταν η απευθείας συνιστώσα του σήματος είναι η ισχυρότερη διαδρομή που ακολουθεί το εκπεμπόμενο σήμα κατά την πορεία του μέχρι τον δέκτη (LoS). Αναλύεται η σημαντικότερη παράμετρος αυτού του τύπου μετάδοσης, δηλαδή ο συντελεστής Κ, και παρουσιάζονται διάφορες μέθοδοι προσδιορισμού του τόσο θεωρητικά όσο και πειραματικά. Στο 4ο κεφάλαιο παρουσιάζονται τα αποτελέσματα των πειραματικών μας μετρήσεων σε διάφορες τοπολογίες μετάδοσης με LoS για ένα δίκτυο Wi-Fi, δηλαδή για συχνότητα λειτουργίας στα 2.4 GHz. Για κάθε τοπολογία, περιγράφεται πλήρως το περιβάλλον μετάδοσης καθώς και ολόκληρη η διαδικασία εκπόνησης των μετρήσεων (μετρητικά όργανα, απαραίτητο λογισμικό, τυχόν προσεγγίσεις κτλ.). Τέλος, στο 5ο και τελευταίο κεφάλαιο, παρουσιάζεται μια μέθοδος υπολογισμού του συντελεστή Κ μέσω των μετρήσεων και με τη βοήθεια του μοντέλου ελευθέρου χώρου, που χρησιμοποιείται για τον υπολογισμό των συνολικών απωλειών διαδρομής του σήματος. Τα αποτελέσματα των υπολογισμών χρησιμοποιήθηκαν, με την βοήθεια του Matlab, για την κατασκευή της CDF των τιμών του Κ αλλά και της γραφικής παράστασης της μεταβολής του Κ συναρτήσει της απόστασης. Οι εμπειρικές CDF συγκριθήκαν και προσεγγιστήκαν με γνωστές θεωρητικές CDF, και η συνάρτηση της μεταβολής του Κ με την απόσταση προσεγγίστηκε με όρους Goodness of Fit με την βοήθεια της γενικής μορφής γνωστών συναρτήσεων. Κλείνοντας, στην τελευταία παράγραφο της εργασίας αφήνεται περιθώριο και δίνεται τροφή για μελλοντική εργασία πάνω στην μελέτη και τον προσδιορισμό του συντελεστή Κ της Rice τόσο για εσωτερικούς όσο και για εξωτερικούς χώρους. / The main purpose of this thesis, is the analysis and estimation , theoretical and empirical, of the Rician K factor for a wireless channel at 2.4 GHz. The Rician power density function is used to describe the amplitude of the received signal when there is a strong LOS component. The Rician K factor expresses the ratio of the power component due to LOS signal propagation and the received signal power due to diffuse components (reflection, scattering, diffraction etc.). It is commonly used for the channel's characterization and the estimation of BER (bit error rate) and SNR (signal to noise ratio), a very important parameter for telecommunications. In the 1st chapter, some of the most important wireless systems are described, since their very first appearance (1G & 2G networks) until the latest 3rd and 4rth generation systems. We also present the current frequency bands and how they are spread at the given electromagnetic spectrum. In the 2nd chapter, the 3 basic propagation mechanisms (reflection, scattering, diffraction) are studied. In addition, we describe all types of signal attenuation within a wireless channel and the fading phenomena that are so commonly seen in mobile and continuously changing propagation environments. In the 3rd chapter, the Rician model of electromagnetic propagation, where LOS is the strongest path of signal components, is analyzed. The most important parameter of this propagation type, the Rician K factor, is also studied. Therefore, various methods of theoretical and empirical estimation of the K factor are presented. In the 4rth chapter, we include the results of our measurements in various LOS propagation topologies for a Wi-Fi system at 2.4 GHz. For each measurement topology, the propagation environment as well as the entire measurement procedure, are thoroughly described. Lastly, in the 5th and final chapter, a K factor estimation method based on the empirical set of data and the Free Space Model, used for the average path loss calculation, is presented. The results of our measurements via the help of the Matlab software were used in order to plot the CDF of K values as well as the K values versus d (distance) curve. Using curve fitting methods, the empirical CDFs and plots were compared to theoretical ones in terms of Goodness of Fit. In the closing section, possible future research in the aforementioned fields is proposed.