Narrow Results

We present a metaheuristic-based attack against the traceability of an ultra-lightweight authentication protocol for RFID environments called SLMAP, and analyze its implications. The main interest of our approach is that it constitutes a complete black-box technique that does not make any assumptions on the components of the underlying protocol and can thus be easily generalized to analyze many other proposals.

In this paper, we design a novel quantum secret information equal exchange protocol, which implements the equal exchange of secret information between the two parties with the help of semi-trusted third party (TP). In the protocol, EPR pairs prepared by the TP are, respectively, distributed to both the communication parties. Then, the two parties perform Pauli operation on each particle and return the new particles to TP, respectively. TP measures each new pair with Bell basis and announces the measurement results. Both parties deduce the secret information of each other according to the result of announcement by TP. Finally, the security analysis shows that this protocol solves the problem about equal exchange of secret information between two parties and verifies the security of semi-trusted TPs. It proves that the protocol can effectively resist glitch attacks, intercept retransmission attacks and entanglement attack.

The authenticity, privacy, and nonrepudiation of IoT applications are all guaranteed by the ID-Based Signature (IDBS) cryptographic technique. Digital communication presents challenges for information evaluation and removal-back transmission. Security was consequently needed in a cloud-based system to interact with the correct location or nodes. Furthermore, in a cloud-based environment, it is difficult to track a group’s key escrow and secret key generations. We improve group signature security, an identity-based method, to address these problems. The strategy asks a member to sign documents on the group’s behalf. The group manager (GM) membership is controlled by two protocols: join and revoke. The GM may utilize the Open protocol to determine who signed a communication. The classic ID-Based Group Signature (IDBGS) method uses a public-key generator (PKG). This method is founded on difficult mathematical ideas like the computational Diffie–Hellman assumptions. Based on the ID-Based GS system, this technique enhances group members’ identity, legitimacy and visibility. The public key size and signature depend on the group members’ autonomy. The improved method guarantees realistic confirmation of nodes and fortifies them against forgery attempts. This solution promises faster execution and increased dependability for secure nodes.

Country Report.

WHO Update.

This paper discusses a group communication protocol to exchange multimedia messages in a group of multiple peer processes. Quality of Service (QoS) required by an application has to be supported. In traditional protocols like RTP, a process can reliably deliver messages to one or more than one process. In the group communication, each process sends a message to multiple processes while receiving messages from multiple processes in a group. Due to the limited computation and communication capacity, we cannot adopt traditional one-to-one or one-to-many transmission ways to the group communication. We propose a notification-based data transmission procedure to exchange multimedia messages among multiple processes so as to satisfy QoS requirement.

The lack of resources in routers will become a crucial issue with the deployment of state storing protocols. In particular, single or any source multicast protocols will most probably take over large amounts of resources for maintaining multicast tree information. The aim of this paper is to study the possibility and benefit of using multiple shortest paths in order for a new member to reach a multicast tree. Such a mechanism would not reduce the overall amount of state information in the network but it would distribute this amount more evenly among all routers. The idea is to use alternate shortest paths provided by the underlying unicast routing protocol to avoid saturated routers, that is, routers that can not or do not want to store any more multicast state information. As the simulation results are very sensitive to the topology, we have used subgraphs of an Internet map. We have then simulated our multipath join mechanism and have found that depending on the tree size, the use of our mechanism can increase successful join attempts by up to 55% when the network is half saturated.

In this paper we study a new class of generic, parametrized, locally load-sensing (LLS) network-routing protocols over simple graphs, Y. These protocols are Y-"local" in the sense that they transmit packets only between Y-adjacent vertices and LLS since they base their "routing decisions" dynamically on queue-sizes of their neighbors and their relative distance to the destination. In the system each vertex has specific data-queues indexed by its respective Y-neighbors. The state of a vertex then consists of the collection of queue-sizes. The data-transmission protocols are formally specified in the framework of sequential dynamical systems, which allows us to categorize and classify our experiments. We will investigate the following scenario: for fixed Y we assume a single source/destination pair to be given and a system-update then consists of the collection of local protocol updates according to some fixed permutation of the Y-vertices. We then iterate the system-updates and thereby obtain the time evolution of the queue-sizes of the vertices. We will present and discuss results on the evolution of the load, i.e. the total number of packets in the network, the throughput, i.e. the rate at which packets arrive at the destination, and study the dependence of the queue-size dynamics on various other system parameters. In particular, we will analyze update schedule dependency and the impact of queue-capacity on system stability. We will show that our protocols can adapt and dynamically utilize new routes in a fixed network.

