We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

A Swarm Intelligent Secured Routing for Wireless Sensor Network

by D. Usha, B. Paramasivan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 6
Year of Publication: 2012
Authors: D. Usha, B. Paramasivan
10.5120/9120-3277

D. Usha, B. Paramasivan . A Swarm Intelligent Secured Routing for Wireless Sensor Network. International Journal of Computer Applications. 57, 6 ( November 2012), 34-38. DOI=10.5120/9120-3277

@article{ 10.5120/9120-3277,
author = { D. Usha, B. Paramasivan },
title = { A Swarm Intelligent Secured Routing for Wireless Sensor Network },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 6 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 34-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number6/9120-3277/ },
doi = { 10.5120/9120-3277 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:59:45.324603+05:30
%A D. Usha
%A B. Paramasivan
%T A Swarm Intelligent Secured Routing for Wireless Sensor Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 6
%P 34-38
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Rapid development of sensor technology, within short span has attracted extensive attention in wide range of applications. But the adhoc nature of the Wireless Sensor Network (WSN) does not support any traditional routing or security scheme and hence the problem of finding a minimum cost, secured and reliable path between the source and destination still becomes a crisis. Therefore, a route maintenance algorithm for WSN should tolerate any intermittent failures and reach destination through shortest and minimal latency path. This thrust has motivated to design the proposed algorithm that provides a probabilistic multi-path routing which constantly updates the goodness of choosing a particular path by measuring the link quality in those paths and also prioritizes the forwarding candidates based on its truthfulness in addition to the shortest path metric. Moreover this proposed system also concentrates on security of a node by assessing its truthfulness. The Prejudice value (propensity to trust/mistrust its neighbors) and deserve value (information of other nodes about this node) are computed to detect the trustworthiness of the node. The effect of packet delivery was analyzed and it is found that perfection is brought about by the participation of the forwarding candidates.

References
  1. karp and H. T. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom, pp. 243- 254, 2000.
  2. Mesut Gunes, Udo Sorges, Imed Bouazizi, "ARA – The Ant-colony based routing algorithm for MANETs", International workshop on Ad-hoc Networking (IWAHN 2002)
  3. Deb, S. Bhatnagar, and B. Nath, "ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks," Proc. Ann. IEEE Int'l Conf. Local Computer Networks (LCN '03), pp. 406- 415, 2003.
  4. Frederick Ducatelle, Gianni Di Caro and Luca Maria Gambardella, "Using ANT Agents to combine reactive and proactive strategies for routing in mobile ad-hoc networks",2004
  5. Felemban, C. -G. Lee, E. Ekici, R. Boder, and S. Vural, "Probabilistic QoS Guarantee in Reliability and Timeliness Domains in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 2646-2657, 2005.
  6. A Trust-Based Geographical Routing Scheme in Sensor Networks Ka-Shun Hung; King-Shan Lui; Yu-Kwong Kwok Wireless Communications and Networking Conference, 2007. Page(s): 3123 – 3127
  7. IEEE Conference PublicationsChen, J. Deng, and P. Varshney, "Selection of a Forwarding Area for Contention-Based Geographic Forwarding in Wireless Multi-Hop Networks," IEEE Trans. Vehicular Technology, vol. 56, no. 5, pp. 3111-3122, Sept. 2007.
  8. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, "SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks," IEEE Trans. Mobile Computing, vol. 8, no. 12, pp. 1622-1635, Dec. 2009.
  9. Trustworthiness Assessment of Wireless Sensor Data for Business Applications Gomez, L. ; Laube, A. ; Sorniotti, A. Advanced Information Networking and Applications, 2009. AINA '09. International Conference
  10. J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg. Predicting positive and negative links in online social networks. In WWW, pages 641–650, 2010.
  11. Implementing a Trust-Aware Routing Protocol in Wireless Sensor Nodes Zahariadis, T. ; Trakadas, P. ; Leligou, H. ; Karkazis, P. ; Voliotis, S. Developments in E-systems Engineering (DESE), 2010 Publication Year: 2010 , Page(s): 47 - 52 IEEE Conference Publications
  12. Yan-fei Zhu,Xiong-min Tang. "Overview of Swarm Intelligence",In ICCASM(IEEE),Pages 400-402,2010.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless Sensor Networks Reliability Swarm intelligence Secured routing Minimal Latency Link Quality Shortest Path