Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ki-Young Jang

dblp:99/6963 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 8 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
5 papers
Wireless networking · 53% Transport protocols and congestion control · 21% Internet of things and sensor networks · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

Topics — the 17 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
wireless mesh network
0.222011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks · CoNEXT 2010
Transport protocols and congestion control
wireless congestion control
0.222011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Internet of things and sensor networks
energy management
0.112011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Wireless networking › WLAN › IEEE 802.11n/ac
IEEE 802.11n
0.112011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Wireless networking › wireless mesh network
multihop wireless network
0.112011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Wireless networking
WLAN
0.112011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Energy-efficient computing
power management
0.112011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Energy-efficient computing › power management › energy-efficient networking
wireless interface power management
0.112011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Transport protocols and congestion control
TCP performance
0.112010
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks · CoNEXT 2010
Network optimization and economics › resource allocation › rate allocation
fair rate allocation
0.112008
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Wireless networking › wireless mesh network
multi-hop wireless mesh networks
0.112008
Understanding congestion control in multi-hop wireless mesh networks · MobiCom 2008
Wireless networking
medium access control
0.122011
Snooze: energy management in 802.11n WLANs · CoNEXT 2011
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks · CoNEXT 2010
Internet of things and sensor networks › wireless sensor network
sensor fusion
0.112006
The tenet architecture for tiered sensor networks · SenSys 2006
Internet of things and sensor networks › wireless sensor network › sensor network architecture
tiered sensor networks
0.112006
The tenet architecture for tiered sensor networks · SenSys 2006
Network optimization and economics › fairness
max-min fairness
0.012011
Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2011
Wireless networking › WLAN
IEEE 802.11
0.012010
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks · CoNEXT 2010
Internet of things and sensor networks › iot networks › iot communication
sensor network communication
0.012006
The tenet architecture for tiered sensor networks · SenSys 2006

Methods — techniques the papers use, named apart from their topics

