Change search
ReferencesLink to record
Permanent link

Direct link
Low-delay sensing and transmission
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
2011 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis studies cooperative sensing and transmission in the context ofwireless sensor networks (WSNs). We especially focus on two means of cooperative sensing and transmission, namely, distributed source coding and relaying. We consider systems where the usefulness of the measured data is dependent on how old the data is and we therefore need low-delay transmission schemes. At first sight, the low-delay criterion may seem to be of little relevance, but it is this aspect in particular that distinguishes this thesis from many of the existing communication theoretic results, which often are asymptotic in the block lengths. The thesis is composed of an introductory part, discussing the fundamentals of communication theory and how these are related to the requirements of WSNs, followed by a part where the results of the thesis are reported in Papers A-H.

Papers A-D study different scenarios for distributed source-channel coding. In Paper A, we consider transmission of correlated continuous sources and propose an iterative algorithm for designing simple and energy-efficient sensor nodes. In particular the cases of the binary symmetric channel as well as the additive white Gaussian noise channel are studied. In Paper B, the work is extended to channels with interference and it is shown that also in this case there can be significant power savings by performing a joint optimization of the system.Papers C and D use a more structured approach and propose side-information-aware source-channel coding strategies using lattices and sinusoids.

In Paper E, we apply the methods we have used in joint source-channel coding to the famous Witsenhausen counterexample. By using a relatively simple iterative algorithm, we are able to demonstrate the best numerical performance known to date.

For the case of systems with relays, we study the transmission of a continuous Gaussian source and the transmission of an uniformly distributed discrete source. In both situations, we propose algorithms to design low-delay source-channel and relay mappings. By studying the structure of the optimized source-channel and relay mappings, we provide useful insights into how the optimized systems work. These results are reported in Papers F and G.

In Paper H, we finally consider sum-MSE minimization for the Gaussian multiple-input, multiple-output broadcast channel. By using recently discovered properties of this problem, we derive a closed-form expression for the optimal power allocation in the two-user scenario and propose a conceptually simple and efficient algorithm that handles an arbitrary number of users.

Throughout the thesis we show that there are significant gains if the parts of the system are jointly optimized for the source and channel statistics. All methods that are considered in this thesis yield very low coding and decoding delays. In general, nonlinear mappings outperform linear mappings for problems where there is side-information available. Another contribution of this thesis is visualization of numerically optimized systems that can be used as inspiration when structured low-delay systems are designed.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology , 2011. , xii, 30 p.
Series
Trita-EE, ISSN 1653-5146 ; 2011:039
Keyword [en]
Cooperative communication, wireless sensor networks, low-delay transmission, joint source-channel coding, distributed source coding, estimation, quantization
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-33404ISBN: 978-91-7415-983-7OAI: oai:DiVA.org:kth-33404DiVA: diva2:415089
Public defence
2011-05-26, Hörsal F3, Lindstedtsvägen 26, KTH, Stockholm, 13:15 (English)
Opponent
Supervisors
Funder
ICT - The Next Generation
Note
The author changed name from Johannes Karlsson to Johannes Kron in January 2011. QC 20110512Available from: 2011-05-12 Created: 2011-05-05 Last updated: 2011-10-30Bibliographically approved
List of papers
1. Distributed Quantization over Noisy Channels
Open this publication in new window or tab >>Distributed Quantization over Noisy Channels
2009 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 57, no 6, 1693-1700 p.Article in journal (Refereed) Published
Abstract [en]

The problem of designing simple and energyefficient sensor nodes in a wireless sensor network is considered from a joint source-channel coding perspective. An algorithm for designing distributed scalar quantizers for orthogonal channels is proposed and evaluated. In particular the cases of the binary symmetric channel as well as the additive white Gaussian noise channel are studied. It is demonstrated that correlation between sources can be useful in order to reduce quantization distortion as well as protecting data when being transmitted over nonideal channels. It is also demonstrated that the obtained system is robust against channel SNR mismatch.

Place, publisher, year, edition, pages
IEEE Communications Society, 2009
Keyword
Source coding, quantization, channel coding, correlation
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-8444 (URN)10.1109/TCOMM.2009.06.070482 (DOI)000266990500026 ()2-s2.0-67650675055 (ScopusID)
Note
QC 20100908. Uppdaterad från Accepted till Published (20100908)Available from: 2008-11-27 Created: 2008-11-27 Last updated: 2011-12-27Bibliographically approved
2. Low-Delay Joint Source-Channel Mappings for the Gaussian MAC
Open this publication in new window or tab >>Low-Delay Joint Source-Channel Mappings for the Gaussian MAC
2014 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 18, no 2, 249-252 p.Article in journal (Refereed) Published
Abstract [en]

