TY - GEN
T1 - A reliable topology for efficient key distribution in ad-hoc networks
AU - Miyao, Kenji
AU - Nakayama, Hidehisa
AU - Ansari, Nirwan
AU - Nemoto, Yoshiaki
AU - Kato, Nei
PY - 2008
Y1 - 2008
N2 - Data confidentiality is one of the most important concerns in security of ad-hoc networks which have been widely studied in recent years. In this paper, we consider the public-key cryptography which is one of the simplest and viable means to maintain data confidentiality. There are several ways to distribute a public key. Flooding is an intuitive approach to distribute each node'spublic key. However, the normal flooding approach is costly, and can cause MAClevel contention in a dense region of nodes. Tree based topology flooding can be appied to mitigate these problems. The construction algorithm should use ideally only local information. In this paper, we propose a completely localized algorithm called the Local Tree-based Reliable Topology (LTRT) algorithm, which achieves both reliability and efficiency. LTRT is a localized version of TRT that has 2-edge connectivity. Each node can distribute its public key to all other nodes in the network by LTRT. Simulation results show the efficiency of LTRT and its superiority over other localized algorithms.
AB - Data confidentiality is one of the most important concerns in security of ad-hoc networks which have been widely studied in recent years. In this paper, we consider the public-key cryptography which is one of the simplest and viable means to maintain data confidentiality. There are several ways to distribute a public key. Flooding is an intuitive approach to distribute each node'spublic key. However, the normal flooding approach is costly, and can cause MAClevel contention in a dense region of nodes. Tree based topology flooding can be appied to mitigate these problems. The construction algorithm should use ideally only local information. In this paper, we propose a completely localized algorithm called the Local Tree-based Reliable Topology (LTRT) algorithm, which achieves both reliability and efficiency. LTRT is a localized version of TRT that has 2-edge connectivity. Each node can distribute its public key to all other nodes in the network by LTRT. Simulation results show the efficiency of LTRT and its superiority over other localized algorithms.
UR - http://www.scopus.com/inward/record.url?scp=52049109219&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52049109219&partnerID=8YFLogxK
U2 - 10.1109/WOWMOM.2008.4594922
DO - 10.1109/WOWMOM.2008.4594922
M3 - Conference contribution
AN - SCOPUS:52049109219
SN - 9781424421008
T3 - 2008 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM2008
BT - 2008 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM2008
T2 - 9th IEEE International Symposium on Wireless, Mobile and Multimedia Networks, WoWMoM 2008
Y2 - 23 June 2008 through 26 June 2008
ER -