摘要
Ad-hoc网络节点之间的无线连接越多,网络通信跳数相对越少,但网络需要的密钥量越大,加重了密钥维护的负担,因此在通信跳数可接受的情况下应该尽量减少密钥量。定义了网络付出的代价,用来描述通信跳数和密钥量。以网络付出的代价最小为原则,设计了一种简单的密钥维护优化方案。将方案应用于一个Ad-hoc场景,推算结果表明该方案对密钥维护的优化是有效的。
In Ad-hoc networks, more wireless links means less routing hops and more cryptographic keys and these would add to the management of crpto keys. Therefore networks should manage the least keys while routing hops is tolerable. In this article, the cost of network is defined to evaluate routing hops and cryptographic keys. Based on the least lost of Ad-hoc networks, a simple key management scheme is proposed. An example is given and shows that this scheme is effective to keep the least cryptographic keys.
出处
《通信技术》
2009年第3期180-182,共3页
Communications Technology
基金
空军工程大学电讯工程学院博士基金资助项目(启动类)
中国博士后科学基金资助项目(20070421136)
陕西省自然科学基金资助项目(2006F22)
