Open Access Open Access  Restricted Access Subscription or Fee Access

Hill Climbing Key Dissemination Approach in Wireless Sensor Networks

T. Sathish Kumar, B. Reshmi

Abstract


We consider routing security for filtering adversaries in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal in wireless sensor networks. In wireless sensor networks offer unprecedented capabilities to monitor the physical world by reporting the occurrence of interested events. Unfortunately, such WSN are vulnerable to event fabrication attacks, in which the compromised nodes inject bogus reports into the network, fabricating non-existent events “appearing” at arbitrary locations. Most existing routing security solutions to these attacks need to share symmetric keys among sensor nodes. In this paper, we propose a Hill Climbing Dissemination Approach in Wireless Sensor Networks (HCD) that drops fabricated reports en-route without symmetric key sharing. In HCD, the source node establishes a secret association with the base station on a per-session basis, while the intermediate forwarding nodes are equipped with a witness key. Through the usage of a hill climbing and hash chain, a forwarding node can use the witness key to verify the authenticity of the reports without knowing the original session key using MAC. As a result, HCD can achieve stronger security protection than the existing symmetric key sharing approach in wireless sensor networks.

Keywords


Secure Routing, GPS, Data Reporting, En-Route Filtering Scheme, Wireless Sensor Networks, Cryptographic.

Full Text:

PDF

References


Zhen Yu and Yong Guan “A Dynamic En-route Filtering Scheme for Data Reporting in Wireless Sensor Networks” in IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 1, FEBRUARY 2010, pp. 150-163.

D. Braginsky and D. Estrin, “Rumor routing algorithm for sensor networks,” in Proc. WSNA, 2002, pp. 22–31.

N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low cost outdoor localization for very small devices,” IEEE Personal Commun. Mag., vol. 7, no. 5, pp. 28–34, Oct. 2000.

S. Capkun and J. Hubaux, “Secure positioning of wireless devices with application to sensor networks,” in Proc. IEEE INFOCOM, 2005, vol. 3, pp. 1917–1928.

L. Eschenauer and V. Gligor, “A key-management scheme for distributed sensor networks,” in Proc. ACM CCS, 2002, pp. 41–47.

T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Rangefree localization schemes in large scale sensor network,” in Proc. ACM MobiCom, 2003, pp. 81–95.

C. karlof and D.Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” in Proc. 1st IEEE Int.Workshop Sensor Netw. Protocols Appl., 2003, pp. 113–127.

B. Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Proc. ACM MobiCom, 2000, pp. 243–254.

L. Lazos and R. Poovendran, “SeRLoc: Secure range-independent localization for Wireless sensor networks,” in Proc. ACMWiSe, 2004, pp. 21–30.

L. Lazos, R. Poovendran, and S. Capkun, “ROPE: Robust position estimation in wireless sensor networks,” in Proc. IPSN, 2005, pp. 324–331.

D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks,” in Proc. ACM CCS, 2003, pp. 52–56.

R. Nagpal, H. Shrobe, and J. Bachrach, “Organizing a global coordinate system from local information on an ad hoc sensor network,” in Proc. IPSN, 2003, LNCS 2634, pp. 333–348.

D. Nicolescu and B. Nath, “Ad-hoc positioning systems (APS),” in Proc. IEEE GLOBECOM, 2001, vol. 5, pp. 2926–2931.

Perrig, R. Szewczyk, V. Wen, D. Culer, and J. Tygar, “SPINS: Security protocols for sensor networks,” in Proc. ACM MobiCom, 2001, pp. 189–199.

Przydatek, D. Song, and A. Perrig, “SIA: Secure information aggregation in sensor networks,” in Proc. ACM SenSys, 2003, pp. 255–265.

K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing location-aware end-to-end data security in wireless sensor networks,” in Proc. IEEE INFOCOM, 2006, pp. 1–12.

“TinyOS community forum,” [Online]. Available: http://www.tinyos.net

A.Woo, T. Tong, and D. Culler, “Taming the underlying challenges of reliable multihop routing in sensor networks,” in Proc. ACM SenSys, 2003, pp. 14–27.

H. Yang and S. Lu, “Commutative cipher based en-route filtering in wireless sensor networks,” in Proc. IEEE VTC, 2004, vol. 2, pp. 1223–1227.

H. Yang, F. Ye, Y. Yuan, S. Lu, and W. Arbaugh, “Toward resilient security in wireless sensor networks,” in Proc. ACM MobiHoc, 2005, pp. 34–45.

F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical en-route detection and filtering of injected false data in sensor networks,” in Proc. IEEE INFOCOM, 2004, vol. 4, pp. 2446–2457.

Y. Yu, R. Govindan, and D. Estrin, “Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks,” Comput. Sci. Dept., Univ. California, Los Angeles, UCLA-CSD TR-01–0023, 2001.

Z. Yu and Y. Guan, “A dynamic en-route scheme for filtering false data injection in wireless sensor networks,” in Proc. IEEE INFOCOM, 2006, pp. 1–12.

Y.-C. Hu, A. Perrig, D.B. Johnson, Packet leashes: a defense against wormhole attacks in wireless networks, in: IEEE Infocom, 2003.

D.B. Johnson, D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: T. Imielinski, H.F. Korth (Eds.), Mobile Computing, vol. 353, Kluwer Academic Publishers, Boston, 1996.

Y.-C. Hu, A. Perrig, D.B. Johnson, Ariadne: a secure ondemand routing protocol for ad hoc networks, in: MOBICOM, 2002.

S. Buchegger, J.-Y.L. Boudec, Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks, in: Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network- based Processing, IEEE Computer Society, Canary Islands, Spain, 2002, pp. 403–410.

D. Ganesan, R. Govindan, S. Shenker, D. Estrin, Highlyresilient, energy-efficient multipath routing in wireless sensor networks, Mobile Computing and Communications Review 4 (5) (2001) 11–25.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.