The bivariate Gaussian multiterminal source coding problem with transmission over the Gaussian multiple-access channel is studied. We propose the use of low-delay joint source-channel mappings and show how performance saturation, which is unavoidable with linear transmission, can be overcome by optimizing the mappings. The optimized mappings are in general nonlinear and perform a combination of hard and soft decision signaling for the error-resilient transmission of analog data.

Keyword
Joint source-channel coding, low-delay transmission, multi-terminal source coding, Gaussian multiple-access channel, correlated sources, mean square error
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-33400 (URN)10.1109/LCOMM.2013.120413.132088 (DOI)000332199300015 ()2-s2.0-84900667700 (ScopusID)
Funder
VinnovaSwedish Research Council
Note

QC 20140404. Updated from submitted to published.

Available from: 2011-05-05 Created: 2011-05-05 Last updated: 2014-04-04Bibliographically approved
3. Lattice-based source-channel coding in wireless sensor networks
Open this publication in new window or tab >>Lattice-based source-channel coding in wireless sensor networks
2011 (English)In: IEEE International Conference on Communications (ICC), Kyoto, Japan, June 5-9, 2011, IEEE conference proceedings, 2011, 1-5 p.Conference paper (Refereed)
Abstract [en]

We consider the problem of gathering measurements in a wireless sensor network consisting of a large number of sensor nodes. A practical joint source–channel coding scheme is proposed and evaluated. The scheme uses lattices to extend apreviously proposed scheme to higher dimensions. The key ideais to use conventional point-to-point communication for a subset of the sensor nodes and side-information aware transmission for the remaining sensor nodes. The selection of sensors is based on their instantaneous channel quality. It is shown that by expanding from one to eight dimensions, a gain of about 1 dB is achievable. The overall transmission delay of the scheme is still very low and it is therefore suitable to use in delay-sensitive applications.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2011
Series
, IEEE International Conference on Communications, ISSN 1550-3607
Keyword
Decoding, Lattices, Peer to peer computing, Signal to noise ratio, Source coding, Wireless sensor networks
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-33401 (URN)10.1109/icc.2011.5962670 (DOI)000296057101091 ()2-s2.0-80052175014 (ScopusID)978-1-61284-232-5 (ISBN)
Conference
IEEE International Conference on Communications (ICC) JUN 05-09, 2011 Kyoto, JAPAN
Funder
Swedish Research Council, 621-2010-4428ICT - The Next Generation
Note
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120111Available from: 2012-01-11 Created: 2011-05-05 Last updated: 2012-06-13Bibliographically approved
4. Analog Distributed Source-Channel Coding Using Sinusoids
Open this publication in new window or tab >>Analog Distributed Source-Channel Coding Using Sinusoids
2009 (English)In: 2009 6TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS: (ISWCS 2009), NEW YORK: IEEE , 2009, 279-282 p.Conference paper (Refereed)
Abstract [en]

In a wireless sensor network, it is likely that the measurements of the sensors are correlated. Distributed source coding can be used to reduce transmission rate or mitigate the effects of the channel noise in the case of analog transmission. In this paper, we propose a novel scheme for implementing distributed source-channel coding based on analog mappings. We assume that an analog source is to be transmitted to a receiver that has access to correlated side information, as in the Wyner-Ziv problem. From the Cramer-Rao lower bound, we observe general properties of analog distributed source-channel mappings. It is especially clear how the stretch factor influences the performance. From this observation we propose two different mappings based on sinusoidal waveforms. The proposed transmission scheme is numerically evaluated and shown to perform well, particularly in the low-SNR regime. Furthermore, it requires no encoding or decoding delay, making it suitable for delay-critical applications in wireless sensor networks.

Place, publisher, year, edition, pages
NEW YORK: IEEE, 2009
National Category
Computer Science
Identifiers
urn:nbn:se:kth:diva-28943 (URN)10.1109/ISWCS.2009.5285266 (DOI)000274636700057 ()2-s2.0-71449121148 (ScopusID)978-1-4244-3583-8 (ISBN)
Conference
6th IEEE International Symposium on Wireless Communication Systems (ISWCS 09) Siena, ITALY, SEP 07-10, 2009
Note
QC 20110221Available from: 2011-02-21 Created: 2011-01-25 Last updated: 2011-05-12Bibliographically approved
5. Iterative source-channel coding approach to Witsenhausen's counterexample
Open this publication in new window or tab >>Iterative source-channel coding approach to Witsenhausen's counterexample
(English)In: Automatica, ISSN 0005-1098Article in journal (Other academic) Submitted
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-33402 (URN)
Funder
EU, FP7, Seventh Framework Programme, 223866
Note
QS 2011 QS 20120327Available from: 2011-05-05 Created: 2011-05-05 Last updated: 2012-03-27Bibliographically approved
6. Optimized low-delay source-channel-relay mappings
Open this publication in new window or tab >>Optimized low-delay source-channel-relay mappings
2010 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 58, no 5, 1397-1404 p.Article in journal (Refereed) Published
Abstract [en]

