Award Abstract # 1907785
CIF: Small: Efficient Relaying and Scheduling for Half-Duplex Wireless Networks

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: REGENTS OF THE UNIVERSITY OF MINNESOTA
Initial Amendment Date: July 17, 2019
Latest Amendment Date: July 17, 2019
Award Number: 1907785
Award Instrument: Standard Grant
Program Manager: Phillip Regalia
pregalia@nsf.gov
 (703)292-2981
CCF
 Division of Computing and Communication Foundations
CSE
 Direct For Computer & Info Scie & Enginr
Start Date: October 1, 2019
End Date: September 30, 2024 (Estimated)
Total Intended Award Amount: $499,999.00
Total Awarded Amount to Date: $499,999.00
Funds Obligated to Date: FY 2019 = $499,999.00
History of Investigator:
  • Martina Cardone (Principal Investigator)
    cardo089@umn.edu
  • Soheil Mohajer (Co-Principal Investigator)
Recipient Sponsored Research Office: University of Minnesota-Twin Cities
200 OAK ST SE
MINNEAPOLIS
MN  US  55455-2009
(612)624-5599
Sponsor Congressional District: 05
Primary Place of Performance: University of Minnesota-Twin Cities
200 Union Street SE, Keller Hall
Minneapolis
MN  US  55455-0170
Primary Place of Performance
Congressional District:
05
Unique Entity Identifier (UEI): KABJZBBJ4B54
Parent UEI:
NSF Program(s): Comm & Information Foundations
Primary Program Source: 01001920DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923, 7939, 9102
Program Element Code(s): 779700
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Wireless technology is currently experiencing a transformative revolution fueled mainly by the staggering amount of data traffic and massive number of critical services (e.g., healthcare and education) offered over the wireless medium. A central role in this wireless revolution is played by relaying technologies, whereby data is transferred from a sender to a receiver by having information hop through a pool of relays (i.e., intermediate nodes). Relaying is foreseen to be a key component for enabling the evolving 5G architecture, and supporting next generation Internet of Things networks. This project seeks to develop a comprehensive analysis of several theoretical and practical aspects of wireless relay networks. The research and its outcomes will be integrated into education, and will promote undergraduate and graduate research.

This project focuses on half-duplex mode of operation at the relays whereby each relay uses different time slots/frequency bands for transmission and reception. The proposed research seeks to derive theoretical foundations that shed light on how to operate these relay networks in a provably (information-theoretic) close-to-optimal, yet simple way, and to develop low-complexity algorithms for efficiently achieving the theoretical limits. Special emphasis will be put on devising solutions to schedule the relays for reception/transmission in a simple and efficient way. This will require that several challenges be overcome, including achieving high performance in computationally-constrained networks, and providing robustness against channel variations. Our ultimate goal is to identify solutions that can be implemented in a distributive fashion across the relay nodes, and that require a minimum communication overhead for exchanging the channel state information.

This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Jain, Sarthak and Mohajer, Soheil and Cardone, Martina "On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks" 2020 IEEE International Symposium on Information Theory (ISIT) , 2020 https://doi.org/10.1109/ISIT44484.2020.9174278 Citation Details
Jain, Sarthak and Cardone, Martina and Mohajer, Soheil "Identifying Reliable Machines for Distributed Matrix-Vector Multiplication" 2022 IEEE International Symposium on Information Theory (ISIT) , 2022 https://doi.org/10.1109/ISIT50566.2022.9834447 Citation Details
Jain, Sarthak and Cardone, Martina and Mohajer, Soheil "Optimality of Energy-Efficient Scheduling and Relaying for Half-Duplex Relay Networks" IEEE Journal on Selected Areas in Information Theory , v.3 , 2022 https://doi.org/10.1109/JSAIT.2022.3157829 Citation Details
Jain, Sarthak and Cardone, Martina and Mohaier, Soheil "When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks?" IEEE International Symposium on Information Theory , 2021 https://doi.org/10.1109/ISIT45174.2021.9517775 Citation Details
Jain, Sarthak and Mohajer, Soheil and Cardone, Martina "Gaussian Half-Duplex Diamond Networks: Ratio of Capacity the Best Relay Can Achieve" IEEE Transactions on Wireless Communications , v.20 , 2021 https://doi.org/10.1109/TWC.2021.3066527 Citation Details
Jain, Sarthak and Cardone, Martina and Mohajer, Soheil "Operating Half-Duplex Diamond Networks with Two Interfering Relays" 2020 IEEE Information Theory Workshop (ITW) , 2021 https://doi.org/10.1109/ITW46852.2021.9457635 Citation Details
Jain, Sarthak and Cardone, Martina and Mohajer, Soheil "Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items" 2023 IEEE Information Theory Workshop (ITW) , 2023 https://doi.org/10.1109/ITW55543.2023.10161616 Citation Details
Jain, Sarthak and Cardone, Martina and Mohajer, Soheil "Probabilistic Group Testing in Distributed Computing with Attacked Workers" 2023 IEEE International Symposium on Information Theory (ISIT) , 2023 https://doi.org/10.1109/ISIT54713.2023.10206705 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page