Preserving Privacy Using an Unobservable Secure Routing Protocol for MANETs


  • Anto Pravin R
  • Uma Mageswari



unlinkability, unobservability, mobile ad-hoc networks, group signature.


Privacy preserving routing is crucial for some ad-hoc networks. Numbers of schemes have been proposed to protect privacy in ad-hoc networks. None of these schemes offer complete unlinkability or unobservability property since data packets and control packets are still linkable and distinguishable in these schemes. In this project, stronger privacy requirements are defined regarding privacy-preserving routing in mobile ad-hoc networks. Then an unobservable secure routing scheme is proposed to offer complete unlinkability and content unobservability for all types of packets. This protocol is efficient as it uses a combination of group signature and ID-based encryption for route discovery. Security analysis demonstrates that Unobservable Secure Routing (USR) protocol can protect user privacy against both inside and outside attackers. USR is implemented on ns2, and its performance is evaluated by comparing with the existing schemes. The simulation results show that this protocol achieves stronger privacy protection than existing schemes.


Download data is not yet available.

Author Biographies

Anto Pravin R

P.G Scholar,

Department of CSE, National College of Engineering,


Uma Mageswari

Assistant Professor,

Department of CSE, National College of Engineering,



[1] Kong, J., Hong, X., “ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks” In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, p 291-302, 2003.

[2] Zhu, B., Wan, Z., Kankanhalli, M.S., Bao, F., Deng, R. H., “Anonymous secure routing in mobile ad-hoc networks” In Local Computer Networks, 29th Annual IEEE International Conference on, pp. 102-108, 2004.

[3] Seys, S., Preneel, B., “ARM: Anonymous routing protocol for mobile ad hoc networks” International Journal of Wireless and Mobile Computing, Vol. 3, No. 3, p 145-155, 2009.

[4] Song, R., Korba, L., Yee, G., “AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks” 2005.

[5] Dong, Y., Chim, T.W., Li, V.O., Yiu, S.M., Hui, C.K., “ARMR: anonymous routing protocol with multiple routes for communications in mobile ad hoc networks” Ad Hoc Networks, Vol. 7, No. 8, p 1536-1550, 2009.

[6] Boukerche, A., El-Khatib, K., Xu, L., Korba, L., “SDAR: a secure distributed anonymous routing protocol for wireless and mobile ad hoc networks” In Local Computer Networks, 29th Annual IEEE International Conference on, p 618-624, 2004.

[7] Sy, D., Chen, R., Bao, L., “Odar: On-demand anonymous routing in ad hoc networks” In IEEE International Conference on Mobile Ad Hoc and Sensor Systems, p 267-276, 2006.

[8] Zhang, Y., Liu, W., Lou, W., “Anonymous communications in mobile ad hoc networks”, In Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3, p 1940-1951, 2005.

[9] El-Defrawy, K., Tsudik, G., “ALARM: anonymous location-aided routing in suspicious MANETs”, IEEE Transactions on Mobile Computing, Vol. 10, No. 9, p 1345-1358, 2011.

[10] El-Defrawy, K., Tsudik, G., “Privacy-preserving location-based on-demand routing in MANETs”, IEEE journal on selected areas in communications, Vol. 29, No. 10, 1926-1934, 2011.

[11] Boneh, D., Boyen, X., Shacham, H., “Short group signatures”, In Annual International Cryptology Conference, Springer Berlin Heidelberg, p 41-55, 2004.

[12] Boneh, D., Franklin, M., “Identity-based encryption from the Weil pairing” In Annual International Cryptology Conference, Springer Berlin Heidelberg, p 213-229,2001.

[13] Dong, D., Li, M., Liu, Y., Li, X.Y., Liao, X., “Topological detection on wormholes in wireless ad hoc and sensor networks” IEEE/ACM Transactions on Networking, Vol. 19, No. 6, p 1787-1796, 2011.

[14] Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A., “Sybilguard: defending against sybil attacks via social networks”, In ACM SIGCOMM Computer Communication Review, Vol. 36, No. 4, p 267-278, 2006.