This paper discusses the algorithms for achieving global states and self-stabilization for communication protocols. It first describes a primary algorithm including its suitability for achieving global states and limitation of self-stabilization for communication protocols. and then presents an impr...

A concept of secret sharing scheme with the function of assignment is proposed. It provides great capabilities for many practical applications. In this scheme, the dealer can randomly assign one or more than one participant to get the secret at any time, but these participants can get nothing about ...

In networks, the stable path problem (SPP) usually results in oscillations in interdomain systems and may cause systems to become unstable. With the rapid development of internet technology, the occurrence of SPPs in interdomain systems has quite recently become a significant focus of research. A fr...

Many practical systems in physics, biology, engineering and information science exhibit impulsive dynamical behaviors due to abrupt changes at certain instants during the dynamical processes. The problems of finite-time stability analysis are investigated for a class of Markovian switching stochasti...

In Delay Tolerant Networks (DTNs), some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Informatio...