Is this your profile?

Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.

Create or connect your ORCID iD

Updated: April 5th, 2024 03:46

2024 journal article

Minimizing File Transfer Time in Opportunistic Spectrum Access Model

*IEEE TRANSACTIONS ON MOBILE COMPUTING*, *23*(1), 630–644.

author keywords: Delays; Throughput; Sensors; Switches; Mathematical models; Vehicle dynamics; Computational modeling; Opportunistic spectrum access; file transfer problem; minimum transfer time; shortest path problem

TL;DR:
This work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transferTime in general.
(via Semantic Scholar)

Sources: Web Of Science, ORCID, NC State University Libraries

Added: January 7, 2024

2023 journal article

Convergence of Bi-Virus Epidemic Models With Non-Linear Rates on Networks-A Monotone Dynamical Systems Approach

*IEEE-ACM TRANSACTIONS ON NETWORKING*, *31*(3), 1187–1201.

author keywords: Epidemics on networks; bi-virus models; multi-layer graphs; monotone dynamical systems

TL;DR:
These results are the first in providing complete convergence analysis for the bi-virus system with non-linear infection and recovery rates on general graphs, and are the best of their knowledge.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(Web of Science; OpenAlex)

Source: Web Of Science

Added: July 31, 2023

2021 article

Competing Epidemics on Graphs - Global Convergence and Coexistence

*IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021)*.

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(OpenAlex)

Sources: Web Of Science, NC State University Libraries

Added: November 23, 2021

2021 journal article

Controlling Metastable Infection Patterns in Multilayer Networks via Interlink Design

*IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING*, *8*(4), 3242–3256.

author keywords: Epidemics; Nonhomogeneous media; Steady-state; Network topology; Transient analysis; Thermodynamics; Interlink design; localized epidemics; multilayer networks; susceptible-infected-susceptible model

TL;DR:
This work compares the interlinking strategies developed in this work to some popular heuristics and demonstrates their superiority by extensive simulation experiments on both synthetic and real-world networks.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(OpenAlex)

Source: Web Of Science

Added: January 3, 2022

2021 journal article

Energy-Aware Stochastic UAV-Assisted Surveillance

*IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS*, *20*(5), 2820–2837.

author keywords: Surveillance; Inspection; Batteries; Trajectory; Unmanned aerial vehicles; Approximation algorithms; Programming; Unmanned aerial vehicles (UAVs); surveillance; random walks; energy-aware design; Markov chains

TL;DR:
A novel framework for stochastic UAV-assisted surveillance that inherently considers the battery constraints of the UAVs, proposes random moving patterns modeled via random walks, and adds another degree of randomness to the system via considering probabilistic inspections is proposed.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

7. Affordable and Clean Energy
(OpenAlex)

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: June 10, 2021

2020 journal article

Maximization of Robustness of Interdependent Networks Under Budget Constraints

*IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING*, *7*(3), 1441–1452.

author keywords: Robustness; Measurement; Nonhomogeneous media; Mathematical model; Network topology; Optimization; Power system faults; Multilayer failure propagation; cost constrained optimization; network robustness; interdependent networks

TL;DR:
This work presents a surrogate metric based framework for constructing interlinks and proposes metrics to track the network robustness for each of these mechanisms, and is able to introduce the cost of construction into the interlink design problem, a practical feature largely ignored in relevant literature.
(via Semantic Scholar)

Source: Web Of Science

Added: September 21, 2020

2020 journal article

Prevention and Mitigation of Catastrophic Failures in Demand-Supply Interdependent Networks

*IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING*, *7*(3), 1710–1723.

author keywords: Power system faults; Power system protection; Robustness; Stress; Load modeling; Adaptation models; Resource management; Interdependent networks; demand-supply networks; robustness; resource and load fluctuations; cascading failures

TL;DR:
A generic system model for a special category of interdependent networks, demand-supply networks, in which the demand and the supply nodes are associated with heterogeneous loads and resources, which sheds a light on a unique cascading failure mechanism induced by resource/load fluctuations.
(via Semantic Scholar)

Source: Web Of Science

Added: September 21, 2020

2019 conference paper

Non-Markovian Monte Carlo on Directed Graphs

*Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)*, *3*(1).

Source: NC State University Libraries

Added: July 10, 2019

2019 article

Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks

