A secure hierarchical model for sensor network

ABSTRACT

In a distributed sensor network, large number of sensors deployed which communicate among themselves to self-organize a wireless ad hoc network. We propose an energy-efficient level-based hierarchical system. We compromise between the energy consumption and shortest path route by utilizing number of neighbors (NBR) of a sensor and its level in the hierarchical clustering. In addition, we design a Secure Routing Protocol for Sensor Networks (SRPSN) to safeguard the data packet passing on the sensor networks under different types of attacks. We build the secure route from the source node to sink node. The sink node is guaranteed to receive correct information using our SRPSN. We also propose a group key management scheme, which contains group communication policies, group membership requirements and an algorithm for generating a distributed group key for secure communication.

REFERENCES

• 1: Chalermek Intanagonwiwat , Ramesh Govindan , Deborah Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, Proceedings of the 6th annual international conference on Mobile computing and networking, p.56-67, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345920]
• 2: Lakshminarayanan Subramanian , Randy H. Katz, An architecture for building self-configurable systems, Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, November 20, 2000, Boston, Massachusetts
• 3: Deborah Estrin , Ramesh Govindan , John Heidemann , Satish Kumar, Next century challenges: scalable coordination in sensor networks, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.263-270, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313556]
• 4: M. Tubaishat and S. Madria. Sensor Networks: An Overview, IEEE Potentials, Vol. 22, No. 2, April/May 2003.
• 5: D. W. Carman, P. S. Kruus, and B. J. Matt. Constraints And Approaches For Distributed Sensor Network Security. NAI Labs Technical Report #00-010, September 2000.
• 6: Adrian Perrig , Robert Szewczyk , J. D. Tygar , Victor Wen , David E. Culler, SPINS: security protocols for sensor networks, Wireless Networks, v.8 n.5, p.521-534, September 2002 [doi>10.1023/A:1016598314198]
• 7: Wendi Rabiner Heinzelman , Joanna Kulik , Hari Balakrishnan, Adaptive protocols for information dissemination in wireless sensor networks, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.174-185, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313529]
• 8: Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks, Proceedings of the Ninth International Conference on Network Protocols, p.251, November 11-14, 2001
• 9: P. Papadimitratos and Z. J. Haas. Secure Routing for Mobile Ad Hoc Networks. SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 27--31, 2002.
• 10: W. Diffie and M. E. Hellman. Privacy and Authentication: An Introduction to Cryptography. Proceedings of the IEEE, 67(3):397--427, March 1979.
• 11: W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, An Application-Specific Protocol Architecture for Wireless Microsensor Networks, IEEE Transactions on Wireless Communications, Vol. 1, No. 4, October 2002, pp. 660--670.
• 12: Yih-Chun Hu , David B. Johnson , Adrian Perrig, SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks, Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications, p.3, June 20-21, 2002
• 13: H. Krawczyk, M. Bellare, and R. Canetti. HMAC: Keyed-Hashing for Message Authentication, Internet RFC 2104, February 1997.