All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 14 of 14

Showing per page

A chaos-based secure cluster protocol for wireless sensor networks

Qian Fang, Ying Liu, Xiaoqun Zhao (2008)

Kybernetika

Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...

A model of route lifetime optimization with linguistic knowledge in wireless ad-hoc networks.

E. Natsheh, S. Khatun, A. Jantan (2006)

Mathware and Soft Computing

Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been and continues to be a very active and fruitful research protocol since its introduction in the wireless ad-hoc networks. AODV uses a static value for its route lifetime parameter called Active Route Timeout (ART) which indicates the time that the route can stay active in the routing table. Route lifetime may be more accurately determined dynamically via measurement, instead of static value. To accomplish this, the fuzzy logic system...

Deciding knowledge in security protocols under some e-voting theories

Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...

Deciding knowledge in security protocols under some e-voting theories

Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier (2011)

RAIRO - Theoretical Informatics and Applications

In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several...

Design of the state predictive model following control system with time-delay

Dazhong Wang, Shujing Wu, Shigenori Okubo (2009)

International Journal of Applied Mathematics and Computer Science

Time-delay systems exist in many engineering fields such as transportation systems, communication systems, process engineering and, more recently, networked control systems. It usually results in unsatisfactory performance and is frequently a source of instability, so the control of time-delay systems is practically important. In this paper, a design of the state predictive model following control system (PMFCS) with time-delay is discussed. The bounded property of the internal states for the control...

Model following control system with time delays

Dazhong Wang, Shujing Wu, Wei Zhang, Guoqiang Wang, Fei Wu, Shigenori Okubo (2016)

Kybernetika

Design of model following control system (MFCS) for nonlinear system with time delays and disturbances is discussed. In this paper, the method of MFCS will be extended to nonlinear system with time delays. We set the nonlinear part f ( v ( t ) ) of the controlled object as | | f ( v ( t ) ) | | ≤ α + β | | v ( t ) | | γ , and show the bounded of internal states by separating the nonlinear part into γ ≥ 0 . Some preliminary numerical simulations are provided to demonstrate the effectiveness of the proposed method.

Prognosis and optimization of homogeneous Markov message handling networks

Pavel Boček, Tomáš Feglar, Martin Janžura, Igor Vajda (2001)

Kybernetika

Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical...

Stability and throughput improvement for multichannel CSMA and CSMA/CD protocols with optimal bandwidth allocation

Ioannis E. Pountourakis (2000)

Kybernetika

This paper examines appropriate protocols for high speed multiple access communication systems where the bandwidth is divided into two separate asymmetric channels. Both channels operate using slotted non-persistent CSMA or CSMA/CD techniques. Free stations access the first channel while all retransmissions occur in the second channel. We define the stability regions and the rules for optimal bandwidth allocation among the two channels for improvement of the system performance in case of infinite...

Currently displaying 1 – 14 of 14

Page 1