*PROCEEDINGS OF THE 2019 THE TWENTIETH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING (MOBIHOC '19)*, pp. 191–200.

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(OpenAlex)

Source: Web Of Science

Added: August 24, 2020

2017 conference paper

Challenging the limits: Sampling online social networks with cost constraints

*Ieee infocom 2017 - ieee conference on computer communications*.

UN Sustainable Development Goal Categories

10. Reduced Inequalities
(OpenAlex)

Source: NC State University Libraries

Added: August 6, 2018

2017 journal article

Designing Optimal Interlink Patterns to Maximize Robustness of Interdependent Networks Against Cascading Failures

*IEEE TRANSACTIONS ON COMMUNICATIONS*, *65*(9), 3847–3862.

author keywords: Interdependent networks; optimal interlinks; targeted attack; network robustness

Source: Web Of Science

Added: August 6, 2018

2017 conference paper

On the rao-blackwellization and its application for graph sampling via neighborhood exploration

*Ieee infocom 2017 - ieee conference on computer communications*.

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(OpenAlex)

Source: NC State University Libraries

Added: August 6, 2018

2016 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.

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

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*.

Source: NC State University Libraries

Added: August 6, 2018

2016 journal article

Energy-Efficient Wi-Fi Sensing Policy Under Generalized Mobility Patterns With Aging

*IEEE-ACM TRANSACTIONS ON NETWORKING*, *24*(4), 2416–2428.

author keywords: Aging; energy efficiency; functional optimization; Wi-Fi sensing

TL;DR:
This paper develops a new sensing algorithm, called Wi-Fi Sensing with AGing (WiSAG), and demonstrates that WiSAG outperforms the existing sensing algorithms up to 37% through extensive trace-driven simulations for which real mobility traces gathered from hundreds of smartphones is used.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

7. Affordable and Clean Energy
(OpenAlex)

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2016 journal article

Exploiting Heterogeneity for Improving Forwarding Performance in Mobile Opportunistic Networks: An Analytic Approach

*IEEE TRANSACTIONS ON MOBILE COMPUTING*, *15*(1), 150–162.

author keywords: Mobile opportunistic networks; heterogeneous contact behaviors between different mobile nodes; heterogeneity-aware forwarding policies; forwarding performance; performance analysis

TL;DR:
An analytical framework is developed to quantify the performance gain achievable by exploiting the heterogeneity in mobile nodes' contact dynamics and derive a delay upper bound of a heterogeneity-aware static forwarding policy per each given number of message copies, which enables a quantitative study on the benefit of leveraging underlying heterogeneity structure in the design of forwarding algorithms.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

16. Peace, Justice and Strong Institutions
(OpenAlex)

Source: Web Of Science

Added: August 6, 2018

2016 journal article

Optimal CSMA Scheduling With Look Ahead Mechanism for Wireless Networks

*IEEE WIRELESS COMMUNICATIONS LETTERS*, *5*(5), 508–511.

author keywords: Optimal CSMA; distributed link scheduling; low delay; throughput optimality; multihop wireless network

TL;DR:
This work proposes looks ahead (LA)-CSMA algorithm in which each link LA its state update in advance and utilizes this free information during the contention stage of Q-CSMA, thereby leading to significantly smaller delay without any additional overhead.
(via Semantic Scholar)

Source: Web Of Science

Added: August 6, 2018

2016 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.

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

2015 journal article

Characterizing link connectivity in opportunistic networks

*Opportunistic Mobile Social Networks*, 71–97.

Source: NC State University Libraries

Added: August 6, 2018

2015 conference paper

Modeling time-sensitive information diffusion in online social networks

*2015 ieee conference on computer communications workshops (infocom wkshps)*, 408–413.

Source: NC State University Libraries

Added: August 6, 2018

2015 conference paper

On the efficiency-optimal Markov chains for distributed networking applications

*2015 ieee conference on computer communications (infocom)*.

Source: NC State University Libraries

Added: August 6, 2018

2014 conference paper

A general framework of hybrid graph sampling for complex network analysis

*2014 proceedings ieee infocom*, 2795–2803.

Source: NC State University Libraries

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.

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.

Source: NC State University Libraries

Added: August 6, 2018

2013 journal article

On the Forwarding Performance under Heterogeneous Contact Dynamics in Mobile Opportunistic Networks

*IEEE TRANSACTIONS ON MOBILE COMPUTING*, *12*(6), 1107–1119.

author keywords: Mobile opportunistic networks; heterogeneous contact dynamics; non-Poisson contact dynamics; forwarding performance; stochastic/convex ordering relationships

TL;DR:
This paper considers two representative heterogeneous network models, each of which captures heterogeneity among node pairs and heterogeneity in underlying environment (spatial), respectively, and demonstrates that the heterogeneity in mobile nodes' contact dynamics should be properly taken into account for the performance evaluation of forwarding algorithms.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(OpenAlex)

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2011 conference paper

Smart sleep: sleep more to reduce delay in duty-cycled wireless sensor networks

*2011 proceedings ieee infocom*, 611–615.

UN Sustainable Development Goal Categories

7. Affordable and Clean Energy
(OpenAlex)

Source: NC State University Libraries

Added: August 6, 2018

2010 conference paper

A Distributed Wake-up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks

*2010 ieee global telecommunications conference globecom 2010*.

UN Sustainable Development Goal Categories

7. Affordable and Clean Energy
(OpenAlex)

Source: NC State University Libraries

Added: August 6, 2018

2010 conference paper

Age invariant regime for multi-source content update in mobile opportunistic networks

*2010 ieee global telecommunications conference globecom 2010*.

Source: NC State University Libraries

Added: August 6, 2018

2010 journal article

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

*IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS*, *21*(10), 1487–1500.

author keywords: Computer network performance; P2P networks

TL;DR:
This paper investigates the relationship among the average download time, system utilization, and the level of competition among downloading peers in a stochastic P2P network, and derives an achievable lower bound on theaverage download time and proposes algorithms to give the peers the minimum average downloading time.
(via Semantic Scholar)

Source: Web Of Science

Added: August 6, 2018

2010 journal article

Superdiffusive Behavior of Mobile Nodes and Its Impact on Routing Protocol Performance

*IEEE TRANSACTIONS ON MOBILE COMPUTING*, *9*(2), 288–304.

author keywords: Mobility models; trace-based models; superdiffusion; mobile ad hoc networks; routing protocols

TL;DR:
The work in this paper suggests that the diffusive behavior of mobile nodes should be correctly captured and taken into account for the design and comparison study of network protocols.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2009 journal article

Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks

*IEEE-ACM TRANSACTIONS ON NETWORKING*, *17*(5), 1578–1591.

author keywords: Bounded domain; exponential versus power-law; intermeeting time distribution; mobile ad hoc network (MANET); time and space scaling

TL;DR:
It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the intermeeting time and that by simply removing the boundary in a simple two-dimensional isotropic random walk model, one is able to obtain the empirically observed power-law decay of the IntermeetingTime.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

16. Peace, Justice and Strong Institutions
(OpenAlex)

Source: Web Of Science

Added: August 6, 2018

2009 conference paper

Heterogeneity in contact dynamics: Helpful or harmful to forwarding algorithms in DTNs?

*2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless*, 72–81.

Source: NC State University Libraries

Added: August 6, 2018

2009 article

Multicast Scheduling in Cellular Data Networks

Won, H., Cai, H., Eun, D. Y., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2009, September). *IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS*, Vol. 8, pp. 4540–4549.

