Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–39 of 39 results for author: <span class="mathjax">Nasiri-Kenari, M</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/cs" aria-role="search"> Searching in archive <strong>cs</strong>. <a href="/search/?searchtype=author&query=Nasiri-Kenari%2C+M">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Nasiri-Kenari, M"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Nasiri-Kenari%2C+M&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Nasiri-Kenari, M"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.17559">arXiv:2411.17559</a> <span> [<a href="https://arxiv.org/pdf/2411.17559">pdf</a>, <a href="https://arxiv.org/format/2411.17559">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Degrees of Freedom of Cache-Aided Interference Channels Assisted by Active Intelligent Reflecting Surfaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Changizi%2C+A">Abolfazl Changizi</a>, <a href="/search/cs?searchtype=author&query=Bafghi%2C+A+H+A">Ali H. Abdollahi Bafghi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.17559v1-abstract-short" style="display: inline;"> This paper studies cache-aided wireless networks in the presence of active intelligent reflecting surfaces (IRS) from an information-theoretic perspective. Specifically, we explore interference management in a cache-aided wireless network assisted by an active IRS, to enhance the achievable degrees of freedom (DoF). To this end, we jointly design the content placement, delivery phase, and phase sh… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.17559v1-abstract-full').style.display = 'inline'; document.getElementById('2411.17559v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.17559v1-abstract-full" style="display: none;"> This paper studies cache-aided wireless networks in the presence of active intelligent reflecting surfaces (IRS) from an information-theoretic perspective. Specifically, we explore interference management in a cache-aided wireless network assisted by an active IRS, to enhance the achievable degrees of freedom (DoF). To this end, we jointly design the content placement, delivery phase, and phase shifts of the IRS and propose a one-shot achievable scheme. Our scheme exploits transmitters' cooperation, cache contents (as side information), interference alignment, and IRS capabilities, adapting to the network's parameters. We derive the achievable one-shot sum-DoF for different sizes of cache memories, network configurations, and numbers of IRS elements. Our results highlight the potential of deploying an IRS in cache-aided wireless communication systems, underscoring the enhancement of achievable DoF for various parameter regimes, particularly when the sizes of the caches (especially at the transmitters) are inadequate. Notably, we show that access to an IRS with a sufficient number of elements enables the achievement of the maximum possible DoF for various parameter regimes of interest. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.17559v1-abstract-full').style.display = 'none'; document.getElementById('2411.17559v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2406.07352">arXiv:2406.07352</a> <span> [<a href="https://arxiv.org/pdf/2406.07352">pdf</a>, <a href="https://arxiv.org/format/2406.07352">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> </div> </div> <p class="title is-5 mathjax"> Stochastic Analysis of Homogeneous Wireless Networks Assisted by Intelligent Reflecting Surfaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bafghi%2C+A+H+A">Ali H. Abdollahi Bafghi</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Maham%2C+B">Behrouz Maham</a>, <a href="/search/cs?searchtype=author&query=Spagnolini%2C+U">Umberto Spagnolini</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2406.07352v1-abstract-short" style="display: inline;"> In this paper, we study the impact of the existence of multiple IRSs in a homogeneous wireless network, in which all BSs, users (U), and IRSs are spatially distributed by an independent homogeneous PPP, with density $位_{\rm BS}\rm{[BS/m^2]}$, $位_{\rm U}\rm{[U/m^2]}$, and $位_{\rm IRS}\rm{[IRS/m^2]}$, respectively. We utilize a uniformly random serving strategy for BS and IRS to create stochastic sy… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2406.07352v1-abstract-full').style.display = 'inline'; document.getElementById('2406.07352v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2406.07352v1-abstract-full" style="display: none;"> In this paper, we study the impact of the existence of multiple IRSs in a homogeneous wireless network, in which all BSs, users (U), and IRSs are spatially distributed by an independent homogeneous PPP, with density $位_{\rm BS}\rm{[BS/m^2]}$, $位_{\rm U}\rm{[U/m^2]}$, and $位_{\rm IRS}\rm{[IRS/m^2]}$, respectively. We utilize a uniformly random serving strategy for BS and IRS to create stochastic symmetry in the network. We analyze the performance of the network and study the effect of the existence of the IRS on the network performance. To this end, for a typical user in the system, we derive analytical upper and lower bounds on the expectation of the power (second statistical moment) of the desired signal and the interference caused by BSs and other users. After that, we obtain analytical upper bounds on the decay of the probability of the power of the desired signal and the interference for the typical user (which results in a lower bound for the cumulative distribution function (CDF)). Moreover, we derive upper bounds on the decay of the probability of the capacity of one typical user, which results in a lower bound for the outage probability. In the numerical results, we observe that the numerical calculation of the power of the desired signal and the interference is near the derived lower bounds and we show that the increment of the parameter ${(位_{\rm IRS})}$ causes increment in powers of both the desired and interference signals. We also observe that the increment of the parameter ${位_{\rm IRS}}$ causes the decrement of outage probability. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2406.07352v1-abstract-full').style.display = 'none'; document.getElementById('2406.07352v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 June, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.06268">arXiv:2401.06268</a> <span> [<a href="https://arxiv.org/pdf/2401.06268">pdf</a>, <a href="https://arxiv.org/format/2401.06268">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/OJCOMS.2024.3403850">10.1109/OJCOMS.2024.3403850 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A Novel Stochastic Model for IRS-Assisted Communication Systems Based on the Sum-Product of Nakagami-$m$ Random Variables </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Amiriara%2C+H">Hamid Amiriara</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Ashtiani%2C+F">Farid Ashtiani</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.06268v2-abstract-short" style="display: inline;"> This paper presents exact formulas for the probability distribution function (PDF) and moment generating function (MGF) of the sum-product of statistically independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ random variables (RVs) in terms of Meijer's G-function. Additionally, exact series representations are also derived for the sum of double-Nakagami RVs, providing us… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.06268v2-abstract-full').style.display = 'inline'; document.getElementById('2401.06268v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.06268v2-abstract-full" style="display: none;"> This paper presents exact formulas for the probability distribution function (PDF) and moment generating function (MGF) of the sum-product of statistically independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ random variables (RVs) in terms of Meijer's G-function. Additionally, exact series representations are also derived for the sum of double-Nakagami RVs, providing useful insights on the trade-off between accuracy and computational cost. Simple asymptotic analytical expressions are provided to gain further insight into the derived formula, and the achievable diversity order is obtained. The suggested statistical properties are proved to be a highly useful tool for modeling parallel cascaded Nakagami-$m$ fading channels. The application of these new results is illustrated by deriving exact expressions and simple tight upper bounds for the outage probability (OP) and average symbol error rate (ASER) of several binary and multilevel modulation signals in intelligent reflecting surfaces (IRSs)-assisted communication systems operating over Nakagami-$m$ fading channels. It is demonstrated that the new asymptotic expression is highly accurate and can be extended to encompass a wider range of scenarios. To validate the theoretical frameworks and formulations, Monte-Carlo simulation results are presented. Additionally, supplementary simulations are provided to compare the derived results with two common types of approximations available in the literature, namely the central limit theorem (CLT) and gamma distribution. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.06268v2-abstract-full').style.display = 'none'; document.getElementById('2401.06268v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">11 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2207.06032">arXiv:2207.06032</a> <span> [<a href="https://arxiv.org/pdf/2207.06032">pdf</a>, <a href="https://arxiv.org/format/2207.06032">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Abnormality Detection and Localization Schemes using Molecular Communication Systems: A Survey </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Etemadi%2C+A">Ali Etemadi</a>, <a href="/search/cs?searchtype=author&query=Farahnak-Ghazani%2C+M">Maryam Farahnak-Ghazani</a>, <a href="/search/cs?searchtype=author&query=Arjmandi%2C+H">Hamidreza Arjmandi</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2207.06032v2-abstract-short" style="display: inline;"> Abnormality detection and localization (ADL) have been studied widely in wireless sensor networks (WSNs) literature, where the sensors use electromagnetic waves for communication. Molecular communication (MC) has been introduced as an alternative approach for ADL in particular areas such as healthcare, being able to tackle the shortcomings of conventional WSNs, such as invasiveness, bio-incompatib… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.06032v2-abstract-full').style.display = 'inline'; document.getElementById('2207.06032v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.06032v2-abstract-full" style="display: none;"> Abnormality detection and localization (ADL) have been studied widely in wireless sensor networks (WSNs) literature, where the sensors use electromagnetic waves for communication. Molecular communication (MC) has been introduced as an alternative approach for ADL in particular areas such as healthcare, being able to tackle the shortcomings of conventional WSNs, such as invasiveness, bio-incompatibility, and high energy consumption. In this paper, we introduce a general framework for MC-based ADL, which consists of multiple tiers for sensing the abnormality and communication between different agents, including the sensors, the fusion center (FC), the gateway (GW), and the external node (e.g., a local cloud), and describe each tier and the agents in this framework. We classify and explain different abnormality recognition methods, the functional units of the sensors, and different sensor features. Further, we describe different types of interfaces required for converting the internal and external signals at the FC and GW. Moreover, we present a unified channel model for the sensing and communication links. We categorize the MC-based abnormality detection schemes based on the sensor mobility, cooperative detection, and cooperative sensing/activation. We also classify the localization approaches based on the sensor mobility and propulsion mechanisms and present a general framework for the externally-controllable localization systems. Finally, we present some challenges and future research directions to realize and develop MC-based systems for ADL. The important challenges in the MC-based systems lie in four main directions as implementation, system design, modeling, and methods, which need considerable attention from multidisciplinary perspectives. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.06032v2-abstract-full').style.display = 'none'; document.getElementById('2207.06032v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 13 July, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">*Ali Etemadi and Maryam Farahnak-Ghazani are co-first authors</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2109.09624">arXiv:2109.09624</a> <span> [<a href="https://arxiv.org/pdf/2109.09624">pdf</a>, <a href="https://arxiv.org/format/2109.09624">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On Achievable Degrees of Freedom for the Frequency-Selective K-User Interference Channel in the Presence of an Instantaneous Relay </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bafghi%2C+A+H+A">Ali H. Abdollahi Bafghi</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2109.09624v1-abstract-short" style="display: inline;"> In this paper, we study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on the IR antennas' cooperation ability. First, we assume that the IR receive and transmit antennas can coordinate with each other, where the transmitted signal of e… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.09624v1-abstract-full').style.display = 'inline'; document.getElementById('2109.09624v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2109.09624v1-abstract-full" style="display: none;"> In this paper, we study the degrees of freedom (DoF) of the frequency-selective K-user interference channel in the presence of an instantaneous relay (IR) with multiple receive and transmit antennas. We investigate two scenarios based on the IR antennas' cooperation ability. First, we assume that the IR receive and transmit antennas can coordinate with each other, where the transmitted signal of each transmit antenna can depend on the received signals of all receive antennas, and we derive an achievable DoF for this model. In our interference alignment scheme, we divide receivers into two groups, called clean and dirty receivers. We design our scheme such that a part of the message of clean receivers can be demultiplexed at the IR. Thus, the IR can use these message streams for interference cancelation at the clean receivers. Next, we consider an IR, whose antennas do not have coordination with each other, where the transmitted signal of each transmit antenna only depends on the received signal of its corresponding receive antenna, and we derive an achievable DoF for it. We show that the achievable DoF decreases considerably compared with the coordinated case. In both of these models, our schemes achieve the maximum K DoFs, if the number of transmit and receive antennas is more than a finite threshold. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.09624v1-abstract-full').style.display = 'none'; document.getElementById('2109.09624v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 September, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to IEEE Transactions on Information Theory</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2101.10745">arXiv:2101.10745</a> <span> [<a href="https://arxiv.org/pdf/2101.10745">pdf</a>, <a href="https://arxiv.org/format/2101.10745">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Interference Alignment Using Reaction in Molecular Interference Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Farahnak-Ghazani%2C+M">Maryam Farahnak-Ghazani</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2101.10745v2-abstract-short" style="display: inline;"> Co-channel interference (CCI) is a performance limiting factor in molecular communication (MC) systems with shared medium. Interference alignment (IA) is a promising scheme to mitigate CCI in traditional communication systems. Due to the signal-dependent noise in MC systems, the traditional IA schemes are less useful in MC systems. In this paper, we propose a novel IA scheme in molecular interfere… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.10745v2-abstract-full').style.display = 'inline'; document.getElementById('2101.10745v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2101.10745v2-abstract-full" style="display: none;"> Co-channel interference (CCI) is a performance limiting factor in molecular communication (MC) systems with shared medium. Interference alignment (IA) is a promising scheme to mitigate CCI in traditional communication systems. Due to the signal-dependent noise in MC systems, the traditional IA schemes are less useful in MC systems. In this paper, we propose a novel IA scheme in molecular interference channels (IFCs), based on the choice of releasing/sampling times. To cancel the aligned interference signals and reduce the signal dependent noise, we use molecular reaction in the proposed IA scheme. We obtain the feasible region for the releasing/sampling times in the proposed scheme. Further, we investigate the error performance of the proposed scheme. Our results show that the proposed IA scheme using reaction improves the performance significantly.\blfootnote{This work was supported in part by the Iran National Science Foundation (INSF) Research Grant on Nano-Network Communications and in part by the Research Center of Sharif University of Technology. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.10745v2-abstract-full').style.display = 'none'; document.getElementById('2101.10745v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 26 January, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2101.02869">arXiv:2101.02869</a> <span> [<a href="https://arxiv.org/pdf/2101.02869">pdf</a>, <a href="https://arxiv.org/format/2101.02869">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Towards High Data-Rate Diffusive Molecular Communications: Performance Enhancement Strategies </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Gursoy%2C+M+C">Mustafa Can Gursoy</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Mitra%2C+U">Urbashi Mitra</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2101.02869v1-abstract-short" style="display: inline;"> Diffusive molecular communications (DiMC) have recently gained attention as a candidate for nano- to micro- and macro-scale communications due to its simplicity and energy efficiency. As signal propagation is solely enabled by Brownian motion mechanics, DiMC faces severe inter-symbol interference (ISI), which limits reliable and high data-rate communications. Herein, recent literature on DiMC perf… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.02869v1-abstract-full').style.display = 'inline'; document.getElementById('2101.02869v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2101.02869v1-abstract-full" style="display: none;"> Diffusive molecular communications (DiMC) have recently gained attention as a candidate for nano- to micro- and macro-scale communications due to its simplicity and energy efficiency. As signal propagation is solely enabled by Brownian motion mechanics, DiMC faces severe inter-symbol interference (ISI), which limits reliable and high data-rate communications. Herein, recent literature on DiMC performance enhancement strategies is surveyed; key research directions are identified. Signaling design and associated design constraints are presented. Classical and novel transceiver designs are reviewed with an emphasis on methods for ISI mitigation and performance-complexity tradeoffs. Key parameter estimation strategies such as synchronization and channel estimation are considered in conjunction with asynchronous and timing error robust receiver methods. Finally, source and channel coding in the context of DiMC is presented. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.02869v1-abstract-full').style.display = 'none'; document.getElementById('2101.02869v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 January, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">19 pages, 15 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2012.13787">arXiv:2012.13787</a> <span> [<a href="https://arxiv.org/pdf/2012.13787">pdf</a>, <a href="https://arxiv.org/format/2012.13787">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Degrees of Freedom of the $K$-User Interference Channel in the Presence of Intelligent Reflecting Surfaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bafghi%2C+A+H+A">Ali H. Abdollahi Bafghi</a>, <a href="/search/cs?searchtype=author&query=Jamali%2C+V">Vahid Jamali</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Schober%2C+R">Robert Schober</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2012.13787v4-abstract-short" style="display: inline;"> In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$-user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider four types of IRSs, namely 1) active IRSs, which are able to amplify, attenuate, and add a phase shift to the received signal, 2) passive IRSs, which are able to attenuate and add a phase shift to the rece… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.13787v4-abstract-full').style.display = 'inline'; document.getElementById('2012.13787v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2012.13787v4-abstract-full" style="display: none;"> In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$-user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider four types of IRSs, namely 1) active IRSs, which are able to amplify, attenuate, and add a phase shift to the received signal, 2) passive IRSs, which are able to attenuate and add a phase shift to the received signal, 3) passive lossless IRSs, which are only able to add a phase shift to the received signal, and 4) $\varepsilon$-relaxed passive lossless IRSs, which are able to scale the received signal by a number between $1-\varepsilon$ and $1$ in addition to adding a phase shift. We derive inner and outer bounds for the DoF region and lower and upper bounds for the sum DoF of the $K$-user interference channel in the presence of an active IRS and prove that the maximum value $K$ for the sum DoF can be achieved if the number of IRS elements exceeds a certain finite value. Then, we introduce probabilistic inner and outer bounds for the DoF region and probabilistic lower and upper bounds for the sum DoF of the $K$-user interference channel in the presence of a passive IRS and prove that the lower bound for the sum DoF asymptotically approaches $K$ as the number of IRS elements grows large. For the DoF analysis of passive lossless IRSs, first, we approximate it by the $\varepsilon$-relaxed passive lossless IRS and introduce a probabilistic lower bound for the corresponding sum DoF. We prove that this bound asymptotically tends to $K$. In addition, we define a relaxed type of DoF called $蟻$-limited DoF. We introduce a lower bound for the $蟻$-limited sum DoF of the passive lossless IRS-assisted $K$-user interference channel and prove that this lower bound asymptotically also tends to $K$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.13787v4-abstract-full').style.display = 'none'; document.getElementById('2012.13787v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 26 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2007.02360">arXiv:2007.02360</a> <span> [<a href="https://arxiv.org/pdf/2007.02360">pdf</a>, <a href="https://arxiv.org/format/2007.02360">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TMBMC.2020.3044772">10.1109/TMBMC.2020.3044772 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> On Molecular Flow Velocity Meters </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Farahnak-Ghazani%2C+M">Maryam Farahnak-Ghazani</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2007.02360v2-abstract-short" style="display: inline;"> Flow velocity is an important characteristic of the fluidic mediums. In this paper, we introduce a molecular based flow velocity meter consisting of a molecule releasing node and a receiver that counts these molecules. We consider both flow velocity detection and estimation problems, which are employed in different applications. For the flow velocity detection, we obtain the maximum a posteriori (… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.02360v2-abstract-full').style.display = 'inline'; document.getElementById('2007.02360v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2007.02360v2-abstract-full" style="display: none;"> Flow velocity is an important characteristic of the fluidic mediums. In this paper, we introduce a molecular based flow velocity meter consisting of a molecule releasing node and a receiver that counts these molecules. We consider both flow velocity detection and estimation problems, which are employed in different applications. For the flow velocity detection, we obtain the maximum a posteriori (MAP) decision rule. To analyze the performance of the proposed flow velocity detector, we obtain the error probability, its Gaussian approximation and Chernoff information (CI) upper bound, and investigate the optimum and sub-optimum sampling times accordingly. We show that, for binary hypothesis, the sub-optimum sampling times using CI upper bound are the same. Further, the sub-optimum sampling times are close to the optimum sampling times. For the flow velocity estimation, we obtain the MAP and minimum mean square error (MMSE) estimators. We consider the mean square error (MSE) to investigate the error performance of the flow velocity estimators and obtain the Bayesian Cramer-Rao (BCR) and expected Cramer-Rao (ECR) lower bounds. Further, we obtain the optimum sampling times for each estimator. It is seen that the optimum sampling times for each estimator are nearly the same. The proposed flow velocity meter can be used to design a new modulation technique in molecular communication (MC), where information is encoded in the flow velocity of the medium instead of the concentration, type, or release time of the molecules. The setup and performance analysis of the proposed flow velocity detector and estimator for molecular communication system need further investigation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.02360v2-abstract-full').style.display = 'none'; document.getElementById('2007.02360v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 January, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 July, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">To be published in the IEEE Transactions on Molecular, Biological, and Multi-Scale Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.13398">arXiv:2006.13398</a> <span> [<a href="https://arxiv.org/pdf/2006.13398">pdf</a>, <a href="https://arxiv.org/format/2006.13398">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On the Capacity of the Joint Time and Concentration Modulation for Molecular Communications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mirkarimi%2C+F">Farhad Mirkarimi</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2006.13398v1-abstract-short" style="display: inline;"> Most diffusion based molecular channels suffer from low information capacity due to the structure of the diffusion environment. To address this issue, this paper studies the capacity of the diffusion based molecular communication by exploiting both time and concentration level of the released molecules for information transfer. The transmitter releases molecules in one of the sub-intervals with a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.13398v1-abstract-full').style.display = 'inline'; document.getElementById('2006.13398v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.13398v1-abstract-full" style="display: none;"> Most diffusion based molecular channels suffer from low information capacity due to the structure of the diffusion environment. To address this issue, this paper studies the capacity of the diffusion based molecular communication by exploiting both time and concentration level of the released molecules for information transfer. The transmitter releases molecules in one of the sub-intervals with a level of concentration both determined by input data, hereby applying joint time and concentration (JTAC) modulation. The observation time, at the receiver, which is equal to symbol period, is divided to some sub-intervals, not necessarily equal to the number of sub-intervals in the transmitter, and the number of received molecules in each sub-interval is counted. We propose three practical schemes, depending on how the receiver uses the number of molecules counted in the sub-intervals and find the lower bound on capacity in each case. Moreover, the symmetric Kullback-Liebler (KL) divergence metric is used to obtain a computable upper bound on the JTAC channel capacity. Finally, the Blahut-Arimoto algorithm is used to compute the capacity numerically, and to determine how tight the derived bounds are. Our numerical results indicate that our bounds are tight especially in environments with high diffusion coefficient. The improvements compared to the conventional concentration based modulation and timing based modulation are also demonstrated. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.13398v1-abstract-full').style.display = 'none'; document.getElementById('2006.13398v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2005.14296">arXiv:2005.14296</a> <span> [<a href="https://arxiv.org/pdf/2005.14296">pdf</a>, <a href="https://arxiv.org/format/2005.14296">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> An Analytical Model for Molecular Communication over a Non-linear Reaction-Diffusion Medium </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Abin%2C+H">Hamidreza Abin</a>, <a href="/search/cs?searchtype=author&query=Gohari%2C+A">Amin Gohari</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2005.14296v3-abstract-short" style="display: inline;"> One of the main challenges in diffusion-based molecular communication is dealing with the non-linearity of reaction-diffusion chemical equations. While numerical methods can be used to solve these equations, a change in the input signals or the parameters of the medium requires one to redo the simulations. This makes it difficult to design modulation schemes and practically impossible to prove the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.14296v3-abstract-full').style.display = 'inline'; document.getElementById('2005.14296v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2005.14296v3-abstract-full" style="display: none;"> One of the main challenges in diffusion-based molecular communication is dealing with the non-linearity of reaction-diffusion chemical equations. While numerical methods can be used to solve these equations, a change in the input signals or the parameters of the medium requires one to redo the simulations. This makes it difficult to design modulation schemes and practically impossible to prove the optimality of a given transmission strategy. In this paper, we provide an analytical technique for modeling the non-linearity of chemical reaction equations based on the perturbation method. The perturbation method expresses the solution in terms of an infinite power series. An approximate solution can be found by keeping the leading terms of the power series. The approximate solution is shown to track the true solution if either the simulation time interval or the reaction rate is sufficiently small. Approximate solutions for long time intervals are also discussed. An illustrative example is given. For this example, it is shown that when the reaction rate (or the total time interval) is low, instead of using a continuous release waveform, it is optimal for the transmitters to release molecules at two time instances. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.14296v3-abstract-full').style.display = 'none'; document.getElementById('2005.14296v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 28 May, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.08934">arXiv:1907.08934</a> <span> [<a href="https://arxiv.org/pdf/1907.08934">pdf</a>, <a href="https://arxiv.org/format/1907.08934">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Emerging Technologies">cs.ET</span> </div> </div> <p class="title is-5 mathjax"> Adaptive Release Duration Modulation for Limited Molecule Production and Storage </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Khaloopour%2C+L">Ladan Khaloopour</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.08934v1-abstract-short" style="display: inline;"> The nature of molecular transmitter imposes some limitations on the molecule production process and its storage. As the molecules act the role of the information carriers, the limitations affect the transmission process and the system performance considerably. In this paper, we focus on the transmitter's limitations, in particular, the limited molecule production rate and the finite storage capaci… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.08934v1-abstract-full').style.display = 'inline'; document.getElementById('1907.08934v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.08934v1-abstract-full" style="display: none;"> The nature of molecular transmitter imposes some limitations on the molecule production process and its storage. As the molecules act the role of the information carriers, the limitations affect the transmission process and the system performance considerably. In this paper, we focus on the transmitter's limitations, in particular, the limited molecule production rate and the finite storage capacity. We consider a time-slotted communication where the transmitter opens its outlets and releases the stored molecules for a specific time duration to send bit "1" and remains silent to send bit "0". By changing the release duration, we propose an adaptive release duration modulation. The objective is to find the optimal transmission release duration to minimize the probability of error. We characterize the properties of the optimal release duration and use it to derive upper and lower bounds on the system performance. We see that the proposed modulation scheme improves the performance. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.08934v1-abstract-full').style.display = 'none'; document.getElementById('1907.08934v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1905.01708">arXiv:1905.01708</a> <span> [<a href="https://arxiv.org/pdf/1905.01708">pdf</a>, <a href="https://arxiv.org/format/1905.01708">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Stochastic Design and Analysis of Wireless Cloud Caching Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Debbah%2C+M">Merouane Debbah</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1905.01708v1-abstract-short" style="display: inline;"> This paper develops a stochastic geometry-based approach for the modeling, analysis, and optimization of wireless cloud caching networks comprised of multiple-antenna radio units (RUs) inside clouds. We consider the Matern cluster process to model RUs and the probabilistic content placement to cache files in RUs. Accordingly, we study the exact hit probability for a user of interest for two strate… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1905.01708v1-abstract-full').style.display = 'inline'; document.getElementById('1905.01708v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1905.01708v1-abstract-full" style="display: none;"> This paper develops a stochastic geometry-based approach for the modeling, analysis, and optimization of wireless cloud caching networks comprised of multiple-antenna radio units (RUs) inside clouds. We consider the Matern cluster process to model RUs and the probabilistic content placement to cache files in RUs. Accordingly, we study the exact hit probability for a user of interest for two strategies; closest selection, where the user is served by the closest RU that has its requested file, and best selection, where the serving RU having the requested file provides the maximum instantaneous received power at the user. As key steps for the analyses, the Laplace transform of out of cloud interference, the desired link distance distribution in the closest selection, and the desired link received power distribution in the best selection are derived. Also, we approximate the derived exact hit probabilities for both the closest and the best selections in such a way that the related objective functions for the content caching design of the network can lead to tractable concave optimization problems. Solving the optimization problems, we propose algorithms to efficiently find their optimal content placements. Finally, we investigate the impact of different parameters such as the number of antennas and the cache memory size on the caching performance. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1905.01708v1-abstract-full').style.display = 'none'; document.getElementById('1905.01708v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 May, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1807.10490">arXiv:1807.10490</a> <span> [<a href="https://arxiv.org/pdf/1807.10490">pdf</a>, <a href="https://arxiv.org/ps/1807.10490">ps</a>, <a href="https://arxiv.org/format/1807.10490">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Stochastic Geometry Modeling and Analysis of Finite Millimeter Wave Wireless Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1807.10490v1-abstract-short" style="display: inline;"> This paper develops a stochastic geometry-based approach for the modeling and analysis of finite millimeter wave (mmWave) wireless networks where a random number of transmitters and receivers are randomly located inside a finite region. We consider a selection strategy to serve a reference receiver by the transmitter providing the maximum average received power among all transmitters. Considering… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.10490v1-abstract-full').style.display = 'inline'; document.getElementById('1807.10490v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1807.10490v1-abstract-full" style="display: none;"> This paper develops a stochastic geometry-based approach for the modeling and analysis of finite millimeter wave (mmWave) wireless networks where a random number of transmitters and receivers are randomly located inside a finite region. We consider a selection strategy to serve a reference receiver by the transmitter providing the maximum average received power among all transmitters. Considering the unique features of mmWave communications such as directional transmit and receive beamforming and having different channels for line-of-sight (LOS) and non-line-of-sight (NLOS) links according to the blockage process, we study the coverage probability and the ergodic rate for the reference receiver that can be located everywhere inside the network region. As key steps for the analyses, the distribution of the distance from the reference receiver to its serving LOS or NLOS transmitter and LOS and NLOS association probabilities are derived. We also derive the Laplace transform of the interferences from LOS and NLOS transmitters. Finally, we propose upper and lower bounds on the coverage probability that can be evaluated easier than the exact results, and investigate the impact of different parameters including the receiver location, the beamwidth, and the blockage process exponent on the system performance. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.10490v1-abstract-full').style.display = 'none'; document.getElementById('1807.10490v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 July, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1806.02953">arXiv:1806.02953</a> <span> [<a href="https://arxiv.org/pdf/1806.02953">pdf</a>, <a href="https://arxiv.org/format/1806.02953">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Asynchronous Downlink Massive MIMO Networks: A Stochastic Geometry Approach </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sadeghabadi%2C+E">Elahe Sadeghabadi</a>, <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1806.02953v1-abstract-short" style="display: inline;"> Massive multiple-input multiple-output (MIMO) is recognized as a promising technology for the next generation of wireless networks because of its potential to increase the spectral efficiency. In initial studies of massive MIMO, the system has been considered to be perfectly synchronized throughout the entire cells. However, perfect synchronization may be hard to attain in practice. Therefore, we… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1806.02953v1-abstract-full').style.display = 'inline'; document.getElementById('1806.02953v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1806.02953v1-abstract-full" style="display: none;"> Massive multiple-input multiple-output (MIMO) is recognized as a promising technology for the next generation of wireless networks because of its potential to increase the spectral efficiency. In initial studies of massive MIMO, the system has been considered to be perfectly synchronized throughout the entire cells. However, perfect synchronization may be hard to attain in practice. Therefore, we study a massive MIMO system whose cells are not synchronous to each other, while transmissions in a cell are still synchronous. We analyze an asynchronous downlink massive MIMO system in terms of the coverage probability and the ergodic rate by means of the stochastic geometry tool. For comparison, we also obtain the results for the synchronous systems. In addition, we investigate the effect of the uplink power control and the number of pilot symbols on the downlink ergodic rate, and we observe that there is an optimal value for the number of pilot symbols maximizing the downlink ergodic rate of a cell. Our results also indicate that, compared to the cases with synchronous transmission, the downlink ergodic rate is more sensitive to the uplink power control in the asynchronous mode. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1806.02953v1-abstract-full').style.display = 'none'; document.getElementById('1806.02953v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 June, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1805.08777">arXiv:1805.08777</a> <span> [<a href="https://arxiv.org/pdf/1805.08777">pdf</a>, <a href="https://arxiv.org/ps/1805.08777">ps</a>, <a href="https://arxiv.org/format/1805.08777">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Early Cancer Detection in Blood Vessels Using Mobile Nanosensors </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mosayebi%2C+R">Reza Mosayebi</a>, <a href="/search/cs?searchtype=author&query=Ahmadzadeh%2C+A">Arman Ahmadzadeh</a>, <a href="/search/cs?searchtype=author&query=Wicke%2C+W">Wayan Wicke</a>, <a href="/search/cs?searchtype=author&query=Jamali%2C+V">Vahid Jamali</a>, <a href="/search/cs?searchtype=author&query=Schober%2C+R">Robert Schober</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1805.08777v1-abstract-short" style="display: inline;"> In this paper, we propose using mobile nanosensors (MNSs) for early stage anomaly detection. For concreteness, we focus on the detection of cancer cells located in a particular region of a blood vessel. These cancer cells produce and emit special molecules, so-called biomarkers, which are symptomatic for the presence of anomaly, into the cardiovascular system. Detection of cancer biomarkers with c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.08777v1-abstract-full').style.display = 'inline'; document.getElementById('1805.08777v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1805.08777v1-abstract-full" style="display: none;"> In this paper, we propose using mobile nanosensors (MNSs) for early stage anomaly detection. For concreteness, we focus on the detection of cancer cells located in a particular region of a blood vessel. These cancer cells produce and emit special molecules, so-called biomarkers, which are symptomatic for the presence of anomaly, into the cardiovascular system. Detection of cancer biomarkers with conventional blood tests is difficult in the early stages of a cancer due to the very low concentration of the biomarkers in the samples taken. However, close to the cancer cells, the concentration of the cancer biomarkers is high. Hence, detection is possible if a sensor with the ability to detect these biomarkers is placed in the vicinity of the cancer cells. Therefore, in this paper, we study the use of MNSs that are injected at a suitable injection site and can move through the blood vessels of the cardiovascular system, which potentially contain cancer cells. These MNSs can be activated by the biomarkers close to the cancer cells, where the biomarker concentration is sufficiently high. Eventually, the MNSs are collected by a fusion center (FC) where their activation levels are read and exploited to declare the presence of anomaly. We analytically derive the biomarker concentration as well as the probability mass function of the MNSs' activation levels and validate the obtained results via particle-based simulations. Then, we derive the optimal decision rule for the FC regarding the presence of anomaly assuming that the entire network is known at the FC. Finally, for the FC, we propose a simple sum detector that does not require knowledge of the network topology. Our simulations reveal that while the optimal detector achieves a higher performance than the sum detector, both proposed detectors significantly outperform a benchmark scheme that used fixed nanosensors at the FC. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.08777v1-abstract-full').style.display = 'none'; document.getElementById('1805.08777v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1805.01514">arXiv:1805.01514</a> <span> [<a href="https://arxiv.org/pdf/1805.01514">pdf</a>, <a href="https://arxiv.org/ps/1805.01514">ps</a>, <a href="https://arxiv.org/format/1805.01514">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Emerging Technologies">cs.ET</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Advanced Target Detection via Molecular Communication </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mosayebi%2C+R">Reza Mosayebi</a>, <a href="/search/cs?searchtype=author&query=Wicke%2C+W">Wayan Wicke</a>, <a href="/search/cs?searchtype=author&query=Jamali%2C+V">Vahid Jamali</a>, <a href="/search/cs?searchtype=author&query=Ahmadzadeh%2C+A">Arman Ahmadzadeh</a>, <a href="/search/cs?searchtype=author&query=Schober%2C+R">Robert Schober</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1805.01514v1-abstract-short" style="display: inline;"> In this paper, we consider target detection in suspicious tissue via diffusive molecular communications (MCs). If a target is present, it continuously and with a constant rate secretes molecules of a specific type, so-called biomarkers, into the medium, which are symptomatic for the presence of the target. Detection of these biomarkers is challenging since due to the diffusion and degradation, the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.01514v1-abstract-full').style.display = 'inline'; document.getElementById('1805.01514v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1805.01514v1-abstract-full" style="display: none;"> In this paper, we consider target detection in suspicious tissue via diffusive molecular communications (MCs). If a target is present, it continuously and with a constant rate secretes molecules of a specific type, so-called biomarkers, into the medium, which are symptomatic for the presence of the target. Detection of these biomarkers is challenging since due to the diffusion and degradation, the biomarkers are only detectable in the vicinity of the target. In addition, the exact location of the target within the tissue is not known. In this paper, we propose to distribute several reactive nanosensors (NSs) across the tissue such that at least some of them are expected to come in contact with biomarkers, which cause them to become activated. Upon activation, an NS releases a certain number of molecules of a secondary type into the medium to alert a fusion center (FC), where the final decision regarding the presence of the target is made. In particular, we consider a composite hypothesis testing framework where it is assumed that the location of the target and the biomarker secretion rate are unknown, whereas the locations of the NSs are known. We derive the uniformly most powerful (UMP) test for the detection at the NSs. For the final decision at the FC, we show that the UMP test does not exist. Hence, we derive a genie-aided detector as an upper bound on performance. We then propose two sub-optimal detectors and evaluate their performance via simulations <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.01514v1-abstract-full').style.display = 'none'; document.getElementById('1805.01514v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1802.08965">arXiv:1802.08965</a> <span> [<a href="https://arxiv.org/pdf/1802.08965">pdf</a>, <a href="https://arxiv.org/ps/1802.08965">ps</a>, <a href="https://arxiv.org/format/1802.08965">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Diffusion Based Molecular Communication with Limited Molecule Production Rate </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bafghi%2C+H+G">Hamid G. Bafghi</a>, <a href="/search/cs?searchtype=author&query=Gohari%2C+A">Amin Gohari</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1802.08965v1-abstract-short" style="display: inline;"> This paper studies the impact of a transmitter's molecule generation process on the capacity of a concentration based Molecular Communication (MC) system. Constraints caused by the molecule generation process affect the availability of the molecules at the transmitter. The transmitter has a storage of molecules, and should decide whether to release or save the currently produced molecules. As a re… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1802.08965v1-abstract-full').style.display = 'inline'; document.getElementById('1802.08965v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1802.08965v1-abstract-full" style="display: none;"> This paper studies the impact of a transmitter's molecule generation process on the capacity of a concentration based Molecular Communication (MC) system. Constraints caused by the molecule generation process affect the availability of the molecules at the transmitter. The transmitter has a storage of molecules, and should decide whether to release or save the currently produced molecules. As a result, the MC system has conceptual connections with energy harvesting systems. In this paper, we consider two scenarios on the propagation channel. The first scenario assumes a channel with no Inter-symbol Interference (ISI), \emph{i.e.,} a memoryless channel. We derive bounds on the capacity of the MC system in this scenario. The second scenario assumes the MC network with ISI, in which the output of the channel depends on the history of released molecules in the previous time-slots. Based on the assumptions that either the transmitter or the receiver knows the channel statistics, we compute a lower bound on the channel capacity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1802.08965v1-abstract-full').style.display = 'none'; document.getElementById('1802.08965v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 February, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1712.08784">arXiv:1712.08784</a> <span> [<a href="https://arxiv.org/pdf/1712.08784">pdf</a>, <a href="https://arxiv.org/format/1712.08784">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Stochastic Geometry Modeling and Analysis of Single- and Multi-Cluster Wireless Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Haenggi%2C+M">Martin Haenggi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1712.08784v1-abstract-short" style="display: inline;"> This paper develops a stochastic geometry-based approach for the modeling and analysis of single- and multi-cluster wireless networks. We first define finite homogeneous Poisson point processes to model the number and locations of the transmitters in a confined region as a single-cluster wireless network. We study the coverage probability for a reference receiver for two strategies; closest-select… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1712.08784v1-abstract-full').style.display = 'inline'; document.getElementById('1712.08784v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1712.08784v1-abstract-full" style="display: none;"> This paper develops a stochastic geometry-based approach for the modeling and analysis of single- and multi-cluster wireless networks. We first define finite homogeneous Poisson point processes to model the number and locations of the transmitters in a confined region as a single-cluster wireless network. We study the coverage probability for a reference receiver for two strategies; closest-selection, where the receiver is served by the closest transmitter among all transmitters, and uniform-selection, where the serving transmitter is selected randomly with uniform distribution. Second, using Matern cluster processes, we extend our model and analysis to multi-cluster wireless networks. Here, the receivers are modeled in two types, namely, closed- and open-access. Closed-access receivers are distributed around the cluster centers of the transmitters according to a symmetric normal distribution and can be served only by the transmitters of their corresponding clusters. Open-access receivers, on the other hand, are placed independently of the transmitters and can be served by all transmitters. In all cases, the link distance distribution and the Laplace transform (LT) of the interference are derived. We also derive closed-form lower bounds on the LT of the interference for single-cluster wireless networks. The impact of different parameters on the performance is also investigated. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1712.08784v1-abstract-full').style.display = 'none'; document.getElementById('1712.08784v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 December, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1707.09735">arXiv:1707.09735</a> <span> [<a href="https://arxiv.org/pdf/1707.09735">pdf</a>, <a href="https://arxiv.org/ps/1707.09735">ps</a>, <a href="https://arxiv.org/format/1707.09735">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/LWC.2017.2736539">10.1109/LWC.2017.2736539 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Haghifam%2C+M">Mahdi Haghifam</a>, <a href="/search/cs?searchtype=author&query=Mili%2C+M+R">Mohammad Robat Mili</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1707.09735v2-abstract-short" style="display: inline;"> We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. Moreover, we develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1707.09735v2-abstract-full').style.display = 'inline'; document.getElementById('1707.09735v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1707.09735v2-abstract-full" style="display: none;"> We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. Moreover, we develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the network sum rate and minimize the maximum users' error probability and to evaluate the effect of the codewords length on the system performance. The results show that, in delay-constrained scenarios, optimizing the per-user error probability plays a key role in achieving high throughput. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1707.09735v2-abstract-full').style.display = 'none'; document.getElementById('1707.09735v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 August, 2017; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 31 July, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted for publication in IEEE Wireless Communications Letters</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Wireless Communications Letters ( Volume: 6, Issue: 6, Dec. 2017 ) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1703.10084">arXiv:1703.10084</a> <span> [<a href="https://arxiv.org/pdf/1703.10084">pdf</a>, <a href="https://arxiv.org/ps/1703.10084">ps</a>, <a href="https://arxiv.org/format/1703.10084">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Cooperative Abnormality Detection via Diffusive Molecular Communications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mosayebi%2C+R">Reza Mosayebi</a>, <a href="/search/cs?searchtype=author&query=Jamali%2C+V">Vahid Jamali</a>, <a href="/search/cs?searchtype=author&query=Ghoroghchian%2C+N">Nafiseh Ghoroghchian</a>, <a href="/search/cs?searchtype=author&query=Schober%2C+R">Robert Schober</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Mehrabi%2C+M">Mahdieh Mehrabi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1703.10084v1-abstract-short" style="display: inline;"> In this paper, we consider abnormality detection via diffusive molecular communications (MCs) for a network consisting of several sensors and a fusion center (FC). If a sensor detects an abnormality, it injects into the medium a number of molecules which is proportional to the sensed value. Two transmission schemes for releasing molecules into the medium are considered. In the first scheme, referr… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1703.10084v1-abstract-full').style.display = 'inline'; document.getElementById('1703.10084v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1703.10084v1-abstract-full" style="display: none;"> In this paper, we consider abnormality detection via diffusive molecular communications (MCs) for a network consisting of several sensors and a fusion center (FC). If a sensor detects an abnormality, it injects into the medium a number of molecules which is proportional to the sensed value. Two transmission schemes for releasing molecules into the medium are considered. In the first scheme, referred to as DTM, each sensor releases a different type of molecule, whereas in the second scheme, referred to as STM, all sensors release the same type of molecule. The molecules released by the sensors propagate through the MC channel and some may reach the FC where the final decision regarding whether or not an abnormality has occurred is made. We derive the optimal decision rules for both DTM and STM. However, the optimal detectors entail high computational complexity as log-likelihood ratios (LLRs) have to be computed. To overcome this issue, we show that the optimal decision rule for STM can be transformed into an equivalent low-complexity decision rule. Since a similar transformation is not possible for DTM, we propose simple low-complexity sub-optimal detectors based on different approximations of the LLR. The proposed low-complexity detectors are more suitable for practical MC systems than the original complex optimal decision rule, particularly when the FC is a nano-machine with limited computational capabilities. Furthermore, we analyze the performance of the proposed detectors in terms of their false alarm and missed detection probabilities. Simulation results verify our analytical derivations and reveal interesting insights regarding the trade-off between complexity and performance of the proposed detectors and the considered DTM and STM schemes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1703.10084v1-abstract-full').style.display = 'none'; document.getElementById('1703.10084v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 March, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 9 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1702.03590">arXiv:1702.03590</a> <span> [<a href="https://arxiv.org/pdf/1702.03590">pdf</a>, <a href="https://arxiv.org/format/1702.03590">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On the Capacity of a Class of Signal-Dependent Noise Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ghourchian%2C+H">Hamid Ghourchian</a>, <a href="/search/cs?searchtype=author&query=Aminian%2C+G">Gholamali Aminian</a>, <a href="/search/cs?searchtype=author&query=Gohari%2C+A">Amin Gohari</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1702.03590v2-abstract-short" style="display: inline;"> In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive Gaussian signal-dependent noise (AGSDN) channel models are used in molecular and optical communication. Herein we provide lower and upper bounds on the capacity of additive signal-dependent noise (ASDN) channels. The idea of the first lower bound is the extension of… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.03590v2-abstract-full').style.display = 'inline'; document.getElementById('1702.03590v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1702.03590v2-abstract-full" style="display: none;"> In some applications, the variance of additive measurement noise depends on the signal that we aim to measure. For instance, additive Gaussian signal-dependent noise (AGSDN) channel models are used in molecular and optical communication. Herein we provide lower and upper bounds on the capacity of additive signal-dependent noise (ASDN) channels. The idea of the first lower bound is the extension of the majorization inequality, and for the second one, it uses some calculations based on the fact that $h(Y) > h (Y|Z)$. Both of them are valid for all additive signal-dependent noise (ASDN) channels defined in the paper. The upper bound is based on a previous idea of the authors ("symmetric relative entropy") and is used for the additive Gaussian signal-dependent noise (AGSDN) channels. These bounds indicate that in ASDN channels (unlike the classical AWGN channels), the capacity does not necessarily become larger by making the variance function of the noise smaller. We also provide sufficient conditions under which the capacity becomes infinity. This is complemented by a number of conditions that imply capacity is finite and a unique capacity achieving measure exists (in the sense of the output measure). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.03590v2-abstract-full').style.display = 'none'; document.getElementById('1702.03590v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 June, 2017; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 February, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">34 pages, 3 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1701.08373">arXiv:1701.08373</a> <span> [<a href="https://arxiv.org/pdf/1701.08373">pdf</a>, <a href="https://arxiv.org/format/1701.08373">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Integer-Forcing Message Recovering in Interference Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1701.08373v1-abstract-short" style="display: inline;"> In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the- art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combin… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1701.08373v1-abstract-full').style.display = 'inline'; document.getElementById('1701.08373v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1701.08373v1-abstract-full" style="display: none;"> In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the- art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient algorithm to sequentially find the equations and integer combinations with maximum rates. We evaluate the performance of our scheme and compare the results with the minimum mean-square error (MMSE) and zero-forcing (ZF), as well as the IFLR schemes. The results indicate that our IFMR scheme outperforms the MMSE and ZF schemes, in terms of achievable rate, considerably. Also, compared to IFLR, the IFMR scheme achieves slightly less rates in moderate signal-to-noise ratios, with significantly less implementation complexity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1701.08373v1-abstract-full').style.display = 'none'; document.getElementById('1701.08373v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 January, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for possible journal publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1612.03360">arXiv:1612.03360</a> <span> [<a href="https://arxiv.org/pdf/1612.03360">pdf</a>, <a href="https://arxiv.org/format/1612.03360">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Information Theory of Molecular Communication: Directions and Challenges </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Gohari%2C+A">Amin Gohari</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1612.03360v1-abstract-short" style="display: inline;"> Molecular Communication (MC) is a communication strategy that uses molecules as carriers of information, and is widely used by biological cells. As an interdisciplinary topic, it has been studied by biologists, communication theorists and a growing number of information theorists. This paper aims to specifically bring MC to the attention of information theorists. To do this, we first highlight the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1612.03360v1-abstract-full').style.display = 'inline'; document.getElementById('1612.03360v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1612.03360v1-abstract-full" style="display: none;"> Molecular Communication (MC) is a communication strategy that uses molecules as carriers of information, and is widely used by biological cells. As an interdisciplinary topic, it has been studied by biologists, communication theorists and a growing number of information theorists. This paper aims to specifically bring MC to the attention of information theorists. To do this, we first highlight the unique mathematical challenges of studying the capacity of molecular channels. Addressing these problems require use of known, or development of new mathematical tools. Toward this goal, we review a subjective selection of the existing literature on information theoretic aspect of molecular communication. The emphasis here is on the mathematical techniques used, rather than on the setup or modeling of a specific paper. Finally, as an example, we propose a concrete information theoretic problem that was motivated by our study of molecular communication. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1612.03360v1-abstract-full').style.display = 'none'; document.getElementById('1612.03360v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 December, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted for publication in the IEEE Transactions on Molecular, Biological, and Multi-Scale Communications as a Shannon Centennial Special Issue</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1611.05995">arXiv:1611.05995</a> <span> [<a href="https://arxiv.org/pdf/1611.05995">pdf</a>, <a href="https://arxiv.org/ps/1611.05995">ps</a>, <a href="https://arxiv.org/format/1611.05995">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Wireless-powered relaying with finite block-length codes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Haghifam%2C+M">Mahdi Haghifam</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a>, <a href="/search/cs?searchtype=author&query=Zorzi%2C+M">Michele Zorzi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1611.05995v1-abstract-short" style="display: inline;"> This paper studies the outage probability and the throughput of amplify-and-forward relay networks with wireless information and energy transfer. We use some recent results on finite block-length codes to analyze the system performance in the cases with short codewords. Specifically, the time switching relaying and the power splitting relaying protocols are considered for energy and information tr… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1611.05995v1-abstract-full').style.display = 'inline'; document.getElementById('1611.05995v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1611.05995v1-abstract-full" style="display: none;"> This paper studies the outage probability and the throughput of amplify-and-forward relay networks with wireless information and energy transfer. We use some recent results on finite block-length codes to analyze the system performance in the cases with short codewords. Specifically, the time switching relaying and the power splitting relaying protocols are considered for energy and information transfer. We derive tight approximations for the outage probability/throughput. Then, we analyze the outage probability in asymptotically high signal-to-noise ratios. Finally, we use numerical results to confirm the accuracy of our analysis and to evaluate the system performance in different scenarios. Our results indicate that, in delay-constrained scenarios, the codeword length affects the outage probability/throughput of the joint energy and information transfer systems considerably. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1611.05995v1-abstract-full').style.display = 'none'; document.getElementById('1611.05995v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 November, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1607.07087">arXiv:1607.07087</a> <span> [<a href="https://arxiv.org/pdf/1607.07087">pdf</a>, <a href="https://arxiv.org/format/1607.07087">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On Wireless Energy and Information Transfer in Relay Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Haghifam%2C+M">Mahdi Haghifam</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1607.07087v1-abstract-short" style="display: inline;"> This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1607.07087v1-abstract-full').style.display = 'inline'; document.getElementById('1607.07087v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1607.07087v1-abstract-full" style="display: none;"> This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and power allocation between the source energy and information transfer signals as well as the optimal relay positioning such that the outage probability is minimized. Finally, we extend our analysis to multi-relay networks. We show that with perfect channel state information (CSI) available at the relays and $N$ relays the opportunistic relaying scheme achieves diversity order of $\frac{N+1}{2}$. Also, we analyze the opportunistic relaying with partial CSI where either the source-relay or the relay-destination CSI is provided at its corresponding transmit terminal, and prove that the relay selection based on the source-relay CSI outperforms the relay selection based on the relay-destination CSI, in terms of outage probability. The analytical and simulation results demonstrate the efficiency of wireless energy and information transfer systems in different conditions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1607.07087v1-abstract-full').style.display = 'none'; document.getElementById('1607.07087v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 July, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05680">arXiv:1604.05680</a> <span> [<a href="https://arxiv.org/pdf/1604.05680">pdf</a>, <a href="https://arxiv.org/ps/1604.05680">ps</a>, <a href="https://arxiv.org/format/1604.05680">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On Medium Chemical Reaction in Diffusion-Based Molecular Communication: a Two-Way Relaying Example </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Farahnak-Ghazani%2C+M">Maryam Farahnak-Ghazani</a>, <a href="/search/cs?searchtype=author&query=Aminian%2C+G">Gholamali Aminian</a>, <a href="/search/cs?searchtype=author&query=Mirmohseni%2C+M">Mahtab Mirmohseni</a>, <a href="/search/cs?searchtype=author&query=Gohari%2C+A">Amin Gohari</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1604.05680v3-abstract-short" style="display: inline;"> Chemical reactions are a prominent feature of molecular communication (MC) systems, with no direct parallels in wireless communications. While chemical reactions may be used inside the transmitter nodes, receiver nodes or the communication medium, we focus on its utility in the medium in this paper. Such chemical reactions can be used to perform computation over the medium as molecules diffuse and… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05680v3-abstract-full').style.display = 'inline'; document.getElementById('1604.05680v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05680v3-abstract-full" style="display: none;"> Chemical reactions are a prominent feature of molecular communication (MC) systems, with no direct parallels in wireless communications. While chemical reactions may be used inside the transmitter nodes, receiver nodes or the communication medium, we focus on its utility in the medium in this paper. Such chemical reactions can be used to perform computation over the medium as molecules diffuse and react with each other (physical-layer computation). We propose the use of chemical reactions for the following purposes: (i) to reduce signal-dependent observation noise of receivers by reducing the signal density, (ii) to realize molecular physical-layer network coding (molecular PNC) by performing the natural XOR operation inside the medium, and (iii) to reduce the inter-symbol interference (ISI) of other transmitters by canceling out the remaining molecules from previous transmissions. To make the ideas formal, we consider an explicit two-way relaying example with a transparent receiver (which has a signal-dependent noise). The proposed ideas are used to define a modulation scheme (which we call the PNC scheme). We compare the PNC with a previously proposed scheme for this problem where the XOR operation is performed at the relay node (using a molecular logic gate). We call the latter, the straightforward network coding (SNC). It is observed that in addition to the simplicity of the proposed PNC scheme, it outperforms the SNC scheme especially when we consider ISI. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05680v3-abstract-full').style.display = 'none'; document.getElementById('1604.05680v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 April, 2018; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">32 pages, 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1601.01488">arXiv:1601.01488</a> <span> [<a href="https://arxiv.org/pdf/1601.01488">pdf</a>, <a href="https://arxiv.org/format/1601.01488">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a>, <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Makki%2C+B">Behrooz Makki</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Svensson%2C+T">Tommy Svensson</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1601.01488v1-abstract-short" style="display: inline;"> This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interferen… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1601.01488v1-abstract-full').style.display = 'inline'; document.getElementById('1601.01488v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1601.01488v1-abstract-full" style="display: none;"> This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interference cancellation (SIC) to enhance the system performance compared to the state-of-the-art schemes. Both methods can be utilized in a network with different number of users, relays, and relay antennas, with negligible feedback channels or signaling overhead. We derive new concise formulations and explicit framework for the successive CMF method as well as an approach to reduce its computational complexity. Our theoretical analysis and computer simulations demonstrate the superior performance of our proposed CMF methods over the conventional schemes. Furthermore, based on our simulation results, the successive CMF method yields additional signal-to-noise ratio gains and shows considerable robustness against channel estimation error, compared to the extended CMF method. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1601.01488v1-abstract-full').style.display = 'none'; document.getElementById('1601.01488v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 January, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">44 pages, 10 figures, 1 table, accepted to be published in IEEE Trans. on Vehicular Tech</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1410.8797">arXiv:1410.8797</a> <span> [<a href="https://arxiv.org/pdf/1410.8797">pdf</a>, <a href="https://arxiv.org/format/1410.8797">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TVT.2016.2518667">10.1109/TVT.2016.2518667 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Integer Forcing-and-Forward Transceiver Design for MIMO Multi-Pair Two-Way Relaying </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Maham%2C+B">Behrouz Maham</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1410.8797v3-abstract-short" style="display: inline;"> In this paper, we propose a new transmission scheme, named as Integer Forcing-and-Forward (IFF), for communications among multi-pair multiple-antenna users in which each pair exchanges their messages with the help of a single multi antennas relay in the multiple-access and broadcast phases. The proposed scheme utilizes Integer Forcing Linear Receiver (IFLR) at relay, which uses equations, i.e., li… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.8797v3-abstract-full').style.display = 'inline'; document.getElementById('1410.8797v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1410.8797v3-abstract-full" style="display: none;"> In this paper, we propose a new transmission scheme, named as Integer Forcing-and-Forward (IFF), for communications among multi-pair multiple-antenna users in which each pair exchanges their messages with the help of a single multi antennas relay in the multiple-access and broadcast phases. The proposed scheme utilizes Integer Forcing Linear Receiver (IFLR) at relay, which uses equations, i.e., linear integer-combinations of messages, to harness the intra-pair interference. Accordingly, we propose the design of mean squared error (MSE) based transceiver, including precoder and projection matrices for the relay and users, assuming that the perfect channel state information (CSI) is available. In this regards, in the multiple-access phase, we introduce two new MSE criteria for the related precoding and filter designs, i.e., the sum of the equations MSE (Sum-Equation MSE) and the maximum of the equations MSE (Max-Equation MSE), to exploit the equations in the relay. In addition, the convergence of the proposed criteria is proven as well. Moreover, in the broadcast phase, we use the two traditional MSE criteria, i.e. the sum of the users' mean squred errors (Sum MSE) and the maximum of the users' mean squared errors (Max MSE), to design the related precoding and filters for recovering relay's equations by the users. Then, we consider a more practical scenario with imperfect CSI. For this case, IFLR receiver is modified, and another transceiver design is proposed, which take into account the effect of channels estimation error. We evaluate the performance of our proposed strategy and compare the results with the conventional amplify-and-forward (AF) and denoise-and-forward (DF) strategies for the same scenario. The results indicate the substantial superiority of the proposed strategy in terms of the outage probability and the sum rate. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.8797v3-abstract-full').style.display = 'none'; document.getElementById('1410.8797v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 February, 2015; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 31 October, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 7 figures, Submitted to a IEEE journal</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1408.2855">arXiv:1408.2855</a> <span> [<a href="https://arxiv.org/pdf/1408.2855">pdf</a>, <a href="https://arxiv.org/format/1408.2855">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Compute-and-Forward Two-Way Relaying </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1408.2855v2-abstract-short" style="display: inline;"> In this paper, a new two-way relaying scheme based on compute-and-forward (CMF) framework and relay selection strategies is proposed, which provides a higher throughput than the conventional two-way relaying schemes. Two cases of relays with or without feedback transmission capability are considered. An upper bound on the computation rate of each relay is derived, and based on that, a lower bound… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1408.2855v2-abstract-full').style.display = 'inline'; document.getElementById('1408.2855v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1408.2855v2-abstract-full" style="display: none;"> In this paper, a new two-way relaying scheme based on compute-and-forward (CMF) framework and relay selection strategies is proposed, which provides a higher throughput than the conventional two-way relaying schemes. Two cases of relays with or without feedback transmission capability are considered. An upper bound on the computation rate of each relay is derived, and based on that, a lower bound on the outage probability of the system is presented assuming block Rayleigh fading channels. Numerical results show that while the average sum rate of the system without feedback, named as Max Compute-and-Forward (M-CMF), reaches the derived upper bound only in low SNRs, that of the system with feedback, named as Aligned Compute-and-Forward (A-CMF) reaches the bound in all SNRs. However, both schemes approach the derived lower bound on the outage probability in all SNRs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1408.2855v2-abstract-full').style.display = 'none'; document.getElementById('1408.2855v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 October, 2014; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 August, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">27 pages, 9 figures, Accepted for IET Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1408.2854">arXiv:1408.2854</a> <span> [<a href="https://arxiv.org/pdf/1408.2854">pdf</a>, <a href="https://arxiv.org/format/1408.2854">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Distributed Compute-and-Forward Based Relaying Strategies in Multi-User Multi-Relay Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Azimi-Abarghouyi%2C+S+M">Seyed Mohammad Azimi-Abarghouyi</a>, <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1408.2854v4-abstract-short" style="display: inline;"> In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior information about each other. First, a new relaying strategy based on CMF, named incremental compute-and-forward (ICMF), is proposed that performs quite well in terms… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1408.2854v4-abstract-full').style.display = 'inline'; document.getElementById('1408.2854v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1408.2854v4-abstract-full" style="display: none;"> In this paper, we propose different practical distributed schemes to solve the rank failure problem in the compute and forward (CMF)-based multi-user multi-relay networks without central coordinator, in which the relays have no prior information about each other. First, a new relaying strategy based on CMF, named incremental compute-and-forward (ICMF), is proposed that performs quite well in terms of the outage probability. We show that the distributed ICMF scheme can even outperform the achievable rate of centralized optimal CMF in strong enough inter relay links, with much less complexity. Then, as the second scheme, amplify-forward and compute (AFC) is introduced in which the equations are recovered in the destination rather than in the relays. Finally, ICMF and AFC schemes are combined to present hybrid compute-amplify and forward (HCAF) relaying scheme, which takes advantages of both ICMF, and AFC and improves the performance of the ICMF considerably. We evaluate the performance of the proposed strategies in terms of the outage probability and compare the results with those of the conventional CMF strategy, the Decode and Forward (DF) strategy, and also the centralized optimal CMF. The results indicate the substantial superiority of the proposed schemes compared with the conventional schemes, specially for high number of users and relays. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1408.2854v4-abstract-full').style.display = 'none'; document.getElementById('1408.2854v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 April, 2015; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 August, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">29 pages, 9 figures, Submitted to IEEE Transactions on Wireless Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.4428">arXiv:1304.4428</a> <span> [<a href="https://arxiv.org/pdf/1304.4428">pdf</a>, <a href="https://arxiv.org/ps/1304.4428">ps</a>, <a href="https://arxiv.org/format/1304.4428">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Simplified Compute-and-Forward and Its Performance Analysis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.4428v2-abstract-short" style="display: inline;"> The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.4428v2-abstract-full').style.display = 'inline'; document.getElementById('1304.4428v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.4428v2-abstract-full" style="display: none;"> The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this paper, we first introduce a method to decrease the implementation complexity of the CMF method. We then evaluate the exact outage probability of our proposed simplified CMF scheme, and hereby provide an upper bound on the outage probability of the optimum CMF in all SNR values, and a close approximation of its outage probability in low SNR regimes. We also evaluate the effect of the channel estimation error (CEE) on the performance of both optimum and our proposed simplified CMF by simulations. Our simulation results indicate that the proposed method is more robust against CEE than the optimum CMF method for the examples considered. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.4428v2-abstract-full').style.display = 'none'; document.getElementById('1304.4428v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 April, 2013; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 16 April, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to IET Communications, 29 pages, 7 figures, 1 table, latex, The authors are with the Wireless Research Laboratory (WRL), Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.4383">arXiv:1304.4383</a> <span> [<a href="https://arxiv.org/pdf/1304.4383">pdf</a>, <a href="https://arxiv.org/ps/1304.4383">ps</a>, <a href="https://arxiv.org/format/1304.4383">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Convolutional Network-Coded Cooperation in Multi-Source Networks with a Multi-Antenna Relay </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Karbalay-Ghareh%2C+A">Alireza Karbalay-Ghareh</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a>, <a href="/search/cs?searchtype=author&query=Hejazi%2C+M">Mohsen Hejazi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.4383v2-abstract-short" style="display: inline;"> We propose a novel cooperative transmission scheme called "Convolutional Network-Coded Cooperation" (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination (R-D) channels are considered Rayleigh fading. The CNCC scheme exploits the gen… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.4383v2-abstract-full').style.display = 'inline'; document.getElementById('1304.4383v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.4383v2-abstract-full" style="display: none;"> We propose a novel cooperative transmission scheme called "Convolutional Network-Coded Cooperation" (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination (R-D) channels are considered Rayleigh fading. The CNCC scheme exploits the generator matrix of a good (N+M', N, v) systematic convolutional code, with the free distance of d_free designed over GF(2), as the network coding matrix which is run by the network's nodes, such that the systematic symbols are directly transmitted from the sources, and the parity symbols are sent by the best antenna of the relay. An upper bound on the BER of the sources, and consequently, the achieved diversity orders are obtained. The numerical results indicate that the CNCC scheme outperforms the other cooperative schemes considered, in terms of the diversity order and the network throughput. The simulation results confirm the accuracy of the theoretical analysis. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.4383v2-abstract-full').style.display = 'none'; document.getElementById('1304.4383v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 September, 2013; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 16 April, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, 9 figures, 1 table, submitted to IEEE Transactions on Wireless Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.0058">arXiv:1303.0058</a> <span> [<a href="https://arxiv.org/pdf/1303.0058">pdf</a>, <a href="https://arxiv.org/ps/1303.0058">ps</a>, <a href="https://arxiv.org/format/1303.0058">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> A Cooperative MARC Scheme Using Analogue Network Coding to Achieve Second-Order Diversity </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Esfahani%2C+M+S">Mohammad Shahrokh Esfahani</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.0058v2-abstract-short" style="display: inline;"> A multiple access relay channel (MARC) is considered in which an analogue-like network coding is implemented in the relay node. This analogue coding is a simple addition of the received signals at the relay node. Using "nulling detection" structure employed in V-BLAST receiver, we propose a detection scheme in the destination which is able to provide a diversity order of two for all users. We anal… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.0058v2-abstract-full').style.display = 'inline'; document.getElementById('1303.0058v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.0058v2-abstract-full" style="display: none;"> A multiple access relay channel (MARC) is considered in which an analogue-like network coding is implemented in the relay node. This analogue coding is a simple addition of the received signals at the relay node. Using "nulling detection" structure employed in V-BLAST receiver, we propose a detection scheme in the destination which is able to provide a diversity order of two for all users. We analytically evaluate the performance of our proposed scheme for the MARC with two users where tight upper bounds for both uncoded and Convolutionally coded transmission blocks are provided. We verify our analytical evaluations by simulations and compare the results with those of noncooperative transmission and Alamouti's scheme for the same power and rate transmission. Our results indicate that while our proposed scheme shows a comparable performance compared to the Alamouti's scheme, it substantially outperforms the non-cooperate transmission. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.0058v2-abstract-full').style.display = 'none'; document.getElementById('1303.0058v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 28 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1201.1090">arXiv:1201.1090</a> <span>  </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> </div> </div> <p class="title is-5 mathjax"> Distributed Multiuser Sequential Channel Sensing Schemes in Multichannel Cognitive Radio Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shokri-Ghadikolaei%2C+H">Hossein Shokri-Ghadikolaei</a>, <a href="/search/cs?searchtype=author&query=Sheikholeslami%2C+F">Fatemeh Sheikholeslami</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1201.1090v2-abstract-short" style="display: inline;"> This paper has been withdrawn by the author due to a crucial problem associated with Figs. 2 and 3. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1201.1090v2-abstract-full" style="display: none;"> This paper has been withdrawn by the author due to a crucial problem associated with Figs. 2 and 3. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1201.1090v2-abstract-full').style.display = 'none'; document.getElementById('1201.1090v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 February, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 January, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This paper has been withdrawn</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1111.5296">arXiv:1111.5296</a> <span> [<a href="https://arxiv.org/pdf/1111.5296">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Analytical and Learning-Based Spectrum Sensing Time Optimization in Cognitive Radio Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shokri-Ghadikolaei%2C+H">Hossein Shokri-Ghadikolaei</a>, <a href="/search/cs?searchtype=author&query=Abdi%2C+Y">Younes Abdi</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1111.5296v2-abstract-short" style="display: inline;"> Powerful spectrum sensing schemes enable cognitive radios (CRs) to find transmission opportunities in spectral resources allocated exclusively to the primary users. In this paper, maximizing the average throughput of a secondary user by optimizing its spectrum sensing time is formulated assuming that a prior knowledge of the presence and absence probabilities of the primary users is available. The… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.5296v2-abstract-full').style.display = 'inline'; document.getElementById('1111.5296v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1111.5296v2-abstract-full" style="display: none;"> Powerful spectrum sensing schemes enable cognitive radios (CRs) to find transmission opportunities in spectral resources allocated exclusively to the primary users. In this paper, maximizing the average throughput of a secondary user by optimizing its spectrum sensing time is formulated assuming that a prior knowledge of the presence and absence probabilities of the primary users is available. The energy consumed for finding a transmission opportunity is evaluated and a discussion on the impact of the number of the primary users on the secondary user throughput and consumed energy is presented. In order to avoid the challenges associated with the analytical method, as a second solution, a systematic neural network-based sensing time optimization approach is also proposed in this paper. The proposed adaptive scheme is able to find the optimum value of the channel sensing time without any prior knowledge or assumption about the wireless environment. The structure, performance, and cooperation of the artificial neural networks used in the proposed method are disclosed in detail and a set of illustrative simulation results is presented to validate the analytical results as well as the performance of the proposed learning-based optimization scheme. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.5296v2-abstract-full').style.display = 'none'; document.getElementById('1111.5296v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 December, 2011; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 November, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2011. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1111.4624">arXiv:1111.4624</a> <span> [<a href="https://arxiv.org/pdf/1111.4624">pdf</a>, <a href="https://arxiv.org/ps/1111.4624">ps</a>, <a href="https://arxiv.org/format/1111.4624">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Sensing Matrix Setting Schemes for Cognitive Networks and Their Performance Analysis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shokri-Ghadikolaei%2C+H">Hossein Shokri-Ghadikolaei</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1111.4624v3-abstract-short" style="display: inline;"> Powerful spectrum decision schemes enable cognitive radios (CRs) to find transmission opportunities in spectral resources allocated exclusively to the primary users. One of the key effecting factor on the CR network throughput is the spectrum sensing sequence used by each secondary user. In this paper, secondary users' throughput maximization through finding an appropriate sensing matrix (SM) is i… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.4624v3-abstract-full').style.display = 'inline'; document.getElementById('1111.4624v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1111.4624v3-abstract-full" style="display: none;"> Powerful spectrum decision schemes enable cognitive radios (CRs) to find transmission opportunities in spectral resources allocated exclusively to the primary users. One of the key effecting factor on the CR network throughput is the spectrum sensing sequence used by each secondary user. In this paper, secondary users' throughput maximization through finding an appropriate sensing matrix (SM) is investigated. To this end, first the average throughput of the CR network is evaluated for a given SM. Then, an optimization problem based on the maximization of the network throughput is formulated in order to find the optimal SM. As the optimum solution is very complicated, to avoid its major challenges, three novel sub optimum solutions for finding an appropriate SM are proposed for various cases including perfect and non-perfect sensing. Despite of having less computational complexities as well as lower consumed energies, the proposed solutions perform quite well compared to the optimum solution (the optimum SM). The structure and performance of the proposed SM setting schemes are discussed in detail and a set of illustrative simulation results is presented to validate their efficiencies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.4624v3-abstract-full').style.display = 'none'; document.getElementById('1111.4624v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 January, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 November, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2011. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1111.1926">arXiv:1111.1926</a> <span> [<a href="https://arxiv.org/pdf/1111.1926">pdf</a>, <a href="https://arxiv.org/ps/1111.1926">ps</a>, <a href="https://arxiv.org/format/1111.1926">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Optimization and Control">math.OC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> </div> </div> <p class="title is-5 mathjax"> Performance Analysis of Sequential Method for Handover in Cognitive Radio Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shokri-Ghadikolaei%2C+H">Hossein Shokri-Ghadikolaei</a>, <a href="/search/cs?searchtype=author&query=Mozaffari%2C+M">Mohammad Mozaffari</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1111.1926v2-abstract-short" style="display: inline;"> Powerful spectrum handover schemes enable cognitive radios (CRs) to use transmission opportunities in primary users' channels appropriately. In this paper, we consider the cognitive access of primary channels by a secondary user. We evaluate the average detection time and the maximum achievable average throughput of the secondary user when the sequential method for hand-over (SMHO) is used. We ass… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.1926v2-abstract-full').style.display = 'inline'; document.getElementById('1111.1926v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1111.1926v2-abstract-full" style="display: none;"> Powerful spectrum handover schemes enable cognitive radios (CRs) to use transmission opportunities in primary users' channels appropriately. In this paper, we consider the cognitive access of primary channels by a secondary user. We evaluate the average detection time and the maximum achievable average throughput of the secondary user when the sequential method for hand-over (SMHO) is used. We assume that a prior knowledge of the primary users' presence and absence probabilities are available. When investigating the maximum achievable throughput of the secondary user, we end into an optimization problem, in which the optimum value of sensing time must be selected. In our optimization problem, we take into account the spectrum hand over due to false detection of the primary user. We also propose a weighted based hand-over (WBHO) scheme in which the impacts of channels conditions and primary users' presence probability are considered. This Spectrum handover scheme provides higher average throughput for the SU than the SMHO method. The tradeoff between the maximum achievable throughput and consumed energy is discussed, and finally an energy efficient optimization formulation for finding a proper sensing time is provided. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1111.1926v2-abstract-full').style.display = 'none'; document.getElementById('1111.1926v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 January, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 8 November, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2011. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1106.0880">arXiv:1106.0880</a> <span>  </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> </div> </div> <p class="title is-5 mathjax"> Performance Analysis of Sequential Method for HandOver in Cognitive Radio Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shokri%2C+H">Hossein Shokri</a>, <a href="/search/cs?searchtype=author&query=Mozaffari%2C+M">Mohammad Mozaffari</a>, <a href="/search/cs?searchtype=author&query=Gavili%2C+A">Adnan Gavili</a>, <a href="/search/cs?searchtype=author&query=Nasiri-Kenari%2C+M">Masoumeh Nasiri-Kenari</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1106.0880v2-abstract-short" style="display: inline;"> This paper has been withdrawn by the author due to a crucial problem in Lemma 3. This equation must be changed. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1106.0880v2-abstract-full" style="display: none;"> This paper has been withdrawn by the author due to a crucial problem in Lemma 3. This equation must be changed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1106.0880v2-abstract-full').style.display = 'none'; document.getElementById('1106.0880v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 February, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 June, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This paper has been withdrawn</span> </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository