Parity‐check is a simple yet effective error detection method. Several other more sophisticated error detection techniques are founded upon single parity‐check (SPC). Exclusive‐OR (XOR) is known as the parity generator in binary logic. This study suggests some multi‐valued parity generators (MPGs), studies their behaviour, and provides a full discussion about their necessary and optional properties. The concept of Sudoku with some customised rules is used to create MPGs, which are the extended versions of binary parity generator in higher radixes. They are capable of revealing all single‐digit errors. Additionally, they can detect incorrect data delivery with high probability when more than one error occurs (with even higher probability than XOR). The probability of error detection is analytically calculated for the occurrence of two to five errors in different bases. The calculations are then experimentally verified by a formal verification method. The authors’ investigations show that error detection probability increases in higher radixes, and it is independent of dataword size.

Abstract Freshness of certificate status information is very important in validating public key certificates. However, existing certificate validation schemes suffer from high inconsistency, which makes network vulnerable to various security attacks. In this paper, we propose a new publish/subscribe‐based certificate validation scheme that provides fresh certificate status information in the mobile ad hoc networks. This scheme increases the security of public key infrastructure‐based security systems and improves the scalability of certificate validation systems. Also, according to the simulation results, our solution effectively decreases the processing overheads on responder nodes and reduces the messaging overhead of certificate status validations in mobile ad hoc networks. Copyright © 2014 John Wiley & Sons, Ltd.

Mobile Ad-hoc Networks (MANET) are multi-hop wireless packet networks in which all the nodes cooperatively maintain the network connectivity without the aid of infrastructure networks. This paper proposes a new Distributed Fuzzy Score-based Clustering Algorithm (DFSCA) for MANETs. The proposed Clustering Algorithm considers the Battery Remaining, Number of Neighbors, Number of Members, and Stability in order to calculate the node's score with a Fuzzy inference algorithm. After each node calculates its score independently, the neighbors of the node must be notified about it. Also each node selects one of its neighbors with the highest score to be its cluster head and, therefore the selection of cluster heads is performed in a distributed manner with most recent information about current status of neighbor nodes. The proposed algorithm is compared with Weighted Clustering Algorithm and Fuzzy Cluster Mean algorithm in terms of number of clusters, lifespan of nodes in the system and the end-to-end throughput. The simulation results proved that the proposed algorithm has achieved the goals.