An Algorithm to Find Multiple Secret Paths on MRNS Networks by Using the Hamiltonian Circuit Latin Square

スポンサーリンク

概要

• 論文の詳細を見る

• 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 ona node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

• 社団法人電子情報通信学会の論文
• 2001-08-01

著者

• CHUNG Ilyong

  Department of Computer Engineering, Chosun University

• Chung I

  Chosun Univ. Gwangju Kor

• Chung Ilyong

  Department Of Computer Engineering Chosun University

• KIM Seongyeol

  Department of Computer Engineering, Chosun University

• Kim Seongyeol

  Department Of Computer Engineering Chosun University

関連論文

• A Priority Routing Protocol Based on Location and Moving Direction in Delay Tolerant Networks
• An Algorithm to Find Multiple Secret Paths on MRNS Networks by Using the Hamiltonian Circuit Latin Square
• A Study of the Clinical Utility of the BPI-12 and 23 in Predicting Shoulder Pain in Stroke Patients

スポンサーリンク