Skip to main content
Log in

SIPTAN: Securing Inimitable and Plundering Track for Ad Hoc Network

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

An AdHoc network is a temporary network without any centralized agent or router, used for special purposes. A generalized group based approach delivers probabilities of existence of attackers. The overhead to identify each participant’s authenticity and integrity at initial phase is out of consideration due to tedious effort. Flood attacks as well as chosen cipher text attacks are among the favorite attacks from such tuners. Session hijacking can also be taken into consideration in case of private data transfer among two ad hoc network nodes. Using a threshold based attack detection algorithm the flood attack can be denied with services. Chosen cipher text attack is evaded using randomized matrix arithmetic coding encryption scheme for arithmetic coding which delivers hard core decryption approach and provides a much easier way to match cipher with original pattern. Improvised datagram header information is made used to defend third party eavesdrop into a private session.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Wen, J. T., Kim, H., & Villasenor, J. D. (2006). Binary arithmetic coding with key-based interval splitting. IEEE Signal Processing Letters, 13, 69–72.

    Article  Google Scholar 

  2. Kim, H., Wen, J. T., & Villasenor, J. D. (2007). Secure arithmetic coding. IEEE Transactions on Signal Processing, 55(5), 2263–2272.

    Article  MathSciNet  Google Scholar 

  3. Rajaram, M., Balaji, S, & Jeeva, R. (2013). XRMAC-an extended RMAC scheme to evade hacking by dynamic sizing. IEEE explore 978-1-4799-3448-5, 2013-IEEE.

  4. Kavitha, V., Balaji, S., & Jeeva, R. (2011). RMAC a new encryption scheme for arithmetic coding to evade CCA attacks. In IJCSE, March 2011 (pp. 1260–1269).

  5. Xie, Y., Tang, S., Xiang, Y., & Hu, J. (2013). Resisting web-proxy based http attacks by temporal and spatial locality behavior. IEEE Transactions on Parallel and Distributed Systems, 24(7), 1401–1410.

  6. Zhou, J., Au, O. C., & Wong, P. H.-W. (2009). Adaptive chosen-cipher text attack on secure arithmetic coding. IEEE Transactions on Signal Processing, 57(5), 1825–1838.

    Article  MathSciNet  Google Scholar 

  7. Katti, R. S., Srinivasan, S. K., & Vosughi, A. (2011). On the security of randomized arithmetic codes against ciphertext-only attacks. IEEE Transactions on Information Forensics and Security, 6(1), 19–27.

    Article  Google Scholar 

  8. Kavitha, V., & Balaji, S. (2011). ESAC based channel aware routing with route handoff. In IJCSE, March 2011 (pp. 1260–1269).

  9. Kuzmanovic, A., & Knightly, E.W. (2003). Low-rate TCP-targeted denial of service attacks (The Shrew vs. the Mice and Elephants). In Proceedings of the ACM SIGCOMM conference applications, August, 2003.

  10. Bremler-Barr, A., Levy, H., & Halachmi, N. (2006). Aggressiveness protective fair queuing for bursty applications. In Proceedings of the IEEE international workshop quality of service (IWQoS), June 2006.

  11. Witten, I. H., & Clearly, J. G. (1988). On the privacy offered by adaptive textcompression. Computers & Security, 7, 397–408.

    Article  Google Scholar 

  12. Balaji, S., Rajaram, M., & Harold, Y. (2015). Robinson“ESBAC: Encryption scheme using binary arithmetic coding with channel based using key based interval splitting”. International Journal of Applied Engineering Research, 10(14), 12023–12026.

    Google Scholar 

  13. Ben-Porat, U., Bremler-Barr, A., & Levy, H. (2008). Evaluating the vulnerability of network mechanisms to sophisticated DDoS attacks. In Proceedings of the IEEE INFOCOM, April 2008.

  14. Xiang, Y., Li, K., & Zhou, W. (2011). Low-rate DDos attacks detection and traceback by using new information metrics. IEEE Transaction on Information Forensics and Security, 6(2), 426–437.

    Article  Google Scholar 

  15. Yu, S., Zhou, W., Jia, W., Guo, S., Xiang, Y., & Tang, F. (2012). Discriminating DDos attacks from flash crowds using flow correlation coefficient. IEEE Transaction on Parallel and Distributed Systems, 23(6), 1073–1080.

    Article  Google Scholar 

  16. Menezes, A. J., Van Oorschot, P. C., & Vanstone, S. A. (1997). Handbook of applied cryptography. Boca Raton, FL: CRC Press.

    MATH  Google Scholar 

  17. Balaji, S., & Rajaram, M. (2014). EUDIS-an encryption scheme for user-data security in public networks. International Journal of Computer, Electrical, Automation, Control and Information Engineering, “World Academy of Science, Engineering and Technology, 95(11), 1991–1996.

    Google Scholar 

  18. Balaji, S., & Prabha, M. (2013). UOSPR: UnObservable secure proactive routing protocol for fast and secure transmission using B.A.T.M.A.N. In IEEE international conference on green high performance computing, may 14–15, 2013.

  19. Harold Robinson, Y., & Rajaram, M. (2015). Establishing pairwise keys using key predistribution schemes for sensor networks. World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering, 9(2), 608–612.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Balaji.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Balaji, S., Rajaram, M. SIPTAN: Securing Inimitable and Plundering Track for Ad Hoc Network. Wireless Pers Commun 90, 679–699 (2016). https://doi.org/10.1007/s11277-016-3187-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-016-3187-y

Keywords

Navigation