Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol 11, Issue 08, August 2024

Call for Paper

Vol 11, Issue 08, August 2024

Indexing

An Efficient Cost-A ware Secure Routing (CASER) Protocol for Wireless Sensor Network

Author : R. Rajeshwari 1 R.Arul Jothi 2 S.Bhuvaneswari 3 P. Jayamary Fathima 4 A.Ajin Brabasher 5

PDF

Date of Publication :7th April 2016

Abstract: It is well known that wireless sensor networks (WSNs) is a self-organization wireless network system constituted by numbers of energy-limited micro sensors under the banner of industrial application (IA). In this project, we propose a secure and efficient Cost Aware Secure Routing (CASER) protocol to address two conflicting issues; They are lifetime optimization and security. Through the energy balance control and random walking, we can address those conflicting issues. We then discover that the energy consumption is severely disproportional to the uniform energy deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To solve this problem, we propose an efficient non-uniform energy deployment strategy to optimize the lifetime and message delivery ratio under the same energy resource and security requirement. We also provide a quantitative security analysis on the proposed routing protocol.

Reference :

    1. Y. Li, J. Ren, and J. Wu, “Quantitative measurement and design of source-location privacy schemes for wireless sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 7, pp. 1302–1311, Jul. 2012.
    2. Y. Li, J. Li, J. Ren, and J. Wu, “Providing hop-by-hop authentication and source privacy in wireless sensor networks,” in Proc. IEEE Conf. Comput. Commun. MiniConf., Orlando, FL, USA, Mar. 2012, pp. 3071–3075
    3. B. Karp and H. T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” in Proc. 6th Annu. Int. Conf. Mobile Comput. Netw., New York, NY, USA, 2000, pp. 243–254. [4] J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing,” in Proc. 6th Annu. Int. Conf. Mobile Comput. Netw., 2000, pp. 120–130.
    4. Y. Xu, J.sHeidemann, and D. Estrin, “Geographyinformed energy conservation for ad-hoc routing,” in Proc. 7th Annu. ACM/IEEE Int. Conf. Mobile Comput. Netw., 2001, pp. 70–84.
    5. Y. Yu, R. Govindan, and D. Estrin, “Geographical and energyaware routing: A recursive data dissemination protocol for wireless sensor networks,” Comput. Sci. Dept., UCLA, TTR-010023, Los Angeles, CA, USA, Tech. Rep., May 2001.
    6. N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less low cost outdoor localization for very small devices,” Comput. Sci. Dept., Univ. Southern California, Los Angeles, CA, USA, Tech. Rep. 00- 729, Apr. 2000.
    7. A. Savvides, C.-C. Han, and M. B. Srivastava, “Dynamic finegrained localization in ad-hoc networks of sensors,” in Proc. 7th ACM Annu. Int. Conf. Mobile Comput. Netw., Jul. 2001, pp. 166–179.
    8. 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.
    9. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with guaranteed delivery in ad hoc wireless networks,” in Proc. 3rd ACM Int. Workshop Discrete Algorithms Methods Mobile Comput. Commun., Seattle, WA, USA, Aug. 1999, pp. 48–55
    10. 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.
    11. Y. Li, Y. Yang, and X. Lu, “Rules of designing routing metrics for greedy, face, and combined greedy-face routing,” IEEE Trans. Mobile Comput., vol. 9, no. 4, pp. 582–595, Apr. 2010.
    12. R. Shah and J. Rabaey, “Energy aware routing for low energy ad hoc sensor networks,” in Proc. IEEE Wireless Commun. Netw. Conf., Mar. 17–21, 2002, vol. 1, pp. 350– 355.
    13. J.-H. Chang and L. Tassiulas, “Maximum lifetime routing in wireless sensor networks,” IEEE/ACM Trans. Netw., vol. 12, no. 4, pp. 609–619, Aug. 2004.
    14. H. Zhang and H. Shen, “Balancing energy consumption to maximize network lifetime in data-gathering sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 20, no. 10, pp. 1526–1539, Oct. 2009.
    15. F. Liu, C.-Y. Tsui, and Y. J. Zhang, “Joint routing and sleep scheduling for lifetime maximization of wireless sensor networks,” IEEE Trans. Wireless Commun., vol. 9, no. 7, pp. 2258–2267, Jul. 2010.
    16. C.-C. Hung, K.-J. Lin, C.-C. Hsu, C.-F. Chou, and C.-J. Tu, “On enhancing network-lifetime using opportunistic routing in wireless sensor networks,” in Proc. 19th Int. Conf. Comput. Commun. Netw., Aug. 2010, pp. 1–6.
    17. C. Ozturk, Y. Zhang, and W. Trappe, “Source-location privacy in energy-constrained sensor network routing,” in Proc. 2nd ACM Workshop Security Ad Hoc Sens. Netw., 2004, pp. 88–93. [19] Y. Li and J. Ren, “Preserving sourcelocation 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.
    18. Y. Li and J. Ren, “Source-location privacy through dynamic routing in wireless sensor networks,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA., Mar. 15–19, 2010. pp. 1–9.
    19. M. Shao, Y. Yang, S. Zhu, and G. Cao, “Towards statistically strong source anonymity for sensor networks,” in Proc. IEEE 27th Conf. Comput. Commun., Apr. 2008, pp. 51–55.
    20. P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, “Enhancing source-location privacy in sensor network routing,” in Proc. 25th IEEE Int. Conf. Distrib. Comput. Syst., Jun. 2005, pp. 599–608.
    21. Wikipedia. Quarttic function [Online]. Available:http://en.wikipedia.org/wiki/Quartic_function, Apr. 2014.
    22. W. Xu, K. Ma, W. Trappe, and Y. Zhang, “Jamming sensor networks: Attack and defense strategies,” IEEE Netw., vol. 20, no. 3, pp. 41–47, May/Jun. 2006.
    23. A. Pathan, H.-W. Lee, and C. seon Hong, “Security in wireless sensor networks: Issues and challenges,” in Proc. 8th Int. Conf. Adv. Commun. Technol., 2006, pp. 1043–1048

Recent Article