Page 1 Next

Displaying 1 – 20 of 206

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 note on generic chaos

Gongfu Liao (1994)

Annales Polonici Mathematici

We consider dynamical systems on a separable metric space containing at least two points. It is proved that weak topological mixing implies generic chaos, but the converse is false. As an application, some results of Piórek are simply reproved.

A note on strange nonchaotic attractors

Gerhard Keller (1996)

Fundamenta Mathematicae

For a class of quasiperiodically forced time-discrete dynamical systems of two variables (θ,x) ∈ T 1 × + with nonpositive Lyapunov exponents we prove the existence of an attractor Γ̅ with the following properties:  1. Γ̅ is the closure of the graph of a function x = ϕ(θ). It attracts Lebesgue-a.e. starting point in T 1 × + . The set θ:ϕ(θ) ≠ 0 is meager but has full 1-dimensional Lebesgue measure.  2. The omega-limit of Lebesgue-a.e point in T 1 × + is Γ ̅ , but for a residual set of points in T 1 × + the omega limit is the...

Currently displaying 1 – 20 of 206

Page 1 Next