K Jayavenkataram, Ms. M. Padmaja


Routing is yet another very challenging design problem for WSNs. A correctly designed routing protocol shouldn't only ensure a higher message delivery ratio and occasional energy consumption for message delivery, but additionally balance the whole sensor network energy consumption, and therefore extend the sensor network lifetime Motivated because WSNs routing is frequently geography-based, we advise a geography-based safe and effective Cost-Aware Secure routing (CASER) protocol for WSNs without counting on flooding. CASER protocol has two major advantages: (i) It ensures balanced energy use of the whole sensor network so the duration of the WSNs could be maximized. (ii) CASER protocol supports multiple routing strategies in line with the routing needs, including fast/slow message delivery and secure message delivery to avoid routing trackback attacks and malicious traffic jamming attacks in WSNs. We advise a safe and effective Cost-Aware Secure Routing (CASER) protocol for WSNs. Within this protocol, cost-aware based routing strategies do apply to deal with the content delivery needs. Actually, the foe is infeasible to look for the previous hop source node through routing trackback analysis. Furthermore, the probability for that foe to get multiple messages in the same source node continuously is minimal for big sensor systems. The content is first transmitted to some randomly selected intermediate node within the sensor domain prior to the message has been given to a network mixing ring in which the messages from various directions are mixed... The quantitative security analysis demonstrates the suggested formula can safeguard the origin location information in the adversaries. Our extensive OPNET simulation results reveal that CASER can offer excellent energy balance and routing security. Our analysis and simulation results reveal that we are able to boost the lifetime and the amount of messages that may be delivered underneath the non-uniform energy deployment by greater than four occasions.


Routing; Security; Energy Efficiency; Energy Balance; Delivery Ratio; Deployment; Simulation;


Y. Li and J. Ren, “Preserving source-location privacy in wireless sensor networks,” in Proc. IEEE 6th Annu. Commun. Soc. Conf. Sens., Mesh Ad Hoc Commun. Netw., Rome, Italy, Jun. 2009, pp. 493–501.

Y. Yu, R. Govindan, and D. Estrin, “Geographical and energy-aware routing: A recursive data dissemination protocol for wire-less sensor networks,” Comput. Sci. Dept., UCLA, TR-010023, Los Angeles, CA, USA, Tech. Rep., May 2001.

T. Melodia, D. Pompili, and I. Akyildiz, “Optimal local topology knowledge for energy efficient geographical routing in sensor networks,” in Proc. IEEE Conf. Comput. Commun., Mar. 2004, vol. 3, pp. 1705–1716.

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with guaranteed delivery in ad hoc wireless networks,” in Proc. 3rd Int. Workshop Discrete Algorithms Methods Mobile Comput. Commun., 1999, pp. 48–55.

H. Zhang and H. Shen, “Balancing energy consumption to maxi-mize network lifetime in data-gathering sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 20, no. 10, pp. 1526–1539, Oct. 2009.

C.-C. Hung, K.-J. Lin, C.-C. Hsu, C.-F. Chou, and C.-J. Tu, “On enhancing network-lifetime using opportunistic routing in wire-less sensor networks,” in Proc. 19th Int. Conf. Comput. Commun. Netw., Aug. 2010, pp. 1–6.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2021, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at