H-SPREAD: a hybrid multipath scheme for secure and reliable data collection in wireless sensor networks

Communication security and reliability are two important issues in any network. A typical communication task in a wireless sensor network is for every sensor node to sense its local environment, and upon request, send data of interest back to a base station (BS). In this paper, a hybrid multipath scheme (H-SPREAD) to improve both the security and reliability of this task in a potentially hostile and unreliable wireless sensor network is proposed. The new scheme is based on a distributed N-to-1 multipath discovery protocol, which is able to find multiple node-disjoint paths from every sensor node to the BS simultaneously in one route discovery process. Then, a hybrid multipath data collection scheme is proposed. On the one hand, end-to-end multipath data dispersion, combined with secret sharing, enhances the security of the end-to-end data delivery in the sense that the compromise of a small number of paths will not result in the compromise of a data message in the face of adversarial nodes. On the other hand, in the face of unreliable wireless links and/or sensor nodes, alternate path routing available at each sensor node improves the reliability of each packet transmission significantly. The extensive simulation results show that the hybrid multipath scheme is very efficient in improving both the security and reliability of the data collection service seamlessly

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[2]  Wenjing Lou,et al.  Geographic On-Demand Disjoint Multipath Routing in Wireless Ad Hoc Networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[3]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[4]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[5]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Sajal K. Das,et al.  An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks , 2003, J. Parallel Distributed Comput..

[7]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[8]  Wenjing Lou,et al.  An efficient N-to-1 multipath routing protocol in wireless sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[9]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[10]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, SIGCOMM '91.

[11]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[12]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[13]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Yuguang Fang,et al.  SPREAD: enhancing data confidentiality in mobile ad hoc networks , 2004, IEEE INFOCOM 2004.

[15]  Yuguang Fang,et al.  A multipath routing approach for secure data delivery , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[16]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[17]  Zygmunt J. Haas,et al.  Multipath routing in the presence of frequent topological changes , 2001, IEEE Commun. Mag..

[18]  Chunming Qiao,et al.  Meshed multipath routing: an efficient strategy in sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[19]  Rong-Jaye Chen,et al.  An algorithm for computing the reliability of weighted-k-out-of-n systems , 1994 .

[20]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[21]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[22]  Richard D. Gitlin,et al.  Diversity coding for transparent self-healing and fault-tolerant communication networks , 1993, IEEE Trans. Commun..

[23]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[24]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[25]  Yuguang Fang,et al.  Scalable and robust data dissemination in wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[26]  Wendi B. Heinzelman,et al.  Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks , 2002, Wirel. Networks.

[27]  Yuguang Fang,et al.  A robust and energy-efficient data dissemination framework for wireless sensor networks , 2006, Wirel. Networks.

[28]  C. Karlof,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[29]  Madhav V. Marathe,et al.  Parametric probabilistic sensor network routing , 2003, WSNA '03.