micro-sleep · 0.2antenna configuration management · 0.2simulation · 0.2distributed rate control · 0.2deployment · 0.2AIMD rate control · 0.1max-min fair allocation · 0.1AIMD · 0.1tasklet library · 0.1pursuit-evasion evaluation · 0.1
YearPublicationVenuePosition
2016 An adaptive routing algorithm considering position and social similarities in an opportunistic network
Ki-Young Jang, Junyeop Lee, Sun-Kyum Kim, Ji-Hyeun Yoon, Sung-Bong Yang
Wirel. Networks1
2016 A forwarding scheme based on swarm intelligence and percolation centrality in opportunistic networks
Jiho Park 0002, Junyeop Lee, Sun-Kyum Kim, Ki-Young Jang, Sung-Bong Yang
Wirel. Networks4
2011 Snooze: energy management in 802.11n WLANs
abstract
Increasingly, mobile devices equipped with 802.11n interfaces are being used for a wide variety of applications including bandwidth-intensive HD video streaming. Recent work has shown that 802.11n interfaces are power-hungry, so energy management is an important challenge. 802.11n implementations have additional power states relative to earlier generations of 802.11 technology, so energy management challenges for 802.11n are qualitatively different compared to that faced by prior work. In this paper, we describe the design and implementation of Snooze, an energy management technique for 802.11n which uses two novel and inter-dependent mechanisms: client micro-sleeps and antenna configuration management. In Snooze, the APmonitors traffic on the WLAN and directs client sleep times and durations as well as antenna configurations, without significantly affecting throughput or delay. Snooze achieves 30~85% energy-savings over CAM across workloads ranging from VoIP and video streaming to file downloads and chats.
Ki-Young Jang, Shuai Hao 0002, Anmol Sheth, Ramesh Govindan
CoNEXT1
2011 Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks
abstract
Complex interference in static multihop wireless mesh networks can adversely affect transport protocol performance. Since TCP does not explicitly account for this, starvation and unfairness can result from the use of TCP over such networks. In this paper, we explore mechanisms for achieving fair and efficient congestion control for multihop wireless mesh networks. First, we design an AIMD-based rate-control protocol called Wireless Control Protocol (WCP), which recognizes that wireless congestion is a neighborhood phenomenon, not a node-local one, and appropriately reacts to such congestion. Second, we design a distributed rate controller that estimates the available capacity within each neighborhood and divides this capacity to contending flows, a scheme we call Wireless Control Protocol with Capacity estimation (WCPCap). Using analysis, simulations, and real deployments, we find that our designs yield rates that are both fair and efficient. WCP assigns rates inversely proportional to the number of bottlenecks a flow passes through while remaining extremely easy to implement. An idealized version of WCPCap is max-min fair, whereas a practical implementation of the scheme achieves rates within 15% of the max-min optimal rates while still being distributed and amenable to real implementation.
Sumit Rangwala, Apoorva Jindal, Ki-Young Jang, Konstantinos Psounis, Ramesh Govindan
IEEE/ACM Trans. Netw.3
2010 Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
abstract
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP starvation in a wireless mesh network is avoided. Our explicit allocation is efficient, redistributing unused airtime and also accounting for airtime rendered unusable by external interference. Our technique requires no modifications to TCP/IP and the 802.11 MAC, and is responsive to short flows, MAClayer auto rate adaptation, and other dynamics, as we demonstate in extensive experiments on two indoor testbeds. Despite its simplicity, the technique is on average within 12% of the max-min optimal allocation on several canonical topologies. 1.
Ki-Young Jang, Konstantinos Psounis, Ramesh Govindan
CoNEXT1
2010 The Tenet architecture for tiered sensor networks
abstract
Most sensor network research and software design has been guided by an architectural principle that permits multinode data fusion on small-form-factor, resource-poor nodes, or motes . While we were among the earliest promoters of this approach, through experience we found that this principle leads to fragile and unmanageable systems and explore an alternative. The Tenet architecture is motivated by the observation that future large-scale sensor network deployments will be tiered , consisting of motes in the lower tier and masters , relatively unconstrained 32-bit platform nodes, in the upper tier. Tenet constrains multinode fusion to the master tier while allowing motes to process locally-generated sensor data. This simplifies application development and allows mote-tier software to be reused. Applications running on masters task motes by composing task descriptions from a novel tasklet library. Our Tenet implementation also contains a robust and scalable networking subsystem for disseminating tasks and reliably delivering responses. We show that a Tenet pursuit-evasion application exhibits performance comparable to a mote-native implementation while being considerably more compact. We also present two real-world deployments of Tenet system: a structural vibration monitoring application at Vincent Thomas Bridge and an imaging-based habitat monitoring application at James Reserve, and show that tiered architecture scales network capacity and allows reliable delivery of high rate data. 1
Jeongyeup Paek, Ben Greenstein, Omprakash Gnawali, Ki-Young Jang, August Joki, Marcos A. M. Vieira, John Hicks, Deborah Estrin, Ramesh Govindan, Eddie Kohler
ACM Trans. Sens. Networks4
2008 Understanding congestion control in multi-hop wireless mesh networks
abstract
Complex interference in static multi-hop wireless mesh networks can adversely affect transport protocol performance. Since TCP does not explicitly account for this, starvation and unfairness can result from the use of TCP over such networks. In this paper, we explore mechanisms for achieving fair and efficient congestion control for multi-hop wireless mesh networks. First, we design an AIMD-based rate-control protocol called Wireless Control Protocol (WCP) which recognizes that wireless congestion is a neighborhood phenomenon, not a node-local one, and appropriately reacts to such congestion. Second, we design a distributed rate controller that estimates the available capacity within each neighborhood, and divides this capacity to contending flows, a scheme we call Wireless Control Protocol with Capacity estimation (WCPCap). Using analysis, simulations, and real deployments, we find that our designs yield rates that are both fair and efficient, and achieve near optimal goodputs for all the topologies that we study. WCP achieves this level of performance while being extremely easy to implement. Moreover, WCPCap achieves the max-min rates for our topologies, while still being distributed and amenable to real implementation.
Sumit Rangwala, Apoorva Jindal, Ki-Young Jang, Konstantinos Psounis, Ramesh Govindan
MobiCom3
2007 Energy Efficient LEACH with TCP for Wireless Sensor Networks
Jungrae Kim, Ki-Young Jang, Hyunseung Choo, Won Kim 0001
ICCSA (2)2
2006 The tenet architecture for tiered sensor networks
abstract
Most sensor network research and software design has been guided by an architectural principle that permits multi-node data fusion on small-form-factor, resource-poor nodes, or motes. We argue that this principle leads to fragile and unmanageable systems and explore an alternative. The Tenet architecture is motivated by the observation that future large-scale sensor network deployments will be tiered, consisting of motes in the lower tier and masters, relatively unconstrained 32-bit platform nodes, in the upper tier. Masters provide increased network capacity. Tenet constrains multi-node fusion to the master tier while allowing motes to process locally-generated sensor data. This simplifies application development and allows mote-tier software to be reused. Applications running on masters task motes by composing task descriptions from a novel tasklet library. Our Tenet implementation also contains a robust and scalable networking subsystem for disseminating tasks and reliably delivering responses. We show that a Tenet pursuit-evasion application exhibits performance comparable to a mote-native implementation while being considerably more compact.
Omprakash Gnawali, Ki-Young Jang, Jeongyeup Paek, Marcos A. M. Vieira, Ramesh Govindan, Ben Greenstein, August Joki, Deborah Estrin, Eddie Kohler
SenSys2