臺灣博碩士論文加值系統

隨著無線微感測網路的廣泛使用，安全路由通訊協定的重要性也隨之增長。在現有的安全路由通訊協定當中，大部分的路徑選擇方法會選擇對單一路徑能源消耗最少的路徑，但是對整個無線微感測網路來說，這類選擇路徑的方法往往會導致網路中某些感測節點很快的消耗完其極有限的能源。因此，當網路中發生因為路由路徑分布所導致的能源消耗不平均現象時，將會在短時間內降低網路的連結性，甚至使網路呈現非連結的狀態。因此，在本論文中，我們針對無線微感測網路的能源消耗情形，提出了一個新的安全路由通訊協定。此安全路由通訊協定不但提供了資料完整性、資料機密性和鄰居認證機制，更重要的是能夠透過基地台所得到的資訊來調整路由路徑，以平衡每個網路節點的能源消耗，以延長整個網路處於連結狀態的總時間。最後，在本論文中，我們亦依所提出之路由通訊機制，進行無線微感測網路能源消耗及網路連結狀態進行模擬分析。模擬的結果顯示我們所提出的安全路由通訊協定在整個網路在連結狀態的總時間上，比現有的省電安全路由通訊協定多出三至四倍，也比傳統無安全性的低能源路由機制高出十至五十個百分比。

As the number of wireless sensor network applications increase, there is a greater emphasis on designing secure routing protocol. Most recent secure routing protocols tend to find the minimum energy cost path to lower energy usage for all routing paths, thus, they may lead to some of the nodes deplete their energy quickly. When energy consumption cause by routing is unbalanced over the network, the network would loss connectivity even fall apart in a short time. In this paper, we introduce a new secure routing scheme that not only provides data confidentiality, neighbor authentication, and evidence of data freshness but also balances energy consumption of each node using a base station to adjust the routing paths in order to prolong the total time of overall network connectivity. Simulation results show that the total time when network is connected increases 3 to 4 times over our related work of secure routing schemes with minimum energy cost path, and up to 10 to 50% over the related work of the conventional energy aware routing scheme.

List of Figures ..............................................................................................................vii
1. Introduction............................................................................................................1
2. Related Work..........................................................................................................5
2.1. Secure Wireless Ad Hoc Routing...............................................................5
2.2. SEAD.........................................................................................................7
2.3. Ariadne.....................................................................................................10
3. Proposed scheme..................................................................................................12
3.1. Key Establishment Phase.........................................................................14
3.1.1. Establishing Individual Node Keys .....................................................14
3.1.2. Establishing Pairwise Shared Keys......................................................14
3.2. Bottleneck Node Finding Mechanism .....................................................17
3.3. Load Balance Propagation Phase.............................................................20
3.4. Secure Data Transmission Phase .............................................................23
4. Evaluation ............................................................................................................26
4.1. Simulation Setup......................................................................................26
4.2. Evaluation on normally distributed network............................................28
5. Security Analysis .................................................................................................32
5.1. Security Requirements .............................................................................32
5.1.1. Semantic Security ................................................................................32
5.1.2. Data Confidentiality.............................................................................32
5.1.3. Data Authentication .............................................................................32
5.1.4. Data Integrity .......................................................................................33
5.1.5. Data Freshness .....................................................................................33
5.2. Analysis....................................................................................................33
5.2.1. Semantic Security ................................................................................34
5.2.2. Data Authentication and Data Integrity ...............................................34
5.2.3. Data Confidential .................................................................................34
6. Conclusion ...........................................................................................................35
References....................................................................................................................36