author keywords: Multicast scheduling; 3G; downlink schedule; optimization; proportional fair; cellular data networks

TL;DR:
It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups.
(via Semantic Scholar)

Source: Web Of Science

Added: August 6, 2018

2009 journal article

Stochastic convex ordering for multiplicative decrease internet congestion control

*COMPUTER NETWORKS*, *53*(3), 365–381.

author keywords: High-speed TCP; Convex ordering; Window growth function

TL;DR:
A new stochastic tool, called convex ordering, is presented that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2008 journal article

Achieving 100% throughput in TCP/AQM under aggressive packet marking with small buffer

*IEEE-ACM TRANSACTIONS ON NETWORKING*, *16*(4), 945–956.

author keywords: router buffer sizing; small buffer; stochastic modeling; transmission control protocol

TL;DR:
By capturing randomness both in packet arrivals and in packet markings, a doubly-stochastic model for a TCP/AQM system with many flows is developed and it is proved that the system always performs well in the sense that the link utilization goes to 100% and the loss ratio decreases to zero as the system size JV increases.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2008 article

Impact of super-diffusive behavior on routing performance in delay tolerant networks

*2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13*, pp. 2941–2945.

UN Sustainable Development Goal Categories

3. Good Health and Well-being
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2008 article

Invariance property of isotropic random walk mobility patterns in mobile ad-hoc networks

*2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13*, pp. 2141–2145.

Source: Web Of Science

Added: August 6, 2018

2008 article

Minimizing file download time in stochastic peer-to-peer networks

Chiu, Y.-M., & Eun, D. Y. (2008, April). *IEEE-ACM TRANSACTIONS ON NETWORKING*, Vol. 16, pp. 253–266.

