Jaewook Kwak

Works (5)

Updated: July 5th, 2023 15:39

2016 conference paper

An antithetic coupling approach to multi-chain based CSMA scheduling algorithms

IEEE INFOCOM 2016 - the 35th annual IEEE international Conference on Computer Communications.

By: J. Kwak n & D. Eun n

TL;DR: This paper develops a new approach via an antithetic coupling (AC) method, which can further improve the delay performance of those that virtually emulate multiple chains of CSMA algorithms, and confirms that AC-CSMA always delivers better queueing performance over a variety of network scenarios. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2015 journal article

A High-Order Markov-Chain-Based Scheduling Algorithm for Low Delay in CSMA Networks

IEEE-ACM TRANSACTIONS ON NETWORKING, 24(4), 2278–2290.

By: J. Kwak n, C. Lee * & D. Eun n

author keywords: Carrier sense multiple access (CSMA); Markov chain; scheduling algorithms; wireless networks
TL;DR: This paper shows that the proposed CSMA algorithm, named delayed CSMA, achieves the throughput optimality, and also provides much better delay performance by effectively “decorrelating” the link state process (and thus resolves link starvation). (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2015 journal article

Towards Distributed Optimal Movement Strategy for Data Gathering in Wireless Sensor Networks

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 27(2), 574–584.

By: C. Lee n, J. Kwak n & D. Eun n

author keywords: Wireless sensor networks; mobile collectors; data gathering; Markovian random-walk movement strategies; distributed optimal movement strategy; network loss probability
TL;DR: This paper obtains the optimal movement strategy among a class of Markovian strategies so as to minimize the data loss rate over all sensor nodes, and explains how such an optimalmovement strategy can be made to work in a distributed fashion. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2014 conference paper

A high-order Markov chain based scheduling algorithm for low delay in CSMA networks

2014 proceedings ieee infocom, 1662–1670.

By: J. Kwak n, C. Lee n & D. Eun n

Source: NC State University Libraries
Added: August 6, 2018

2013 conference paper

Characterizing link connectivity for opportunistic mobile networking: Does mobility suffice?

2013 proceedings ieee infocom, 2076–2084.

By: C. Lee n, J. Kwak n & D. Eun n

TL;DR: This work investigates how each user's availability jointly with mobility-induced contact/inter-contact process affects the link-level connectivity depending on their relative operating time scales and suggests the presence of many uncharted research territories for further exploration. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2025) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.