Energy minimization of wireless sensor networks based on modulation and coding optimization under finite frame length constraint

Kei Kinoshita, H. Ochiai
{"title":"Energy minimization of wireless sensor networks based on modulation and coding optimization under finite frame length constraint","authors":"Kei Kinoshita, H. Ochiai","doi":"10.1109/MILCOM.2012.6415881","DOIUrl":null,"url":null,"abstract":"Recent hardware advances allow more signal processing functionality to be integrated into a single chip. In sensor networks, the wireless nodes are typically operated with small batteries for which their replacement, when not impossible, is very difficult and expensive. Thus, minimizing the energy consumption of transmitting sensor nodes is an important issue on the design of such communication systems. The previous work in the literature proposes modulation as well as coding optimization considering uncoded and coded bit error rate (BER) of M-ary QAM as well as its average mutual information. However, these approaches do not address the coded case with finite frame length, which is always the case in practical systems. In this paper, we consider a design of coding and modulation that minimizes the transmit circuit energy under finite codeword length constraint of capacity-approaching channel codes and analyze its performance through simulation using regular low-density parity-check (LDPC) codes in a point-to-point communication link. The results are also compared with those of information-theoretic analysis based on the mutual information rate.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"24 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2012 - 2012 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2012.6415881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Recent hardware advances allow more signal processing functionality to be integrated into a single chip. In sensor networks, the wireless nodes are typically operated with small batteries for which their replacement, when not impossible, is very difficult and expensive. Thus, minimizing the energy consumption of transmitting sensor nodes is an important issue on the design of such communication systems. The previous work in the literature proposes modulation as well as coding optimization considering uncoded and coded bit error rate (BER) of M-ary QAM as well as its average mutual information. However, these approaches do not address the coded case with finite frame length, which is always the case in practical systems. In this paper, we consider a design of coding and modulation that minimizes the transmit circuit energy under finite codeword length constraint of capacity-approaching channel codes and analyze its performance through simulation using regular low-density parity-check (LDPC) codes in a point-to-point communication link. The results are also compared with those of information-theoretic analysis based on the mutual information rate.
有限帧长约束下基于调制和编码优化的无线传感器网络能量最小化
最近的硬件进步允许更多的信号处理功能集成到单个芯片中。在传感器网络中,无线节点通常由小型电池供电,即使更换电池并非不可能,也非常困难和昂贵。因此,最小化传输传感器节点的能量消耗是这类通信系统设计的一个重要问题。先前的文献提出了考虑M-ary QAM的未编码和编码误码率(BER)及其平均互信息的调制和编码优化。然而,这些方法不能解决有限帧长度的编码情况,这在实际系统中总是存在。在本文中,我们考虑了一种编码和调制的设计,在有限码字长度约束下,最大限度地减少传输电路的能量,并通过在点对点通信链路中使用规则低密度奇偶校验(LDPC)码的仿真分析了它的性能。并与基于互信息率的信息论分析结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信