Scalability is one of the most important problems in Overlay network research. Ant colony optimization was used to improve the widely-used one-hop path routing algorithm(OHPR) in Overlay routing system, and the deploy...
详细信息
Scalability is one of the most important problems in Overlay network research. Ant colony optimization was used to improve the widely-used one-hop path routing algorithm(OHPR) in Overlay routing system, and the deploying and running overload was reduced by maintaining the neighborhood set. Simulation results show that compared with OHPR in an Overlay network with 500 nodes, ant-colony-optimization based one-hop path routing algorithm (ACOHPR) can effectively reduce the querying overload to almost 30 nodes in system routing with no more than 9 ms difference in communication delay.
Through analysis of the process of handoff and existing improvement program, a novel Cache update solution is proposed. It is composed of slice Cache update algorithm, which contains a Cache update trigger mechanism b...
详细信息
Through analysis of the process of handoff and existing improvement program, a novel Cache update solution is proposed. It is composed of slice Cache update algorithm, which contains a Cache update trigger mechanism based on dynamic domain values, AP(access point) load balancing and a Cache update strategy based on slice channel scanning. Experiment results show that this solution can effectively avoid Cache updates when STA (station) is stable and the associated AP's signal is good. While ensuring the timely update of the Cache it can reduce the cost of each Cache update and the handoff delay. Meanwhile the load balancing of each AP can be well considered while choosing the AP. Therefore, the solution is able to significantly improve the mobile terminals handoff performance between AP.
A key pre-distribution scheme is a method by which initially an off-line trusted authority T A distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key fo...
详细信息
A key pre-distribution scheme is a method by which initially an off-line trusted authority T A distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key for secure communication. In this paper we present a keying Material Based key Pre-distribution Scheme, i.e., a group of users, using secret information preloaded in their memory and some public information retrieved from a keying material server, can compute a common key. We first formally define the keying material based key pre-distribution scheme in terms of the entropy, and give lower bounds on the amount of information each user has to keep secret. Then, we describe its applications for sensor networks.
Due to the deficiency of fluid-based (FB) P2P network model in dealing with the stream which could not be divided infinitely, a limitedly dividable stream-based (LDSB) model was studied and proposed for P2P streaming ...
详细信息
Due to the deficiency of fluid-based (FB) P2P network model in dealing with the stream which could not be divided infinitely, a limitedly dividable stream-based (LDSB) model was studied and proposed for P2P streaming networks. A close-form expression of maximum universal streaming rate of LDSB model was given and proved in theory. The results of theoretical analysis and numerical calculation show that the maximum universal streaming rate of LDSB model can not be greater than that of FB model because of the limitation of minimum sub streaming rate. However, with the decrease of minimum sub streaming rate, the performance of LDSB model would approximate to FB model. In addition, by choosing appropriate system parameters such as minimum sub streaming rate and server upload rate, etc., the performance of LDSB system may reach the upper limit of FB model's theoretical performance, and unnecessary waste of resources in system deployment can be avoided.
In order to fulfill the task of prolonging network lifetime, the primary objective of wireless sensor network execution is to consume the battery energy efficiently. The network topology, which is the important founda...
详细信息
In order to fulfill the task of prolonging network lifetime, the primary objective of wireless sensor network execution is to consume the battery energy efficiently. The network topology, which is the important foundation of upper layer protocols, serves as the supportive groundwork for this goal. A significant feature of WSN is application diversity;therefore the topology control techniques under different event scenarios should be obviously different. In searching for a topology control scheme that conforms to the low probability event scenario, a theoretical model of sensor networks is constructed and analyzed. Because the listening cost is the dominating power cost under the low probability event scenario. It turns out that there is consanguineous relationship between network lifetime and the k-center problem, which are dual to each other in the theoretical sense. A periodical clustering algorithm (PCA) based on k-center problem is introduced consequently. PCA is composed of three phases: neighbor discovery phase, head decision phase and node attachment phase. PCA algorithm reflects the thinking of the load balancing, while minimizing the number of cluster heads. The performance of PCA algorithm is analyzed through theoretical model and simulation experiments, which indicates that PCA algorithm can be deployed quickly, and a well-constructed topology and an effectively prolonged network lifetime can be acquired.
According to the weakness of mode of operation, a modified parallelizable message authentication code (MPMAC) is proposed. The mode to process the last block of message is improved to avoid the forgery attack with ran...
详细信息
According to the weakness of mode of operation, a modified parallelizable message authentication code (MPMAC) is proposed. The mode to process the last block of message is improved to avoid the forgery attack with random message by using the fact that the block cipher has same output with the same input using a key. Its security is proved by quantifying the advantage of distinguishing message authentication code from the random function in terms of the quality of the block cipher as a pseudo-random permutation.
The main objective of wireless sensor network design is to fulfill the task of prolonging network lifetime. The network topology, which is the important foundation of upper layer protocols, serves as the supportive gr...
详细信息
The main objective of wireless sensor network design is to fulfill the task of prolonging network lifetime. The network topology, which is the important foundation of upper layer protocols, serves as the supportive groundwork for achieving this goal. In order to design a topology control algorithm that conforms to the lifetime requirement of wireless sensor networks, the defects of previous algorithms are firstly explored. There are some defects such as deployment restriction, low reliability or poor rationality found in these algorithms. Then a WSN cluster model is constructed and analyzed theoretically according to the requirement of clustering, which ultimately turns to a clustering and cluster-head electing problem with approximate optimizing objectives. A heuristic topology control algorithm of cluster (HTCC) is proposed as a solution to the above problem. HTCC is composed of two methods: cluster constructing (CC) method and cluster-head electing (CHE) method. The clusters can be partitioned by the CC method, and the cluster-heads can be selected by the CHE method. The performance of the algorithm is analyzed and validated through experiments. The result indicates that the network topology of clusters with proper size has the characteristics of low energy consumption and high robustness, effectively prolonging the lifetime of the whole network.
Routing security is an important issue in secure ad hoc networks, and it appears to be a problem that is not trivial to solve. In this paper, we consider secure routing protocol and applied new cryptographic mechanism...
详细信息
Routing security is an important issue in secure ad hoc networks, and it appears to be a problem that is not trivial to solve. In this paper, we consider secure routing protocol and applied new cryptographic mechanism: multi-signcryption to routing protocol for ad hoc networks. SL multi-signcryption scheme efficiently provides message flexibility, order flexibility, message verifiability, order verifiability, message confidentiality, message unforgeability, non-repudiation and robustness. It is suitable for protecting messages and multi-signers from malicious attacks in networks. For this reason, using SL multi-signcryption, we propose a new secure AODV (Ad hoc on-demand distance vecter) routing protocol: SCRP (Signcryption based routing protocol). SCRP indeed enhances the security of AODV routing protocol and provides confidentiality, integrity, authentication, and non-repudiation to the routing message. Moreover, compared with other secure AODV, SCRP provides some other advantages such as lower computational cost and communicational overhead, flexibility of route message, and partially anonymous route.
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PH1 (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A co...
详细信息
暂无评论