The Experts below are selected from a list of 3657 Experts worldwide ranked by ideXlab platform
Dan Keun Sung - One of the best experts on this subject based on the ideXlab platform.
-
aggregate throughput maximization in a hierarchical cooperation scheme under consideration of Packet Arrival Rate control and data overhead
Wireless Communications and Networking Conference, 2013Co-Authors: Inkyu Bang, Eunmi Chu, Taehoon Kim, Seong Hwan Kim, Dan Keun SungAbstract:The conventional hierarchical cooperation (HC) scheme proposed by Ozgur et al. [1] is a novel communication scheme that can achieve linear capacity scaling, O(N) in wireless ad-hoc network from the viewpoint of information theory without considering control and data overhead. In this paper, we investigate the effects of practical parameters such as Packet Arrival Rate, control overhead and data overhead on the HC scheme. We formulate an aggregate throughput optimization problem in terms of cluster size m and solve it by well-known algorithms. Through the performance evaluations, we observe three main effects of the practical parameters. First, large data overhead ratio degrades the aggregate throughput. 31% performance degradation occurs when we consider data overhead ratio α = 0.45. Second, large control overhead also degrades the aggregate throughput and affects to determine the cluster size m for maximum aggregate throughput. Third, the Packet Arrival Rate λ plays a key factor for system stability and we obtain a sufficient condition for system stability.
-
WCNC - Aggregate throughput maximization in a hierarchical cooperation scheme under consideration of Packet Arrival Rate, control and data overhead
2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013Co-Authors: Inkyu Bang, Eunmi Chu, Taehoon Kim, Seong Hwan Kim, Dan Keun SungAbstract:The conventional hierarchical cooperation (HC) scheme proposed by Ozgur et al. [1] is a novel communication scheme that can achieve linear capacity scaling, O(N) in wireless ad-hoc network from the viewpoint of information theory without considering control and data overhead. In this paper, we investigate the effects of practical parameters such as Packet Arrival Rate, control overhead and data overhead on the HC scheme. We formulate an aggregate throughput optimization problem in terms of cluster size m and solve it by well-known algorithms. Through the performance evaluations, we observe three main effects of the practical parameters. First, large data overhead ratio degrades the aggregate throughput. 31% performance degradation occurs when we consider data overhead ratio α = 0.45. Second, large control overhead also degrades the aggregate throughput and affects to determine the cluster size m for maximum aggregate throughput. Third, the Packet Arrival Rate λ plays a key factor for system stability and we obtain a sufficient condition for system stability.
-
Queueing model of sleep-mode operation in cellular digital Packet data
IEEE Transactions on Vehicular Technology, 2003Co-Authors: Sun Jong Kwon, Yun Won Chung, Dan Keun SungAbstract:Cellular digital Packet data (CDPD) provides a sleep-mode operation for power conservation in mobile end systems (M-ESs). We perform a theoretical analysis of sleep-mode operation for CDPD. Sleep-mode operation is modeled as an M/sup X//G/1/L queueing system with an attention span and multiple vacations with an exceptional first vacation. The steady-state probabilities of the queueing system, the frame loss probability, the expected frame waiting time, and the percentage of time in the sleep period are derived. Sleep-mode performance is evaluated for varying Packet Arrival Rate, buffer length, and timers' values using the queueing model. Sleep mode in an M-ES occurs when the Packet Arrival Rate for the M-ES is low. When the M-ES is in sleep mode, the expected frame waiting time depends on the T204 value. To keep the frame loss probability low for M-ES in sleep mode, the mobile data intermediate system buffer should be sufficiently large. Sleep mode can efficiently reduce power consumption by selecting a low value for timer T203 and a high value for timer T204.
Jinsheng Sun - One of the best experts on this subject based on the ideXlab platform.
-
A simple active queue management based on the prediction of the Packet Arrival Rate
Journal of Network and Computer Applications, 2014Co-Authors: Jinsheng SunAbstract:Abstract In this paper, we predict the change in the Packet Arrival Rate at the link through the analysis of the network congestion control mechanism. An appropriate expression for dropping probability is derived based on this prediction to stabilize the queue length to the desired value. A new Active Queue Management (AQM) algorithm named as Straightforward AQM (SFAQM) is proposed with simple implementation. Its analysis of the stability is also carried out, and the necessary and sufficient condition for the system to be stable is presented. The simulation results using NS2 demonstRate that SFAQM is effective in different network environments. Compared to the conventional AQM controllers, such as PI, RaQ and CARED, SFAQM has smaller queue length jitter and faster convergence speed.
Inkyu Bang - One of the best experts on this subject based on the ideXlab platform.
-
aggregate throughput maximization in a hierarchical cooperation scheme under consideration of Packet Arrival Rate control and data overhead
Wireless Communications and Networking Conference, 2013Co-Authors: Inkyu Bang, Eunmi Chu, Taehoon Kim, Seong Hwan Kim, Dan Keun SungAbstract:The conventional hierarchical cooperation (HC) scheme proposed by Ozgur et al. [1] is a novel communication scheme that can achieve linear capacity scaling, O(N) in wireless ad-hoc network from the viewpoint of information theory without considering control and data overhead. In this paper, we investigate the effects of practical parameters such as Packet Arrival Rate, control overhead and data overhead on the HC scheme. We formulate an aggregate throughput optimization problem in terms of cluster size m and solve it by well-known algorithms. Through the performance evaluations, we observe three main effects of the practical parameters. First, large data overhead ratio degrades the aggregate throughput. 31% performance degradation occurs when we consider data overhead ratio α = 0.45. Second, large control overhead also degrades the aggregate throughput and affects to determine the cluster size m for maximum aggregate throughput. Third, the Packet Arrival Rate λ plays a key factor for system stability and we obtain a sufficient condition for system stability.
-
WCNC - Aggregate throughput maximization in a hierarchical cooperation scheme under consideration of Packet Arrival Rate, control and data overhead
2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013Co-Authors: Inkyu Bang, Eunmi Chu, Taehoon Kim, Seong Hwan Kim, Dan Keun SungAbstract:The conventional hierarchical cooperation (HC) scheme proposed by Ozgur et al. [1] is a novel communication scheme that can achieve linear capacity scaling, O(N) in wireless ad-hoc network from the viewpoint of information theory without considering control and data overhead. In this paper, we investigate the effects of practical parameters such as Packet Arrival Rate, control overhead and data overhead on the HC scheme. We formulate an aggregate throughput optimization problem in terms of cluster size m and solve it by well-known algorithms. Through the performance evaluations, we observe three main effects of the practical parameters. First, large data overhead ratio degrades the aggregate throughput. 31% performance degradation occurs when we consider data overhead ratio α = 0.45. Second, large control overhead also degrades the aggregate throughput and affects to determine the cluster size m for maximum aggregate throughput. Third, the Packet Arrival Rate λ plays a key factor for system stability and we obtain a sufficient condition for system stability.
Michele Zorzi - One of the best experts on this subject based on the ideXlab platform.
-
sr arq Packet delay statistics on markov channels in the presence of variable Arrival Rate
IEEE Transactions on Wireless Communications, 2006Co-Authors: Leonardo Badia, Michele Rossi, Michele ZorziAbstract:In this letter we investigate the Packet delay statistics of a fully reliable selective repeat ARQ scheme by considering a discrete time Markov channel with non-instantaneous feedback and assigned round-trip delay m. Our focus is on studying the impact of the Arrival process on the delay experienced by a Packet. An exact model is introduced to represent the system constituted by the transmitter buffer, the m round-trip slots, and the channel state. By means of this model, we evaluate and discuss the delay statistics and we analyze the impact of the system parameters, in particular the Packet Arrival Rate, on the delay statistics
-
Some results on the statistics of delay terms in SR ARQ on Markov channels
2005 2nd International Symposium on Wireless Communication Systems, 1Co-Authors: Leonardo Badia, Michele Rossi, Michele ZorziAbstract:In this paper we explore the Packet delay statistics of a selective repeat ARQ scheme on a discrete time Markov channel with non-instantaneous round trip delay. In particular, we are interested in obtaining considerations about the queueing delay of the process and also possible comparisons between different delay components. For this reason, we analyze in detail the impact of system parameters, such as the Packet Arrival Rate and the Packet error probability, on the terms which constitute the overall delay. Finally, we explore the connection of these numerical evaluations with the QoS requirements connected to delay for multimedia traffic.
Richard M Murray - One of the best experts on this subject based on the ideXlab platform.
-
kalman filtering over a Packet dropping network a probabilistic approach
International Conference on Control Automation Robotics and Vision, 2008Co-Authors: Michael Epstein, Richard M MurrayAbstract:We consider the problem of state estimation of a discrete time process over a Packet dropping network. Previous pioneering work on Kalman filtering with intermittent observations is concerned with the asymptotic behavior of E[Pk], i.e., the expected value of the error covariance, for a given Packet Arrival Rate. We consider a different performance metric, Pr[Pk les M], i.e., the probability that Pk is bounded by a given M, and we derive lower and upper bounds on Pr[Pk les M]. We are also able to recover the results in the literature when using Pr[Pk les M] as a metric for scalar systems. Examples are provided to illustRate the theory developed in the paper.
-
control over a Packet dropping network with norm bounded uncertainties
Asian Journal of Control, 2008Co-Authors: Ling Shi, M Epstein, Richard M MurrayAbstract:In this paper, we consider a robust networked control problem. We consider linear unstable and uncertain discrete time plants with a network between the sensor and controller as well as between the controller and plant. We investigate the effect of data dropout in the form of Packet losses and we focus on the tradeoff between Packet Arrival Rate versus the uncertainties of the system dynamics. We show that the minimum Packet Arrival Rate and the maximum uncertainty of the system dynamics have a positive correlation. Four distinct control schemes are explored and serve as examples to study this tradeoff. We derive sufficient condition for each scheme to ensure almost sure stability of the closed loop system. Simulation and examples are provided to assist the theory. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society
-
Networked control systems with norm bounded uncertainties: a stability analysis
2006 American Control Conference, 2006Co-Authors: Ling Shi, M Epstein, Richard M MurrayAbstract:In this paper, we consider a robust networked control problem. We consider linear unstable and uncertain discrete time plants with networks between the sensors and controller as well as the controller and plant. We investigate two defining characteristics of networked control systems and the impact uncertainty has on these. Namely, the minimum data Rates required for the two networks and the tolerable data drop out in the form of Packet losses. We are able to derive sufficient conditions in terms of the minimum data Rate and minimum Packet Arrival Rate to ensure stability of the closed loop system.
