MDMine Gokce Dogan

Mine Gokce Dogan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mine Gokce Dogan has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Reinforcement Learning-Based Hybrid Scheduling Mechanism for mmWave Networks

    by Mine Gokce Dogan, Martina Cardone, Christina Fragouli

    Millimeter-wave (mmWave) technology is expected to support next-generation wireless networks by expanding the available spectrum and supporting multi-gigabit services. While mmWave communications hold great promise, mmWave links are vulnerable against link blockages, which can severely impact their performance. This paper aims to develop resilient transmission mechanisms to suitably distribute traffic across multiple paths in mmWave networks. The main contributions include: (a) the development of proactive transmission mechanisms to build resilience against link blockages in advance, while achieving a high end-to-end packet rate; (b) the design of a heuristic path selection algorithm to efficiently select (in polynomial time in the network size) multiple proactively resilient paths that have high capacity; and (c) the development of a hybrid scheduling algorithm that combines the proposed path selection algorithm with a deep reinforcement learning (DRL) based online approach for decentralized adaptation to blockages. To achieve resilience against link blockages and to adapt the information flow through the network, a state-of-the-art Soft Actor-Critic DRL algorithm is investigated. The proposed scheduling algorithm robustly adapts to blockages and channel variations over different topologies, channels, and blockage realizations while outperforming alternative algorithms which include a conventional congestion control algorithm additive increase multiplicative decrease. Specifically, it achieves the desired packet rate in over 99% of the episodes in static networks with blockages (where up to 80% of the paths are blocked), and in 100% of the episodes in time-varying networks with blockages and link capacity variations – compared to 0.5% to 45% success rates achieved by the baseline methods under the same conditions.

  • Multilevel Coding for Achieving Low Latency and Low Outage in mmWave Networks

    by Mine Gokce Dogan, Jaimin Shah, Martina Cardone, Christina Fragouli, Wei Mao, Hosein Nikopour, Rath Vannithamby

    Achieving ultra-reliable low-latency communications (URLLC) is critical for the operation of data-intensive applications and for ensuring seamless connectivity. Millimeter-wave (mmWave) technology is expected to support URLLC by expanding the available spectrum and providing multi-gigabit services. However, a well-recognized challenge is that mmWave communication links are susceptible to blockage, which may lead to communication disruptions. Conventional approaches, such as interleaving and feedback mechanisms provide resilience against such blockages at the cost of incurring additional delay, which may be too large to support URLLC effectively. This calls for novel techniques to develop resilient transmission mechanisms that can support URLLC. This paper develops gracefully resilient transmission mechanisms by deploying multilevel codes over space and over time. These codes allow the control of the received information and they accommodate different quality of service requirements of different information streams. Our evaluations, carried out also within the ns-3 network simulator, show that deploying these codes leads to attractive trade-offs between rate, delay, and outage probability.


  • Network synthesis for tactical environments: scenario, challenges, and opportunities

    by Tzanis Anevlavis, Jonathan Bunton, Jared Coleman, Mine Gokce Dogan, Eugenio Grippo, Abel Souza, Christina Fragouli, Bhaskar Krishnamachari, Matthew Maness, Karl Olson, et al.

    We develop a network synthesis scenario, which is built around a concrete perimeter surveillance application, yet we believe captures a number of the challenges and requirements that are common to other tactical communication and computational network applications. The proposed scenario addresses the problem of binary population identification within a perimeter: our goal is to synthesize a sensing and computing network that classifies people moving within a given perimeter into one of two categories (e.g., friend or foe). We discuss several open challenges that we organize across the following clusters: sensor placement, communication network provisioning and optimization, computational task placement, dynamic re-synthesis and resilience under adversarial settings. We also briefly discuss approaches that attempt to address such challenges.

  • Gomory-Hu Trees Over Wireless

    by Mine Gokce Dogan, Yahya H. Ezzeldin, Christina Fragouli

    The Gomory-Hu tree is a popular optimization algorithm that enables to efficiently find a min-cut (or equivalently, max-flow) for every pair of nodes in a graph. However, graphs cannot capture broadcasting and interference in wireless: over wireless networks we need to resort to the information-theoretical cut-set to bound the max-flow. Leveraging the submodularity of mutual information, we show that the Gomory-Hu algorithm can be used to efficiently find information-theoretic rate characterizations such as the capacity or an approximation to the capacity, over a number of network scenarios including wireless Gaussian networks and deterministic relay networks.