author keywords: network performance; peer-to-peer network; peer selection strategy

TL;DR:
It is rigorously proved that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then a simple, distributed algorithm is analyzed to effectively remove these negative factors, thus minimizing theaverage download time.
(via Semantic Scholar)

Source: Web Of Science

Added: August 6, 2018

2008 journal article

Super-diffusive behavior of mobile nodes from GPS traces

*ACM SIGMOBILE Mobile Computing and Communications Review*, *12*(1), 28.

UN Sustainable Development Goal Categories

16. Peace, Justice and Strong Institutions
(OpenAlex)

Source: Crossref

Added: June 14, 2019

2008 article

Tuning up the performance of constant-time distributed scheduling algorithms via majorization

*2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13*, pp. 2931–2935.

Source: Web Of Science

Added: August 6, 2018

2007 journal article

A dynamic TCP-Aware call admission control scheme. for generic next generation packet-switched wireless networks

*IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS*, *6*(9), 3344–3352.

author keywords: admission control; wireless networks; TCP

TL;DR:
This work proposes a TCP-aware CAC scheme to regulate the packet-level dynamics of TCP flows and demonstrates that the proposed scheme can effectively improve the system performance in terms of call blocking probability, call-level throughput (call/min) and link utilization.
(via Semantic Scholar)

Sources: Web Of Science, NC State University Libraries

Added: August 6, 2018

2007 article

Local and global stability of TCP-newReno/RED with many flows

Wang, X., & Eun, D. Y. (2007, March 8). *COMPUTER COMMUNICATIONS*, Vol. 30, pp. 1091–1105.

author keywords: TCP; NewReno; local stability; global stability

TL;DR:
A normalized discrete-time model is presented to capture the essential dynamics of TCP- newReno/RED with many flows and obtain its local stability criterion and shows that by properly choosing some 'free' parameters, it can always ensure that a locally stable TCP-newR Reno/RED system is in fact globally stable.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2007 article

On the limitation of fluid-based approach for Internet congestion control

Eun, D. Y. (2007, February). *TELECOMMUNICATION SYSTEMS*, Vol. 34, pp. 3–11.

author keywords: congestion control; fluid modeling; markov chains; stability analysis

TL;DR:
It is proved that the equilibrium point of a fluid model can be quite different from the true average rate of the corresponding stochastic system, which implies that the current congestion control design can be much more flexible, to the benefit of efficient usage of network resources.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2007 journal article

Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes

*COMPUTER NETWORKS*, *51*(12), 3655–3671.

author keywords: congestion control; buffer sizing; active queue management; discrete-time stochastic models; performance analysis

TL;DR:
A stochastic model in a discrete-time setting is developed and it is shown that it can have 100% link utilization and zero packet loss probability for a large number of flows when the buffer size is chosen anywhere between O(N) and O( N).
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2005 journal article

Network decomposition: Theory and practice

*IEEE-ACM TRANSACTIONS ON NETWORKING*, *13*(3), 526–539.

author keywords: aggregation; many-sources-asymptotic; network decomposition; overflow probability; performance analysis

TL;DR:
A network decomposition approach in which network analysis can be greatly simplified, and it is proved that the queue length at the downstream queue converges to that of a single queue obtained by removing the upstream queue, as the capacity and the number of flows at the upstream queues increase.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2004 journal article

Analyzing a two-stage queueing system with many point process arrivals at upstream queue

*QUEUEING SYSTEMS*, *48*(1-2), 23–43.

author keywords: queueing networks; overflow probability; many-sources-asymptotic; point processes

TL;DR:
It is shown that as the capacity and the number of flows aggregated at the upstream queue increases, the overflow probability at the downstream queue converges to that of a simplified single queue obtained by removing the upstream queues from the original two-stage queueing system.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2004 journal article

Network decomposition in the many-sources regime

*ADVANCES IN APPLIED PROBABILITY*, *36*(3), 893–918.

author keywords: aggregation; queueing network; many-sources asymptotic; speed of convergence

TL;DR:
This model consists of a two-stage queueing system where the first queue serves many flows, of which a certain subset arrive at the second queueing queue, and it is proved that, as the number of flows being aggregated in the upstream queue increases, the overflow probability of the downstream queue converges uniformly in the buffer level.
(via Semantic Scholar)

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: August 6, 2018

2004 journal article

Network decomposition in the many-sources regime

*Advances in Applied Probability*, *36*(03), 893–918.

Source: Crossref

Added: February 24, 2020

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© (2024) 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.