Energy Minimization With Network Coding via Latin Hypercubes
View / Open Files
Publication Date
2017-06Journal Title
IEEE Systems Journal
ISSN
1932-8184
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
11
Issue
2
Pages
696-705
Type
Article
This Version
AM
Metadata
Show full item recordCitation
Kocaoglu, M., & Akan, O. (2017). Energy Minimization With Network Coding via Latin Hypercubes. IEEE Systems Journal, 11 (2), 696-705. https://doi.org/10.1109/JSYST.2015.2458327
Abstract
© 2016 IEEE. Network coding is mostly used to achieve the capacity of communication networks. In this paper, motivated by the nanoscale communications where the energy cost for the channel symbols is asymmetric due to the widely employed on-off keying modulation, we design energy-minimizing network codes. We develop the best mapping between the input and output symbols at the network coding node that minimizes the average codeword energy using Latin squares, which we call the minimum energy network code (MENC). We define the class of networks composed of coding nodes with N incoming and 1 outgoing symbols as in-N networks. First, we derive the condition on the network code to minimize the average energy in in-two networks and propose two linear MENCs. Later, we investigate the MENCs for in-N networks using the Latin hypercubes and propose a low-energy network code (LENC) to reduce the average energy with network coding. We compare MENC with the classical XOR and random network codes for in-two networks. The performance comparison between LENC and random network codes for in-N networks shows that the proposed network codes provide significant energy gains.
Identifiers
External DOI: https://doi.org/10.1109/JSYST.2015.2458327
This record's URL: https://www.repository.cam.ac.uk/handle/1810/287110
Rights
Licence:
http://www.rioxx.net/licenses/all-rights-reserved
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.