在本篇論文中，我們以能使無線隨意網路中群組成員擁有共同群組金鑰為前提，考量如何使金鑰交換時所消耗之通訊能量成本降至最低。我們首先提出直觀之試誤法MEFS (Minimum-Energy First-Selected)。由於通訊消耗能量正比於群組成員間相對距離之n次方，利用最短路徑演算法找出群組成員間最短通訊路徑(可能含中繼節點)，即找出最小之通訊能量消耗。並以總是優先選取通訊能量消耗小的群組成員金鑰交換，測試是否能得到群組最低總通訊能量消耗成本。因MEFS隱含之缺陷，我們提出利用最小成本流量問題概念，經過適當之轉換，可求得節能式群組金鑰管理問題之最佳解。我們亦進行相關之電腦模擬試驗，以驗證我們所提出之解決方案。

In this thesis, we consider how to reduce the communication cost of the key exchange procedures as many as possible, while the secure group communication can still be achieved. Due to the energy consumption is usually proportional to the distance, we use the shortest paths algorithm to find the shortest communication paths between any pair of the secure group members. We first propose a straightforward heuristic named Minimum-Energy First-Selected ( MEFS ). MEFS tries to select the pair of group members which has less communication cost than all other pairs have at every time. Though MEFS performs better than random selecting, it still has some weakness in solving the energy-aware key management problem. So we use the concept of the minimum cost flow problem, and by appropriate transformation, then we get the optimal solution of the energy-aware key management problem under some constraints. At last, the simulation results proves that the minimum cost flow approach actually works better than MEFS does.

目錄

第一章 緒論..............................................................................................1
1-1 研究背景及動機……………………………………………….1
1-2 文獻探討……………………………………………………….2
1-3 文章組織……………………………………………………….3
第二章 MEFS (Minimum-Energy First-Selected)……..………………..4
2-1 會議樹(Conference Tree)及蝴蝶圖(Butterfly Scheme)……….6
2-2 MEFS基本概念…..…………………………………………….8
2-3 以模擬範例(群組成員為5人)解說…………………………...8
2-4 MEFS之缺陷討論………..…………………………………...15
第三章 節能式群組金鑰管理問題之最佳解…………………………17
3-1 最小成本流量問題…………………………………………...17
3-2 連續最短路徑演算法………………………………………...20
3-3 轉換為最小成本流量問題之設定與圖形分析……………...24
3-4 模擬範例之最佳解…………………………………………...27
第四章 以電腦模擬比較MEFS與最佳解方案……………………..28
第五章 總結…………………………………………………………..33
參考文獻………………………………………………………………..34

[1] Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci, “A
Survey on Sensor Networks,” IEEE Communications Magazine, August 2002,
pp.102-114.
[2] Jamal N. AL-Karaki, and Ahmed E. Kamal, “Routing Techniques in Wireless Sensor Networks：A Survey,” IEEE Wireless Communications, December 2004, pp.6-28.
[3] Jun-Hong Cui, Faloutsos M. , and Gerla M. , “An architecture for scalable,
efficient, and fast fault-tolerant multicast provisioning,” IEEE Network,
March/April 2004, Vol. 18, pp.26-34.
[4] W. Diffie, and M. Hellman, “New Directions in Cryptography,” IEEE Trans.
Inform. Theory, Vol. 22, No. 6, Nov. 1976, pp.644-654.
[5] Ingemar Ingemarsson, Donald T. Tang, and C.K. Wong, “A Conference Key
Distribution System,” IEEE Transactions on Information Theory, Vol. IT-28, No.5, September 1982, pp.714-720.
[6] Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin,
John Heidemann, and Fabio Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE Transactions on Networking, Vol. 11, No. 1, February 2003, pp.2-16.
[7] Yongdae Kim, Adrian Perrig, and Gene Tsudik, “Simple and Fault-Tolerant Key
Agreement for Dynamic Collaborative Groups,” in Proc. 7th ACM Conf.
Computer Communication Security, 2000, pp.235-244.
[8] Haibin Liu, “A novel high-order tree for secure multicast key management,”
IEEE Transactions on Computers, February 2005, Vol. 54, pp.214-224.
[9] Sandro Rafaeli, and David Hutchison, “A Survey of Key Management for Secure
Group Communication,” ACM Computing Surveys, Vol. 35, No. 3, September
2003, pp.309-329.
[10] William Stallings, Cryptography and Network Security：Principles and Practices,
3rd Edition, Pearson, Prentice-Hall, 2003
[11] Wade Trappe, Yuke Wang, and K. J. Ray Liu, “Establishment of Conference
Keys in Heterogeneous Networks,” in Proc. IEEE Int. Conf. Communications,
2002, pp.2201-2205.

[12] Wade Trappe, Yuke Wang, and K. J. Ray Liu, “Resource-Aware Conference Key
Establishment for Heterogeneous Networks,” IEEE/ACM Transactions on
Networking, Vol. 13, No. 1, February 2005, pp.134-146.
[13] Chung Kei Wong, Mohamed Gouda, and Simon S. Lam, “Secure Group
Communications Using Key Graphs,” IEEE/ACM Transactions on Networking,
Vol. 8, No. 1, February 2000, pp.16-30.
[14] Wei Ye, Heidemann J. , and Estrin D. , “Medium access control with
coordinated adaptive sleeping for wireless sensor networks,” IEEE/ACM
Transactions on Networking, Vol.12, June 2004, pp.493-506.
[15] Xin Yan Zhang, Qian Zhang, Zhensheng Zhang, Gang Song, and Wenwu Zhu, “A
Construction of Locality-Aware Overlay Network：mOverlay and Its Performance,”
IEEE Journal on Selected Areas in Communications, Vol. 22, January 2004,
pp.18-28
[16] Jinhua Zhu, Chunming Qiao, and Xin Wang, “A Comprehensive Minimum Energy Routing Scheme for Wireless Ad hoc Networks,” IEEE INFOCOM 2004, Mar., Vol. 2, pp.1437-1445.
[17] Jinhua Zhu, and Xin Wang, “PEER：A Progressive Energy Efficient Routing
Protocol for Wireless Ad Hoc Networks,” IEEE INFOCOM 2005, Mar. Vol. 3,
pp.1887-1896.
[18] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, Network Flows： Theory, Algorithms, and Applications, 1st Edition, Prentice-Hall, 1993