[1] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, "Wireless sensor networks for habitat monitoring," in Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. Atlanta, Georgia, USA: ACM Press, 2002, pp. 88-97.
[2] Z. Butler, P. Corke, R. Peterson, and D. Rus, "Virtual fences for controlling cows," presented at Proceedings of 2004 IEEE International Conference on Robotics and Automation (ICRA '04), 2004.
[3] C. Lin, C. Federspiel, and D. Auslander, "Multi-Sensor Single Actuator Control of HVAC Systems," presented at International Conference for Enhanced Building Operations, 2002.
[4] I. F. Akyildiz, W. S. Sankarasubramaniam, and E. Y. Cayirci, "A survey on sensor networks," in Communications Magazine, IEEE, 2002.
[5] M. Tubaishat and S. Madria, "Sensor networks: an overview," in Potentials, IEEE, 2003.
[6] S. S. Intille, "Designing a home of the future," Pervasive Computing, IEEE, 2002.
[7] D. H. Goldberg, A. G. Andreou, P. Julien P. O. Pouliquen, L. Riddle, and R. Rosasco, "A wake-up detector for an acoustic surveillance sensor network: algorithm and VLSI implementation," in Proceedings of the third international symposium on Information processing in sensor networks. Berkeley, California, USA: ACM Press, 2004, pp. 134-141
[8] L. Schwiebert, S. K. S. Gupta, and J. Weinmann, "Research challenges in wireless networks of biomedical sensors," in Proceedings of the 7th annual international conference on Mobile computing and networking. Rome, Italy: ACM Press, 2001, pp. 151-165.
[9] J.-H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," presented at INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, 2000.
[10] Y.-C. Hu, D. B. Johnson, and A. Perrig, "SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks," presented at Mobile Computing Systems and Applications, 2002. Proceedings Fourth IEEE Workshop on, 2002.
[11] C. E. Perkins and P. Bhagwat, "Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers," SIGCOMM Comput. Commun. Rev., vol. 24, pp. 234-244, 1994.
[12] C. E. Perkins and E. M. Royer, "Ad-hoc On-Demand Distance Vector Routing," presented at Second IEEE Workshop on Mobile Computer Systems and Applications, 1999.
[13] K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. M. Belding-Royer, "A secure routing protocol for ad hoc networks," presented at Network Protocols, 2002. Proceedings. 10th IEEE International Conference on, 2002.
[14] Yih-Chun Hu, Adrian Perrig, and David B. Johnson, "Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks," Wireless Networks, vol. Volume 11, pp. Pages 21 - 38, 2005.
[15] M. G. Zapata and N. Asokan, "Securing ad hoc routing protocols," in Proceedings of the 3rd ACM workshop on Wireless security. Atlanta, GA, USA: ACM Press, 2002, pp. 1-10.
[16] R. C. Shah and J. M. Rabaey, "Energy aware routing for low energy ad hoc sensor networks," presented at Proceedings of Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 IEEE, 2002
[17] D. B. Johnson, D. A. Maltz, and J. Broch, "DSR: the dynamic source routing protocol for multihop wireless ad hoc networks " in Ad hoc networking Addison-Wesley Longman Publishing Co., Inc., 2001 pp. 139-172
[18] R. Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 122–134, Apr. 1980.
[19] Adrian Perrig, Robert Szewczyk, J.D. Tygar, Victor Wen, and David E. Culler, "SPINS: Security Protocols for Sensor Networks," Wireless Networks, vol. Volume 8, pp. Pages 521 - 534, 2002.
[20] S. Zhu, S. Setia, and S. Jajodia, "LEAP: efficient security mechanisms for large-scale distributed sensor networks," in Proceedings of the 10th ACM conference on Computer and communications security. Washington D.C., USA: ACM Press, 2003, pp. 62-72.
[21] O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," J. ACM, vol. 33, pp. 792-807, 1986.
[22] Mihir Bellare, Anand Desai, Eron Jokipii, and P. Rogaway, "A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES modes of Operation," presented at Symposium on Foundations of Computer Science (FOCS), 1997.
[23] W. Diffie and M. E. Hellman, "Privacy and authentication: An introduction to cryptography," Proceedings of the IEEE, vol. 67, pp. 397-427, 1979
[24] A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, “Handbook of Applied Cryptography,” CRC Press, 1997.
[25] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," in Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking. Dallas, Texas, United States: ACM Press, 1998, pp. 85-97.
[26] Crossbow Technology, MICAz Datasheet, http://www.xbow.com/Products /Product_pdf_files/Wireless_pdf/MICAz_Datasheet.pdf
[27] S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer Security
[28] Adrian Perrig, J.D. Tygar, Dawn Song, and Ran Canetti, "Efficient Authentication and Signing of Multicast Streams over Lossy Channels," presented at 2000 IEEE Symposium on Security and Privacy (S&P 2000), 2000.
[29] I. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300–304, 1960.
[30] H. Krawczyk. Distributed fingerprints and secure information dispersal. In 13th ACM Symposium on Principles of Distributed Computing, pages 207–218. ACM, 1993.
[31] R. Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 122–134, Apr. 1980.
[32] P. Golle and N. Modadugu. Authenticating streamed data in the presence of random packet loss. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001), pages 13–22. Internet Society, Feb. 2001.
[33] A. Perrig, R. Canetti, J. D. Tygar, and D. Song. Efficient authentication and signature of multicast streams over lossy channels. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 56–73, May 2000.
[34] D. Song, D. Zuckerman, and J. D. Tygar. Expander graphs for digital stream authentication and robust overlay networks. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 258–270, May 2002.