Email this article 
Open Access
Subscription or Fee Access
Secure Channel Aware Routing Protocol to Detect Malicious Nodes in Wireless Networks
Abstract
A wireless protocol designed to get channel condition are known as channel aware routing protocol. Channel aware protocols have mainly focused on how channel condition information can be used to more efficiently utilize wireless resources. An attacker that falsely report channel condition can affect network performance. In this paper an algorithm to prevent misreporting channel condition and to eliminate malicious node are designed. The designed protocol is known as secure channel aware routing protocol. Data is send to destination through nodes, if any nodes in the network act as malicious node the data is lost from that node. So it is necessary to prevent malicious nodes in the network to send data without any error. Secure channel aware routing protocol helps to prevent the malicious node in the network and helps in efficient routing of data through the network, thus improves system efficiency.
References
Dongho Kim and Yih-Chun Hu, (2014), “A Study on False Channel Condition Reporting Attackin Wireless Networks”, IEEE transactions on mobile computing, Vol. 13, No. 5, pp. 935-947.
Carbunar. B, Ioannis. I, and Nita Rotaru. C, (2009), “Janus: A framework for scalable and secure routing in hybrid wireless networks”, IEEE transactions on Dependable Secure Computing, Vol. 6, No. 4, pp. 295–308.
Dongbin Wang, Mingzeng Hu and Hui Zhi, (2008), “A survey of secure routing in ad hoc networks”, The Ninth International Conference on Web-Age Information Management, IEEE DOI 0.1109/WAIM.2008.79.
Douglas, De Couto D.S., Aguayo. J, Bicket. J, and Morris. R, (2003), “A high throughput path metric for multi-hop wireless routing”, in Proc. ACM MobiCom, San Diego, CA, USA, pp. 134–146.
Draves. R, Padhye. J, and Zill.B, (2004), “Comparison of routing metrics for static multi-hop wireless networks”, in Proc. ACM SIGCOMM, Portland, USA, pp. 133–144
Gaurav Soni and Kamlesh Chandrawanshi, (2013), “A novel defence scheme against selfish node attack in manet”, International Journal on Computational Sciences & Applications (IJCSA), Vol.3, No.3, pp. 51-63.
Haas. J. J, and Hu.Y. C, (2009), “Secure unified cellular ad hoc network routing” in Proc. IEEE Globecom, Honolulu, HI, USA.
Hu. Y. C and Perrig. A, (2004), “A survey of secure wireless ad hoc routing” IEEE Security Privacy, Vol. 2, No. 3, pp. 28–39.
Jalali, Padovani. R, and Pankaj.R, (2000), “Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system”, in Proc. IEEE VTC, Tokyo, Japan, pp. 1854–1858.
Luo. H, Ramjee. R, Sinha. P, Li. L. E, and Lu. S, (2003), “Ucan: A unified cellular and ad-hoc network architecture”, in Proc. ACM MobiCom, San Diego, CA, USA, pp. 353–367.
Martin Schütte, (2006), “Detecting Selfish and Malicious Nodes in MANETs”, Seminar: sicherheit in selbstorganisierenden netzen, hpi/universität potsdam, sommersemester.
Perkins. C and Royer. E, (1999), “Ad-hoc on-demand distance vector routing” in Proc. WMCSA, New Orleans, LA, USA, pp. 90–100.
Perkins. E and Bhagwat. P, (1994), “Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers”, in Proc. ACM SIGCOMM, London, U.K
Racic. R, Ma. D, Chen.H, and Liu. X, (2010), “Exploiting and defending opportunistic scheduling in cellular data networks”, IEEE Trans. Mobile Comput., Vol. 9, No. 5, pp. 609–620.
Sendonaris, Erkip. E, and Aazhang. B, (1998), “Increasing uplink capacity via user cooperation diversity”, in Proc. IEEE ISIT, Cambridge, MA, USA, pp. 156.
www.wikepedia.com
www.cisco.com
www.PacketDeliveryratio.awk.com
http://www.businessdictionary.com/definition/overhead.html
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.