While there are already literature surveys upon agent-mediated electronic commerce applications, none have specifically tackled the issue from an interaction perspective or looked at how the control is distributed among the agents. This state-of-the-art survey focuses on how agent interactions are handled. First, it deeply looks at how methods for enforcing the actions taken by agents have been dealt with, namely protocols, negotiation and auction. Second, it defines the various types of communication languages used in multi-agent market architectures. The three main alternatives are KQML, ACL and FLBC. A comparison is then made between them and shows how much they suite their purpose. Third, this paper highlights how the current electronic commerce applications provide explicit and integrated support for complex agent interactions and present several virtual institutions where agents are engaged in multiple bilateral negotiations. Finally, it discusses some related research perspectives and identify some limitations.

Recently, a number of collaborative large-scale mouse mutagenesis programs have been launched. These programs aim for a better understanding of the roles of all individual coding genes and the biological systems in which these genes participate. In international efforts to share phenotypic data among facilities/institutes, it is desirable to integrate information obtained from different phenotypic platforms reliably. Since the definitions of specific phenotypes often depend on a tacit understanding of concepts that tends to vary among different facilities, it is necessary to define phenotypes based on the explicit evidence of assay results. We have developed a website termed PhenoSITE (Phenome Semantics Information with Terminology of Experiments: ), in which we are trying to integrate phenotype-related information using an experimental-evidence–based approach. The site's features include (1) a baseline database for our phenotyping platform; (2) an ontology associating international phenotypic definitions with experimental terminologies used in our phenotyping platform; (3) a database for standardized operation procedures of the phenotyping platform; and (4) a database for mouse mutants using data produced from the large-scale mutagenesis program at RIKEN GSC. We have developed two types of integrated viewers to enhance the accessibility to mutant resource information. One viewer depicts a matrix view of the ontology-based classification and chromosomal location of each gene; the other depicts ontology-mediated integration of experimental protocols, baseline data, and mutant information. These approaches rely entirely upon experiment-based evidence, ensuring the reliability of the integrated data from different phenotyping platforms.

Wireless network of wearable biomedical sensors by human body shows great potential to enhance the biometrics performance significantly. Meanwhile, it poses prominent characteristics and challenges to physicians and engineers for its particular medical application as compared to other application of wireless sensor networks (WSN). Mobility pattern plays an important role in designing the wireless body sensor networks (WBSN) and will also affect the accuracy of modeling WBSN in health care application. Much of the mobility scenarios generated in current work of wireless body sensor networks has used fairly simple models to generate the mobile topological graph, which bear little resemblance to the actual mobility patterns. This paper is the first attempt to investigate the mobility model in WBSN based on the existing mobility models in wireless data networks and ad hoc networks. We first briefly review the existing mobility models in related research areas such as wireless ad hoc network and cellular networks. Further on, we propose a dedicated and more realistic mobility model named BAMM (Body Area Mobility Model) for wireless body sensor networks by concentrating on the unique characteristics of WBSN and finally study the effects of mobility on the performance of WBSN by simulation experiments.

With the mutual promotion and development of computing technology, communication technology and control technology, building control systems by multiple machines has become a trend. The reliability of communication mechanism in these systems is the basic guarantee of system effectiveness. In this paper, a communication mechanism suitable for centralized and distributed control systems is proposed, which attempts to provide an effective framework for the design of communication subsystems in the system. The mechanism includes the logical structure of the communication network, RPC of Client-Server used in a control system, protocol and its basic functions. The basic function of the protocol is concretization and leaves a large expansion space, so this mechanism can be directly applied to the engineering design of medium and small control system, and has good flexibility and scalability.

Beginning with the characteristic of city roads network, this article discusses two algorithms based on abstract network and network topological relation model which gets the shortest path between two points in a city's road net, and the algorithms are implemented with program. At the end of the article, it provides some instance of urban area transportation map as processed object; it makes analysis and comparison of two algorithm's complexity and applicability.

We propose a new Dynamic Address Assignment Protocol for wireless sensor networks. This new protocol is based on the Dynamic Host Configuration Protocol and is modified into wireless sensor networks. The protocol aims to increase the flexibility and agility of wireless sensor networks with changing the amount of sensor nodes in sensor networks system easily. It is well suit for large-scale wireless sensor networks which update their sensor nodes frequently. The goals are achieved by assigning address dynamically and registering in collectors. We present an implement on wireless sensor network and evaluate our approach by discussing the payload ability of a wireless node.

Energy efficiency and lifetime are two vital issues in the research of WSN. The Low-Energy Adaptive Clustering Hierarchy(LEACH) and Low-Energy Adaptive Clustering Hierarchy-centralized(LEACH-C) are classical algorithms where sensor nodes can be divided into different clusters and transmit fuse data to Base Station(BS). This paper proposes an improved algorithm based on LEACH-C, which balances energy consumption in the way of changing the range of nodes that could participate in cluster head selection. Simulation results show that the proposed algorithm can prolong network lifetime effectively.