The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the clock synchronization problem in wireless mobile ad hoc networks in the presence of Byzantine nodes. The communication topology is dynamic: nodes move randomly within a geographical area. We propose a clock synchronization protocol which is based on the linear approximate consensus method. Periodically each correct node broadcasts its current timestamp and gathers the timestamps provided...
A brief analysis of improved effectiveness and reliability of the third-generation Automatic Link Establishment (ALE) system is presented by comparing the performance with the second generation. And the channel coding theory in the second and third-generation ALE system is also introduced separately. With the channel coding performance simulation results, we conclude that there is an obviously improvement...
In the application of target tracking based on dynamic convey tree-based collaboration (DCTC) in wireless sensor networks, collisions and interferences among nodes pose a challenge for data aggregation. In this paper, we refine slot allocation to the nodes in dynamic convey tree and design an energy efficient MAC protocol called D-TDMA, which avoids collisions and interferences and allocates contiguous...
Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection,...
By analyzing the data transmission Collisions for wireless sensor networks, due to the shortage of energy efficiency and latency in MAC protocol, we propose a distributed TDMA scheduling protocol based on coloring algorithm (TDMA-CA), which uses spatial reuse of transmission channel. It allocates different colors for conflict nodes in the networks, and arranges distinct slots for data transmission...
We consider a mutable distributed storage system that protects data using systematic linear k-of-n codes. Such a system may get into a partial updated state if some failures occur, and may become unrecoverable even though there are k+ living bricks (for they may be inconsistent with each other). General recovery mechanisms judge whether the system is recoverable according to the maximum number of...
Replication plays an important role in fault tolerant field which can improve the availability of distributed systems. After analyzing two shortcomings of the passive replication approach, which are update backup state frequently and slow recovery after the primary fault, this paper proposes a non-blocking consistent model, NBPRC. NBPRC satisfies the correctness criteria of passive replication that...
Most of proposed threshold proxy signature schemes have been based on discrete logarithms which required for a protocol to generate and verify a shared secret among the proxy group. Therefore, it is necessary for the proxy signers to perform many expensive modular exponential operations and communications to obtain and verify a shared secret. Moreover, most of the existing threshold proxy signature...
In distributed systems that use active replication to achieve robustness, it is important to efficiently enforce consistency among replicas. The nonblocking mode helps to speed up system execution. Unfortunately, this benefit comes at the expense of introducing decision conflicts when the replicas form a single logical token ring and client requests are processed in sequence following the ring. In...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.