The three-node relay channel with a Gaussian source is studied for transmission subject to a low-delay constraint. A joint source-channel coding design algorithm is proposed and numerically evaluated. The designed system is compared with reference systems, based on modular source and channel coding, and the distortion-rate function for the Gaussian source using known achievable rates for the relay channel. There is a significant gain, in terms of decreased power, in using the optimized systems compared with the reference systems. The structure of the resulting source encoder and the relay mapping is visualized and discussed in order to gain understanding of fundamental properties of optimized systems. Interestingly, the design algorithm generally produces relay mappings with a structure that resembles Wyner-Ziv compression.

Place, publisher, year, edition, pages
IEEE Press, 2010
Keyword
Estimation, joint source-channel coding, relay channel, quantization, sensor networks
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-9681 (URN)10.1109/TCOMM.2010.05.080595 (DOI)000277771000013 ()2-s2.0-77952564533 (ScopusID)
Funder
EU, FP7, Seventh Framework Programme, 223866
Note
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20110207Available from: 2011-12-21 Created: 2008-11-27 Last updated: 2011-12-21Bibliographically approved
7. Design and performance of optimized relay mappings
Open this publication in new window or tab >>Design and performance of optimized relay mappings
2010 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 58, no 9, 2718-2724 p.Article in journal (Refereed) Published
Abstract [en]

We look at the three-node relay channel and the transmission of an information symbol from the source node to the destination node. We let the relay be a memoryless function and formulate necessary conditions for the optimality of the relay mapping and the detector. Based on these, we propose a design algorithm to find relay mappings such that the symbol error rate at the destination is minimized. The optimized relay mappings are illustrated for different scenarios and the dependency between the relay mapping and the link qualities is discussed in detail. Furthermore, the performance is compared with existing schemes, such as detect-and-forward, amplify-and-forward, and estimate-and-forward. It is shown that there is a significant gain in terms of decreased symbol error rate if the optimized relay mapping is used.

Keyword
Cooperative transmission, relay channel, relay mapping, modulation, detection, sensor networks.
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-9696 (URN)10.1109/TCOMM.2010.071410.080475 (DOI)000283588700027 ()2-s2.0-77956929922 (ScopusID)
Note
QC 20110207Available from: 2008-11-27 Created: 2008-11-27 Last updated: 2011-12-14Bibliographically approved
8. Closed-form sum-MSE minimization for the two-user Gaussian MIMO broadcast channel
Open this publication in new window or tab >>Closed-form sum-MSE minimization for the two-user Gaussian MIMO broadcast channel
2011 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 15, no 9, 950-952 p.Article in journal (Refereed) Published
Abstract [en]

We study the Gaussian multiple-input, multiple-output broadcast channel, where a base station with N(T) antennas transmits K independent messages to K users, each having a single receive antenna. The messages consist of independent, identically distributed Gaussian random variables and we study linear transmission with an end-to-end distortion criterion. By using an already established uplink/downlink duality and a recently discovered special relation between beamforming vectors and channel vectors, we present a closed-form expression for the optimal power allocation in the two-user case. We also outline an iterative algorithm that finds the optimal power allocation for an arbitrary number of users.

Place, publisher, year, edition, pages
IEEE, 2011
Keyword
MIMO systems, mean square error, linear transmission, power allocation
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-33403 (URN)10.1109/LCOMM.2011.070711.110571 (DOI)000294894500016 ()2-s2.0-80052836672 (ScopusID)
Funder
Swedish Research Council, 621-2010-4428ICT - The Next GenerationKnut and Alice Wallenberg FoundationICT - The Next Generation
Note
© 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists,or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. QC 20111003Available from: 2011-12-21 Created: 2011-05-05 Last updated: 2012-06-13Bibliographically approved

Open Access in DiVA

fulltext(376 kB)249 downloads
File information
File name FULLTEXT02.pdfFile size 376 kBChecksum SHA-512
841ecb7022868bbf28419f44d562a2814c47d8e7aa4ab196d936e9d8c017bd99cbd194dbd01c069a682ee01c1e61d6e0db308e12bcd8c5b8a7c90fabc7cfdded
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kron, Johannes
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 249 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1008 hits
ReferencesLink to record
Permanent link

Direct link