A continuous state space model of multiple service, multiple resource communication networks
نویسندگان
چکیده
منابع مشابه
A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملStability of multiple access communication networks
The problem of stability of different multiple access schemes in computer networks is discussed. The results for the main multiple access schemes -slotted ALOHA, controlled ALOHA, CSMA, CSMA/CD, polling systems and collision resolution algorithms are surveyed. The techniques used for the stability of these systems have been emphasized.
متن کاملPerformance Management of Multiple Access Communication Networks
AbsfructThis paper focuses on conceptual design, development, and implementation of a performance management tool for computer communication networks to serve large-scale integrated systems. The objective is to improve the network performance in handling various types of messages by on-line adjustment of protocol parameters. The techniques of perturbation analysis of Discrete Event Dynamic Syst...
متن کاملA Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes
Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...
متن کاملState Estimation of Multiple Plants over a Shared Communication Network
This paper considers state estimation for multiple plants over a shared communication network. Each linear time-invariant plant transmits information through the common network according to either a timetriggered or an event-triggered rule. For an event-triggered algorithm with CSMA (carrier sense multiple access), each plant is assumed to access the network based on a priority mechanism. For a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1995
ISSN: 0090-6778
DOI: 10.1109/26.380065