Secure Data Transmission Using Hop-By-Hop Routing Algorithm

Authors

  • S. P. Gayathri  Department of Computer Science, Sakthi College of Arts and Science for Women, Oddanchatram, Dindigul, Tamil Nadu, India
  • K.Susmitha  Department of Computer Science, Sakthi College of Arts and Science for Women, Oddanchatram, Dindigul, Tamil Nadu, India

Keywords:

Routing, Wireless Network, Protocol Design.

Abstract

This paper is an enhancement of existing spatial reusability-aware single-path routing (SASR) and any path routing to use Hop by Hop Message authentication scheme for ensuring data confidentiality. We Propose Secure Spatial Reusability-Aware Routing with Enhanced Secure Data Transmission using Hop-by-Hop Routing Algorithm. In the existing paper, the system investigated two kinds of routing protocols, including single-path routing and any path routing. The task of a single-path routing protocol is to select a cost minimizing path, along which the packets are delivered from the source node to the destination node, but it failed to consider shortest path and issues in it. The most vital way to prevent malicious, unauthorized and corrupted messages from being transmitted/ forwarded in Multi-hop wireless networks is message authentication technique. Most of the existing systems have several limitations to incorporate in Multi-hop wireless networks, which includes high computational cost and several communication overheads are available in it, which also leads to lack of scalability and resilience to node compromise attacks. We propose a system with enabling verification model in the intermediate nodes and thus our model permits any node to transmit an infinite number of messages without adversity of the threshold problem. We prove that our system is efficient and more useful to check the shortest path with lowest cost than the existing system models.

References

  1. Akella, S. Seshan, R. Karp, and S. Shenker." Selfish behavior and stability of the internet: Game-theoretic analysis of TCP," In Proceedings of the Special Interest Group on Data Communication, Pittsburgh, PA, August 2002.
  2. L. Anderegg and S. Eidenbenz. "Ad hoc-VCG: a Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks With Selfish Agents," In Proceedings of the Ninth International Conference on Mobile Computing and Networking ,San Diego, CA, Sep. 2003.
  3. N. Ben Salem, L. Buttyan, J. P. Hubaux, and M. Jakobsson. "A charging and rewarding scheme for packet forwarding in multi-hop cellular networks," In Proceedings of the Fourth ACM Symposium on Mobile Ad Hoc Networking and Computing, Annapolis, MD, Jun. 2003.
  4. S. Buchegger and J.-Y. Le Boudec. "Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc network," In Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing Islands, Spain, Jan. 2002.
  5. S. Buchegger and J.-Y. Le Boudec. "Performance analysis of the CONFIDANT protocol (Cooperation of nodes: fairness in dynamic ad-hoc networks)," In Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, Jun. 2002.
  6. L. Buttyan and J. P. Hubaux. "Enforcing service availability in mobile ad-hoc WANs," In Proceedings of the First ACM Workshop on Mobile Ad Hoc Networking and Computing, Boston, Massachusetts, Aug. 2000.
  7. L. Buttyan and J. P. Hubaux. "Stimulating cooperation in self-organizing mobile ad hoc networks," ACM Journal for Mobile Networks, special issue on Mobile Ad Hoc Networks, summer 2002.
  8. S. Eidenbenz, V. S. A. Kumar, and S. Zust. "Equilibria in topology control games for ad hoc networks," In Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 2-11], 2003.
  9. S. Eidenbenz, G. Resta, and P. Santi. "Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes," In Proceedings of 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, Apr. 2005.
  10. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. "A BGP-based mechanism for lowest cost routing," In Proceedings of the 21 Symposium on Principles of Distributed Computing, pp. 173-182], Monterey, CA, Jul.2002.

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
S. P. Gayathri, K.Susmitha, " Secure Data Transmission Using Hop-By-Hop Routing Algorithm, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 4, pp.979-984, March-April-2018.