Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination node using the shortest path. Furthermore, if we use a number of secret routes from the starting node to the destination node, data security is much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS (Mixed Radix Number System) Network, which requires O(l) for the time complexity where l is the number of links on a node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

There were researches that measured effort required to understand and adapt components based on the complexity of the component, which is some general criterion related to the intrinsic quality of the component to be adapted and understood. They, however, don't consider significance of the measurement attributes and user must decide reusability of similar components for himself. Therefore, in this paper, we propose a new method that can measure the DOR (Degree Of Reusability) of the components by considering the significance of the measurement attributes. We calculates the relative significance of them by using rough set and integrate the significance with the measurement value by using Sugeno's fuzzy integral. Lastly, we apply our method to the source code components and show through statistical technique that it can be used as the ordinal and ratio scale.

Delay Tolerant Networks (DTNs) are a class of emerging networks that experience frequent and long-duration partitions. Delay is inevitable in DTNs, so ensuring the validity and reliability of the message transmission and making better use of buffer space are more important than concentrating on how to decrease the delay. In this paper, we present a novel routing protocol named Location and Direction Aware Priority Routing (LDPR) for DTNs, which utilizes the location and moving direction of nodes to deliver a message from source to destination. A node can get its location and moving direction information by receiving beacon packets periodically from anchor nodes and referring to received signal strength indicator (RSSI) for the beacon. LDPR contains two schemes named transmission scheme and drop scheme, which take advantage of the nodes' information of the location and moving direction to transmit the message and store the message into buffer space, respectively. Each message, in addition, is branded a certain priority according to the message's attributes (e.g. importance, validity, security and so on). The message priority decides the transmission order when delivering the message and the dropping sequence when the buffer is full. Simulation results show that the proposed LDPR protocol outperforms epidemic routing (EPI) protocol, prioritized epidemic routing (PREP) protocol, and DTN hierarchical routing (DHR) protocol in terms of packet delivery ratio, normalized routing overhead and average end-to-end delay. It is worth noting that LDPR doesn't need infinite buffer size to ensure the packet delivery ratio as in EPI. In particular, even though the buffer size is only 50, the packet delivery ratio of LDPR can still reach 93.9%, which can satisfy general communication demand. We expect LDPR to be of greater value than other existing solutions in highly disconnected and mobile networks.

Since any suggestion to regional services are not described in Kerberos, authentication between regions can be performed via PKINIT (Public Key Cryptography for Initial Authentication) presented by IETF (Internet Engineering Task Force) CAT working group. In this paper, an efficient Kerberos authentication mechanism associated with X.509 and Domain Name system (DNS) is presented by employing the two distinct key management systems - asymmetric and symmetric methods. A new protocol is better than the authentication mechanism proposed by IETF CAT Working group in terms of communication complexity.