Abstract: A vehicle driving with an Adaptive Cruise Control
System (ACC) is usually controlled decentrally, based on the
information of radar systems and in some publications based on
C2X-Communication (CACC) to guarantee stable platoons. In this
paper we present a Model Predictive Control (MPC) design of a
centralized, server-based ACC-System, whereby the vehicular platoon
is modeled and controlled as a whole. It is then proven that the
proposed MPC design guarantees asymptotic stability and hence
string stability of the platoon. The Networked MPC design is
chosen to be able to integrate system constraints optimally as well
as to reduce the effects of communication delay and packet loss.
The performance of the proposed controller is then simulated and
analyzed in an LTE communication scenario using the LTE/EPC
Network Simulator LENA, which is based on the ns-3 network
simulator.
Abstract: Adapting wireless devices to communicate within grid
networks empowers us by providing range of possibilities.. These
devices create a mechanism for consumers and publishers to create
modern networks with or without peer device utilization. Emerging
mobile networks creates new challenges in the areas of reliability,
security, and adaptability. In this paper, we propose a system
encompassing mobility management using AAA context transfer for
mobile grid networks. This system ultimately results in seamless task
processing and reduced packet loss, communication delays,
bandwidth, and errors.
Abstract: This paper addresses the design of predictive
networked controller with adaptation of a communication delay. The
networked control system contains random delays from sensor to
controller and from controller to actuator. The proposed predictive
controller includes an adaptation loop which decreases the influence
of communication delay on the control performance. Also, the
predictive controller contains a filter which improves the robustness
of the control system. The performance of the proposed adaptive
predictive controller is demonstrated by simulation results in
comparison with PI controller and predictive controller with constant
delay.
Abstract: This paper proposes a delay-dependent leader-following consensus condition of multi-agent systems with both communication delay and probabilistic self-delay. The proposed methods employ a suitable piecewise Lyapunov-Krasovskii functional and the average dwell time approach. New consensus criterion for the systems are established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. Numerical example showed that the proposed method is effective.
Abstract: CloudSim is a useful tool to simulate the cloud
environment. It shows the service availability, the power consumption,
and the network traffic of services on the cloud environment.
Moreover, it supports to calculate a network communication delay
through a network topology data easily. CloudSim allows inputting a
file of topology data, but it does not provide any generating process.
Thus, it needs the file of topology data generated from some other
tools. The BRITE is typical network topology generator. Also, it
supports various type of topology generating algorithms. If CloudSim
can include the BRITE, network simulation for clouds is easier than
existing version. This paper shows the potential of connection between
BRITE and CloudSim. Also, it proposes the direction to link between
them.
Abstract: Decrease in hardware costs and advances in computer
networking technologies have led to increased interest in the use of
large-scale parallel and distributed computing systems. One of the
biggest issues in such systems is the development of effective
techniques/algorithms for the distribution of the processes/load of a
parallel program on multiple hosts to achieve goal(s) such as
minimizing execution time, minimizing communication delays,
maximizing resource utilization and maximizing throughput.
Substantive research using queuing analysis and assuming job
arrivals following a Poisson pattern, have shown that in a multi-host
system the probability of one of the hosts being idle while other host
has multiple jobs queued up can be very high. Such imbalances in
system load suggest that performance can be improved by either
transferring jobs from the currently heavily loaded hosts to the lightly
loaded ones or distributing load evenly/fairly among the hosts .The
algorithms known as load balancing algorithms, helps to achieve the
above said goal(s). These algorithms come into two basic categories -
static and dynamic. Whereas static load balancing algorithms (SLB)
take decisions regarding assignment of tasks to processors based on
the average estimated values of process execution times and
communication delays at compile time, Dynamic load balancing
algorithms (DLB) are adaptive to changing situations and take
decisions at run time.
The objective of this paper work is to identify qualitative
parameters for the comparison of above said algorithms. In future this
work can be extended to develop an experimental environment to
study these Load balancing algorithms based on comparative
parameters quantitatively.
Abstract: With the increasing number of on-chip components and the critical requirement for processing power, Chip Multiprocessor (CMP) has gained wide acceptance in both academia and industry during the last decade. However, the conventional bus-based onchip communication schemes suffer from very high communication delay and low scalability in large scale systems. Network-on-Chip (NoC) has been proposed to solve the bottleneck of parallel onchip communications by applying different network topologies which separate the communication phase from the computation phase. Observing that the memory bandwidth of the communication between on-chip components and off-chip memory has become a critical problem even in NoC based systems, in this paper, we propose a novel 3D NoC with on-chip Dynamic Random Access Memory (DRAM) in which different layers are dedicated to different functionalities such as processors, cache or memory. Results show that, by using our proposed architecture, average link utilization has reduced by 10.25% for SPLASH-2 workloads. Our proposed design costs 1.12% less execution cycles than the traditional design on average.