CFP last date
20 May 2024
Reseach Article

Optimized Secure Data Delivery Based on Randomized Routing in Wireless Sensor Networks

Published on April 2012 by J. Preetheswari, J. Mark Jain
International Conference in Recent trends in Computational Methods, Communication and Controls
Foundation of Computer Science USA
ICON3C - Number 6
April 2012
Authors: J. Preetheswari, J. Mark Jain
790f542e-2905-4c0f-9255-b2102ba39b9c

J. Preetheswari, J. Mark Jain . Optimized Secure Data Delivery Based on Randomized Routing in Wireless Sensor Networks. International Conference in Recent trends in Computational Methods, Communication and Controls. ICON3C, 6 (April 2012), 1-6.

@article{
author = { J. Preetheswari, J. Mark Jain },
title = { Optimized Secure Data Delivery Based on Randomized Routing in Wireless Sensor Networks },
journal = { International Conference in Recent trends in Computational Methods, Communication and Controls },
issue_date = { April 2012 },
volume = { ICON3C },
number = { 6 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 1-6 },
numpages = 6,
url = { /proceedings/icon3c/number6/6040-1041/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference in Recent trends in Computational Methods, Communication and Controls
%A J. Preetheswari
%A J. Mark Jain
%T Optimized Secure Data Delivery Based on Randomized Routing in Wireless Sensor Networks
%J International Conference in Recent trends in Computational Methods, Communication and Controls
%@ 0975-8887
%V ICON3C
%N 6
%P 1-6
%D 2012
%I International Journal of Computer Applications
Abstract

Security and Energy restriction are of most concern in pushing the success of Wireless Sensor Networks (WSNs) for their wide deployment. Despite years of much intensive research, deploying secure communication between wireless nodes remains the cumbersome setup process. Due to the deprived physical layout of sensor nodes, it is generally assumed that an adversary can capture and compromise a small number of sensors in the network. The key attack identified in such a network is Compromised Node (CN) attack which has the ability to create black hole, thereby intercepting the active information delivery. In this paper, we develop an effective routing mechanism that can with high probability, circumvent the black hole formed by this attack. The Purely Random Propagation (PRP) algorithm developed generates randomized dispersive routes so that the routes taken by the shares of different packets changes over time. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of bypassing black hole. Also, the energy constraint is highly optimized in the entire routing mechanism leading to minimal energy consumption. Extensive simulations are conducted to investigate the security and energy performance of our mechanism

References
  1. Tao Shu, Student Member, IEEE, Marwan Krunz, Fellow, IEEE, and Sisi Liu, Student Member, IEEE," Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes", IEEE Transactions On Mobile Computing, Vol. 9, No. 7, July 2010
  2. Roberto Di Pietro, Luigi V. Mancini, Claudio Soriente, Angelo Spognardi, and Gene Tsudik," Data Security in Unattended Wireless Sensor Networks", IEEE Transactions On Computers, Vol. 58, , Nov 2009
  3. D. R. Stinson, Cryptography, Theory and Practice. CRC Press, 2006.
  4. S. J. Lee and M. Gerla, "Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm. (ICC), pp. 3201-3205, 2001.
  5. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
  6. D. B. Johnson, D. A. Maltz, and J. Broch, "DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks," Ad Hoc Networking, C. E. Perkins, ed. , pp. 139-172, Addison-Wesley, 2001.
  7. Dimple Juneja, Neha Arora, Sandhya Bansal "An Agent based Routing Algorithm for Detecting Attacks in Wireless Sensor Networks". IJCIR, 2010.
  8. T. Claveirole, M. D. de Amorim, M. Abdalla, and Y. Viniotis, "Securing Wireless Sensor Networks Against Aggregator Compromises,"IEEE Comm. Magazine, vol. 46, no. 4, pp. 134-141, Apr. 2008
  9. M. K. Marina and S. R. Das, "On-Demand Multipath Distance Vector Routing in Ad Hoc Networks," Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 14-23, Nov. 2001.
  10. Yun Wang, Student Member, IEEE, Xiaodong Wang, Student Member, IEEE, Bin Xie, Senior Member, IEEE, Demin Wang, Student Member, IEEE, and Dharma P. Agrawal, Fellow, IEEE,"Intrusion Detection In Homogeneous And Heterogeneous Wireless Sensor Networks", IEEE Transactions On Mobile Computing, Vol. 7, No. 6, June 2008
  11. John Felix Charles Joseph, Member, IEEE, Bu-Sung Lee, Amitabha Das, Senior Member, IEEE, and Boon-Chong Seet, Member, IEEE "Cross-Layer Detection of Sinking Behavior in Wireless Ad Hoc Networks Using SVM and FDA",IEEE Transactions On Dependable And Secure Computing, Vol. 8, No. 2, March-April 2011 233
  12. Xinyu Zhang, Baochun Li," Optimized Multipath Coding In Lossy Wireless Networks", IEEE Journal On Selected Areas In Communications, Vol. 27, No. 5, June 2009
  13. Z. Ye, V. Krishnamurthy, and S. K. Tripathi, "A Framework for Reliable Routing in Mobile Ad Hoc Networks," Proc. IEEE INFOCOM, vol. 1, pp. 270-280, Mar. 2003.
  14. N. F. Maxemchuk, "Dispersity Routing," Proc. IEEE Int'l Conf. Comm. (ICC), pp. 41. 10-41. 13, 1975.
Index Terms

Computer Science
Information Sciences

Keywords

Network Security Randomized Routing