Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through a wired or wireless link with less latency than the network links, and relays them to another point in the network. We first propose a centralized algorithm to detect wormholes and show its correctness rigorously. For the distributed wireless network, we proposes DAWN, Distributed detection Algorithm against Wormhole in wireless Network coding systems, by exploring the change of the flow directions of the innovative packets caused by wormholes. We find that the robustness depends on the node density in the network, and prove a necessary condition to achieve collision-resistance. Our solutions only depend on the local information that can be obtained from regular network coding protocols, and thus the overhead that our algorithms introduce is acceptable for most applications.
Chitra. G, Krithika. S, Monisha.K. R, P. Deivendran
Wireless networks, random linear network coding, wormhole attack, expected transmission count.
- S. Li, R. Yeung, and N. Cai, “Linear network coding,” IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371–381, Feb. 2003.
- T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, “A random linear network coding approach to multicast,” IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413–4430, Oct. 2006.
- S. Biswas and R. Morris, “Opportunistic routing in multihop wireless networks,” ACM SIGCOMM Comput. Commun. Rev., vol. 34, pp. 69–74, Sep. 2004.
- S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, “XORs in the air: Practical wireless network coding,” in Proc. Conf. Appl., Technol., Archit. Protocols Comput. Commun., 2006, pp. 243–254.
- S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading structure for randomness in wireless opportunistic routing,” in Proc. Conf. Appl., Technol., Archit. Protocols Comput. Commun., Aug. 2007,pp. 169–180.
- D. Dong, Y. Liu, X. Li, and X. Liao, “Topological detection on wormholes in wireless ad hoc and sensor networks,” IEEE Trans. Netw., vol. 19, no. 6, pp. 1787–1796, Dec. 2011.
- J. Kim, D. Sterne, R. Hardy, R. K. Thomas, and L. Tong, “Timingbased localization of in-band wormhole tunnels in MANETs,” in Proc. 3rd ACM Conf. Wireless Netw. Security, 2010, pp. 1–12.
- S. R. D. R. Maheshwari, J. Gao, “Detecting wormhole attacks in wireless networks using connectivity information,” in Proc. IEEE 26th Int. Conf Commun., 2007, pp. 107–115.
- Y.-C. Hu, A. Perrig, and D. B. Johnson, “Wormhole attacks in wireless networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 2, pp. 370–380, Feb. 2006.
- R. Poovendran and L. Lazos, “A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks,” Wireless Netw., vol. 13, no. 1, pp. 27–59, 2007.
- A. J. Newell, R. Curtmola, and C. Nita-Rotaru, “Entropy attacks and countermeasures in wireless network coding,” in Proc. 5th ACM Conf. Security Privacy Wireless Mobile Netw., 2012, pp. 185–196.
- W. Wang, B. Bhargava, Y. Lu, and X. Wu, “Defending against wormhole attacks in mobile ad hoc networks: Research articles,” Wireless Commun. Mobile Comput., vol. 6, no. 4, pp. 483–503, Jun. 2006.
- Y.-C. Hu, A. Perrig, and D. B. Johnson, “Packet leashes: A defense against wormhole attacks in wireless networks,” in Proc. IEEE 23rd Annu. Joint Conf. IEEE Comput. Commun., Mar. 2003, pp. 1976–1986.
- W. Wang and B. Bhargava, “Visualization of wormholes in sensor networks,” in Proc. 3rd ACM Workshop Wireless Security, Oct. 2004, pp. 51–60.
- J. Eriksson, S. Krishnamurthy, and M. Faloutsos, “Truelink: A practical countermeasure to the wormhole attack in wireless networks,” in Proc. IEEE Int. Conf. Netw. Protocols, 2006, pp. 75–84.
- S. _Capkun, L. Butty_an, and J.-P. Hubaux, “Sector: Secure tracking of node encounters in multi-hop wireless networks,” in Proc. 1st ACM Workshop Security Ad Hoc Sensor Netw., 2003, pp. 21–32.
- D. S. J. D. Couto, D. Aguayo, J. Bicket, and R. Morris, “A highthroughput path metric for multi-hop wireless routing,” Wireless Netw., vol. 11, no. 4, pp. 419–434, 2005.
- A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539–4551, Sep. 2010.
- A. S. Avestimehr, S. N. Diggavi, and D. N. Tse, “Wireless network information flow: A deterministic approach,” IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872–1905, Apr. 2011.
- B. Nazer and M. Gastpar, “Compute-and-forward: Harnessing interference through structured codes,” IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463–6486, Oct. 2011.
- P. Santi, “Topology control in wireless ad hoc and sensor networks,” ACM Comput. Surv., vol. 37, no. 2, pp. 164–194, 2005.
- F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-compatible opportunistic routing for wireless networks,” in Proc. 14th ACM Int. Conf. Mobile Comput. Netw., 2008, pp. 303–314.
- S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 129–137, Mar. 1982.
- C. Cortes and V. Vapnik, “Support vector machine,” Mach. Learn., vol. 20, no. 3, pp. 273–297, 1995.
- W. Hoeffding, “Probability inequalities for sums of bounded random variables,” J. Amer. Statist. Assoc., vol. 58, no. 301, pp. 13–30, 1963.
- Beecrypt Online]. Available: http://sourceforge.net/projects/beecrypt.com
|Published in :
||Volume 2 | Issue 2 | March-April - 2016
|Date of Publication
Cite This Article
Chitra. G, Krithika. S, Monisha.K. R, P. Deivendran, "Wormhole Attack Detection In Wireless Networks", International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.442-448, March-April-2016.
URL : http://ijsrset.com/IJSRSET1622114.php