Secure Group Key Management Protocol for Grid Computing

In any multi–device / party systems supporting GRID and cloud-based applications, an essential constraint of these systems is the need of all tools and participants to interconnect with each other as members of a group in a secure approach. Group key management method is an essential functional element for any protected distributed communication setting. Key distribution method is a crucial factor in securing communication in grid computing. After the secure key management is executed, messages will be able to be securely exchanged between the grid units. A number of protocols have been proposed to maintain secure group key management. In this paper we present a new password base protocol for secure group key management in Grid computing environment, which is organized in two dynamic servicing layers: the grid application that needs grid services, and the grid services that act on behalf of the user.

Multi-Target Coordinated Search Algorithm for Swarm Robotics Considering Practical Constraints

In order to deal with the multi-target search problems for swarm robots in unknown complex environments, a multi-target coordinated search algorithm for swarm robots considering practical constraints is proposed in this paper. Firstly, according to the target detection situation of swarm robots, an ideal search algorithm framework combining the strategy of roaming search and coordinated search is established. Secondly, based on the framework of the multi-target search algorithm, a simplified virtual force model is combined, which effectively overcomes the real-time obstacle avoidance problem in the target search of swarm robots. Finally, in order to solve the distributed communication problem in the multi-target search of swarm robots, a distributed neighborhood communication mechanism based on a time-varying characteristic swarm with a restricted random line of sight is proposed, and which is combined with the multi-target search framework. For the swarm robot kinematics, obstacle avoidance, and communication constraints of swarm robots, the proposed multi-target search strategy is more stable, efficient, and practical than the previous methods. The effectiveness of this proposed method is verified by numerical simulations.

Distributed communication power monitoring system based on big data technology

Communication system has high quality requirements for power supply. Realizing the effective monitoring of power supply system is an important measure to improve power quality. In order to better and effectively manage massive power information in complex environment and avoid communication power failure, a design method of distributed communication power monitoring system based on big data technology is proposed. The system operation performance is proposed, and the software function and operation process of the communication power monitoring system are simplified by using big data technology to improve the system monitoring accuracy. Finally, the experiment shows that the distributed communication power monitoring system based on big data technology has significantly higher response speed and relatively lower monitoring error in the actual application process.

Warranted assertibility and the Internet: A theoretical model for an online proto-research community

In this paper, we suggest that research platforms on the present Internet should offer more diverse pathways for distributed communication, to cope with the idiosyncrasies of a post-truth society. Present platforms adhere to a first-order cybernetic approach, using rule-based systems and algorithms to guide the activity of researchers, and expose them to new research findings and articles based on their preferences. The larger Internet, however, supports communities such as Reddit, that offer opportunities for pragmatic problem-solving that mirrors the ideas of second- order cybernetics, but show much potential for incivility. We first test this assumption using 704 comments responding to 25 top posts pulled from the CoronavirusUS subreddit, using a Python script. Our analyses indicate that a substantial percentage of posts in the subreddit display higher-order reflectivity (what we label transformative critical reflection) which predicts the number of upvotes received by these posts. We also found that karma, or user reputation, is not predicted by interaction between high-order reflectivity and upvotes. This suggests that posts are gauged by quality rather than users’ reputations. From these results, we infer that such communication can be mirrored in online proto-research communities, and streamlined by laying down regulations, appointing moderators, and using algorithms to guide distributed communication, and combat the propensity for chaos arising from emancipation. We lay out our design/vision for such a community, based on a dual-layered reformulation of the Open Source Educative Processes framework.

Efficient data validation for geographical interlocking systems

In this paper, an efficient approach to data validation of distributed geographical interlocking systems (IXLs) is presented. In the distributed IXL paradigm, track elements are controlled by local computers communicating with other control components over local and wide area networks. The overall control logic is distributed over these track-side computers and remote server computers that may even reside in one or more cloud server farms. Redundancy is introduced to ensure fail-safe behaviour, fault-tolerance, and to increase the availability of the overall system. To cope with the configuration-related complexity of such distributed IXLs, the software is designed according to the digital twin paradigm: physical track elements are associated with software objects implementing supervision and control for the element. The objects communicate with each other and with high-level IXL control components in the cloud over logical channels realised by distributed communication mechanisms. The objective of this article is to explain how configuration rules for this type of IXLs can be specified by temporal logic formulae interpreted on Kripke Structure representations of the IXL configuration. Violations of configuration rules can be specified using formulae from a well-defined subset of LTL. By decomposing the complete configuration model into sub-models corresponding to routes through the model, the LTL model checking problem can be transformed into a CTL checking problem for which highly efficient algorithms exist. Specialised rule violation queries that are hard to express in LTL can be simplified and checked faster by performing sub-model transformations adding auxiliary variables to the states of the underlying Kripke Structures. Further performance enhancements are achieved by checking each sub-model concurrently. The approach presented here has been implemented in a model checking tool which is applied by Siemens Mobility for data validation of geographical IXLs.