CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network

by Rekha R, Sowmya G. V
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 17
Year of Publication: 2012
Authors: Rekha R, Sowmya G. V
10.5120/7441-0427

Rekha R, Sowmya G. V . A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network. International Journal of Computer Applications. 48, 17 ( June 2012), 21-25. DOI=10.5120/7441-0427

@article{ 10.5120/7441-0427,
author = { Rekha R, Sowmya G. V },
title = { A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 17 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number17/7441-0427/ },
doi = { 10.5120/7441-0427 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:44:20.344344+05:30
%A Rekha R
%A Sowmya G. V
%T A New Highly Secure and Efficient Routing Algorithm for Wireless Sensor Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 17
%P 21-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today's world the security vulnerabilities are increasing day by day. It is really difficult to route the packet with minimum packet loss with less power consumption and high energy efficiency. In this paper a new routing protocol is presented which would route the packets in a highly efficient way by introducing the concept of friend list, unauthenticated list and question mark list. The algorithm will avoid the malicious node by studying the network in an intelligent way. The algorithm works by sending challenges and sharing friend list to provide a list of trusted nodes to the source node through which data is transmitted. The proposed algorithm is also compared with the existing algorithms namely Trust Message Routing (TMR), Disjoint Multipath Routing (DMR). Message Trust Routing(MTMR) and the performance analysis proves that the proposed method will have better performance with respect to number of hops, route discovery time, power consumed, energy efficiency and packet loss.

References
  1. L. Wang and N. -T. Zhang, "Locally forwarding management in ad-hoc networks," in Proc. IEEE Int. Conf. Communications, Circuits and Systems and West Sino Expositions, Jun. /Jul. 2002, pp. 160–164.
  2. D. Johnson and D. Maltz, "Dynamic source routing in ad hoc wireless networks," in Book Chapter inMobile Computing, T. Imielinski andH. Korth, Eds. Dordrecht, The Netherlands: Kluwer, 1996, pp. 131–181.
  3. A. Wood and J. A. Stankovic, "A taxonomy for denial-of-service attacks in wireless sensor networks," in Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. Boca Raton, FL: CRC, 2005, pp. 32:1–32:20.
  4. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 644–654, 1976.
  5. M. S. Obaidat and N. Boudriga, Security of e-Systems and Computer Networks. Cambridge, U. K. : Cambridge Univ. Press, 2007.
  6. K. Sanzgiri, B. N. Levine, C. Shields, B. Dahill, and E. M. Belding- Royer, "A secure routing protocol for ad hoc networks," in Proc. 10th IEEE Int. Conf. Network.
  7. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 644–654, 1976.
  8. M. S. Obaidat and N. Boudriga, Security of e-Systems and Computer Networks. Cambridge, U. K. : Cambridge Univ. Press, 2007.
  9. K. Sanzgiri, B. N. Levine, C. Shields, B. Dahill, and E. M. Belding- Royer, "A secure routing protocol for ad hoc networks," in Proc. 10th IEEE Int. Conf. Network Protocols (ICNP), Paris, France, Nov. 12–15, 2002, pp. 78–89.
  10. Y. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks,"Wireless Netw. , vol. 11, no. 1–2, pp. 21–38, Jan. 2005.
  11. S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehaviour in mobile ad hoc networks," in Proc. MobiCom 2000, Boston, MA, Aug. 2000, pp. 255–265.
  12. M. G. Zapata and N. Asokan, "Securing ad hoc routing protocols," in WiSe'02: Proc. of 1st ACM Workshop on Wireless Security, Atlanta, GA, Sep. 28, 2002, pp. 1–10.
  13. P. Papadimitratos and Z. J. Haas, "Secure link state routing for mobile ad hoc networks," in IEEE International Symposium on Applications and the Internet-Workshop on Security and Assurance in Ad Hoc Networks, Orlando, FL, Jan. 2003, p. 379.
  14. T. Haniotakis, S. Tragoudas, and C. Kalapodas, "Security enhancement through multiple path transmission in ad hoc networks," in 2004 IEEE Int. Conf. Communications, Jun. 2004, vol. 7, pp. 4187–4191.
Index Terms

Computer Science
Information Sciences

Keywords

Faces Scheme Friend-based Ad Hoc Routing Manets Friend-list Unauthenticated-list Friend-list Security Of Communication Systems Simulation Analysis

Powered by PhDFocusTM