Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600258
Vineeta Das, S. Dandapat, P. Bora
This paper proposes a scheme for the image super-resolution (SR) of retinal fundus images obtained from the handheld imaging devices. Clinical information in fundus images is present in the blood vessels, the optic disk, the macula and the retinal lesions. The homogeneous regions in the fundus images do not carry much relevant diagnostic information. Therefore, a patch based region selective approach for retinal image SR is proposed for providing a relatively fast and accurate SR results. The contrast sensitivity index (CSI) is applied to coarsely measure the clinical relevance of the input low resolution retinal image patch. If the clinical relevance of the input patch is above a particular threshold, then sparse representation based SR is performed else time efficient bicubic interpolation is performed for the patch. The method attains a quality performance in terms of the peak signal to noise ratio (PSNR) and the structural similarity index measure (SSIM) value.
{"title":"Region Selective Information Augmentation for Retinal Images","authors":"Vineeta Das, S. Dandapat, P. Bora","doi":"10.1109/NCC.2018.8600258","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600258","url":null,"abstract":"This paper proposes a scheme for the image super-resolution (SR) of retinal fundus images obtained from the handheld imaging devices. Clinical information in fundus images is present in the blood vessels, the optic disk, the macula and the retinal lesions. The homogeneous regions in the fundus images do not carry much relevant diagnostic information. Therefore, a patch based region selective approach for retinal image SR is proposed for providing a relatively fast and accurate SR results. The contrast sensitivity index (CSI) is applied to coarsely measure the clinical relevance of the input low resolution retinal image patch. If the clinical relevance of the input patch is above a particular threshold, then sparse representation based SR is performed else time efficient bicubic interpolation is performed for the patch. The method attains a quality performance in terms of the peak signal to noise ratio (PSNR) and the structural similarity index measure (SSIM) value.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132777878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600016
S. Singh, R. Bose, A. Joshi
To minimize energy theft attacks in Advanced Metering Infrastructure (AMI), we propose statistical distance based theft detection method. In the proposed method, different statistical distance indices (Jensen-Shannon distance, Hellinger distance, and Cumulative Distribution Function based distance) are computed using historical measurement variations between adjacent time steps. When adversary launches energy theft attacks in AMI, distance indices increases. A threshold is set to detect malicious measurement samples. We tested the performance of the proposed method under different attack scenario using real smart meter data. Test results show that the proposed method minimizes energy theft attacks efficiently.
{"title":"Minimizing Energy Theft by Statistical Distance based Theft Detector in AMI","authors":"S. Singh, R. Bose, A. Joshi","doi":"10.1109/NCC.2018.8600016","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600016","url":null,"abstract":"To minimize energy theft attacks in Advanced Metering Infrastructure (AMI), we propose statistical distance based theft detection method. In the proposed method, different statistical distance indices (Jensen-Shannon distance, Hellinger distance, and Cumulative Distribution Function based distance) are computed using historical measurement variations between adjacent time steps. When adversary launches energy theft attacks in AMI, distance indices increases. A threshold is set to detect malicious measurement samples. We tested the performance of the proposed method under different attack scenario using real smart meter data. Test results show that the proposed method minimizes energy theft attacks efficiently.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116080438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600044
Y. Hinamoto, A. Doi
In this paper, we investigate the problem of minimizing roundoff noise and pole sensitivity simultaneously subject to l2-scaling constraints for state-space digital filters. A measure for evaluating roundoff noise and pole sensitivity is introduced. An efficient iterative technique for minimizing this measure is then explored by relaxing the constraints into a single constraint on matrix trace and solving the relaxed problem with an effective matrix iteration scheme. Finally, the validity and effectiveness of the proposed technique is demonstrated by a numerical example.
{"title":"State-Space Digital Filters with Minimum Weighted Round-off Noise and Pole Sensitivity Subject to $pmb{l}_{2}$ -Scaling Constraints","authors":"Y. Hinamoto, A. Doi","doi":"10.1109/NCC.2018.8600044","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600044","url":null,"abstract":"In this paper, we investigate the problem of minimizing roundoff noise and pole sensitivity simultaneously subject to l2-scaling constraints for state-space digital filters. A measure for evaluating roundoff noise and pole sensitivity is introduced. An efficient iterative technique for minimizing this measure is then explored by relaxing the constraints into a single constraint on matrix trace and solving the relaxed problem with an effective matrix iteration scheme. Finally, the validity and effectiveness of the proposed technique is demonstrated by a numerical example.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8599982
P. K, P. V. Hunugund, Vani R.M
This paper discusses the comparative effect of Electromagnetic Band Gap (EBG) structures on two element Microstrip antenna array. The dielectric substrate used is FR-4 glass epoxy with dielectric constant 4.2 and loss tangent 0.0245. The conventional antenna array is resonating at a frequency of 5.53 GHz with a mutual coupling of -17.83 dB. The first proposed antenna array with square slot EBG structure in the ground plane and fractal patch EBG structure on the surface produces a mutual coupling of -50.21 dB and a gain of 8.78 dB at 5.53 GHz. The second proposed antenna array with star slot EBG structure in the ground plane and diamond patch EBG structure on the surface produces a mutual coupling of -51.63 dB and a gain of 7.20 dB at 5.53 GHz. Both the proposed antenna arrays are producing appreciable decrease in back lobe radiation. The antenna arrays are designed using Mentor Graphics IE3D software and measured are obtained using vector network analyzer.
{"title":"Design of Enhanced Gain Two Element Linear Microstrip Antenna Array","authors":"P. K, P. V. Hunugund, Vani R.M","doi":"10.1109/NCC.2018.8599982","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599982","url":null,"abstract":"This paper discusses the comparative effect of Electromagnetic Band Gap (EBG) structures on two element Microstrip antenna array. The dielectric substrate used is FR-4 glass epoxy with dielectric constant 4.2 and loss tangent 0.0245. The conventional antenna array is resonating at a frequency of 5.53 GHz with a mutual coupling of -17.83 dB. The first proposed antenna array with square slot EBG structure in the ground plane and fractal patch EBG structure on the surface produces a mutual coupling of -50.21 dB and a gain of 8.78 dB at 5.53 GHz. The second proposed antenna array with star slot EBG structure in the ground plane and diamond patch EBG structure on the surface produces a mutual coupling of -51.63 dB and a gain of 7.20 dB at 5.53 GHz. Both the proposed antenna arrays are producing appreciable decrease in back lobe radiation. The antenna arrays are designed using Mentor Graphics IE3D software and measured are obtained using vector network analyzer.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132530429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600233
N. Mohan, Soman K.P.
The accurate estimation of power system frequency and amplitude is essential for power system monitoring, stability, control, and protection. This work proposes a novel approach for power system frequency and amplitude estimation based on variational mode decomposition (VMD) algorithm and Cheb-function (Chebfun) approximation system. In this work, the spectral information of power signals is extracted using VMD as sub-signals or modes. Each mode is further interpolated by Chebyshev polynomials in continuous domain using Chebfun system. The instantaneous frequency and amplitude are estimated based on zero crossings and local extrema locations of the continuous function. The robustness of the approach is evaluated on various power system scenarios and the results are compared with other existing methods. The promising results suggest that the proposed approach can be used as an efficient candidate for power system frequency and amplitude estimation.
{"title":"Power System Frequency and Amplitude Estimation Using Variational Mode Decomposition and Chebfun Approximation System","authors":"N. Mohan, Soman K.P.","doi":"10.1109/NCC.2018.8600233","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600233","url":null,"abstract":"The accurate estimation of power system frequency and amplitude is essential for power system monitoring, stability, control, and protection. This work proposes a novel approach for power system frequency and amplitude estimation based on variational mode decomposition (VMD) algorithm and Cheb-function (Chebfun) approximation system. In this work, the spectral information of power signals is extracted using VMD as sub-signals or modes. Each mode is further interpolated by Chebyshev polynomials in continuous domain using Chebfun system. The instantaneous frequency and amplitude are estimated based on zero crossings and local extrema locations of the continuous function. The robustness of the approach is evaluated on various power system scenarios and the results are compared with other existing methods. The promising results suggest that the proposed approach can be used as an efficient candidate for power system frequency and amplitude estimation.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129665191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600241
Viswanathan Ramachandrar, S. R. B. Pillai, V. Prabhakaran
A joint communication and state estimation problem in a Gaussian multiple access channel with common additive state is considered. The state process is assumed to be IID Gaussian, and known non-causally at both the transmitters. The receiver not only has to decode the messages from the transmitters, but also needs to estimate the state process to within some prescribed squared error distortion. We provide a complete characterization of the optimal sum-rate versus distortion performance.
{"title":"Communication and State Estimation over a State-Dependent Gaussian Multiple-Access Channel","authors":"Viswanathan Ramachandrar, S. R. B. Pillai, V. Prabhakaran","doi":"10.1109/NCC.2018.8600241","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600241","url":null,"abstract":"A joint communication and state estimation problem in a Gaussian multiple access channel with common additive state is considered. The state process is assumed to be IID Gaussian, and known non-causally at both the transmitters. The receiver not only has to decode the messages from the transmitters, but also needs to estimate the state process to within some prescribed squared error distortion. We provide a complete characterization of the optimal sum-rate versus distortion performance.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121132825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-21DOI: 10.1109/NCC.2018.8600259
Balaji Srinivasan Babu, Ganesh Ramachandra Kini, P. V. Kumar
An erasure code is said to be a code with sequential recovery with parameters $r$ and t, if for any $s$ ≤ $t$ erased code symbols, there is an s-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most $r$ other code symbols. In this paper, we give a construction of binary codes with sequential recovery that are rate-optimal for any value of $t$ and any value $r$ ≥ 3. Our construction is based on construction of certain kind of tree-like graphs with girth $t$ + 1. We construct these graphs and hence the codes recursively.
{"title":"A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length","authors":"Balaji Srinivasan Babu, Ganesh Ramachandra Kini, P. V. Kumar","doi":"10.1109/NCC.2018.8600259","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600259","url":null,"abstract":"An erasure code is said to be a code with sequential recovery with parameters <tex>$r$</tex> and t, if for any <tex>$s$</tex> ≤ <tex>$t$</tex> erased code symbols, there is an s-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most <tex>$r$</tex> other code symbols. In this paper, we give a construction of binary codes with sequential recovery that are rate-optimal for any value of <tex>$t$</tex> and any value <tex>$r$</tex> ≥ 3. Our construction is based on construction of certain kind of tree-like graphs with girth <tex>$t$</tex> + 1. We construct these graphs and hence the codes recursively.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128049904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-10DOI: 10.1109/NCC.2018.8599965
D. Shivakrishna, V. Rameshwar, V. Lalitha, B. Sasidharan
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are $a$ local constraints in every column forming a column code, $b$ local constraints in every row forming a row code, and $h$ global constraints in an (m × n) grid of codeword. Recently, Gopalan et al. initiated the study of MRCs under grid-like topology, and derived a necessary and sufficient condition, termed as the regularity condition, for an erasure pattern to be recoverable when $a = 1, h = 0$. In this paper, we consider MRCs for product topology ($h = 0$). First, we construct a certain bipartite graph based on the erasure pattern satisfying the regularity condition for product topology (any $a, b, h = 0$) and show that there exists a complete matching in this graph. We then present an alternate direct proof of the sufficient condition when $a = 1, h = 0$. We later extend our technique to study the topology for $a = 2, h = 0$, and characterize a subset of recoverable erasure patterns in that case. For both $a = 1, 2$, our method of proof is uniform, i.e., by constructing tensor product Gcol ⊗ Growof generator matrices of column and row codes such that certain square sub-matrices retain full rank. The full-rank condition is proved by resorting to the matching identified earlier and also another set of matchings in erasure sub-patterns.
给定局部奇偶校验约束的拓扑结构，最大可恢复代码(MRC)可以纠正所有在信息理论上可纠正的擦除模式。在类似网格的拓扑结构中，每列中有$a$局部约束，形成列码;每行中有$b$局部约束，形成行码;在码字的(m × n)网格中有$h$全局约束。最近，Gopalan等人对类网格拓扑下的MRCs进行了研究，导出了当$a = 1, h = 0$时擦除模式可恢复的充分必要条件，称为正则性条件。在本文中，我们考虑产品拓扑($h = 0$)的MRCs。首先，基于满足积拓扑(任意$a, b, h = 0$)正则性条件的擦除模式构造了一个二部图，并证明了该二部图存在一个完全匹配。然后给出了a = 1, h = 0时充分条件的另一种直接证明。稍后，我们将扩展我们的技术来研究$a = 2, h = 0$的拓扑结构，并在这种情况下描述可恢复擦除模式的子集。对于两个$a = 1,2 $，我们的证明方法是一致的，即通过构造列码和行码的生成矩阵的张量积Gcol⊗grow，使得某些方子矩阵保持满秩。利用前面确定的匹配和擦除子模式中的另一组匹配证明了满秩条件。
{"title":"On Maximally Recoverable Codes for Product Topologies","authors":"D. Shivakrishna, V. Rameshwar, V. Lalitha, B. Sasidharan","doi":"10.1109/NCC.2018.8599965","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599965","url":null,"abstract":"Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are $a$ local constraints in every column forming a column code, $b$ local constraints in every row forming a row code, and $h$ global constraints in an (m × n) grid of codeword. Recently, Gopalan et al. initiated the study of MRCs under grid-like topology, and derived a necessary and sufficient condition, termed as the regularity condition, for an erasure pattern to be recoverable when $a = 1, h = 0$. In this paper, we consider MRCs for product topology ($h = 0$). First, we construct a certain bipartite graph based on the erasure pattern satisfying the regularity condition for product topology (any $a, b, h = 0$) and show that there exists a complete matching in this graph. We then present an alternate direct proof of the sufficient condition when $a = 1, h = 0$. We later extend our technique to study the topology for $a = 2, h = 0$, and characterize a subset of recoverable erasure patterns in that case. For both $a = 1, 2$, our method of proof is uniform, i.e., by constructing tensor product Gcol ⊗ Growof generator matrices of column and row codes such that certain square sub-matrices retain full rank. The full-rank condition is proved by resorting to the matching identified earlier and also another set of matchings in erasure sub-patterns.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123506047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented using a side-information graph $G$ (with number of vertices $n$ equal to the number of source symbols). The size of the maximum acyclic induced subgraph, denoted by MAI S is a lower bound on the broadcast rate. For IC problems with MAIS = n - 1 and MAI S = n - 2, prior work has shown that binary (over F 2) linear index codes achieve the MAI S lower bound for the broadcast rate and thus are optimal. In this work, we use the the duality relationship between NC and IC to show that for a class of IC problems with MAIS = n - 3, binary linear index codes achieve the MAI S lower bound on the broadcast rate. In contrast, it is known that there exists IC problems with MAIS = n - 3 and optimal broadcast rate strictly greater than MAIS.
在索引编码中，目标是尽可能有效地使用广播信道将信息从一个源传输到多个接收器，这些接收器可以在源处拥有一些信息符号作为侧信息。在这项工作中，我们提出了索引编码(IC)和多单播网络编码(NC)之间的对偶关系。众所周知，IC问题可以用边信息图$G$表示(顶点数$n$等于源符号数)。最大无环诱导子图的大小，用MAI S表示为广播速率的下界。对于MAIS = n - 1和MAIS = n - 2的IC问题，先前的工作表明，二进制(超过f2)线性索引码实现了广播速率的MAIS下界，因此是最优的。在这项工作中，我们利用NC和IC之间的对偶关系表明，对于一类MAIS = n - 3的IC问题，二进制线性索引码实现了广播速率的MAIS下界。相反，已知在MAIS = n - 3且最优广播速率严格大于MAIS时存在IC问题。
{"title":"Optimal Index Codes via a Duality between Index Coding and Network Coding","authors":"Ashok Choudhary, Vamsi Krishna Gummadi, Prasad Krishnan","doi":"10.1109/NCC.2018.8599997","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599997","url":null,"abstract":"In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented using a side-information graph $G$ (with number of vertices $n$ equal to the number of source symbols). The size of the maximum acyclic induced subgraph, denoted by MAI S is a lower bound on the broadcast rate. For IC problems with MAIS = n - 1 and MAI S = n - 2, prior work has shown that binary (over F 2) linear index codes achieve the MAI S lower bound for the broadcast rate and thus are optimal. In this work, we use the the duality relationship between NC and IC to show that for a class of IC problems with MAIS = n - 3, binary linear index codes achieve the MAI S lower bound on the broadcast rate. In contrast, it is known that there exists IC problems with MAIS = n - 3 and optimal broadcast rate strictly greater than MAIS.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-11-14DOI: 10.1109/NCC.2018.8600172
R. Vaze, Shreyas Chaudhari, Akshat Choube, Nitin Aggarwal
An energy-limited source trying to transmit multiple packets to a destination with possibly different sizes is considered. With limited energy, the source cannot potentially transmit all bits of all packets. In addition, there is a delay cost associated with each packet. Thus, the source has to choose, how many bits to transmit for each packet, and the order in which to transmit these bits, to minimize the cost of distortion (introduced by transmitting lower number of bits) and queueing plus transmission delay, across all packets. Assuming an exponential metric for distortion loss and linear delay cost, we show that the optimal order of transmission is the increasing order of packet sizes and optimization problem is jointly convex. Hence, the problem can be exactly solved using convex solvers, however, because of the complicated expression derived from the KKT conditions, no closed form solution can be found even with the simplest cost function choice made in the paper. To facilitate a more structured solution, a discretized version of the problem is also considered, where time and energy are divided in discrete amounts. In any time slot (fixed length), bits belonging to any one packet can be transmitted, while any discrete number of energy quanta can be used in any slot corresponding to any one packet, such that the total energy constraint is satisfied. The discretized problem is a special case of a multi-partitioning problem, where each packet's utility is super-modular and the proposed greedy solution is shown to incur cost that is at most 2-times of the optimal cost.
{"title":"Energy-Delay-Distortion Problem","authors":"R. Vaze, Shreyas Chaudhari, Akshat Choube, Nitin Aggarwal","doi":"10.1109/NCC.2018.8600172","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600172","url":null,"abstract":"An energy-limited source trying to transmit multiple packets to a destination with possibly different sizes is considered. With limited energy, the source cannot potentially transmit all bits of all packets. In addition, there is a delay cost associated with each packet. Thus, the source has to choose, how many bits to transmit for each packet, and the order in which to transmit these bits, to minimize the cost of distortion (introduced by transmitting lower number of bits) and queueing plus transmission delay, across all packets. Assuming an exponential metric for distortion loss and linear delay cost, we show that the optimal order of transmission is the increasing order of packet sizes and optimization problem is jointly convex. Hence, the problem can be exactly solved using convex solvers, however, because of the complicated expression derived from the KKT conditions, no closed form solution can be found even with the simplest cost function choice made in the paper. To facilitate a more structured solution, a discretized version of the problem is also considered, where time and energy are divided in discrete amounts. In any time slot (fixed length), bits belonging to any one packet can be transmitted, while any discrete number of energy quanta can be used in any slot corresponding to any one packet, such that the total energy constraint is satisfied. The discretized problem is a special case of a multi-partitioning problem, where each packet's utility is super-modular and the proposed greedy solution is shown to incur cost that is at most 2-times of the optimal cost.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130230745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：