Open Access Open Access  Restricted Access Subscription or Fee Access

Reliable Data Security Architecture for Mobile Ad Hoc Networks

M. Renuka, Dr.P. Thangaraj

Abstract


Mobile ad hoc networks proved their efficiency in the deployment for different fields, but highly vulnerable to security attacks. It seems to be more challenging of in wireless networks. Existing research carried out provides authentication, confidentiality, availability, and secure routing and intrusion detection in ad hoc networks. Ad hoc network characteristics should be taken into consideration to design efficient data security along its path of transmission. The proposal work present, reliable data security architecture (RDSA) in improving the data transmission security of ad hoc networks with reliable multi-path routing. Reliable multiple paths between nodes in the ad hoc network increase the security level of transmitted data. The original message to be secured is split into parts that are transmitted in reliable multiple paths. The disseminated messages are encrypted on its course of transmission to improve the security further. Experimental simulations are conducted to the proposed RDSA approach and compared with existing ad hoc multi-path security solutions. RDSA shows better performance compared to that of generic data security architecture in terms of path stability and data loss to 5% and 7% respectively.

Keywords


Mobile ad hoc networks,Public Key Infrastructure

Full Text:

PDF

References


Y.-C. Hu, A. Perrig and D. B. Johnson, “Ariadne : a secure on-demand routing protocol for ad hoc networks” MobiCom 2002, Sep 2002

W. Lou, Y. Fang, “A survey of wireless security in mobile ad hoc networks: challenges and available solutions”, book chapter in Ad Hoc Wireless Networking, Kluwer, May 2003

P. Papadimitratos and Z. Haas, “Secure Routing for Mobile Ad Hoc Networks,” Proc. SCS Comm. Networks and Distributed Systems Modeling and Simulation Conf. (CNDS ’02), 2002.

W. Lou, Y. Fang, “Securing data delivery in ad hoc networks”, International Workshop on Cryptology and Network Security (CANS’03), Miami, FL, Sep 2003

C.E. Perkins and E.M. Belding-Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second Workshop Mobile Computing Systems and Applications (WMCSA ’99), pp. 90-100, 1999.

M.G. Zapata, “Secure Ad Hoc On-Demand Distance Vector Routing,” Mobile Computing and Comm. Rev., vol. 6, no. 3, pp. 106-107, 2002.

P. Papadimitratos and Z. Haas, “Securing Mobile Ad Hoc Networks,” Handbook of Ad Hoc Wireless Networks, M. Ilyas, ed., CRC Press, 2002.

K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E.M. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. IEEE Int’l Conf. Network Protocols (ICNP ’02), pp. 78-89, 2002.

Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” Ad Hoc Networks, vol. 1, no. 1, pp. 175-192, 2003.

Y.-C. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks,” Proc. IEEE INFOCOM, 2003.

Y.-C. Hu and A. Perrig, “A Survey of Secure Wireless Ad Hoc Routing,” IEEE Security and Privacy, vol. 2, no. 3, pp. 28-39, Mar. 2004.

L. Buttya´n and I. Vajda, “Towards Provable Security for Ad Hoc Routing Protocols,” Proc. ACM Workshop Ad Hoc and Sensor Networks (SASN ’04), 2004.

G. _Acs, L. Buttya´n, and I. Vajda, “Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks,” Technical Report 159, Int’l Assoc. for Cryptologic Research, 2004.

G. _ Acs, L. Buttya´n, and I. Vajda, “Provable Security of On- Demand Distance Vector Routing in Wireless Ad Hoc Networks,” Proc. European Workshop Security and Privacy in Ad Hoc and Sensor Networks (ESAS ’05), pp. 113-127, 2005.

G. _ Acs, L. Buttya´n, and I. Vajda, “Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1533-1546, Nov. 2006.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.